Fast Nearest Neighbor Search in Medical Image Databases

Specifically, we use, .:!tate-of-the-art concepts from morphology, n;,mely the ‘pattern spectrum’ of a shape, to map each shape to a point in n-dimensional space. Following [16, 301, we organize the n-d points in an R-tree. We show that the L, (= max) norm in the n-d space lower-bounds the actual distance. This guarantees no false dismissals for range queries. In addition, we present a nearest neighbor algorithm that also guarantees no false dismissals.

[1]  Petros Maragos,et al.  Morphological skeleton representation and coding of binary images , 1984, IEEE Trans. Acoust. Speech Signal Process..

[2]  Petros Maragos,et al.  Morphological skeleton representation and coding of binary images , 1984, IEEE Trans. Acoust. Speech Signal Process..

[3]  Theodosios Pavlidis,et al.  Algorithms for Shape Analysis of Contours and Waveforms , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  C. Faloutsos.  Eecient Similarity Search in Sequence Databases , 1993 .

[5]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[6]  Petros Maragos.  Morphology-based symbolic image modeling, multi-scale nonlinear smoothing, and pattern spectrum , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Edward R. Dougherty,et al.  An introduction to morphological image processing , 1992 .

[8]  Serge Beucher.  Digital skeletons in Euclidean and geodesic spaces , 1994, Signal Process..

[9]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[10]  Jack A. Orenstein.  Spatial query processing in an object-oriented database system , 1986, SIGMOD '86.

[11]  Oliver Günther,et al.  The cell tree: An index for geometric databases , 1988 .

[12]  H. V. Jagadish.  Spatial search with polyhedra , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[13]  Klaus H. Hinrichs,et al.  The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects , 1983, International Workshop on Graph-Theoretic Concepts in Computer Science.

[14]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[15]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[16]  Berthold K. P. Horn.  Robot vision , 1986, MIT electrical engineering and computer science series.

[17]  Dmitry B. Goldgof,et al.  Biomedical Image Processing and Biomedical Visualization , 1993 .

[18]  Jack Sklansky,et al.  Fast polygonal approximation of digitized curves , 1980, Pattern Recognit..

[19]  H. V. Jagadish,et al.  A retrieval technique for similar shapes , 1991, SIGMOD '91.

[20]  G. Matheron.  Random Sets and Integral Geometry , 1976 .

[21]  Diane Greene,et al.  An implementation and performance analysis of spatial data access methods , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[22]  David B. Lomet,et al.  The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.

[23]  Anastasios N. Venetsanopoulos,et al.  Morphological skeleton representation and shape recognition , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[24]  Anastasios N. Venetsanopoulos,et al.  Rotationally invariant pecstrum: A rotationally invariant object descriptor based on mathematical morphology , 1992 .

[25]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[26]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[27]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.

[28]  Robert Ransom.  A Computer Model of Cell Clone Growth , 1977 .

[29]  Christos Faloutsos,et al.  Fast subsequence matching in time-series databases , 1994, SIGMOD '94.

[30]  Arnold W. M. Smeulders,et al.  Towards a Morphological Scale-Space Theory , 1994 .

[31]  Ramesh C. Jain,et al.  A Visual Information Management System for the Interactive Retrieval of Faces , 1993, IEEE Trans. Knowl. Data Eng..

[32]  Petros Maragos,et al.  Pattern Spectrum and Multiscale Shape Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[33]  Stéphane Mallat,et al.  A Theory for Multiresolution Signal Decomposition: The Wavelet Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[34]  Christos Faloutsos,et al.  Fractals for secondary key retrieval , 1989, PODS.

[35]  Harold G. Longbotham,et al.  Nonlinear indicators of malignancy , 1993, Electronic Imaging.

[36]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

[37]  Ugo Montanari,et al.  A note on minimal length polygonal approximation to a digitized contour , 1970, CACM.

[38]  M. Eden.  A Two-dimensional Growth Process , 1961 .

[39]  Edward R. Dougherty,et al.  Detection of osteoporosis by morphological granulometries , 1992, Electronic Imaging.

[40]  T. Williams,et al.  Stochastic Model for Abnormal Clone Spread through Epithelial Basal Layer , 1972, Nature.

[41]  Christos Faloutsos,et al.  Hilbert R-tree: An Improved R-tree using Fractals , 1994, VLDB.

[42]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[43]  H. V. Jagadish,et al.  Linear clustering of objects with multiple attributes , 1990, SIGMOD '90.

[44]  K. Wakimoto,et al.  Efficient and Effective Querying by Image Content , 1994 .

[45]  T. Liggett.  Interacting Particle Systems , 1985 .

[46]  Dragutin Petkovic,et al.  Query by Image and Video Content: The QBIC System , 1995, Computer.

[47]  T. E. Harris.  Contact Interactions on a Lattice , 1974 .

[48]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[49]  Georgios Evangelidis,et al.  The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation , 1995, VLDB.

[50]  G. Matheron.  Éléments pour une théorie des milieux poreux , 1967 .

[51]  Floyd B. Hanson,et al.  A stochastic model of tumor growth , 1982 .

[52]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Comput. Graph. Image Process..

[53]  Walid G. Aref,et al.  Optimization for Spatial Query Processing , 1991, Very Large Data Bases Conference.

[54]  Malur K. Sundareshan,et al.  Adaptive image contrast enhancement based on human visual properties , 1994, IEEE Trans. Medical Imaging.

[55]  Clu-istos Foutsos,et al.  Fast subsequence matching in time-series databases , 1994, SIGMOD '94.

[56]  A. Venetsanopoulos,et al.  The classification properties of the pecstrum and its use for pattern identification , 1991 .

[57]  Noel A Cressie,et al.  A spatial statistical analysis of tumor growth , 1992 .

[58]  R. Durrett.  Lecture notes on particle systems and percolation , 1988 .

[59]  Christos Faloutsos,et al.  Efficient Similarity Search In Sequence Databases , 1993, FODO.

[60]  Rajiv Mehrotra,et al.  Shape-similarity-based retrieval in image database systems , 1992, Electronic Imaging.

[61]  Andrew Blake,et al.  Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.