Most cited papers in Digital Image Processing Techniques
What are the most cited papers in Digital Image Processing Techniques?
The most cited paper in Digital Image Processing Techniques is "Use of the Hough transformation to detect lines and curves in pictures" (Richard O. Duda, Peter E. Hart, 1972), with 6,653 citations. Next come "Efficient Graph-Based Image Segmentation" (6,257) and "Statistical and structural approaches to texture" (5,789).
Showing 50 of 98 papers. Every paper with more than 597 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Use of the Hough transformation to detect lines and curves in pictures Richard O. Duda, Peter E. Hart · Communications of the ACM | 1972 | 6,653 |
| 2 | Efficient Graph-Based Image Segmentation Pedro F. Felzenszwalb, Daniel P. Huttenlocher · International Journal of Computer Vision | 31 Mar 2004 | 6,257 |
| 3 | Statistical and structural approaches to texture R.M. Haralick · Proceedings of the IEEE | 1979 | 5,789 |
| 4 | Watersheds in digital spaces: an efficient algorithm based on immersion simulations Luc M. Vincent, Pierre Soille · IEEE Transactions on Pattern Analysis and Machine Intelligence | Jun 1991 | 5,678 |
| 5 | The quickhull algorithm for convex hulls C. Bradford Barber, David Dobkin, Hannu T. Huhdanpaa · ACM Transactions on Mathematical Software | Dec 1996 | 5,441 |
| 6 | Comparing images using the Hausdorff distance D.P. Huttenlocher, G.A. Klanderman, William J. Rucklidge · IEEE Transactions on Pattern Analysis and Machine Intelligence | 1993 | 4,576 |
| 7 | Automatically Parcellating the Human Cerebral Cortex Bruce R. Fischl · Cerebral Cortex | 3 Dec 2003 | 4,519 |
| 8 | Computational Geometry: Algorithms and Applications Mark de Berg, Otfried Cheong, Marc J. van Kreveld et al. · CERN Document Server (European Organization for Nuclear Research) | 1997 | 4,503 |
| 9 | ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE David H. Douglas, Thomas K. Peucker · Cartographica The International Journal for Geographic Information and Geovisualization | Dec 1973 | 4,256 |
| 10 | Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images Yuri Boykov, Marie‐Pierre Jolly | 13 Nov 2002 | 3,707 |
| 11 | Approximation Algorithms for NP-Hard Problems Dorit S. Hochba · ACM SIGACT News | Jun 1997 | 3,143 |
| 12 | A fast parallel algorithm for thinning digital patterns Tingwei Zhang, Ching Y. Suen · Communications of the ACM | Mar 1984 | 2,781 |
| 13 | Topological structural analysis of digitized binary images by border following Satoshi Suzuki, KeiichiA be · Computer Vision Graphics and Image Processing | Apr 1985 | 2,693 |
| 14 | Random Walks for Image Segmentation Leo J. Grady · IEEE Transactions on Pattern Analysis and Machine Intelligence | 29 Sep 2006 | 2,668 |
| 15 | Globally optimal stitching of tiled 3D microscopic image acquisitions Stephan Preibisch, Stephan Saalfeld, Pavel Tomančák · Bioinformatics | 3 Apr 2009 | 2,664 |
| 16 | Digital Image Processing Mario A. Gomarasca | 2009 | 2,635 |
| 17 | Fast Discrete Curvelet Transforms Emmanuel J. Candès, Laurent Demanet, David L. Donoho et al. · Multiscale Modeling and Simulation | 2006 | 2,582 |
| 18 | Topology and data Gunnar Carlsson · Bulletin of the American Mathematical Society | 29 Jan 2009 | 2,371 |
| 19 | The rendering equation James T. Kajiya · ACM SIGGRAPH Computer Graphics | 31 Aug 1986 | 2,258 |
| 20 | The Elliptic Curve Digital Signature Algorithm (ECDSA) Don B. Johnson, Alfred Menezes, Scott A. Vanstone · International Journal of Information Security | Aug 2001 | 2,252 |
| 21 | Topology matching for fully automatic similarity estimation of 3D shapes Masaki Hilaga, Yoshihisa Shinagawa, Taku Kohmura et al. | Aug 2001 | 2,211 |
| 22 | Poisson Surface Reconstruction Michael Kazhdan, Matthew Bolitho, Hugues Hoppe | 2006 | 2,173 |
| 23 | Textural Features Corresponding to Visual Perception Hideyuki Tamura, Shunji Mori, T. Yamawaki · IEEE Transactions on Systems Man and Cybernetics | 1978 | 2,155 |
| 24 | Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition Thomas M. Cover · IEEE Transactions on Electronic Computers | Jun 1965 | 2,092 |
| 25 | Euclidean distance mapping Per‐Erik Danielsson · Computer Graphics and Image Processing | Nov 1980 | 2,018 |
| 26 | Morphological grayscale reconstruction in image analysis: applications and efficient algorithms Luc M. Vincent · IEEE Transactions on Image Processing | Apr 1993 | 1,928 |
| 27 | Graph Cuts and Efficient N-D Image Segmentation Yuri Boykov, Gareth Funka-Lea · International Journal of Computer Vision | 23 Jul 2006 | 1,926 |
| 28 | Distance transformations in digital images Gunilla Borgefors · Computer Vision Graphics and Image Processing | Jun 1986 | 1,904 |
| 29 | Elliptic Fourier features of a closed contour Frank P. Kuhl, Charles R. Giardina · Computer Graphics and Image Processing | Mar 1982 | 1,880 |
| 30 | Fourier Descriptors for Plane Closed Curves Charles T. Zahn, Ralph Z. Roskies · IEEE Transactions on Computers | Mar 1972 | 1,877 |
| 31 | Thinning methodologies-a comprehensive survey Louisa Lam, S.-W. Lee, Ching Y. Suen · IEEE Transactions on Pattern Analysis and Machine Intelligence | 1992 | 1,793 |
| 32 | Computational topology an introduction Herbert Edelsbrunner, John Harer | 2010 | 1,788 |
| 33 | Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters Charles T. Zahn · IEEE Transactions on Computers | 1971 | 1,773 |
| 34 | Cosmic‐Ray Rejection by Laplacian Edge Detection Pieter G. van Dokkum · Publications of the Astronomical Society of the Pacific | Nov 2001 | 1,644 |
| 35 | The visual hull concept for silhouette-based image understanding Aldo Laurentini · IEEE Transactions on Pattern Analysis and Machine Intelligence | 1994 | 1,469 |
| 36 | Topographic distance and watershed lines Fernand Meyer · Signal Processing | Jul 1994 | 1,441 |
| 37 | The Watershed Transform: Definitions, Algorithms and Parallelization Strategies Jos B. T. M. Roerdink, Arnold Meijster · Fundamenta Informaticae | 2000 | 1,395 |
| 38 | An iterative procedure for the polygonal approximation of plane curves Urs Ramer · Computer Graphics and Image Processing | Nov 1972 | 1,388 |
| 39 | Finite-element methods for active contour models and balloons for 2-D and 3-D images Laurent D. Cohen, I. Cohen · IEEE Transactions on Pattern Analysis and Machine Intelligence | 1993 | 1,378 |
| 40 | Computer Processing of Line-Drawing Images Herbert Freeman · ACM Computing Surveys | Mar 1974 | 1,377 |
| 41 | Barcodes: The persistent topology of data Robert Ghrist · Bulletin of the American Mathematical Society | 26 Oct 2007 | 1,313 |
| 42 | Mesh optimization Hugues Hoppe, Tony DeRose, Tom Duchamp et al. | Sep 1993 | 1,304 |
| 43 | A survey on image segmentation K. S. Fu, Jack K. Mui · Pattern Recognition | 1981 | 1,201 |
| 44 | Biological shape and visual science (part I) H.E. Blum · Journal of Theoretical Biology | Feb 1973 | 1,170 |
| 45 | Morphological segmentation Fernand Meyer, Serge Beucher · Journal of Visual Communication and Image Representation | Sep 1990 | 1,164 |
| 46 | An Integrated Software Suite for Surface-based Analyses of Cerebral Cortex David C. Van Essen, Heather A. Drury, James M. J. J. Dickson et al. · Journal of the American Medical Informatics Association | Sep 2001 | 1,144 |
| 47 | DREAM.3D: A Digital Representation Environment for the Analysis of Microstructure in 3D Michael A. Groeber, Michael Jackson · Integrating materials and manufacturing innovation | Apr 2014 | 1,129 |
| 48 | A Fast algorithm for active contours and curvature estimation Donna J. Williams, Mubarak A. Shah · CVGIP Image Understanding | 1992 | 1,100 |
| 49 | Efficient Planarity Testing John E. Hopcroft, Robert Endre Tarjan · Journal of the ACM | Oct 1974 | 1,083 |
| 50 | Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models Tony Fan-Cheong Chan, Selim Esedoḡlu, Mila Nikolova · SIAM Journal on Applied Mathematics | 2006 | 1,064 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.