Robert M. Haralick (born 1943) is Distinguished Professor in Computer Science at Graduate Center of the City University of New York (CUNY). Haralick is one of the leading figures in computer vision, pattern recognition, and image analysis. He is a Fellow of the Institute of Electrical and Electronics Engineers (IEEE) and a Fellow and past president of the International Association for Pattern Recognition. Professor Haralick is the King-Sun Fu Prize winner of 2016, "for contributions in image analysis, including remote sensing, texture analysis, mathematical morphology, consistent labeling, and system performance evaluation".

Biography

Haralick received a B.A. degree in mathematics from the University of Kansas in 1964, a B.S. degree in electrical engineering in 1966, and a M.S. degree in electrical engineering in 1967. In 1969, after completing his Ph.D. at the University of Kansas, he joined the faculty of the electrical engineering department, serving as professor from 1975 to 1978. In 1979 Haralick joined the electrical engineering department at Virginia Polytechnic Institute and State University, where he was a professor and director of the spatial data analysis laboratory.

From 1984 to 1986 Haralick served as vice president of research at Machine Vision International, Ann Arbor, Michigan. Haralick occupied the Boeing Clairmont Egtvedt Professorship in the department of electrical engineering at the University of Washington from 1986 through 2000. At University of Washington, Haralick was an adjunct professor in the computer science department and the bioengineering department.

In 2000 Haralick accepted a Distinguished Professorship position at the computer science department of the Graduate Center of the City University of New York.[1]

Contributions

Haralick began his work as one of the principal investigators of the NASA ERTS satellite data doing remote sensing image analysis.[2][3][4]

Haralick has made a series of contributions in the field of computer vision. In the high-level vision area, he has worked on inferring 3D geometry from one or more perspective projection views.[5][6][7][8] He has also identified a variety of vision problems which are special cases of the consistent labeling problem. His papers on consistent labeling,[9][10] arrangements, relation homomorphism,[11] matching, and tree search translate some specific computer vision problems to the more general combinatorial consistent labeling problem and then discuss the theory of the look-ahead operators that speed up the tree search. The most basic of these is called Forward Checking.[12] This gives a framework for the control structure required in high-level vision problems. He has also extended the forward-checking tree search technique to propositional logic.[13]

In the low-and mid-level areas, Haralick has worked in image texture analysis using spatial gray tone co-occurrence texture features.[14][15] These features have been used with success on biological cell images, x-ray images, satellite images, aerial images and many other kinds of images taken at small and large scales. In the feature detection area, Haralick has developed the facet model for image processing.[16] The facet model states that many low-level image processing operations can be interpreted relative to what the processing does to the estimated underlying gray tone intensity surface of which the given image is a sampled noisy version. The facet papers develop techniques for edge detection,[17][18] line detection,[19] noise removal,[20] peak and pit detection, as well as a variety of other topographic gray tone surface features.[21]

Haralick's work in shape analysis and extraction uses the techniques of mathematical morphology.[22] He has developed the morphological sampling theorem[23] which establishes a sound shape/size basis for the focus of attention mechanisms which can process image data in a multiresolution mode, thereby making some of the image feature extraction processes execute more efficiently. He has also developed recursive morphological algorithms for the computation of opening and closing transforms. The recursive algorithms permit all possible sized openings or closings for a given structuring element to be computed in constant time per pixel.[24][25] He also developed statistical morphological methodologies for image analysis and noise removal.[26] and noise removal[27]

In the area of document image understanding, Haralick is responsible for the development of comprehensive ground-truthed databases consisting of over 1500 document images, most in English and some in Japanese. The databases are issued on CD-ROMs and are used all around the world by people developing character recognition methodologies and techniques for document image structural decomposition.[28] He has developed algorithms for document image skew angle estimation, zone delineation, and word and text line bounding box delineation.[29][30]

In a series of papers, Haralick has helped influence the computer vision community to be more sensitive to the needs of computer vision performance characterization and covariance propagation for without this kind of analysis Computer Vision has no robust theory.[31][32][33]

Haralick has contributed to the medical image analysis area particularly working with X-ray ventriculargrams .[34][35][36] and echocardiography,[37] These papers developed techniques to identify and delineate anatomically accurate boundaries for the left ventricle of the heart.

His most recent work is in the pattern recognition area, particularly in the manifold clustering of high-dimensional data sets,[38][39] the application of pattern recognition to mathematical combinatorial problems[40][41] and in the area of Torah codes popularly called Bible codes. In this area he has co-authored a book with Eliyahu Rips, one of the coauthors of the original Statistical Sciences paper. Haralick's research has helped develop sophisticated algorithmic and statistical methodology for Torah code experiments, methodology that he claims can differentiate between the tables that are depicted as encodings in books like Moby Dick and War and Peace from those encodings that occur in the Torah text.[42][43]

