Search Sciweavers | Sciweavers

28

ICCV
2009
IEEE

430views Computer Vision» more ICCV 2009»

Beyond Connecting the Dots: A Polynomial-time Algorithm for Segmentation and Boundary Estimation with Imprecise User Input

15 years 1 months ago

Download www-cvpr.iai.uni-bonn.de

We propose a polynomial-time algorithm for segmentation and (open) boundary estimation which takes into account a series of user-specified attraction points. In contrast to exis...

Thomas Windheuser, Thomas Schoenemann, Daniel Crem...

claim paper

Read More »

21

click to vote

CVPR
1996
IEEE

125views Computer Vision» more CVPR 1996»

Physics-Based Segmentation: Moving Beyond Color

14 years 11 months ago

Download www.cs.colby.edu

Bruce A. Maxwell, Steven A. Shafer

claim paper

Read More »

25

click to vote

CVPR
2003
IEEE

149views Computer Vision» more CVPR 2003»

Seeing Beyond Occlusions (and other marvels of a finite lens aperture)

14 years 11 months ago

Download vision.ucla.edu

Paolo Favaro, Stefano Soatto

claim paper

Read More »

28

click to vote

CVPR
2003
IEEE

149views Computer Vision» more CVPR 2003»

Multi-view Stereo Beyond Lambert

14 years 11 months ago

Download www.vision.cs.ucla.edu

We consider the problem of estimating the shape and radiance of an object from a calibrated set of views under the assumption that the reflectance of the object is nonLambertian. ...

Hailin Jin, Stefano Soatto, Anthony J. Yezzi

claim paper

Read More »

28

click to vote

CVPR
2005
IEEE

207views Computer Vision» more CVPR 2005»

Beyond Pairwise Clustering

14 years 11 months ago

Download vision.ucsd.edu

We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...

Sameer Agarwal, Jongwoo Lim, Lihi Zelnik-Manor, Pi...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers