Sciweavers

2064 search results - page 219 / 413
» Segmentation Problems
Sort
View
TALG
2010
86views more  TALG 2010»
13 years 9 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
ICPR
2006
IEEE
14 years 12 months ago
Combinatorial Surface Integration
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
Edwin R. Hancock, Roberto Fraile
CVPR
2012
IEEE
12 years 1 months ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
CVPR
2001
IEEE
15 years 25 days ago
Convex and Non-convex Illuminant Constraints for Dichromatic Colour Constancy
The dichromatic reflectance model introduced by Shafer [16] predicts that the colour signals of most materials fall on a plane spanned by a vector due to the material and a vector...
Graham D. Finlayson, Gerald Schaefer
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
14 years 4 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny