Sciweavers

14548 search results - page 2457 / 2910
» The Optimal Path-Matching Problem
Sort
View
CVPR
2008
IEEE
16 years 9 months ago
Graph cut with ordering constraints on labels and its applications
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu
ICCV
2007
IEEE
16 years 8 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
ECCV
2008
Springer
16 years 8 months ago
Contour Context Selection for Object Detection: A Set-to-Set Contour Matching Approach
Abstract. We introduce a shape detection framework called Contour Context Selection for detecting objects in cluttered images using only one exemplar. Shape based detection is inva...
Qihui Zhu, Liming Wang, Yang Wu, Jianbo Shi
ECCV
2006
Springer
16 years 8 months ago
An Integral Solution to Surface Evolution PDEs Via Geo-cuts
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
Yuri Boykov, Vladimir Kolmogorov, Daniel Cremers, ...
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
16 years 8 months ago
Query Selection Techniques for Efficient Crawling of Structured Web Sources
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
Ping Wu, Ji-Rong Wen, Huan Liu, Wei-Ying Ma
« Prev « First page 2457 / 2910 Last » Next »