Sciweavers

610 search results - page 50 / 122
» Fast Modular Reduction
Sort
View
VCBM
2010
14 years 4 months ago
Fast and Smooth Interactive Segmentation of Medical Images Using Variational Interpolation
We present a fast and interactive segmentation method for medical images that allows a smooth reconstruction of an object's surface from a set of user drawn, three-dimensiona...
Frank Heckel, Olaf Konrad, Heinz-Otto Peitgen
ICDAR
2011
IEEE
13 years 9 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
ICCV
2007
IEEE
15 years 11 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas
ECCV
2008
Springer
15 years 11 months ago
A Fast Algorithm for Creating a Compact and Discriminative Visual Codebook
In patch-based object recognition, using a compact visual codebook can boost computational efficiency and reduce memory cost. Nevertheless, compared with a large-sized codebook, it...
Lei Wang, Luping Zhou, Chunhua Shen
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
15 years 10 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle