Skip to main content

A Distributed Algorithm for Content Based Indexing of Images by Projections on Ritz Primary Images

  • Chapter
Scalable High Performance Computing for Knowledge Discovery and Data Mining

Abstract

Large collections of images can be indexed by their projections on a few “primary” images. The optimal primary images are the eigenvectors of a large covariance matrix. We address the problem of computing primary images when access to the images is expensive. This is the case when the images cannot be kept locally, but must be accessed through slow communication such as the Internet, or stored in a compressed form. A distributed algorithm that computes optimal approximations to the eigenvectors (known as Ritz vectors) in one pass through the image set is proposed. When iterated, the algorithm can recover the exact eigenvectors. The widely used SVD technique for computing the primary images of a small image set is a special case of the proposed algorithm. In applications to image libraries and learning, it is necessary to compute different primary images for several sub-categories of the image set. The proposed algorithm can compute these additional primary images “offline”, without the image data. Similar computation by other algorithms is impractical even when access to the images is inexpensive.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • Abdi, H., Valentin, D., Edelman, B., and O’Toole, A. 1995. More about the difference between men and women: Evidence from linear neural networks and the principal component approach. Perception, 24:539–562.

    Article  Google Scholar 

  • Berry, M.W. 1992. Large-scale sparse singular value computations. The International Journal of Supercomputer Applications, 6(1): 13–49.

    Google Scholar 

  • Burl, M.C., Fayyad, U.M., Perona, P., Smyth, P., and Burl, M.P. 1994. Automating the hunt for volcanoes on venus. Proc. of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR’94), pp. 302–309.

    Google Scholar 

  • Champagne, B. 1994. Adaptive eigendecomposition of data covariance matrices based on first-order perturbations. IEEE Transactions on Signal Processing, 42(10):2758–2770.

    Article  Google Scholar 

  • Devijver, P.A. and Kittler, J. 1982. Pattern Recognition: A Statistical Approach. London: Prentice Hall.

    MATH  Google Scholar 

  • Fukunaga, K. 1990. Introduction to Statistical Pattern Recognition (second edition). New York: Academic Press.

    MATH  Google Scholar 

  • Golub, G.H. and Van-Loan, C.F. 1996. Matrix Computations (third edition). The Johns Hopkins University Press.

    Google Scholar 

  • Hertz, J., Krogh, A., and Palmer, R. 1991. Introduction to the Theory of Neural Computation. Reading, Massachusetts: Addison-Wesley.

    Google Scholar 

  • Jolliffe, I.T. 1986. Principal Component Analysis. Springer-Verlag.

    Google Scholar 

  • Leonardis, A. and Bischof, H. 1996. Dealing with occlusions in the eigenspace approach. Proc. of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR’96). IEEE Computer Society Press, pp. 453–458.

    Google Scholar 

  • Murakami, H. and Kumar, V. 1982. Efficient calculation of primary images from a set of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-4(5):511–515.

    Article  Google Scholar 

  • Murase, H. and Nayar, S. 1994. Illumination planning for object recognition using parametric eigenspaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(12): 1219–1227.

    Article  Google Scholar 

  • Murase, H. and Lindenbaum, M. 1995. Partial eigenvalue decomposition of large images using spatial-temporal adaptive method. IEEE Transactions on Image Processing, 4(5):620–629.

    Article  Google Scholar 

  • Murase, H. and Nayar, S. 1995. Visual learning and recognition of 3D objects from appearance. International Journal of Computer Vision, 14:5–24.

    Article  Google Scholar 

  • Patel, N. and Sethi, I. 1997. Video segmentation for video data management. In The Handbook of Multimedia Information Management, W. Grosky, R. Jain, and R. Mehrotra (Eds.). Prentice Hall PTR, chap. 5, pp. 139–165.

    Google Scholar 

  • Pentland, A., Picard, R.W., and Sclaroff, S. 1994. Photobook: Tools for content-base manipulation of image databases. Proc. SPIE Conf. on Storage and Retrieval of Image and Video Databases II, San Jose, CA, pp. 34–47.

    Google Scholar 

  • Rosenfeld, A. and Kak, A.C. 1982. Digital Picture Processing (second edition). Academic Press.

    Google Scholar 

  • Sanger, T.D. 1989. An optimality principle for unsupervised learning. In Advances in Neural Information Processing Systems, D.S. Touretzky (Ed.). San Mateo, 1989. (Denver 1988), Morgan Kaufmann, pp. 11–19.

    Google Scholar 

  • Schweitzer, H. 1995. Occam algorithms for computing visual motion. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(11): 1033–1042.

    Article  Google Scholar 

  • Schweitzer, H. 1998a. Computing Ritz approximations to primary images. Proceedings of the Sixth International Conference on Computer Vision (ICCV’98), (in press).

    Google Scholar 

  • Schweitzer, H. 1998b. Indexing images by trees of visual content. Proceedings of the Sixth International Conference on Computer Vision (ICCV’98), (in press).

    Google Scholar 

  • Stewart, G.W. 1969. Accelerating the orthogonal iteration for the eigenvalues of a hermitian matrix. Numer. Math., 13:362–376.

    Article  MathSciNet  MATH  Google Scholar 

  • Swets, D.L. and Weng, J. 1996. Using discriminant eigenfeatures for image retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(8):831–836.

    Article  Google Scholar 

  • Turk, M. and Pentland, A. 1991. Eigenfaces for recognition. Journal of Cognitive Neuroscience, 3(l):71–86.

    Article  Google Scholar 

  • Yang, X., Sarkar, T., and Arvas, E. 1989. A survey of conjugate gradient algorithms for solutions of extreme eigen-problems of asymmetric matrix. IEEE Transactions on Acoustics, Speech, and Signal Processing, 37(10): 1550–1555.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media New York

About this chapter

Cite this chapter

Schweitzer, H., Stolorz, P., Musick, R. (1997). A Distributed Algorithm for Content Based Indexing of Images by Projections on Ritz Primary Images. In: Stolorz, P., Musick, R. (eds) Scalable High Performance Computing for Knowledge Discovery and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5669-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-5669-5_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7595-1

  • Online ISBN: 978-1-4615-5669-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics