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. Prof. 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, MI. Haralick occupied the Boeing Clairmont Egtvedt Professorship in the department of electrical engineering at the University of Washington from 1986 through 2000. At UW, 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, City University of New York. Contributions Haralick began his work as one of the principal investigators of the NASA ERTS satellite data doing remote sensing image analysis. 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. He has also identified a variety of vision problems which are special cases of the consistent labeling problem. His papers on consistent labeling, arrangements, relation homomorphism, 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. This gives a framework for the control structure required in high-level vision problems. He has also extended the forward-checking tree search technique