Announcements

24
Announcements Readings Seitz et al., A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms, CVPR 2006, pp. 519-526 > http://vision.middlebury.edu/mview/seitz_mview_cvpr06.pdf

description

Announcements. Readings Seitz et al., A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms, CVPR 2006, pp. 519-526 http://vision.middlebury.edu/mview/seitz_mview_cvpr06.pdf. Multi-view Stereo. Apple Maps. CMU’s 3D Room. Point Grey ’s ProFusion 25. Multi-view Stereo. - PowerPoint PPT Presentation

Transcript of Announcements

Page 1: Announcements

Announcements

Readings• Seitz et al., A Comparison and Evaluation of Multi-View Stereo Reconstruction

Algorithms, CVPR 2006, pp. 519-526> http://vision.middlebury.edu/mview/seitz_mview_cvpr06.pdf

Page 2: Announcements

Multi-view Stereo

Apple Maps

Page 3: Announcements

Multi-view Stereo

CMU’s 3D Room

Point Grey’s Bumblebee XB3

Point Grey’s ProFusion 25

Page 4: Announcements

Multi-view Stereo

Page 5: Announcements

Multi-view Stereo

Figure by Carlos Hernandez

Input: calibrated images from several viewpoints

Output: 3D object model

Page 6: Announcements

Fua Narayanan, Rander, KanadeSeitz, Dyer

1995 1997 1998Faugeras, Keriven

1998

Hernandez, Schmitt Pons, Keriven, Faugeras Furukawa, Ponce

2004 2005 2006Goesele et al.

2007

Page 7: Announcements

Stereo: basic idea

error

depth

Page 8: Announcements

width of a pixel

Choosing the stereo baseline

What’s the optimal baseline?• Too small: large depth error

• Too large: difficult search problem

Large BaselineLarge Baseline Small BaselineSmall Baseline

all of thesepoints projectto the same pair of pixels

Page 9: Announcements

The Effect of Baseline on Depth Estimation

Page 10: Announcements

z

width of a pixel

width of a pixel

z

pixel matching score

Page 11: Announcements
Page 12: Announcements

Multibaseline Stereo

Basic Approach• Choose a reference view

• Use your favorite stereo algorithm BUT> replace two-view SSD with SSSD over all baselines

Limitations• Only gives a depth map (not an “object model”)

• Won’t work for widely distributed views:

Page 13: Announcements

Some Solutions•Match only nearby photos

•Ignore SSD values > threshold

•Alternative to SSD

Problem: visibility

Page 14: Announcements

Merging Depth Maps

vrip [Curless and Levoy 1996]• compute weighted average of depth maps

set of depth maps(one per view)

merged surfacemesh

Page 15: Announcements

Merging depth maps

depth map 1 depth map 2 Union

Naïve combination (union) produces artifacts

Better solution: find “average” surface• Surface that minimizes sum (of squared) distances to the depth maps

Page 16: Announcements

Least squares solution

E( f ) di2

i1

N

∑ (x, f )∫ dx

Page 17: Announcements

VRIP [Curless & Levoy 1996]

depth map 1 depth map 2 combination

signeddistancefunction

isosurfaceextraction

Page 18: Announcements

Michael Goesele

16 images (ring)47 images (ring)

Merging Depth Maps: Temple Model

317 images(hemisphere)

input image ground truth model

Goesele, Curless, Seitz, 2006

Page 19: Announcements
Page 20: Announcements

Sparse output from the SfM system

From Sparse to Dense

Page 21: Announcements

From Sparse to Dense

Furukawa, Curless, Seitz, Szeliski, CVPR 2010

Page 22: Announcements

QuickTime™ and aH.264 decompressor

are needed to see this picture.

Page 23: Announcements

Venice Sparse Model

QuickTime™ and a decompressor

are needed to see this picture.

Page 24: Announcements

QuickTime™ and aGeneric MPEG-4 decompressorare needed to see this picture.