246 search results - page 17 / 50 » Dynamic Local Search for the Maximum Clique Problem |
CRV
2008
IEEE
15 years 4 months ago
2008
IEEE
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
78
Voted
ESANN
2006
14 years 11 months ago
2006
The Blind Source Separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical dependency between outputs. Since global maximization may be ...
100
click to vote
ACCV
2010
Springer
14 years 4 months ago
2010
Springer
Accurate localization of the salient object from an image is a difficult problem when the saliency map is noisy and incomplete. A fast approach to detect salient objects from image...
72
Voted
IEICET
2006
14 years 9 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
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...