3415 search results - page 511 / 683 » Lower bounds on kernelization |
165
Voted
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
154
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
Many natural images contain reflections and transparency, i.e., they contain mixtures of reflected and transmitted light. When viewed from a moving camera, these appear as the sup...
177
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
177
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We present a theoretical analysis for characterizing the shadows cast by a point light source given its relative position to the camera. In particular, we analyze the epipolar geo...
191
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...