Sciweavers

529 search results - page 2 / 106
» Indexing Biometric Databases Using Pyramid Technique
Sort
View
CORR
2010
Springer
145views Education» more  CORR 2010»
13 years 4 months ago
Feature Level Clustering of Large Biometric Database
This paper proposes an efficient technique for partitioning large biometric database during identification. In this technique feature vector which comprises of global and local de...
Hunny Mehrotra, Dakshina Ranjan Kisku, V. Bhawani ...
ICMCS
2005
IEEE
120views Multimedia» more  ICMCS 2005»
13 years 10 months ago
KPYR: An Efficient Indexing Method
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
Thierry Urruty, Fatima Belkouch, Chabane Djeraba
ICIP
2000
IEEE
14 years 6 months ago
Pyramid Texture Compression and Decompression Using Interpolative Vector Quantization
Abstract-Texture mapping is a common technique used to increase the visual quality of 3D scenes. As texture mapping requires large memory to deal with large textures generally r e ...
Young-Su Kwon, In-Cheol Park, Chong-Min Kyung
PODS
2000
ACM
120views Database» more  PODS 2000»
13 years 8 months ago
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stépha...
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 5 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...