504 search results - page 58 / 101 » Canonical Graph Shapes |
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
SDM
2010
SIAM
13 years 11 months ago
2010
SIAM
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
ICMCS
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, we use the three-dimensionaltopological shape information for human face identification. We propose a new method to represent 3D faces as a topological graph. Fine...
SIAMDM
2008
13 years 9 months ago
2008
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
ICIP
2000
IEEE
14 years 11 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...