Skip to main content

Plane Sweeping

  • Reference work entry
  • First Online:
Computer Vision
  • 224 Accesses

Related Concepts

Multi-baseline Stereo

Definition

Plane sweeping is a multi-view stereo algorithm notable for its efficiency, especially on modern graphics hardware (GPU).

Background

Plane sweeping addresses the stereo problem, which is to find the surface of a scene, given two or more calibrated views of the scene. Assuming that surfaces are Lambertian and that there are no occlusions, a point on the surface will have the same appearance in all views. Therefore, a conceptual solution to the stereo problem is to find the points that maximize photoconsistency. This can be done by searching along the viewing rays for some image. The distance to the surface along the ray is called depth, and the set of all depths is called a depth map. Plane sweeping is a technique for efficiently organizing this search by sweeping a plane through space. Projecting all points on a plane into a perspective camera is simply a homography transformation, which can be executed efficiently on modern graphics...

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 649.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 899.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

References

  1. Gallup D, Frahm J-M, Mordohai P, Qingxiong Y, Pollefeys M (2007) Real-time plane-sweeping stereo with multiple sweeping directions. In: Computer vision and pattern recognition (CVPR). IEEE, Piscataway, Minneapolis, Minnesota

    Google Scholar 

  2. Gallup D, Frahm J-M, Mordohai P, Pollefeys M (2008) Variable baseline/resolution stereo. In: Computer vision and pattern recognition (CVPR). IEEE, Piscataway, Anchorage, Alaska

    Google Scholar 

  3. Kanade T, Okutomi M (1994) A stereo matching algorithm with an adaptive window: theory and experiment. In: Pattern analysis and machine intelligence (PAMI), IEEE transaction; IEEE Trans Pattern analysis and machine intelligence, 16(9):920-932

    Google Scholar 

  4. Kang SB, Szeliski R, Chai J (2001) Handling occlusions in dense multi-view stereo. In: Computer vision and pattern recognition (CVPR). IEEE Computer Society, Los Alamitos, Kauai, Hawaii, pp I:103–110

    Google Scholar 

  5. Pollefeys M, Nistâer D, Frahm J-M, Akbarzadeh A, Mordohai P, Clipp B, Engels C, Gallup D, Kim S-J, Merrell P, Salmi C, Sinha S, Talton B, Wang L, Yang Q, Stewâenius H, Yang R, Welch G, Towles H (2008) Detailed real-time urban 3d reconstruction from video. Int J Comput Vis 78: 143–167

    Article  Google Scholar 

  6. Scharstein D, Szeliski R (2002) A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int J Comput Vis 47:7–42

    Article  MATH  Google Scholar 

  7. Yang R, Pollefeys M (2002) Real-time consensus-based scene reconstruction using commodity graphics hardware. In: Pacific graphics. Academic, San Diego

    Google Scholar 

  8. Yang R, Pollefeys M (2003) Multi-resolution real-time stereo on commodity graphics hardware. In: International conferences on computer vision and pattern recognition (CVPR), Madison, Wisconsin, pp I:211–217

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Gallup, D., Pollefeys, M. (2014). Plane Sweeping. In: Ikeuchi, K. (eds) Computer Vision. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-31439-6_205

Download citation

Publish with us

Policies and ethics