1133 search results - page 73 / 227 » Basics of Graph Cuts |
ICCV
2005
IEEE
15 years 3 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
SMI
2006
IEEE
15 years 3 months ago
2006
IEEE
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...