Sciweavers

1115 search results - page 38 / 223
» Separating Shape Graphs
Sort
View
CVPR
2005
IEEE
14 years 10 months ago
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
David Tolliver, Gary L. Miller, Robert T. Collins
CVPR
2006
IEEE
14 years 10 months ago
Shape from Shading: Recognizing the Mountains through a Global View
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
Qihui Zhu, Jianbo Shi
ACII
2005
Springer
13 years 10 months ago
The Bunch-Active Shape Model
Active Shape Model (ASM) is one of the most powerful statistical tools for face image alignment. In this paper, we propose a novel method, called Bunch-Active Shape Model (Bunch-AS...
Jingcai Fan, Hongxun Yao, Wen Gao, Yazhou Liu, Xin...
PR
2007
134views more  PR 2007»
13 years 8 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
CAV
2008
Springer
152views Hardware» more  CAV 2008»
13 years 10 months ago
Heap Assumptions on Demand
Termination of a heap-manipulating program generally depends on preconditions that express heap assumptions (i.e., assertions describing reachability, aliasing, separation and shar...
Andreas Podelski, Andrey Rybalchenko, Thomas Wies