Sciweavers

2127 search results - page 22 / 426
» Computing large matchings fast
Sort
View
CVPR
2008
IEEE
15 years 4 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
EMMCVPR
2003
Springer
15 years 3 months ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri
BMCBI
2010
205views more  BMCBI 2010»
14 years 10 months ago
A fast indexing approach for protein structure comparison
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...
Lei Zhang, James Bailey, Arun Siddharth Konagurthu...
CVPR
2010
IEEE
15 years 1 months ago
Fast pattern matching using orthogonal Haar transform
Pattern matching is a widely used procedure in signal processing, computer vision, image and video processing. Recently, methods using Walsh Hadamard Transform (WHT) and Gray-Code...
Wanli Ouyang, Renqi Zhang, Cham Wai-Kuen
MIR
2004
ACM
154views Multimedia» more  MIR 2004»
15 years 3 months ago
Fast and robust short video clip search using an index structure
In this paper, we present an index structure-based method to fast and robustly search short video clips in large video collections. First we temporally segment a given long video ...
Junsong Yuan, Ling-Yu Duan, Qi Tian, Changsheng Xu