Sciweavers

99 search results - page 12 / 20
» Shock Graphs and Shape Matching
Sort
View
CVPR
2009
IEEE
15 years 2 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
CVPR
2009
IEEE
15 years 2 months ago
Locally Constrained Diffusion Process on Locally Densified Distance Spaces with Applications to Shape Retrieval
The matching and retrieval of 2D shapes is an important challenge in computer vision. A large number of shape similarity approaches have been developed, with the main focus bein...
Xingwei Yang (Temple University), Suzan Koknar-Tez...
AVBPA
2005
Springer
279views Biometrics» more  AVBPA 2005»
14 years 1 months ago
On Combining Textural and Geometrical Scores for Discriminative Face Authentication
Abstract. In this paper, a combined shape-texture approach to discriminative face authentication is studied. Facial texture information is captured through Gabor responses (jets), ...
José Luis Alba-Castro, Daniel Gonzál...
PR
2008
206views more  PR 2008»
13 years 7 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu
JMM2
2006
141views more  JMM2 2006»
13 years 7 months ago
Optimal Weighting of Landmarks for Face Recognition
A new method named Landmark Model Matching was recently proposed for fully automatic face recognition. It was inspired by Elastic Bunch Graph Matching and Active Shape Model. Landm...
Rajinda Senaratne, Saman K. Halgamuge