University of Cambridge > Talks.cam > Inference Group > Non-Rigid Photometric Stereo with Colored Lights

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Non-Rigid Photometric Stereo with Colored Lights

Download to your calendar using vCal

If you have a question about this talk, please contact David MacKay .

We present an algorithm and the associated capture methodology to acquire and track the detailed 3D shape, bends, and wrinkles of deforming surfaces. Moving 3D data has been difficult to obtain by methods that rely on known surface features, structured light, or silhouettes. Multispectral photometric stereo is an attractive alternative because it can recover a dense normal field from an un-textured surface. We show how to capture such data and register it over time to generate a single deforming surface.

Experiments were performed on video sequences of untextured cloth, filmed under spatially separated red, green, and blue light sources. Our first finding is that using zero-depth-silhouettes as the initial boundary condition already produces rather smoothly varying per-frame-reconstructions with high detail. Second, when these 3D reconstructions are augmented with 2D optical flow, one can register the first frame’s reconstruction to every subsequent frame.

This talk is part of the Inference Group series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on Saturdays: 7818.5 kWh The Alexandra Arms, Cambridge S2, Alison Richard Building, 7 West Road, Cambridge, CB3 9DT

Other talks

Title to be confirmed Loke CTR Annual Meeting 2026 - Epigenetics of embryogenesis and placentation Morning Tea and Coffee Argentina 2005 Christopher Cowie on the epistemology of assessing biosignature claims Title and abstract tba
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity