Peter N. Belhumeur

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Melissa L. Koudelka

> Home > Persons > Peter N. Belhumeur

Publications

2005
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/pami/RamamoorthiKB05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pami/RamamoorthiKB05
Ravi Ramamoorthi, Melissa L. Koudelka, Peter N. Belhumeur:
A Fourier Theory for Cast Shadows. IEEE Trans. Pattern Anal. Mach. Intell. 27(2): 288-295 (2005)
[c36]
- view
  authority control:
- export record
  dblp key:
  - conf/siggraph/EnriqueKBDNR05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/siggraph/EnriqueKBDNR05
Sebastian Enrique, Melissa L. Koudelka, Peter N. Belhumeur, Julie Dorsey, Shree K. Nayar, Ravi Ramamoorthi:
Time-varying textures: definition, acquisition, and synthesis. SIGGRAPH Sketches 2005: 130
2004
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/eccv/RamamoorthiKB04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eccv/RamamoorthiKB04
Ravi Ramamoorthi, Melissa L. Koudelka, Peter N. Belhumeur:
A Fourier Theory for Cast Shadows. ECCV (1) 2004: 146-162
2001
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/cvpr/KoudelkaBMK01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cvpr/KoudelkaBMK01
Melissa L. Koudelka, Peter N. Belhumeur, Sebastian Magda, David J. Kriegman:
Image-based Modeling and Rendering of Surfaces with Arbitrary BRDFs. CVPR (1) 2001: 568-575

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.