Sciweavers

1190 search results - page 109 / 238
» Complex Salient Regions for Computer Vision Problems
Sort
View
98
Voted
ICCV
2001
IEEE
16 years 4 days ago
Image Segmentation by Data Driven Markov Chain Monte Carlo
?This paper presents a computational paradigm called Data-Driven Markov Chain Monte Carlo (DDMCMC) for image segmentation in the Bayesian statistical framework. The paper contribut...
Zhuowen Tu, Song Chun Zhu, Heung-Yeung Shum
73
Voted
WADS
2001
Springer
113views Algorithms» more  WADS 2001»
15 years 2 months ago
Movement Planning in the Presence of Flows
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
John H. Reif, Zheng Sun
CVPR
1997
IEEE
16 years 7 days ago
Disparity Component Matching for Visual Correspondence
We present a method for computing dense visual correspondence based on general assumptions about scene geometry. Our algorithm does not rely on correlation, and uses a variable re...
Yuri Boykov, Olga Veksler, Ramin Zabih
ECCV
2002
Springer
16 years 2 days ago
Diffuse-Specular Separation and Depth Recovery from Image Sequences
Specular reflections present difficulties for many areas of computer vision such as stereo and segmentation. To separate specular and diffuse reflection components, previous approa...
Stephen Lin, Yuanzhen Li, Sing Bing Kang, Xin Tong...
CVPR
2010
IEEE
14 years 10 months ago
Exploiting Monge structures in optimum subwindow search
Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a fou...
Senjian An, Patrick Peursum, Wanquan Liu, Svetha V...