Sciweavers

306 search results - page 13 / 62
» Parameterized matching with mismatches
Sort
View
ACIVS
2009
Springer
13 years 5 months ago
Enhanced Low-Resolution Pruning for Fast Full-Search Template Matching
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
CVPR
2008
IEEE
14 years 10 months ago
Parameterized Kernel Principal Component Analysis: Theory and applications to supervised and unsupervised image alignment
Parameterized Appearance Models (PAMs) (e.g. eigentracking, active appearance models, morphable models) use Principal Component Analysis (PCA) to model the shape and appearance of...
Fernando De la Torre, Minh Hoai Nguyen
WG
2009
Springer
14 years 2 months ago
The Parameterized Complexity of Some Minimum Label Problems
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
TMI
2011
130views more  TMI 2011»
13 years 2 months ago
Parameterization-Invariant Shape Comparisons of Anatomical Surfaces
—We consider 3D brain structures as continuous parameterized surfaces and present a metric for their comparisons that is invariant to the way they are parameterized. Past compari...
Sebastian Kurtek, Eric Klassen, Zhaohua Ding, Sand...
ASPDAC
2007
ACM
146views Hardware» more  ASPDAC 2007»
13 years 12 months ago
Practical Implementation of Stochastic Parameterized Model Order Reduction via Hermite Polynomial Chaos
Abstract-- This paper describes the stochastic model order reduction algorithm via stochastic Hermite Polynomials from the practical implementation perspective. Comparing with exis...
Yi Zou, Yici Cai, Qiang Zhou, Xianlong Hong, Sheld...