1327 search results - page 63 / 266 » Path following algorithm for the graph matching problem |
139
click to vote
ICASSP
2010
IEEE
15 years 1 months ago
2010
IEEE
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
107
click to vote
CGO
2003
IEEE
15 years 5 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
142
click to vote
JDCTA
2010
14 years 8 months ago
2010
At present, China's automobile logistics cost accounts for more than 20% of the production of motor vehicles. Therefore, lowering logistics cost by seeking its best path is a...
105
click to vote
ASAP
1997
IEEE
15 years 6 months ago
1997
IEEE
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
126
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...