DocumentCode
3201711
Title
A matching algorithm based on hierarchical primitive structure
Author
Wang, Xiao-jun ; Fu, Jie ; Wu, Li-De
Author_Institution
Dept. of Comput. Sci., Fudan Univ., Shanghai, China
Volume
i
fYear
1990
fDate
16-21 Jun 1990
Firstpage
285
Abstract
A novel motion matching algorithm based on a hierarchical primitive structure (HPS) is presented. It has two main steps. The first is the construction of the HPS. Zero crossings are extracted using a Laplacian or Gaussian operator, and they are assembled according to certain rules. The second is a coarse-to-fine matching step based on similarity criteria. A strategy which combines relaxation and constrained tree-searching is used to obtain the optimal matching result. Experimental results for real images are given
Keywords
pattern recognition; picture processing; search problems; trees (mathematics); Gaussian operator; Laplacian operator; constrained tree-searching; hierarchical primitive structure; matching algorithm; motion matching; relaxation; similarity criteria; zero crossings; Computer science; Feature extraction; Image analysis; Image segmentation; Impedance matching; Laplace equations; Layout; Linear approximation; Microwave integrated circuits; Optimal matching;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 1990. Proceedings., 10th International Conference on
Conference_Location
Atlantic City, NJ
Print_ISBN
0-8186-2062-5
Type
conf
DOI
10.1109/ICPR.1990.118114
Filename
118114
Link To Document