Sciweavers

243 search results - page 35 / 49
» On randomized representations of graphs using short labels
Sort
View
PAMI
2010
274views more  PAMI 2010»
13 years 1 months ago
3D Face Recognition Using Isogeodesic Stripes
In this paper, we present a novel approach to 3D face matching that shows high effectiveness in distinguishing facial differences between distinct individuals from differences indu...
Stefano Berretti, Alberto Del Bimbo, Pietro Pala
TIP
2008
133views more  TIP 2008»
13 years 6 months ago
A Recursive Model-Reduction Method for Approximate Inference in Gaussian Markov Random Fields
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
Jason K. Johnson, Alan S. Willsky
ECCV
2008
Springer
14 years 8 months ago
Latent Pose Estimator for Continuous Action Recognition
Recently, models based on conditional random fields (CRF) have produced promising results on labeling sequential data in several scientific fields. However, in the vision task of c...
Huazhong Ning, Wei Xu, Yihong Gong, Thomas S. Huan...
SIGGRAPH
2010
ACM
13 years 11 months ago
Vector solid textures
In this paper, we introduce a compact random-access vector representation for solid textures made of intermixed regions with relatively smooth internal color variations. It is fea...
Lvdi Wang, Kun Zhou, Yizhou Yu, Baining Guo
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 5 days ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud