This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast and Effective Retrieval of Medical Tumor Shapes
November/December 1998 (vol. 10 no. 6)
pp. 889-904

Abstract—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 pattern."). We use a natural similarity function for shape-matching, based on concepts from mathematical morphology, and we show how it can be lower-bounded by a set of shape features for safely pruning candidates, thus giving fast and correct output. These features can be organized in a spatial access method, leading to fast indexing for range queries and nearest-neighbor queries. In addition to the lower-bounding, our second contribution is the design of a fast algorithm for nearest-neighbor search, achieving significant speedup while provably guaranteeing correctness. Our experiments demonstrate that roughly 90 percent of the candidates can be pruned using these techniques, resulting in up to 27 times better performance compared to sequential scan.

[1] R. Agrawal, C. Faloutsos, and A. Swami, “Efficient Similarity Search in Sequence Databases,” Proc. Fourth Int'l Conf. Foundations of Data Organization and Algorithms, pp. 69-84, Oct. 1993.
[2] V. Anastassopoulos and A.N. Venetsanopoulos, "Classification Properties of the Spectrum and Its Use for Pattern Identification," Circuits, Systems, and Signal Processing, vol. 10, no. 3, 1991.
[3] J.R. Bach, S. Paul, and R. Jain, “A Visual Information Management System for the Interactive Retrieval of Faces,” IEEE Trans. Knowledge and Data Eng., vol. 5, no. 4, pp. 619-628, 1993.
[4] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf. Management of Data, 1990.
[5] J.L. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching," Comm. ACM, vol. 18, no. 9, pp. 509-517, 1975.
[6] S. Berchtold, D. Keim, and H.-P. Kriegel, "Using Extended Feature Objects for Partial Similarity Retrieval," VLDB J., vol. 6, no. 4, 1997.
[7] T. Bozkaya and M. Ozsoyoglu, “Distance-Based Indexing for High-Dimensional Metric Spaces,” Proc. SIGMOD Int'l Conf. Management of Data, pp. 357-368, 1997.
[8] S. Brin, “Near Neighbour Search in Large Metric Spaces,” Proc. 21st Int'l Conf. Very Large Data Bases, pp. 574-584, Sept. 1995.
[9] L. Brown, “A Survey of Image Registration Techniques,” ACM Computing Surveys, vol. 24, no. 4, pp. 325-376, 1992.
[10] C.J. Burdett, H.G. Longbotham, M. Desai, Walter B. Richardson, and John F. Stoll, "Nonlinear Indicators of Malignancy," Proc. SPIE—Biomedical Image Processing and Biomedical Visualization, vol. 1905, part 2, pp. 853-860, Feb. 1993.
[11] P. Ciaccia, M. Patella, and P. Zezula, “M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces,” Proc. Int'l Conf. Very Large Data Bases, 1997.
[12] M. Eden, "A Two-Dimensional Growth Process," Proc. Fourth Berkeley Symp. Math. Statistics and Probability, J. Neyman ed., Univ. of California Press, Berkeley, Calif., 1961
[13] C. Faloutsos, R. Barber, M. Flicker, J. Hafner, W. Niblack, and W. Equitz, "Efficient and effective querying by image content," J. Intell. Information Systems," vol. 3, pp. 231-262, 1994.
[14] C. Faloutsos and S. Roseman, "Fractals for Secondary Key Retrival," Proc. Symp. Principles of Database Systems, SIGMOD-SIGACT PODS, 1989.
[15] C. Faloutsos, Searching Multimedia Databases by Content. Kluwer Academic, 1996.
[16] C. Faloutsos, M. Ranganathan, and I. Manolopoulos, “Fast Subsequence Matching in Time Series Databases,” Proc. ACM SIGMOD, pp. 419-429, May 1994.
[17] M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker, “Query by Image and Video Content: The QBIC System,” IEEE Computer, 1995.
[18] K. Fukunaga and P.M. Narendra, "A Branch and Bound Algorithm for Computing k-Nearest Neighbors," IEEE Trans. Computers, vol. 24, no. 7, pp. 750-753, July 1975.
[19] I. Gargantini, "An Effective Way to Represent Quadtrees," Comm. ACM, vol. 25, no. 12, pp. 905-910, Dec. 1982.
[20] Gary and Mehrotra, "Shape Similarity-Based Retrieval in Image Database Systems," Proc. SPIE, vol. 1662, pp. 2-8, 1992.
[21] C. Giardina and E. Dougherty, Morphological Methods in Image and Signal Processing.Englewood Cliffs, N.J.: Prentice Hall, 1988.
[22] D.Q. Goldin and P.C. Kanellakis, “On Similarity Queries for Time Series Data: Constraint Specification and Implementation,” Proc. Int'l Conf. Principles and Practice of Constraint Programming, pp. 137-153, 1995.
[23] V. Gudivada, "Indexing for Efficient Spatial-Similarity Query Processing in Multimedia Databases," Proc. SPIE Proc., vol. 2916, pp. 46-52,Boston, Nov. 1996.
[24] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[25] D. Harman, Proc. TREC 3, Third Text Retrieval Conf., special publication, National Inst. of Standards and Tech nology, Gaithersburg, Md., 1995.
[26] K. Hinrichs and J. Nievergelt, "The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects," Proc. WG Int'l Workshop Graph Theoretic Concepts in Computer Science, pp. 100-113, 1983.
[27] B.K. Horn, Robot Vision. Cambridge, Mass.: MIT Press, 1986.
[28] B.K. Horn, Robot Vision. Cambridge, Mass.: MIT Press, 1986.
[29] D.P. Huttenlocher, G.A. Klanderman, and W.J. Rucklidge, “Comparing Images Using the Hausdorff Distance,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 850-863, Sept. 1993.
[30] C.E. Jacobs and A. Finkelstein, S.H. Salesin, “Fast Multiresolution Image Querying,” Proc. SIGGRAPH, 1995.
[31] H.V. Jagadish, "Linear Clustering of Objects with Multiple Attributes," Proc. Int'l Conf. Management of Data, pp. 332-342, ACM SIGMOD, 1990.
[32] H.V. Jagadish, "Spatial Search with Polyhedra," Proc. Sixth IEEE Int'l Conf. Data Eng., Feb. 1990.
[33] H.V. Jagadish, “A Retrieval Technique for Similar Shapes,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 208-217, 1991.
[34] T. Ji, M. Sundareshan, and H. Roehrig, "Adaptive Image Contrast Enhancement Based on Human Visual Properties," IEEE Trans. Medical Imaging, vol. 13, no. 4, Dec. 1994.
[35] I.T. Jolliffe, Principal Component Analysis. Springer Verlag, 1986.
[36] V. Kobla, D. Doermann, K.-I. Lin, and C. Faloutsos, "Compressed Domain Video Indexing Techniques Using DCT and Motion Vector Information in MPEG Video," Proc. SPIE, vol. 2916, Boston, Nov. 1996.
[37] F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas, “Fast Nearest-Neighbor Search in Medical Image Databases,” Proc. Conf. Very Large Data Bases (VLDB '96), Sept. 1996.
[38] F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas, "Fast and Effective Similarity Search in Medical Tumor Databases Using Morphology," Proc. SPIE, vol. 2916, pp. 116-129,Boston, Nov. 1996.
[39] D. Lomet and B. Salzberg, "The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance," ACM Trans. Database Systems. vol. 15, no. 4, pp. 625-658, Dec. 1990.
[40] P.A. Maragos and R.W. Schafer, "Morphological Skeleton Representation and Coding of Binary Images," IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 34, pp. 1,228-1,244, Oct. 1986.
[41] P. Maragos, "Morphology-Based Symbolic Image Modeling, Multi-Scale Nonlinear Smoothing, and Pattern Spectrum," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition,Ann Arbor, Mich., pp. 766-773, June 1988.
[42] P. Maragos, "Pattern Spectrum and Multiscale Shape Representation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 701-716, 1989.
[43] P.A. Maragos and R.W. Schafer, "Morphological Skeleton Representation and Coding of Binary Images," IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 34, pp. 1,228-1,244, Oct. 1986.
[44] G. Matheron, Random Sets and Integral Geometry, Wiley. New York, 1975.
[45] R. Mehrotra and J.E. Gary, “Feature-Based Retrieval of Similar Shapes,” Proc. Ninth Int'l Conf. Data Eng., pp. 108-115, 1993.
[46] W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, P. Yanker, C. Faloutsos, and G. Taubin, "The QBIC Project: Querying Images by Content Using Color, Texture, and Shape," Proc. SPIE 1993 Int'l Symp. Electronic Imaging: Science and Technology, Conf. 1908, Storage and Retrieval for Image and Video Databases, Feb. 1993; also available as IBM Research Report No. RJ 9203 81511, Feb. 1993.
[47] J. Orenstein, “Spatial Query Processing in an Object-Oriented Database System,” Proc. Fifth ACM-SIGMOD Conf., pp. 326-336, 1986.
[48] T. Pavlidis, "Algorithms for Shape Analysis of Contours and Waveforms," IEEE T. Pattern Analysis and Machine Intelligence, vol. 2, pp. 301-312, 1980.
[49] S. Pong and A.N. Venetsanopoulos, "Rotationally Invariant Spectrum: An Object Recognition Descriptor Based on Mathematical Morphology," Circuits, Systems, and Signal Processing, vol. 11, no. 4, pp. 455-492, 1992.
[50] D. Rafiei and A. Mendelzon, “Similarity-Based Queries for Time Series Data,” Proc. ACM SIGMOD Conf. Management of Data, pp. 13-25, 1997.
[51] J.T. Robinson, “The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 10-18, 1981.
[52] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 71-79, 1995.
[53] S. Santini and R. Jain, "Similarity Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, 1996.
[54] T. Seidl and H.-P. Kriegel, "Efficient User-Adaptable Similarity Search in Large Multimedia Databases," Proc. 23rd VLDB Conf., pp. 506-515,Athens, Aug. 1997.
[55] T. Seidl and H.-P. Kriegel, “Optimal Multi-Step k-Nearest Neighbor Search,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 154-165, 1998.
[56] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+-Tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB), 1987.
[57] V.S. Subrahmanian, Principles of Multimedia Database Systems. Morgan Kaufmann, 1998.
[58] Z. Zhou and A.N. Venetsanopoulos, "Morphological Skeleton Representation and Shape Recognition," Proc. IEEE Second Int'l Conf. ASSP,New York, pp. 948-951, 1988.

Index Terms:
Content-based retrieval, multimedia indexing, mathematical morphology, pattern spectrum.
Citation:
Philip (Flip) Korn, Nicholas Sidiropoulos, Christos Faloutsos, Eliot Siegel, Zenon Protopapas, "Fast and Effective Retrieval of Medical Tumor Shapes," IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 6, pp. 889-904, Nov.-Dec. 1998, doi:10.1109/69.738356
Usage of this product signifies your acceptance of the Terms of Use.