DocumentCode
3160307
Title
Fast greedy optimal algorithm for hierarchical matching
Author
Antsfeld, Leonid ; Hertz, David
Author_Institution
Fac. of Appl. Math., Technion-Israel Inst. of Technol., Haifa, Israel
fYear
2002
fDate
1 Dec. 2002
Firstpage
108
Lastpage
110
Abstract
In this paper we present a new efficient optimal greedy algorithm for solving a variant of the matching problem. Here, only matchings that are associated with a given hierarchical structure are allowed. We prove the correctness of the proposed algorithm and analyze its computational complexity.
Keywords
computational complexity; flow graphs; image matching; object recognition; trees (mathematics); bipartite graph; computational complexity; fast greedy optimal algorithm; flow network solution approach; hierarchical matching; hierarchical structure; hierarchical tree; matching problem; observed objects; rooted tree; Algorithm design and analysis; Bipartite graph; Computational complexity; Greedy algorithms; Mathematics; Vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Electronics Engineers in Israel, 2002. The 22nd Convention of
Print_ISBN
0-7803-7693-5
Type
conf
DOI
10.1109/EEEI.2002.1178348
Filename
1178348
Link To Document