Sciweavers

449 search results - page 23 / 90
» Measuring the Similarity of Geometric Graphs
Sort
View
LPAR
2004
Springer
14 years 27 days ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
ECCV
2004
Springer
14 years 9 months ago
Human Pose Estimation Using Learnt Probabilistic Region Similarities and Partial Configurations
Abstract. A model of human appearance is presented for efficient pose estimation from real-world images. In common with related approaches, a high-level model defines a space of co...
Timothy J. Roberts, Stephen J. McKenna, Ian W. Ric...
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 7 months ago
Relaxation-based coarsening and multiscale graph organization
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
Dorit Ron, Ilya Safro, Achi Brandt
TIP
2010
155views more  TIP 2010»
13 years 5 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
MICCAI
2010
Springer
13 years 6 months ago
Multiple Cortical Surface Correspondence Using Pairwise Shape Similarity
Accurately corresponding a population of human cortical surfaces provides important shape information for the diagnosis of many brain diseases. This problem is very challenging due...
Pahal Dalal, Feng Shi, Dinggang Shen, Song Wang