Sciweavers

517 search results - page 73 / 104
» An Approximate Algorithm for Structural Matching of Images
Sort
View
ICIAP
1999
ACM
14 years 5 days ago
Bayesian Graph Edit Distance
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
Richard Myers, Richard C. Wilson, Edwin R. Hancock
MM
2004
ACM
167views Multimedia» more  MM 2004»
14 years 1 months ago
Learning an image manifold for retrieval
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
Xiaofei He, Wei-Ying Ma, HongJiang Zhang
SIAMSC
2010
120views more  SIAMSC 2010»
13 years 6 months ago
Simultaneously Sparse Solutions to Linear Inverse Problems with Multiple System Matrices and a Single Observation Vector
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...
Adam C. Zelinski, Vivek K. Goyal, Elfar Adalsteins...
ICIP
2006
IEEE
14 years 9 months ago
Modulation Domain Features for Discriminating Infrared Targets and Backgrounds
For the first time, we compute modulation domain features for infrared targets and backgrounds, including dominant modulations that characterize the local texture contrast, orient...
Chuong T. Nguyen, Joseph P. Havlicek
CIKM
2008
Springer
13 years 10 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...