Sciweavers

2127 search results - page 67 / 426
» Computing large matchings fast
Sort
View
108
Voted
ICIP
2009
IEEE
16 years 4 months ago
Fast Pseudo-enhancement Correction In Ct Colonography Using Linear Shift-invariant Filters
This paper presents a novel method to approximate shiftvariant Gaussian filtering of an image using a set of shiftinvariant Gaussian filters. This approximation affords filtering ...
ICMCS
2006
IEEE
113views Multimedia» more  ICMCS 2006»
15 years 9 months ago
Fast Multi-Reference Frame Motion Estimation via Downhill Simplex Search
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
Chen-Kuo Chiang, Shang-Hong Lai
107
Voted
ECIR
2009
Springer
16 years 22 days ago
Revisiting N-Gram Based Models for Retrieval in Degraded Large Collections
The traditional retrieval models based on term matching are not effective in collections of degraded documents (output of OCR or ASR systems for instance). This paper presents a n...
Javier Parapar, Ana Freire, Alvaro Barreiro
133
Voted
CVPR
1998
IEEE
15 years 7 months ago
Curves Matching Using Geodesic Paths
We present a method for matching curves which accommodates large and small deformation. The method preserves geometric similarities in the case of small deformation, and loosens t...
Isaac Cohen, Isabelle Herlin
129
Voted
SI3D
1995
ACM
15 years 7 months ago
Portals and Mirrors: Simple, Fast Evaluation of Potentially Visible Sets
We describe an approach for determining potentially visible sets in dynamic architectural models. Our scheme divides the models into cells and portals, computing a conservative es...
David P. Luebke, Chris Georges