Sciweavers

107 search results - page 11 / 22
» Computing subsets of equivalence classes for large FSMs
Sort
View
DCC
1995
IEEE
13 years 10 months ago
Accelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
Dietmar Saupe
PAMI
2007
156views more  PAMI 2007»
13 years 6 months ago
Selection and Fusion of Color Models for Image Feature Detection
—The choice of a color model is of great importance for many computer vision algorithms (e.g., feature detection, object recognition, and tracking) as the chosen color model indu...
Harro M. G. Stokman, Theo Gevers
CVPR
2003
IEEE
14 years 8 months ago
Clustering Appearances of Objects Under Varying Illumination Conditions
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
Jeffrey Ho, Ming-Hsuan Yang, Jongwoo Lim, Kuang-Ch...
CVPR
2010
IEEE
14 years 3 months ago
Admissible Linear Map Models of Linear Cameras
This paper presents a complete analytical characterization of a large class of central and non-central imaging devices dubbed linear cameras by Ponce [9]. Pajdla [7] has shown tha...
Guillaume Batog, Xavier Goaoc, Jean Ponce
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 7 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar