# Patent

## Title
System and method for depth extraction of images with forward and backward depth prediction

## Abstract

A system and method for spatiotemporal depth extraction of images with forward and backward depth prediction are provided. The system and method of the present disclosure provide for acquiring a plurality of frames, generating a first depth map of a current frame in the plurality of frames based on a depth map of a previous frame in the plurality of frames, generating a second depth map of the current frame in the plurality of frames based on a depth map of a subsequent frame in the plurality of frames, and processing the first depth map and the second depth map to produce a third depth map for the current frame.

## Background
This application claims the benefit under 35 U.S.C. §365 of International Application PCT/US2008/006770, filed May 28, 2008, which was published in accordance with PCT article 21(2) on Dec. 3, 2009.
TECHNICAL FIELD OF THE INVENTION
The present disclosure generally relates to computer graphics processing and display systems, and more particularly, to a system and method for depth extraction of images with forward and backward depth prediction.
BACKGROUND OF THE INVENTION
Stereoscopic imaging is the process of visually combining at least two images of a scene, taken from slightly different viewpoints, to produce the illusion of three-dimensional (“3D”) depth. This technique relies on the fact that human eyes are spaced some distance apart and do not, therefore, view exactly the same scene. By providing each eye with an image from a different perspective, the viewer's eyes are tricked into perceiving depth. Typically, where two distinct perspectives are provided, the component images are referred to as the “left” and “right” images, also know as a reference image and complementary image, respectively. However, those skilled in the art will recognize that more than two viewpoints may be combined to form a stereoscopic image.
In 3D post-production, visual effects (“VFX”) workflow and 3D display applications, an important process is to infer a depth map from stereoscopic images consisting of left eye view and right eye view images. For instance, recently commercialized autostereoscopic 3D displays require an image-plus-depth-map input format, so that the display can generate different 3D views to support multiple viewing angles.
The process of infering the depth map from a stereo image pair is called stereo matching in the field of computer vision research since pixel or block matching is used to find the corresponding points in the left eye and right eye view images. More recently, the process of inferring a depth map is also known as depth extraction in the 3D display community. Depth values are infered from the relative distance between two pixels in the images that correspond to the same point in the scene.
Stereo matching of digital images is widely used in many computer vision applications (such as, for example, fast object modeling and prototyping for computer-aided drafting (CAD), object segmentation and detection for human-computer interaction (HCI), video compression, and visual surveillance) to provide three-dimensional (3-D) depth information. Stereo matching obtains images of a scene from two or more cameras positioned at different locations and orientations in the scene. These digital images are obtained from each camera at approximately the same time and points and each of the images are matched corresponding to a 3-D point in space. In general, points from different images are matched by searching a portion of the images and using constraints (such as an epipolar constraint) to correlate a point in one image to a point in another image.
There has been substantial work on depth map extraction. Most of the work on depth extraction focuses on single stereoscopic image pairs rather than videos. However, videos instead of images are the dominant media in the consumer electronics world. For videos, a sequence of stereoscopic image pairs are employed rather than single image pairs. In conventional technology, a static depth extraction algorithm is applied to each frame pair. In most cases, the qualities of the output depth maps are sufficient for 3D playback. However, for frames with a large amount of texture, temporal jittering artifacts can be seen because the depth maps are not exactly aligned in the time direction, i.e., over a period of time for a sequence of image pairs.
Therefore, a need exists for techniques to stabilize the depth map extraction process along the time direction to reduce the temporal jittering artifacts.
SUMMARY
According to one aspect of the present disclosure, a system and method for spatiotemporal depth extraction of images with forward and backward depth prediction are provided. The system and method of the present disclosure provide for acquiring a number of frames, generating a first depth map of a current frame in the number of frames based on a depth map of a previous frame in the number of frames, generating a second depth map of the current frame in the number of frames based on a depth map of a subsequent frame in the number of frames, and processing the first depth map and the second depth map to produce a third depth map for the current frame.



BRIEF DESCRIPTION OF THE DRAWINGS
These, and other aspects, features and advantages of the present disclosure will be described or become apparent from the following detailed description of the preferred embodiments, which is to be read in connection with the accompanying drawings.
In the drawings, wherein like reference numerals denote similar elements throughout the views:
FIG. 1 is an exemplary illustration of a system for stereo matching at least two images according to an aspect of the present disclosure;
FIG. 2 is a flow diagram of an exemplary method for stereo matching at least two images according to an aspect of the present disclosure;
FIG. 3 illustrates the epipolar geometry between two images taken of a point of interest in a scene;
FIG. 4 illustrates the relationship between disparity and depth;
FIG. 5 is a flow diagram of an exemplary method for estimating disparity of at least two images according to an aspect of the present disclosure;
FIG. 6 is a flow diagram of an exemplary method of spatiotemporal depth extraction according to an aspect of the present disclosure;
FIG. 7 illustrates a forward and backward prediction process for enhancing depth maps a sequence of successive frames of stereoscopic images; and
FIG. 8 is a flow diagram of an exemplary method of generating a depth map according to an aspect of the present disclosure.



It should be understood that the drawing(s) is for purposes of illustrating the concepts of the disclosure and is not necessarily the only possible configuration for illustrating the disclosure.
DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
It should be understood that the elements shown in the FIGS. may be implemented in various forms of hardware, software or combinations thereof. Preferably, these elements are implemented in a combination of hardware and software on one or more appropriately programmed general-purpose devices, which may include a processor, memory and input/output interfaces.
The present description illustrates the principles of the present disclosure. It will thus be appreciated that those skilled in the art will be able to devise various arrangements that, although not explicitly described or shown herein, embody the principles of the disclosure and are included within its spirit and scope.
All examples and conditional language recited herein are intended for pedagogical purposes to aid the reader in understanding the principles of the disclosure and the concepts contributed by the inventor to furthering the art, and are to be construed as being without limitation to such specifically recited examples and conditions.
Moreover, all statements herein reciting principles, aspects, and embodiments of the disclosure, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future, i.e., any elements developed that perform the same function, regardless of structure.
Thus, for example, it will be appreciated by those skilled in the art that the block diagrams presented herein represent conceptual views of illustrative circuitry embodying the principles of the disclosure. Similarly, it will be appreciated that any flow charts, flow diagrams, state transition diagrams, pseudocode, and the like represent various processes which may be substantially represented in computer readable media and so executed by a computer or processor, whether or not such computer or processor is explicitly shown.
The functions of the various elements shown in the figures may be provided through the use of dedicated hardware as well as hardware capable of executing software in association with appropriate software. When provided by a processor, the functions may be provided by a single dedicated processor, by a single shared processor, or by a plurality of individual processors, some of which may be shared. Moreover, explicit use of the term “processor” or “controller” should not be construed to refer exclusively to hardware capable of executing software, and may implicitly include, without limitation, digital signal processor (“DSP”) hardware, read only memory (“ROM”) for storing software, random access memory (“RAM”), and nonvolatile storage.
Other hardware, conventional and/or custom, may also be included. Similarly, any switches shown in the figures are conceptual only. Their function may be carried out through the operation of program logic, through dedicated logic, through the interaction of program control and dedicated logic, or even manually, the particular technique being selectable by the implementer as more specifically understood from the context.
In the claims hereof, any element expressed as a means for performing a specified function is intended to encompass any way of performing that function including, for example, a) a combination of circuit elements that performs that function or b) software in any form, including, therefore, firmware, microcode or the like, combined with appropriate circuitry for executing that software to perform the function. The disclosure as defined by such claims resides in the fact that the functionalities provided by the various recited means are combined and brought together in the manner which the claims call for. It is thus regarded that any means that can provide those functionalities are equivalent to those shown herein.
Stereo matching is a standard methodology for inferring a depth map from stereoscopic images, e.g., a left eye view image and right eye view image. 3D playback on conventional autostereoscopic displays has shown that the smoothness of the depth map significantly affects the look of the resulting 3D playback. Non-smooth depth maps often result in zig-zaging edges in 3D playback, which are visually worse than the playback of a smooth depth map with less accurate depth values. Therefore, the smoothness of depth map is more important than the depth accuracy for 3D display and playback applications. Furthermore, global optimization based approaches are necessary for depth estimation in 3D display applications. This disclosure presents a depth extraction technique that incorporates temporal information to improve the smoothness of the depth map. Many stereo techniques optimize a cost function that enforce spatial coherence and consistency with the data. For image sequences, a temporal component is important to improve the accuracy of the extracted depth map.
A system and method for spatiotemporal depth extraction of images with forward and backward depth prediction are provided. The system and method of the present disclosure provide a depth extraction technique that incorporates temporal information to improve the smoothness of the depth map. The techniques of the present disclosure incorporate a forward and backward pass, where a previous depth map of a frame of an image sequence is used to initialize the depth extraction at a current frame, which makes the computation faster and more accurate. The depth map or disparity map can then be utilized with a stereoscopic image pair for 3D playback. The techniques of the present disclosure are effective in solving the problem of temporal uttering artifacts of 3D playback in 2D+Depth display caused by the instability of depth maps.
Referring now to the Figures, exemplary system components according to an embodiment of the present disclosure are shown in FIG. 1. A scanning device 103 may be provided for scanning film prints 104, e.g., camera-original film negatives, into a digital format, e.g. Cineon-format or Society of Motion Picture and Television Engineers (“SMPTE”) Digital Picture Exchange (“DPX”) files. The scanning device 103 may comprise, e.g., a telecine or any device that will generate a video output from film such as, e.g., an Arri LocProTM with video output. Alternatively, files from the post production process or digital cinema 106 (e.g., files already in computer-readable form) can be used directly. Potential sources of computer-readable files are AVIDTM editors, DPX files, D5 tapes etc.
Scanned film prints are input to a post-processing device 102, e.g., a computer. The computer is implemented on any of the various known computer platforms having hardware such as one or more central processing units (CPU), memory 110 such as random access memory (RAM) and/or read only memory (ROM) and input/output (I/O) user interface(s) 112 such as a keyboard, cursor control device (e.g., a mouse or joystick) and display device. The computer platform also includes an operating system and micro instruction code. The various processes and functions described herein may either be part of the micro instruction code or part of a software application program (or a combination thereof) which is executed via the operating system. In one embodiment, the software application program is tangibly embodied on a program storage device, which may be uploaded to and executed by any suitable machine such as post-processing device 102. In addition, various other peripheral devices may be connected to the computer platform by various interfaces and bus structures, such a parallel port, serial port or universal serial bus (USB). Other peripheral devices may include additional storage devices 124 and a printer 128. The printer 128 may be employed for printing a revised version of the film 126, e.g., a stereoscopic version of the film, wherein a scene or a plurality of scenes may have been altered or replaced using 3D modeled objects as a result of the techniques described below.
Alternatively, files/film prints already in computer-readable form 106 (e.g., digital cinema, which for example, may be stored on external hard drive 124) may be directly input into the computer 102. Note that the term “film” used herein may refer to either film prints or digital cinema.
A software program includes a stereo matching module 114 stored in the memory 110 for matching at least one point in a first image with at least one corresponding point in a second image. The stereo matching module 114 further includes an image warper 116 configured to adjust the epipolar lines of the stereoscopic image pair so that the epipolar lines are exactly the horizontal scanlines of the images.
The stereo matching module 114 further includes a disparity estimator 118 configured for estimating the disparity of the at least one point in the first image with the at least one corresponding point in the second image and for generating a disparity map from the estimated disparity for each of the at least one point in the first image with the at least one corresponding point in the second image. The disparity estimator 118 includes a pixel matching cost function 132 configured to match pixels in the first and second images, a smoothness cost function 134 to apply a smoothness constraint to the disparity estimation and a temporal cost function 136 configured to align a sequence of generated disparity maps over time. The disparity estimator 118 further includes a belief propagation algorithm or function 138 for minimizing the estimated disparity and a dynamic programming algorithm or function 140 to initialize the belief propagation function 138 with a result of a deterministic matching function applied to the first and second image to speed up the belief propagation function 138.
The stereo matching module 114 further includes a depth map generator 120 for converting the disparity map into a depth map by inverting the disparity values of the disparity map.
FIG. 2 is a flow diagram of an exemplary method for stereo matching of at least two two-dimensional (2D) images according to an aspect of the present disclosure. Initially, the post-processing device 102 acquires at least two two-dimensional (2D) images, e.g., a stereo image pair with left and right eye views (step 202). The post-processing device 102 may acquire the at least two 2D images by obtaining the digital master image file in a computer-readable format. The digital video file may be acquired by capturing a temporal sequence of moving images with a digital camera. Alternatively, the video sequence may be captured by a conventional film-type camera. In this scenario, the film is scanned via scanning device 103.
It is to be appreciated that whether the film is scanned or already in digital format, the digital file of the film will include indications or information on locations of the frames, e.g., a frame number, time from start of the film, etc.
Stereoscopic images can be taken by two cameras with the same settings. Either the cameras are calibrated to have the same focal length, focal height and parallel focal plane; or the images have to be warped based on known camera parameters as if they were taken by the cameras with parallel focal planes (step 204). This warping process includes camera calibration (step 206) and camera rectification (step 208). The calibration and rectification process adjust the epipolar lines of the stereoscopic images so that the epipolar lines are exactly the horizontal scanlines of the images. Referring to FIG. 3, OL and OR represent the focal points of two cameras, P represents the point of interest in both cameras and pL and pR represent where point P is projected onto the image plane. The point of intersection on each focal plane is called the epipole (denoted by EL and ER). Right epipolar lines, e.g., ER-pR, are the projections on the right image of the rays connecting the focal center and the points on the left image, so the corresponding point on the right image to a pixel on the left image should be located at the epipolar line on the right image, likewise for the left epipolar lines, e.g., EL-pL. Since corresponding point finding happens along the epipolar lines, the rectification process simplifies the correspondence search to searching only along the scanlines, which greatly reduces the computational cost. Corresponding points are pixels in images that correspond to the same scene point.
Next, in step 210, the disparity map is estimated for every point in the scene. Once the corresponding points are found, the disparity for every scene point is calculated as the relative distance of the matched points in the left and right eye images. For example, referring to FIG. 4, if the horizontal coordinate of a point in the left eye image 402 is x, and the horizontal coordinate of its corresponding point in the right eye image 404 is x′, then the disparity d=x′−x. Then, in step 212, the disparity value d for a scene point 406 is converted into depth value z, the distance from the scene point 406 (also known as the convergence point) to the camera 408, 410, using the following formula: z=Bf/d, where B is the distance between the two cameras 408, 410, also called baseline, and f is the focal length of the camera, the proof of which is shown in FIG. 4.
With reference to FIG. 5, a method for estimating a disparity map, identified above as step 210, in accordance with the present disclosure is provided. Initially, a stereoscopic pair of images is acquired (step 502). A disparity cost function is computed including computing a pixel cost function (step 504), computing a smoothness cost function (step 506) and computing a temporal cost function (step 508). A low-cost stereo matching optimization, e.g., dynamic programming, is performed to get initial deterministic results of stereo matching the two images (step 510). The results of the low-cost optimization are then used to initialize a belief propagation function to speed up the belief propagation function for minimizing the disparity cost function for the first frame of a sequence (512). Predictive depth maps will then be used to initialize the belief propagation function for the subsequent frames of the sequence.
The disparity estimation and formulation thereof shown in FIG. 5 will now be described in more detail. Disparity estimation is an important step in the workflow described above. The problem consists of matching the pixels in left eye image and the right eye image, i.e., find the pixels in the right and left images that correspond to the same scene point. By considering that the disparity map is smooth, the stereo matching problem can be formulated mathematically as follows:

C(d(•))=Cp(d(•))+λCs(d(•))  (1)

where d(•) is the disparity field, d(x,y) gives the disparity value of the point in the left eye image with coordinate (x,y), C is the overall cost function, Cp is the pixel matching cost function, and Cs is the smoothness cost function. The smoothness cost function is a function used to enforce the smoothness of the disparity map. During the optimization process, the above cost functional is minimized with respect to all disparity fields. For local optimization, the smoothness term Cs is discarded; therefore, smoothness is not taken into account during the optimization process. Cp can be modeled, among other forms, as the mean square difference of the pixel intensities:





  
    
      
        
          
            C
            p
          
          ⁡
          
            (
            
              d
              ⁡
              
                (
                .
                )
              
            
            )
          
        
        =
        
          
            ∑
            
              x
              ,
              y
            
          
          ⁢
          
            
              
                [
                
                  
                    I
                    ⁡
                    
                      (
                      
                        x
                        ,
                        y
                      
                      )
                    
                  
                  -
                  
                    
                      I
                      ′
                    
                    ⁡
                    
                      (
                      
                        
                          x
                          -
                          
                            d
                            ⁡
                            
                              (
                              
                                x
                                ,
                                y
                              
                              )
                            
                          
                        
                        ,
                        y
                      
                      )
                    
                  
                
                ]
              
              2
            
            .
          
        
      
    
    
      
        (
        2
        )
      
    
  




The smoothness constraint can be written differently depending on whether vertical smoothness is enforced or not. If both horizontal and vertical smoothness constraints are enforced, then, the smoothness cost function can be modeled as the following mean square error function:





  
    
      
        
          
            C
            s
          
          ⁡
          
            (
            
              d
              ⁡
              
                (
                .
                )
              
            
            )
          
        
        =
        
          
            
              ∑
              
                x
                ,
                y
              
            
            ⁢
            
              
                [
                
                  
                    d
                    ⁡
                    
                      (
                      
                        x
                        ,
                        y
                      
                      )
                    
                  
                  -
                  
                    d
                    ⁡
                    
                      (
                      
                        
                          x
                          +
                          1
                        
                        ,
                        y
                      
                      )
                    
                  
                
                ]
              
              2
            
          
          +
          
            
              [
              
                
                  d
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
                -
                
                  d
                  ⁡
                  
                    (
                    
                      x
                      ,
                      
                        y
                        +
                        1
                      
                    
                    )
                  
                
              
              ]
            
            2
          
        
      
    
    
      
        (
        3
        )
      
    
  




Next, the temporal constraints are taken into account in the cost function as illustrated in FIG. 6. The previous depth map at (i−1)th frame is used to predict the current depth map at the ith frame, so that the estimation of the current depth map can be constrained by the previous depth map. In step 602, assume a depth map estimated at the (i−1)th frame from the (i−1)th left image 604 and the (i−1) right image 606 is represented as di−1(•). Predictive depth map d+(•) is used to predict the depth map at ith frame. The predictive depth map d+(•) is calculated by interpolating the depth map at (i−1)th frame to ith frame, in step 608. In one embodiment, a simple interpolation process is used, where the predictive depth map is equal to the depth map at (i−1)th frame, i.e. d+(•)=di−1(•), without considering motion information. Taking into account the predictive depth map, a temporal prediction term in the overall depth cost function can be constructed as the following:




  
    
      
        
          
            C
            t
          
          ⁡
          
            (
            
              d
              ⁡
              
                (
                .
                )
              
            
            )
          
        
        =
        
          
            ∑
            
              x
              ,
              y
            
          
          ⁢
          
            
              [
              
                
                  d
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
                -
                
                  
                    d
                    +
                  
                  ⁡
                  
                    (
                    
                      x
                      ,
                      y
                    
                    )
                  
                
              
              ]
            
            2
          
        
      
    
    
      
        (
        4
        )
      
    
  




In step 610, the cost function is calculated for the current frame from the two input images, i.e., the ith left image 612 and the ith right image 614. The cost function will be minimized to get the final depth map result, in step 616. In step 618, the predictive depth map (determined in step 608) is used to initialize the minimization process (minimization block 616) so as to speed up the computation (as shown in Eq.4).

Therefore, the overall cost function becomes

C(d(•))=Cp(d(•))+λCs(d(•))+μCt(d(•))  (5)

where μ is a weighting factor to weight the temporal predictive cost function in the overall cost function. μ can be determined empirically.

The drawback of the method described above is that when there is error at the first frame of the sequence, the error would be propagated to the rest of the frames until the end of the sequence. Furthermore, in experiments, it has been observed that the depth map at the last frame in the sequence is much smoother than the first depth map in the sequence. That is because the smoothing effect is accumulated along the frames during the optimization with temporal constraints.
To solve the above the described problem, a multi-pass forward and backward process is provided as illustrated in FIG. 7. The forward and backward process first performs the temporal prediction in a first pass 702 with forward direction, i.e. from the first frame in the sequence to the last frame, i.e., (N)th frame.
In the next pass 704, the temporal prediction starts from the last frame, and goes backward until the first frame, e.g., (N−1)th frame; (N−2)th frame, (N−3)th frame . . . 1st frame. The same procedure can be repeated to have multiple passes of forward and backward prediction.
In the forward and backward process, for the forward pass the predictive depth map is set as d+(•)=di−1(•), and for the backward pass the predictive depth map is set as d+(•)=di+1(•). The rest of the procedure and equation is the same as those described above.
The overall cost function, shown in Eq. 5, can be minimized using different methods to get the estimated depth map. In one embodiment, a belief propagation function is used to minimize the cost function of Eq. 5. Belief propagation is high quality optimization algorithm used in computer vision and machine learning. To speed up the belief propagation function or algorithm, a low-cost optimization algorithm, e.g., a dynamic programming function, is used to first get a low-quality depth map. Then, this low-quality depth map is used to initialize the belief propagation function or algorithm.
In a further embodiment, instead of using a low-quality depth map to initialize the belief propagation function, the predictive depth map d+(•) can be employed to initialize the belief propagation function. In this embodiment, for a sequence of images, the low-quality depth initialization is only used for the 1st image frame in the sequence. For the rest of the frames in the sequence, the predictive depth maps are used to initialize the belief propagation function or algorithm.
Referring back to FIG. 2, in step 212, the disparity value d for each scene point is converted into depth value z, the distance from the scene point to the camera, using the following formula: z=Bf/d, where B is the distance between the two cameras, also called baseline, and f is the focal length of the camera. The depth values for each at least one image, e.g., the left eye view image, are stored in a depth map. The corresponding image and associated depth map are stored, e.g., in storage device 124, and may be retrieved for 3D playback (step 214). Furthermore, all images of a motion picture or video clip can be stored with the associated depth maps in a single digital file 130 representing a stereoscopic version of the motion picture or clip. The digital file 130 may be stored in storage device 124 for later retrieval, e.g., to print a stereoscopic version of the original film.
Referring now to FIG. 8, an exemplary method for generating a depth map according to an aspect of the present disclosure is shown. Initially, at step 802, a plurality of frames is acquired. The plurality of acquired frames may represent a scene, shot or some other segment of a film. Each frame includes a right eye image and a left eye image (e.g., a stereoscopic image pair), a reference image and a complementary image, a plurality of images having different viewpoints, or the like. Next, at step 804, a frame (e.g., current frame) for which a depth map is to be generated is selected. Afterwards, at step 806, and in accordance with the processes discussed in FIGS. 6 and 7, a first depth map is generated for the selected frame. The first depth map generation includes estimating the first depth map based on a previous depth map or a plurality of previous depth maps by processing the plurality of acquired frames in a first direction (e.g., a forward direction going from the earliest frame to the latest frame). Next, at step 808, and in accordance with the processes discussed in FIGS. 6 and 7, a second depth map is generated for the selected frame. The second depth map generation includes estimating the second depth map based on a subsequent depth map or a plurality of subsequent depth maps by processing the plurality of acquired frames in a second direction (e.g., a backward direction going from the latest frame to the earliest frame). Finally, at step 810, the first and second depth maps are processed such that any error that propagated through the frames in one direction (e.g., either forwards and existing in the first depth map or backwards and existing in the second depth map) can be minimized or reduced using a corrective value generated by processing the frames in another direction (e.g., either backwards and existing in the second depth map or forwards and existing in the first depth map).
Although embodiments which incorporate the teachings of the present disclosure have been shown and described in detail herein, those skilled in the art can readily devise many other varied embodiments that still incorporate these teachings. Having described preferred embodiments for a system and method for spatiotemporal depth extraction of images with forward and backward depth prediction (which are intended to be illustrative and not limiting), it is noted that modifications and variations can be made by persons skilled in the art in light of the above teachings. It is therefore to be understood that changes may be made in the particular embodiments of the disclosure disclosed which are within the scope of the disclosure as outlined by the appended claims.

