SuperLectures.com

PROXIMAL SPLITTING METHODS FOR DEPTH ESTIMATION

Full Paper at IEEE Xplore

Stereoscopic and 3-D Coding

Presented by: Mireille El Gheche, Author(s): Mireille El Gheche, Jean-Christophe Pesquet, Université Paris-Est Marne la Vallée, France; Joumana Farah, Holy-Spirit University of Kaslik, Lebanon; Mounir Kaaniche, Béatrice Pesquet-Popescu, Télécom ParisTech, France

Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach has been proposed in order to generate a dense disparity field. In this paper, we address the same estimation problem and propose to solve it by using a more general convex optimization framework based on proximal methods. More precisely, unlike previous works where the criterion must satisfy some restrictive conditions in order to be able to solve numerically the minimization problem, this work offers a great flexibility in the choice of the involved criterion. Experimental results carried out on real stereo pairs demonstrate the good performance of the proposed parallel proximal algorithm.


  Speech Transcript

|

  Slides

Enlarge the slide | Show all slides in a pop-up window

0:00:16

  1. slide

0:02:05

  2. slide

0:02:56

  3. slide

0:05:12

  4. slide

0:06:34

  5. slide

0:07:34

  6. slide

0:09:34

  7. slide

0:10:18

  8. slide

0:10:52

  9. slide

0:12:05

 10. slide

0:13:09

 11. slide

0:15:04

 12. slide

0:16:09

 13. slide

0:18:21

 14. slide

0:18:31

    13. slide

0:19:11

    11. slide

0:20:09

     9. slide

  Comments

Please sign in to post your comment!

  Lecture Information

Recorded: 2011-05-25 10:50 - 11:10, Club A
Added: 14. 6. 2011 22:07
Number of views: 18
Video resolution: 1024x576 px, 512x288 px
Video length: 0:21:19
Audio track: MP3 [7.21 MB], 0:21:19