Haralick is a Fellow of IEEE for his contributions in computer vision and image processing and a Fellow of the International Association for Pattern Recognition (IAPR) for his contributions in pattern recognition, image processing, and for service to IAPR. He served as president of IAPR from 1996 to 1998. He has served on the editorial board of "IEEE Transactions on Pattern Analysis and Machine Intelligence" and has been the computer vision area editor for Communications of the ACM and as an associate editor for Computer Vision, Graphics, and Image Processing, The IEEE Transactions on Image Processing and Pattern Recognition. He served on the editorial board of Real Time Imaging and the editorial board of Electronic Imaging. His publications include over 570 archival papers, book chapters, conference proceedings and books. The science citation index lists over 6300 references to his papers.

Haralick has been recognized for his academic research in the Marquis Who's Who books. He is listed in the current editions for Who's Who in the East, Who's Who in America, and Who's Who in the World.

Works

  • Haralick, Robert M.; Thomas Creese (1978). Differential Equations For Engineers. McGraw Hill Book Company. ISBN 0-07-013510-X.
  • Haralick, Robert M (1995). Inner Meaning of the Hebrew Letters. Jason Aronson. ISBN 1-56821-356-5.
  • Haralick, Robert M.; Shapiro, Linda G. (2002). Computer and Robot Vision (Volume I). Addison Wesley Longman.
  • Haralick, Robert M.; Shapiro, Linda G. (2002). Computer and Robot Vision (Volume II). Addison Wesley Longman. ISBN 0-201-56943-4.
  • Haralick, Robert M.; Rips, Eliyahu; Glazerson, Matiyahu (2005). Torah Codes: A Glimpse into the Infinite. Mazal & Bracha Publishing. ISBN 0-9740493-9-5.

See also