## Claims

1. In a computer, a method of matching at least two images, the method comprising:
acquiring a plurality of frames, each frame in the plurality of frames includes a first image and a second image;
generating a first depth map of a current frame in the plurality of frames based on a depth map of a previous frame in the plurality of frames;
generating a second depth map of the current frame in the plurality of frames based on a depth map of a subsequent frame in the plurality of frames; and
processing the first depth map and the second depth map to produce a third depth map for the current frame,
wherein generating first and second depth maps further include:
estimating a disparity of at least one point in the first image with at least one corresponding point in the second image, the step of estimating including performing a low-cost optimization function and computing a belief propagation function based on the results of the low-cost optimization function;
generating a disparity map based on the estimated disparity; and
converting the estimated disparity map into a depth map; and
wherein the first depth map contains an error based on the depth map of the previous frame and the second depth map contains a correction for reducing the error.

2. The method of claim 1, wherein the estimating the disparity includes computing a pixel matching cost function.

3. The method of claim 1, wherein the estimating the disparity includes computing a smoothness cost function.

4. The method of claim 1, wherein the estimating the disparity includes computing a temporal cost function.

5. The method of claim 1, wherein the first image is a left eye view and second image is a right eye view of a stereoscopic pair.

6. The method of claim 1, wherein the second depth map contains the correction for reducing the error due to a smoothing effect accumulated during processing of the plurality of frames.

7. A system for matching at least two images, the system comprising:
means for acquiring a plurality of frames, each frame in the plurality of frames includes a first image and a second image;
means for generating a first depth map of a current frame in the plurality of frames based on a depth map of a previous frame in the plurality of frames;
means for generating a second depth map of the current frame in the plurality of frames based on a depth map of a subsequent frame in the plurality of frames; and
means for processing the first depth map and the second depth map to produce a third depth map for the current frame,
wherein the means for generating the first depth map and means for generating the second depth map further include:
means for estimating a disparity of at least one point in the first image with at least one corresponding point in the second image, the means for estimating further including means for performing a low-cost optimization function and means for computing a belief propagation function based on the results of the low-cost optimization function;
means for generating a disparity map based on the estimated disparity; and
means for converting the estimated disparity map into a depth map; and
wherein the first depth map contains an error based on the depth map of the previous frame and the second depth map contains a correction for reducing the error.

8. The system of claim 7, wherein the means for estimating the disparity includes means for computing a pixel matching cost function.

9. The system of claim 7, wherein the means for estimating the disparity includes means for computing a smoothness cost function.

10. The system of claim 7, wherein the means for estimating the disparity includes computing a temporal cost function.

11. The system of claim 7, wherein the first image is a left eye view and second image is a right eye view of a stereoscopic pair.

12. The system of claim 7, wherein the first image is a left eye view and second image is a right eye view of a stereoscopic pair.

13. The system of claim 7, wherein the second depth map contains the correction for reducing the error due to a smoothing effect accumulated during processing of the plurality of frames.

14. An apparatus matching at least two images, the apparatus comprising:
a memory configured for storing data and instructions;
a processor configured to acquire a plurality of frames, each frame in the plurality of frames includes a first image and a second image; generate a first depth map of a current frame in the plurality of frames based on a depth map of a previous frame in the plurality of frames; generate a second depth map of the current frame in the plurality of frames based on a depth map of a subsequent frame in the plurality of frames; and process the first depth map and the second depth map to produce a third depth map for the current frame,
wherein generating first and second depth maps further include: estimating a disparity of at least one point in the first image with at least one corresponding point in the second image, the step of estimating including performing a low-cost optimization function and computing a belief propagation function based on the results of the low-cost optimization function; generating a disparity map based on the estimated disparity; and converting the estimated disparity map into a depth map; and wherein the first depth map contains an error based on the depth map of the previous frame and the second depth map contains a correction for reducing the error.

15. The apparatus of claim 14, wherein the processor if further configured to estimate the disparity by computing a pixel matching cost function.

16. The apparatus of claim 14, wherein the processor if further configured to estimate the disparity by computing a smoothness cost function.

17. The apparatus of claim 14, wherein the processor if further configured to estimate the disparity by computing a temporal cost function.

18. The apparatus of claim 14, wherein the second depth map contains the correction for reducing the error due to a smoothing effect accumulated during processing of the plurality of frames.