Sciweavers

140 search results - page 28 / 28
» Computing the visibility graph of points within a polygon
Sort
View
EMMCVPR
1999
Springer
13 years 9 months ago
A New Algorithm for Energy Minimization with Discontinuities
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
Yuri Boykov, Olga Veksler, Ramin Zabih
FOCS
2008
IEEE
13 years 11 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
SIGGRAPH
1995
ACM
13 years 8 months ago
Intelligent scissors for image composition
We present a new, interactive tool called Intelligent Scissors which we use for image segmentation and composition. Fully automated segmentation is an unsolved problem, while manu...
Eric N. Mortensen, William A. Barrett
CVIU
2004
134views more  CVIU 2004»
13 years 4 months ago
The "dead reckoning" signed distance transform
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
George J. Grevera
DAGSTUHL
2001
13 years 6 months ago
Visualization for the Mind's Eye
Software visualization has been almost exclusively tackled from the visual point of view; this means visualization occurs exclusively through the visual channel. This approach has ...
Nelson A. Baloian, Wolfram Luther