Skip to main content

Recognizing Objects Using Color-Annotated Adjacency Graphs

  • Chapter
  • First Online:
Shape, Contour and Grouping in Computer Vision

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1681))

Abstract

We introduce a new algorithm for identifying objects in clut- tered images, based on approximate subgraph matching. This algorithm is robust under moderate variations in the camera viewpoints. In other words, it is expected to recognize an object (whose model is derived from a template image) in a search image, even when the cameras of the template and search images are substantially different. The algorithm represents the objects in the template and search images by weighted adjacency graphs. Then the problem of recognizing the template object in the search image is reduced to the problem of approximately match- ing the template graph as a subgraph of the search image graph. The matching procedure is somewhat insensitive to minor graph variations, thus leading to a recognition algorithm which is robust with respect to camera variations.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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.

References

  1. Ambler A.P., Barrow H.G., Brown C.M., Burstall R.M., Popplestone R.J., ‘A versatile computer-controlled assembly system’, IJCAI, pages 298–307, (1973).

    Google Scholar 

  2. Ballard D.H., Brown C.M., ‘Computer Vision’, Prentice-Hall, Englewood Cli_s, NJ, (1982).

    Google Scholar 

  3. Batahan F., Junger M., Reinelt G., ‘Experiments in Quadratic 0-1 programming’, Mathematical Programming, vol. 44, pages 127–137, (1989).

    Google Scholar 

  4. David H. Brainard and Brian A. Wandell, ‘Analysis of the retinex theory of color vision’, Journal of the Optical Society of America, Vol. 3, No 10, pages 1651-1661, (1986).

    Google Scholar 

  5. J. Brian Burns and Stanley J. Rosenschein, ‘Recognition via Blob Representation and Relational Voting’, Proc 27th Asilomar Conference on Signals, Systems and Computer, pages 101–105, (1993).

    Google Scholar 

  6. Marie-Pierre Dubuisson and Anil K. Jain, ‘Fusing Color and Edge Information for Object Matching’, Proceedings, ICIP-94, pages 471–476, (1994).

    Google Scholar 

  7. Francois Ennesser and Gerard Medioni, ‘Finding Waldo, or Focus of Attention using Local Color Information’, IEEE Transactions on PAMI, Vol 17, 8, pages 805–809, (1993).

    Google Scholar 

  8. Faugeras O., ‘Three-dimensional computer vision’, MIT Press, (1993).

    Google Scholar 

  9. G. D. Finlayson, B. V. Funt and K. Barnard, ‘Color Constancy under Varying Illumination’, Proceedings of 5th International Conference on Computer Vision, ICCV-95, pages 720–725, (1995).

    Google Scholar 

  10. David Forsyth, ‘A Novel Approach to Colour Constancy’, Proceedings of 2nd International Conference on Computer Vision, ICCV-88, pages 9–18, (1988).

    Google Scholar 

  11. Brian V. Funt and Graham D. Finlayson, ‘Color Constant Color Indexing’, IEEE Transactions on PAMI, Vol. 17, No. 5, pages 522–529, (May 1995).

    Google Scholar 

  12. Graham D. Finlayson, Mark S. Drew and Brian V. Funt, ‘Color constancy: generalized diagonal transforms suffice’, Journal of the Optical Society of America, Vol. 11, No 11, pages 3011–3019, (1994).

    Google Scholar 

  13. Gold S. and Rangarjan A., ‘A gradual assignment algorithm for graph matching’, IEEE Transactions on PAMI, Vol. 18 No 4, (April 1996), pages 377–387.

    Google Scholar 

  14. Gibson A., ‘Algorithmic graph theory’, Cambridge University Press, Cambridge (MA), USA, (1985)

    Google Scholar 

  15. Allen R. Hanson and Edward M. Riseman, ‘Segmentation of Natural Scenes’, in Computer Vision Systems, (edited A. Hanson and E. Riseman), Academic Press, (1978), pages 129–164.

    Google Scholar 

  16. Allen R. Hanson and Edward M. Riseman, ‘VISIONS: A computer system for interpreting scenes’, in Computer Vision Systems, (edited A. Hanson and E. Rise-man), Academic Press, (1978), pages 303–334.

    Google Scholar 

  17. Glenn Healey and David Slater, ‘Global color constancy: recognition of objects by use of illumination-invariant properties of color distributions’, Journal of the Optical Society of America, Vol. 11, No 11, pages 3003–3010, (1994).

    Google Scholar 

  18. Glenn Healey and David Slater, ‘Computing Illumination-Invariant Descriptors of Spatially Filtered Color Image Regions’, IEEE Transactions on Image Processing, Vol. 6 No 7, (July 1997), pages 1002–1013.

    Google Scholar 

  19. Glenn Healey and David Slater, ‘Exploiting an Atmospheric Model for Automated Invariant Material Identification in Hyperspectral Imagery’, Preprint report: to appear (Darpa IU Workshop, Monterey, (1998)?).

    Google Scholar 

  20. Lin, F. ‘A parallel computation network for the maximum clique problem’, Pro-ceeding 1993 international symposium on circuits and systems, pages 2549–52, vol. 4, IEEE, (May 1993).

    Google Scholar 

  21. Stephen Lin and Sang Wook Lee, ‘Using Chromaticity Distributions and Eigenspace Analysis for Pose, Illumination and Specularity Invariant Recognition of 3D objects’, Proceedings Computer Vision and Pattern Recognition, CVPR-97, pages 426–431, (1997).

    Google Scholar 

  22. Hiroshi Murase and Shree K. Nayar, ‘Visual Learning and Recognition of 3-D Objects from Appearance’, International Journal of Computer Vision, 14, pages 5–24, (1995)

    Google Scholar 

  23. Adnan A. Y. Mustafa, Linda G. Shapiro and Mark A. Ganter, ‘3D Object Recognition from Color Intensity Images’, Proc. ICPR’96, pages 627–631, (1996).

    Google Scholar 

  24. Kenji Nagao, ‘Recognizing 3D Objects Using Photogrametric Invariant’, Proceedings of 5th International Conference on Computer Vision, ICCV-95, pages 480–487, (1995).

    Google Scholar 

  25. Shree K. Nayar, Sameer A. Nene and Hiroshi Murase, ‘Real-Time 100 Object Recognition System’, Proc. 1996 IEEE Conference on Robotics and Automation, Minneapolis, pages 2321–2325, (April 1996).

    Google Scholar 

  26. Sameer A. Nene and Shree K. Nayar, ‘A Simple Algorithm for Nearest Neighbor Search in High Dimensions’, IEEE Transactions on PAMI, Vol. 19 No 9, pages 989–1003, (Sept, 1997).

    Google Scholar 

  27. Michael J. Swain and Dana H. Ballard, ‘Color Indexing’, International Journal of Computer Vision, 7:1 pages 11–32, (1991).

    Google Scholar 

  28. Pelillo M., ‘Relaxation labeling Networks that solve the maximum clique problem’, Fourth international conference on artificial neural networks, pages 166–70, published by IEE (June 1995).

    Google Scholar 

  29. Tushar Saxena, Peter Tu and Richard Hartley, ‘Recognizing objects in cluttered images using subgraph isomorphism’, to appear in Proceedings of the IU Work-shop, Monterey, (1998).

    Google Scholar 

  30. David Slater and Glenn Healey, ‘Combining Color and Geometric Information for the Illumination Invariant Recognition of 3D Objects’, Proceedings of 5th International Conference on Computer Vision, ICCV-95, pages 563–568, (1995).

    Google Scholar 

  31. David Slater and Glenn Healey, ‘Exploiting an Atmospheric Model for Automated Invariant Material Identification in Hyperspectral Imagery’, Preprint report: to appear (Darpa IU Workshop, Monterey, (1998) ?).

    Google Scholar 

  32. A. Zisserman, D. Forsyth, J. Mundy, C. Rothwell, J. Liu, N. Pillow, ‘3D Object Recognition Using Invariance’, Artificial Intelligence Journal, 78, pages 239–288, (1995).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Tu, P., Hartley, R., Saxena, T. (1999). Recognizing Objects Using Color-Annotated Adjacency Graphs. In: Shape, Contour and Grouping in Computer Vision. Lecture Notes in Computer Science, vol 1681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46805-6_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-46805-6_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66722-3

  • Online ISBN: 978-3-540-46805-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics