Sciweavers

36 search results - page 7 / 8
» Active Geodesics: Region based Active Contour Segmentation w...
Sort
View
IJCV
2006
299views more  IJCV 2006»
13 years 4 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
SCALESPACE
2009
Springer
13 years 11 months ago
A Variational Model for Interactive Shape Prior Segmentation and Real-Time Tracking
In this paper, we introduce a semi-automated segmentation method based on minimizing the Geodesic Active Contour energy incorporating a shape prior. We increase the robustness of t...
Manuel Werlberger, Thomas Pock, Markus Unger, Hors...
ICCV
2001
IEEE
14 years 6 months ago
Flux Maximizing Geometric Flows
Several geometric active contour models have been proposed for segmentation in computer vision. The essential idea is to evolve a curve (in 2D) or a surface (in 3D) under constrai...
Alexander Vasilevskiy, Kaleem Siddiqi
MVA
2007
230views Computer Vision» more  MVA 2007»
13 years 6 months ago
A Rear Vehicle Location Algorithm for Lane Change Assist
A monocular vision based location algorithm is presented to detect and track rear vehicles for lane change assist. The algorithm uses the shadow underneath the vehicle to extract ...
Wei Liu, Chunyan Song, Pengyu Fu, Nan Wang, Huai Y...
CVPR
1997
IEEE
13 years 8 months ago
Area and Length Minimizing Flows for Shape Segmentation
— A number of active contour models have been proposed that unify the curve evolution framework with classical energy minimization techniques for segmentation, such as snakes. Th...
Kaleem Siddiqi, Steven W. Zucker, Yves Béru...