References

  1. ↑ "Robert Haralick Distinguished Professor, Ph.D. Program in Computer Science". Recently Appointed Graduate Center Faculty: 1999-present. The Graduate Center, City University of New York. Archived from the original on 2015-09-06. Retrieved 2011-12-04.
  2. ↑ Pattern Recognition with Measurement Space and Spatial Clustering for Multiple Images, (with G.L. Kelly), Proceedings of the IEEE, Volume 57, Number 4, April, 1969, pages 654-665.
  3. ↑ Using Radar Imagery for Crop Discrimination: A Statistical and Conditional Probability Study, with (F. Caspall and D.S. Simonett), Remote Sensing of Environment, Volume 1, 1970, pages 131-142
  4. ↑ An Iterative Clustering Procedure, (with I. Dinstein), IEEE Transactions on Systems, Man, and Cybernetics, Volume SMC 1, Number 3, July, 1971, pages 275-289.
  5. ↑ Haralick, Robert M. (1980). "Using Perspective Transformations in Scene Analysis" (PDF). Computer Graphics and Image Processing. 13 (3): 191–221. doi:10.1016/0146-664x(80)90046-5.
  6. ↑ Statistical Estimation For Exterior Orientation From Line to Line Correspondences, (with Chung Nan Lee), Image and Vision Computing, Volume 14, 1996, pages 379-388
  7. ↑ A Robust Linear Least squares Estimation of Camera Exterior Orientation Using Multiple Geometric Features, (with Qiang Ji, Mauro Costa, and Linda Shapiro), ISPRS Journal of Photogrammetry and Remote Sensing, Volume 55, Number 2, 2000, pages 75-93.
  8. ↑ Testing Camera Calibration With Constraints, (with Huang Youcai), Photogrammetric Engineering and Remote Sensing, March 1999, pages 249-258.
  9. ↑ The Consistent Labeling Problem: Part I, (with L.G. Shapiro), IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume 1, Number 2, April, 1979, pages 173-184.
  10. ↑ The Consistent Labeling Problem: Part II, (with L.G. Shapiro), IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume 2, Number 3, May, 1980, pages 193-203.
  11. ↑ Structural Pattern Recognition, Homomorphisms, and Arrangements, Pattern Recognition, Volume 10, Number 3, June, 1978, pages 223-236.
  12. ↑ Increasing Tree Search Efficiency for Constraint Satisfaction Problems, (with G.L. Elliott), Artificial Intelligence, Volume 14, 1980, pages 263-313.
  13. ↑ An Approximate Linear Time Propagate and Divide Theorem Prover for Propositional Logic, with S.H. Wu, International Journal of Pattern Recognition and Artificial Intelligence, Volume 1, Number 1, 1987, pages 141-155.
  14. ↑ Textural Features for Image Classification, with S. Shamnugam, IEEE Transactions on Cybernetics, Volume SMC-3, No. 2, 1973
  15. ↑ Statistical and Structural Approaches to Texture, Proceedings of the IEEE, Volume 67, Number 5, May, 1979, pages 786-804.
  16. ↑ A Facet Model for Image Data, (with L. Watson), Computer Graphics and Image Processing, Volume 15, February, 1981, pages 113-129.
  17. ↑ Digital Step Edges from Zero Crossing of Second Directional Derivatives, IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume 6, Number 1, January, 1984, pages 58-68.
  18. ↑ Integrated Directional Derivative Gradient Operator, (with O.A. Zuniga), IEEE Transactions on Systems, Man, and Cybernetics, Volume SMC 17, Number 3, May/June, 1987, pages 508-518.
  19. ↑ Ridges and Valleys on Digital Images, Computer Vision, Graphics, and Image Processing, Volume 22, 1983, pages 28-38.
  20. ↑ Peak Noise Removal by a Facet Model, (with Y. Yasuoka), Pattern Recognition, Volume 16, Number 1, 1983, pages 23-29.
  21. ↑ The Topographic Primal Sketch, (with L.T. Watson and T.J. Laffey), The International Journal of Robotics Research, Volume 2, Number 1, Spring 1983, pages 50-72.
  22. ↑ Image Analysis Using Mathematical Morphology, (with S. Sternberg and X. Zhuang), IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume 9, Number 4, July, 1987, pages 532-550.
  23. ↑ The Digital Morphological Sampling Theorem, (with X. Zhuang, C. Lin, and J.S.J. Lee), IEEE Transactions on Acoustics, Speech, and Signal Processing, Volume 37, Number 12, December, 1989, pages 2067-2090.
  24. ↑ Recursive Erosion, Dilation, Opening, and Closing Transforms, (with S. Chen), IEEE Transactions on Image Processing, March, 1995, Volume 4, Number 3, pages 335-345.
  25. ↑ Recursive Binary Dilation and Erosion Using Digital Line Structuring Elements In Arbitrary Orientations, (with Desika Nadadur), IEEE Transactions on Image Processing, May 2000
  26. ↑ Model Based Morphology: The Opening Spectrum, (with E.R. Dougherty and P.L. Katz), Computer Vision, Graphics, and Image Understanding: Graphical Models and Image Processing, Volume 57, Number 1, January, 1995, pages 1-12.
  27. ↑ Estimation of Optimal Morphological Tau opening Parameters Based on Independent Observation of Signal and Noise Pattern Spectra, (with E.R. Dougherty, Y. Chen, C. Agerskov, U. Jacobi, and P.H. Sloth), Journal of Signal Processing, Volume 29, Number 3, December, 1992, pages 265-281.
  28. ↑ CD_ROM Standard Document Database Standard, with I.T. Phillips, International Conference on Document Analysis and Recognition, Tsukuba, Japan, 1993
  29. ↑ Extraction of Text Lines and Text Blocks on Document Images Based on Statistical Modeling, (with Su Chen and Ihsin Phillips), International Journal of Imaging Systems and Technology, Volume 7, 1996, pages 343-35.
  30. ↑ Extraction of Text Words In Document Images Based On A Statistical Characterization, (with Su Chen and Ihsin Phillips), Journal of Electronic Imaging, Volume 5, 1996, page 24-34.
  31. ↑ Computer Vision Theory: The Lack Thereof, Computer Vision, Graphics, and Image Processing, Volume 36, 1986, page 372-386.
  32. ↑ Propagating Covariance in Computer Vision, International Journal of Pattern Recognition and Artificial Intelligence, Volume 10, Number 5, 1996, pages 561-572.
  33. ↑ Error Propagation in Machine Vision, (with Seungku Yi and L.G. Shapiro), Machine Vision and Applications, Volume 7, 1994, pages 93-114.
  34. ↑ A general technique for automatic left ventricle boundary validation: relation between gray scale cardioangiograms and observed boundary errors, (with J. Suri, F. Sheehan), Journal of Digital Imaging, 1997, August;10(3 Suppl 1), pages 212-217.
  35. ↑ Greedy Algorithm for Error Correction in Automatically Produced Boundaries from Low Contrast Ventriculograms, (with Jasjit S. Suri, Florence H. Sheehan), Pattern Analysis and Applications, Volume 3 Number 1, 2000, pages 39-60.
  36. ↑ A Knowledge based Boundary Delineation System For Contrast Ventriculograms", (with Lei Sui and Florence Sheehan), IEEE Transactions on Information Technology in Biomedicine, Volume 5, Number 2, 2001, pages 116-132.
  37. ↑ Integrated Surface Model Optimization for Freehand Three Dimensional Echocardiography, IEEE Transactions on Medical Imaging, (with Mingzhou Song, Florence Sheehan, and Richard Johnson), Volume 21, Number 9, September 2002.
  38. ↑ Linear Manifold Clustering In High Dimensional Spaces By Stochastic Search, (with Rave Harpaz), Pattern Recognition, Volume 40, Number 10, 2007, pages 2672-2684.
  39. ↑ Linear Manifold Correlation Clustering, (with Rave Harpaz), (invited paper) International Journal of Information Technology And Intelligent Computing, Volume 2, Number 2, 2007.
  40. ↑ Pattern Recognition Approaches To Solving Combinatorial Problems in Free Groups, (with Alex Miasnikov and Alexei Myasnikov), Contemporary Mathematics, Volume 349, 2004, pages 197-213.
  41. ↑ Heuristics for Whitehead Minimization Problem, (with Alex Miasnikov and Alexei Myasnikov), Experimental Mathematics, Volume 14, Number 1, 2005, page 7-14.
  42. ↑ Basic Concepts For Testing The Torah Code Hypothesis", International Conference on Pattern Recognition, Volume 3, 2006, pages 104-109.
  43. ↑ Testing The Torah Code Hypothesis: The Experimental Protocol, International Conference on Pattern Recognition, Volume 3, 2006, pages 110-115.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.