Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. On the Bandwidth of the Plenoptic Function
 
research article

On the Bandwidth of the Plenoptic Function

Do, Minh N.  
•
Marchand-Maillet, Davy
•
Vetterli, Martin  
2012
IEEE Transactions on Image Processing

The plenoptic function (POF) provides a powerful conceptual tool for describing a number of problems in image/video processing, vision, and graphics. For example, image based-rendering can be seen as sampling and interpolation of the POF. In such applications, it is important to characterize the bandwidth of the POF. We study a simple but representative model of the scene where bandlimited signals (e.g. texture images) are "painted" on smooth surfaces (e.g. of objects or walls). We show that in general the POF is not bandlimited unless the surfaces are flat. We then provide simple rules to estimate the essential bandwidth of the POF for this model. Our analysis reveals that, in addition to the maximum and minimum depths, the bandwidth of the POF also depend on the maximum surface slope and maximum frequency of painted signals. With a unifying formalism based on multidimensional signal processing, we can verify several key results in POF processing, such as induced filtering in space and depth correction interpolation, and quantify the necessary sampling rates.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

05978219.pdf

Access type

openaccess

Size

706.14 KB

Format

Adobe PDF

Checksum (MD5)

c8cb23bd4bac3e77e442d7f8dc717cac

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés