[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Improved stripe matching for colour encoded structured light

  • 3-D Vision
  • Conference paper
  • First Online:
Computer Analysis of Images and Patterns (CAIP 1993)

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

Included in the following conference series:

Abstract

The identification of stripes in colour-encoded structured light images has previously been implemented only on a raster scan basis, recursively picking a raster and identifying intersecting stripes until all are identified. This technique is inadequate since sub-sequences of stripes may not all intersect a given stripe, and the first line chosen may give incorrect matching information on which subsequent matches will be based. In this paper we present a new technique which uses a directed acyclic graph to represent stripe ordering, then cost-matches the graph consistently. The theory and advantages of the technique are explained, and details of implementation are given.

This work was funded by the SERC under research grant No. GR/G21155.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Boyer, K. and Kak, A., “Colour-encoded structured light for rapid active ranging.,” Pattern Analysis and Machine Intelligence, vol. 9, pp. 14–28, January 1987.

    Google Scholar 

  2. Monks, T.P., “Video-rate 3d digitisation using colour encoded structured light. ” University of Southampton, Department of Electronics and Computer Science, Southampton SO9 5NH, UK., November 1992.

    Google Scholar 

  3. Monks, T.P., Carter, J.N. and Shadle,C.H., “A real-time 3d digitisation system for speech research,” in SPIE Biomedical Applications of Image Processing III 1992, San Jose, USA., vol. 1660, 1992.

    Google Scholar 

  4. Monks, T.P., Carter, J.N. and Shadle,C.H., “Colour-encoded structured light for real-time 3d digitisation,” in IEE 4th International Conference on Image Processing; Maastricht, The Neterlands; 7–9 April 1992., 1992.

    Google Scholar 

  5. Swamy, M.N.S., Graphs, Networks and Algorithms. John Wiley and Sons., 1981.

    Google Scholar 

  6. Levenshtein, V.I., “Binary codes capable of correcting deletions, insertions and reversals,” in Cybernetics and Control Theory, vol. 10, pp. 707–710, 1966.

    Google Scholar 

  7. Sankoff, D. and Kruskal, J.B., ed., Time warps, string edits, and macromolecules: the theory and practice of sequence comparison. Addison-Wesley, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dmitry Chetverikov Walter G. Kropatsch

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monks, T.P., Carter, J.N. (1993). Improved stripe matching for colour encoded structured light. In: Chetverikov, D., Kropatsch, W.G. (eds) Computer Analysis of Images and Patterns. CAIP 1993. Lecture Notes in Computer Science, vol 719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57233-3_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-57233-3_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57233-6

  • Online ISBN: 978-3-540-47980-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics