9842 search results - page 1597 / 1969 » The Complexity of the Matching-Cut Problem |
171
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...
203
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In recent years, local pattern based object detection and recognition have attracted increasing interest in computer vision research community. However, to our best knowledge no p...
163
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
In this paper a new rectification method is proposed. The method is both simple and efficient and can deal with all possible camera motions. A minimal image size without any pixel...
181
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
212
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...