1. Field of the Invention
The present invention generally relates to 3D imaging, and more particularly to a system of stereo matching with an adaptive window size.
2. Description Of Related Art
3D imaging is a technique for creating, enhancing or recording the illusion of depth in an image by means of two offset images, i.e., a left image and a right image, which are combined, in the brain of a viewer to give the perception of 3D depth.
Stereo matching technique is a major concern in many applications such as stereo 3D adjustment, multi-view rendering and free view point system.
Moreover, in the conventional system of stereo matching, a matching window for performing the stereo matching generally has a fixed square window size. If the window size is set small, a noisy depth map may ordinarily be obtained. On the other hand, if the window size is set large, a depth map with blurred boundary may usually be obtained.
For the foregoing reasons, a need has arisen to propose a novel system of image stereo matching to overcome deficiencies of the conventional 3D system.
In view of the foregoing, it is an object of the embodiment of the present invention to provide a system of image stereo matching that has reduced circuit area and latency, and/or improved depth map by using adaptive window size.
According to one embodiment, a system of image stereo matching includes at least one stereo matching unit (SMU) and a backward tracer. Each SMU is operable to receive a first view and a second view of a view pair, according to which the SMU is configured to generate a first depth map for the first view. The backward tracer is operable to receive the first depth map, according to which a second depth map for the second view is derived.
As shown in
Referring back to
It is observed that sometimes not all pixels in the right image can find a matched depth value. As a result, some hole regions may exist in the derived right depth map. It is therefore according to another aspect of the embodiment that the system 200 may further include a compensation unit 23 configured to fill or mend at least one hole region in the right depth map, resulting in a compensated right depth map. In one exemplary embodiment, interpolation may be adopted to construct a depth value for the hole region (particularly a thin hole region) based on depth values of neighboring regions. For example, the depth values of the neighboring regions surrounding the hole region are averaged as the constructed depth value to fill the hole region. In another exemplary embodiment, extrapolation may be adopted to construct a depth value for the hole region (particularly a wide hole region) based on depth values of a neighboring region. For example, the depth value of the neighboring region may be used as the constructed depth value to fill the hole region.
The embodiment for the two-view application as discussed above may be adapted to a multi-view application as exemplified in
According to a further aspect of the embodiment, a size of the matching window as mentioned above may be adaptively or dynamically changed according to texture density of the left image.
In an example, a local histogram of an edge map obtained from the edge detector 51 is provided to the texture density unit 52, therefore resulting in a texture density. The resultant texture density is then compared with three density threshold values, e.g., a first density threshold, a second density threshold and a third density threshold, in an order from small to large. In a case that the texture density is larger than the first density threshold but less than the second density threshold, a large window size, e.g., a 7×7 window, is allocated. In a case that the texture density is larger than the second density threshold but less than the third density threshold, a medium window size, e.g., a 5×5 window, is allocated. In a case that the texture density is larger than the third density threshold, a small window size, e.g., a 3×3 window, is allocated. Generally speaking, the larger the resultant texture density is, a matching window with a smaller size is allocated. According to the allocated window size, image pixel values stored in an image buffer 53 bound by the allocated window size are forwarded to the SMU 21 (
According to a further aspect of the embodiment, in a case that the texture density is less than the first density threshold, indicating a smooth region around the matching window, the image pixel values originally stored in the image buffer 53, e.g., of the large window size, are regrouped in a line buffer 54. The image pixel values regrouped in the line buffer 54 (instead of the image buffer 53) are then forwarded to the SUM 21 for processing.
Although specific embodiments have been illustrated and described, it will be appreciated by those skilled in the art that various modifications may be made without departing from the scope of the present invention, which is intended to be limited solely by the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
8774512 | Yao et al. | Jul 2014 | B2 |
20090324059 | Boughorbel | Dec 2009 | A1 |
20100134496 | Bhaskaran et al. | Jun 2010 | A1 |
20110026809 | Jeong et al. | Feb 2011 | A1 |
20110210965 | Thorpe | Sep 2011 | A1 |
20110261050 | Smolic et al. | Oct 2011 | A1 |
20120237114 | Park et al. | Sep 2012 | A1 |
20130129194 | Gusis et al. | May 2013 | A1 |
20130155050 | Rastogi et al. | Jun 2013 | A1 |
20130170736 | Guo et al. | Jul 2013 | A1 |
20130222377 | Bruls et al. | Aug 2013 | A1 |
20140003704 | Liao et al. | Jan 2014 | A1 |
20140049612 | Ishii | Feb 2014 | A1 |
Number | Date | Country |
---|---|---|
WO2012059841 | May 2012 | WO |
Number | Date | Country | |
---|---|---|---|
20140177927 A1 | Jun 2014 | US |