DocumentCode
315821
Title
An optimally fast greedy algorithm for active contours
Author
Mirhosseini, Ali R. ; Yan, Hong
Author_Institution
Dept. of Electr. Eng., Sydney Univ., NSW, Australia
Volume
2
fYear
1997
fDate
9-12 Jun 1997
Firstpage
1189
Abstract
Greedy algorithm is an iterative method used for minimizing the energy functional of active contours, snakes. In this paper we will show that using a suitable set of search patterns instead of a full search can increase its speed. A search pattern set that expands the search space and minimizes a suggested computational complexity cost function achieves the maximum speed. Finally a comparative study is made to show the agreement of the theoretical derivation with experimental results
Keywords
computational complexity; face recognition; iterative methods; splines (mathematics); active contours; boundary detection; computational complexity cost function; energy functional; face recognition; greedy algorithm; iterative method; search patterns; snakes; Active contours; Computational complexity; Cost function; Face detection; Face recognition; Greedy algorithms; Humans; Iterative algorithms; Iterative methods; Velocity measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1997. ISCAS '97., Proceedings of 1997 IEEE International Symposium on
Print_ISBN
0-7803-3583-X
Type
conf
DOI
10.1109/ISCAS.1997.622025
Filename
622025
Link To Document