DocumentCode :
2966971
Title :
Partial shape recognition: a landmark-based approach
Author :
Ansari, Nirwan ; Delp, Edward J.
Author_Institution :
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
fYear :
1989
fDate :
14-17 Nov 1989
Firstpage :
831
Abstract :
A technique to guide landmark matching known as hopping dynamic programming is described. The location of the model in the scene is estimated with a least-squares fit. A heuristic measure is then computed to decide if the model is in the scene. The shape features of an object are the landmarks associated with the object. The landmarks of an object are defined as the points of interest of the object that have important shape attributes. Examples of landmarks are corners, holes, protrusions, and high-curvature points
Keywords :
dynamic programming; least squares approximations; pattern recognition; heuristic; hopping dynamic programming; landmark matching; least-squares; partial shape recognition; Computer vision; Feature extraction; Image processing; Laboratories; Layout; Least squares approximation; Pattern recognition; Performance evaluation; Shape measurement; Signal processing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man and Cybernetics, 1989. Conference Proceedings., IEEE International Conference on
Conference_Location :
Cambridge, MA
Type :
conf
DOI :
10.1109/ICSMC.1989.71410
Filename :
71410
Link To Document :
بازگشت