A fast multigrid implicit algorithm for the evolution of geodesic active contours

Papandreou, G; Maragos, P

dc.contributor.author	Papandreou, G	en
dc.contributor.author	Maragos, P	en
dc.date.accessioned	2014-03-01T02:42:23Z
dc.date.available	2014-03-01T02:42:23Z
dc.date.issued	2004	en
dc.identifier.issn	10636919	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30977
dc.subject	Active Contour Model	en
dc.subject	Computer Vision	en
dc.subject	Curve Evolution	en
dc.subject	Geodesic Active Contour	en
dc.subject	Multigrid Method	en
dc.subject	Numerical Scheme	en
dc.subject	Rapid Evolution	en
dc.subject	Rotation Invariance	en
dc.subject	Sparse Linear System	en
dc.subject.other	Algorithms	en
dc.subject.other	Anisotropy	en
dc.subject.other	Boundary conditions	en
dc.subject.other	Computer vision	en
dc.subject.other	Difference equations	en
dc.subject.other	Invariance	en
dc.subject.other	Iterative methods	en
dc.subject.other	Linear systems	en
dc.subject.other	Partial differential equations	en
dc.subject.other	Topology	en
dc.subject.other	Balloon force	en
dc.subject.other	Geodesic active contours	en
dc.subject.other	Multigrade implicit algorithms	en
dc.subject.other	Sparse linear systems	en
dc.subject.other	Geodesy	en
dc.title	A fast multigrid implicit algorithm for the evolution of geodesic active contours	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/CVPR.2004.1315231	en
heal.identifier.secondary	http://dx.doi.org/10.1109/CVPR.2004.1315231	en
heal.publicationDate	2004	en
heal.abstract	Active contour models are among the most popular PDE-based tools in computer vision. In this paper we present a new algorithm for the fast evolution of geodesic active contours and compare it with other established numerical schemes. The new algorithm employs a full time-implicit and unconditionally stable numerical scheme and applies multigrid methods for the efficient solution of the occurring sparse linear system. When we utilize very big time-steps for the numerical evolution of the front, the proposed scheme has increased accuracy and better rotational invariance properties compared with the alternative AOS scheme. This allows for the rapid evolution and convergence of the contour to its final configuration after only very few iterations. Standard pyramidal and/or narrowband techniques can be easily integrated into our algorithm and further accelerate the curve evolution. Experimental results in object boundary detection demonstrate the power of the method.	en
heal.journalName	Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition	en
dc.identifier.doi	10.1109/CVPR.2004.1315231	en
dc.identifier.volume	2	en
dc.identifier.spage	II689	en
dc.identifier.epage	II694	en