Sciweavers

1542 search results - page 229 / 309
» Redundancy in Spatial Databases
Sort
View
ICVGIP
2004
13 years 10 months ago
Local Correlation-based Fingerprint Matching
Most fingerprint matching systems are based on matching minutia points between two fingerprint images. Each minutia is represented by a fixed number of attributes such as the loca...
Karthik Nandakumar, Anil K. Jain
CEC
2010
IEEE
13 years 10 months ago
A modified genetic algorithm for matching building sets with the histograms of forces
Abstract--This paper presents an approach to the task of locating a group of buildings based solely on their relative spatial relationships. This situation can occur in the problem...
Andrew R. Buck, James M. Keller, Marjorie Skubic
DKE
2006
123views more  DKE 2006»
13 years 8 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
CVIU
2007
84views more  CVIU 2007»
13 years 8 months ago
Practical implementation of LMMSE demosaicing using luminance and chrominance spaces
Most digital color cameras sample only one color at each spatial location, using a single sensor coupled with a color filter array (CFA). An interpolation step called demosaicing...
Brice Chaix de Lavarène, David Alleysson, J...
TKDE
1998
102views more  TKDE 1998»
13 years 8 months ago
Fast and Effective Retrieval of Medical Tumor Shapes
—We investigate the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes (“Find tumors that are similar to a given patter...
Flip Korn, Nikolaos Sidiropoulos, Christos Falouts...