A stereo matching device used in a stereoscopic display system for determining a concave block and a convex block is provided. The stereo matching device comprises a receiving module for receiving a first and a second view-angle frames, a computation module, a feature extraction module and an estimation module. The computation module generates a disparity map having disparity entries respectively corresponding to blocks of the first view-angle frame. The feature extraction module generates feature maps each having feature entries respectively corresponding to the blocks. The estimation module comprises a reliability computation unit for computing a feature reliability of each of the blocks based on the feature maps and a comparator unit for filtering out unqualified blocks according to at least one reliability threshold to generate a plurality of candidate blocks and further determining the concave block and the convex block.

Patent
   8989481
Priority
Feb 13 2012
Filed
Feb 13 2012
Issued
Mar 24 2015
Expiry
May 16 2032
Extension
93 days
Assg.orig
Entity
Large
1
34
currently ok
1. A stereo matching method used in a stereo matching device of a stereoscopic display system for determining a concave block and a convex block, wherein the stereo matching method comprises:
receiving a first view-angle frame and a second view-angle frame;
dividing the first view-angle frame into a plurality of blocks, wherein each of the blocks comprises a plurality of pixels;
generating a disparity map having a plurality of disparity entries respectively corresponding to the plurality of the blocks according to the first view-angle frame and the second view-angle frame;
performing a feature extraction process on each of the blocks to generate a plurality of feature maps, wherein each of the feature maps has a plurality of feature entries respectively corresponding to the blocks;
computing a feature reliability of each of the blocks based on the plurality of the feature maps, wherein the feature reliability is a sum of the feature entries of the feature maps;
filtering out a plurality of unqualified blocks according to a comparison result between the feature reliability of each of the blocks and at least one reliability threshold to generate a plurality of candidate blocks; and
determining the concave block and the convex block according to a maximum disparity entry and a minimum disparity entry the candidate blocks, wherein the concave block corresponds to the maximum disparity entry of the disparity map and the convex block corresponds to the minimum disparity entry of the disparity map.
2. The stereo matching method of claim 1, wherein the step of performing the feature extraction process further comprises:
generating a color segment map having a plurality of color feature entries; and
generating an edge map having a plurality of edge feature entries.
3. The stereo matching method of claim 2, wherein the step of performing the feature extraction process further comprises:
generating an attention map having a plurality of attention feature entries.
4. The stereo matching method of claim 2, wherein step of computing the feature reliability further comprises:
generating a similarity reliability map according to the color segment map and the disparity map, wherein the disparity similarity reliability map has a plurality of similarity reliability entries each corresponding to a similarity strength of each of the blocks;
generating an edge reliability map according to the edge map, wherein the edge reliability map has a plurality of edge reliability entries each corresponding to an edge strength of each of the blocks;
generating a matching-cost reliability map according to the minimal sum of absolute difference of each of the blocks, wherein the matching-cost reliability map has a plurality of matching-cost reliability entries each corresponding to a matching-cost strength of each of the blocks; and
generating the feature reliability of each of the blocks by summing the plurality of similarity reliability entries, the plurality of edge reliability entries and the plurality of matching-cost reliability entries of each of the blocks.
5. The stereo matching method of claim 4, wherein step of computing the feature reliability further comprises:
generating an attention reliability map according to the attention map, wherein the attention map has a plurality of attention reliability entries each corresponding to an attention strength of each of the blocks, wherein the feature reliability of each of the blocks is generated by summing the plurality of similarity reliability entries, the plurality of edge reliability entries, the plurality of matching-cost reliability entries and the plurality of attention reliability entries of each of the blocks.
6. The stereo matching method of claim 1, wherein the step of generating the disparity map further comprises computing a minimal sum of absolute difference between each of the blocks of the first view-angle frame and each of a plurality of corresponding blocks of the second view-angle frame.
7. The stereo matching method of claim 1, wherein the step of receiving the first view-angle frame and the second view-angle frame further comprises performing a low pass filtering process and a down sampling process on the first view-angle frame and the second view-angle frame respectively.

1. Technical Field

The present disclosure relates to a display technology. More particularly, the present disclosure relates to a stereo matching device and a stereo matching method used in a stereoscopic display system for determining a concave block and a convex block.

2. Description of Related Art

Stereo matching of images is widely employed as one method of automatically generating three-dimensional data from stereo images. A stereo matching process is for finding matching points, at which the same position is picked up, from two images or so-called stereo images that are captured from different viewpoints, and calculating the depth to an object of interest or its shape according to the principle of triangulation by using the disparity between the matching points.

By using stereo matching, there are two important parameters to estimate, i.e. the concave and the convex. Some technologies use global search method to perform stereo matching process such as graph cut or belief propagation. However, the cost of these methods is extremely high in terms of run time or hardware complexity. Further, the reliability of these methods is not good enough as well.

Accordingly, it is desired to provided a stereo matching device and a stereo matching method used in a stereoscopic display system for determining the concave block and the convex block to overcome the above issues. The present disclosure addresses such a need.

An aspect of the present disclosure is to provide a stereo matching device used in a stereoscopic display system for determining a concave block and a convex block. The stereo matching device comprises a receiving module, a computation module, a feature extraction module and an estimation module. The receiving module receives a first view-angle frame and a second view-angle frame and divides the first view-angle frame into a plurality of blocks. The computation module generates a disparity map having a plurality of disparity entries respectively corresponding to the plurality of blocks according to the first view-angle frame and the second view-angle frame. The feature extraction module performs a feature extraction process on each of the blocks to generate a plurality of feature maps, wherein each of the feature maps has a plurality of feature entries respectively corresponding to the blocks. The estimation module comprises a reliability computation unit and a comparator unit. The reliability computation unit computes a feature reliability of each of the blocks based on the plurality of feature maps, wherein the feature reliability is a sum of the feature entries of the feature maps. The comparator unit filters out a plurality of unqualified blocks according to a comparison result between the feature reliability of each of the blocks and at least one reliability threshold to generate a plurality of candidate blocks and further determining the concave block and the convex block according to a maximum disparity entry and a minimum disparity entry of the candidate blocks.

Another aspect of the present disclosure is to provide a stereo matching method used in a stereo matching device of a stereoscopic display system for determining a concave block and a convex block. The stereo matching method comprises the steps outlined below. A first view-angle frame and a second view-angle frame are received. The first view-angle frame is divided into a plurality of blocks. A disparity map having a plurality of disparity entries respectively is generated corresponding to the plurality of the blocks according to the first view-angle frame and the second view-angle frame. A feature extraction process is performed on each of the blocks to generate a plurality of feature maps, wherein each of the feature maps has a plurality of feature entries respectively corresponding to the blocks. A feature reliability of each of the blocks is computed based on the plurality of the feature maps, wherein the feature reliability is a sum of the feature entries of the feature maps. A plurality of unqualified blocks are filtered out according to a comparison result between the feature reliability of each of the blocks and at least one reliability threshold to generate a plurality of candidate blocks. The concave block and the convex block are determined according to a maximum disparity entry and a minimum disparity entry the candidate blocks.

It is to be understood that both the foregoing general description and the following detailed description are by examples, and are intended to provide further explanation of the disclosure as claimed.

The disclosure can be more fully understood by reading the following detailed description of the embodiments, with reference made to the accompanying drawings as follows:

FIG. 1 is a block diagram of a stereo matching device for determining a concave block and a convex block in an embodiment of the present disclosure;

FIG. 2 is a detailed block diagram of a receiving module in an embodiment of the present disclosure;

FIG. 3 is a detailed block diagram of a computation module in an embodiment of the present disclosure;

FIG. 4 is a detailed block diagram of a feature extraction module in an embodiment of the present disclosure;

FIG. 5 is a detailed block diagram of a estimation module in an embodiment of the present disclosure; and

FIG. 6 is a flow chart of a stereo matching method in an embodiment of the present disclosure.

Reference will now be made in detail to the present embodiments of the disclosure, examples of which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers are used in the drawings and the description to refer to the same or like parts.

FIG. 1 is a block diagram of a stereo matching device 1 used in a stereoscopic display system (not shown) for determining a concave block and a convex block in an embodiment of the present disclosure. The stereo matching device 1 comprises a receiving module 10, a computation module 12, a feature extraction module 14 and an estimation module 16.

FIG. 2 is a detailed block diagram of the receiving module 10 in an embodiment of the present disclosure. The receiving module 10 receives a first view-angle frame 11 and a second view-angle frame 13. In an embodiment, one of the first view-angle frame 11 and the second view-angle frame 13 is a left view-angle frame and the other is a right view-angle frame, in which the left view-angle frame is for being perceived by the left eye of an observer and the right view-angle frame is for being perceived by the right eye of the observer. In the present embodiment, the receiving module 10 comprises low pass filters 20 and a down sampler 22 to perform a low pass filtering process and a down sampling process on the first view-angle frame 11 and the second view-angle frame 13 respectively. The receiving module 10 further divides the first view-angle frame 11 (or the second view-angle frame 13) into a plurality of blocks. In an embodiment, each of the blocks has the same size and comprises a plurality of pixels. For example, the first view-angle frame 11 can be divided into the blocks each having a size of 5 pixels×5 pixels. In other embodiments, the first view-angle frame 11 can be divided in the blocks having different sizes as well. In other embodiment, the receiving module 10 may further divides the first view-angle frame 11 into a plurality of objects by a segmentation method which segment each object in the first view-angle frame 11 according to color or edge information in the first view-angle frame 11.

The computation module 12 generates a disparity map having a plurality of disparity entries respectively corresponding to the plurality of blocks (or objects) according to the first view-angle frame 11 and the second view-angle frame 13. FIG. 3 is a detailed block diagram of the computation module 12 in an embodiment of the present disclosure. The computation module 12 comprises a matching cost computation unit 30, a disparity computation unit 32 and a disparity refining unit 34. In an embodiment, the computation module 12 computes a minimal sum of absolute difference (SAD), named matching-cost hereafter, between each of the blocks of the first view-angle frame 11 and each of a plurality of corresponding blocks of the second view-angle frame 13 by the matching cost computation unit 30 first. The SAD computation technique is one of the simplest of the similarity measures that is calculated by subtracting pixels within a square neighborhood between the reference image (the first view-angle frame 11) and the target image (the second view-angle frame 13) followed by the aggregation of absolute differences within the square window.

Further, the disparity computation unit 32 selects the minimum of the SAD. The minimum of SAD can be used to find the matched block (or object). If the left and right images exactly match, the resultant will be zero. The disparity refining unit 34 provides a further refining mechanism to generate the disparity map, in which the refining mechanism can be implemented with various conventional methods. Accordingly, the depth information of the images can be derived from the computation of the disparity map.

FIG. 4 is a detailed block diagram of the feature extraction module 14 in an embodiment of the present disclosure. The feature extraction module 14 receives the blocks of the first view-angle frame 11 divided by the receiving module 10 and performs a feature extraction process on each of the blocks to generate a plurality of feature maps, wherein each of the feature maps has a plurality of feature entries respectively corresponding to the blocks. In the present embodiment, the feature extraction module 14 comprises a hue-based color segment unit 40, an edge detection unit 42 and a position analysis unit 44. The hue-based color segment unit 40 generates a color segment map having a plurality of color feature entries. In more detail, the hue-based color segment unit 40 classifies each pixel in the block by hue information and groups the pixels having similar hue. The number of groups indicates how many objects are in the block. The value of color feature entry relates to the number of groups in the block. The edge detection unit 42 generates an edge map having a plurality of edge feature entries, wherein the value of each edge feature entry relates to the number of edge pixels in the corresponding block. The edge pixels may be determined by a high pass filter (HPF). The term “edge pixel” is the pixel on edge. The position analysis unit 44 generates an attention map having a plurality of attention feature entries. The position analysis unit 44 may be omitted in another embodiment. The value of color, edge and attention feature entries indicates strength of color, edge and attention feature.

In an embodiment, when the value in one of the color feature entries is higher, the possibility of having different objects in the corresponding block is higher. The disparity entry of the corresponding block is more reliable, if the color feature entry is higher. When the value in one of the edge feature entries is higher, the number of edges in the corresponding block is greater. The disparity entry of the corresponding block is more reliable, if the edge feature entry is higher. And when the value in one of the attention feature entries is higher, the position of the corresponding block makes it easier to be perceived by human. For example, the blocks in the middle part of the image tend to have higher values since they are easier to be perceived by human than the blocks on the edges of the image.

It is noted that there are merely three types of features in the above embodiment. In other embodiments, other kinds of features may be taken into consideration as well.

FIG. 5 is a detailed block diagram of the estimation module 16 in an embodiment of the present disclosure. In the present embodiment, the estimation module 16 comprises a reliability computation unit 50 and a comparator unit 52, in which the reliability computation unit 50 comprises a disparity similarity reliability computation unit 500, an edge reliability computation unit 502, an attention reliability computation unit 504, a matching-cost reliability computation unit 506 and a reliability summing unit 508. The disparity similarity reliability computation unit 500, the edge reliability computation unit 502, the attention reliability computation unit 504, the matching-cost reliability computation unit 506 convert the color segment map, edge map, attention map and the matching-costs of the blocks into corresponding reliability maps respectively.

The disparity similarity reliability computation unit 500 generates a similarity reliability map according to the color segment map from the hue-based color segment unit 40 depicted in FIG. 4 and the disparity map from the computation module 12 depicted in FIG. 1. The disparity similarity reliability computation unit 500 compares the disparity entry of one specific block and the disparity entries of the blocks neighboring to the specific block when the color of these blocks are about the same (or in the same predetermined color range) to verify reliability of the disparity entries and further normalize the disparity entries. The similarity reliability map thus has a plurality of similarity reliability entries respectively corresponding to the color feature entries of color segment map. When the disparity entry of the specific block and the disparity entries of the blocks neighboring to the specific block having the same color are similar, the similarity reliability entry of the specific block is higher.

The edge reliability computation unit 502 generates an edge reliability map according to the edge map from the edge detection unit 42 depicted in FIG. 4, wherein the edge reliability map has a plurality of edge reliability entries respectively corresponding to the edge feature entries of edge map. In more detail, the edge reliability entries are proportional to the edge feature entries. For example, the edge reliability entries are generated by normalizing the edge feature entries to 0˜2.

The attention reliability computation unit 504 generates an attention reliability map by normalizing the attention map from the position analysis unit 44 depicted in FIG. 4, wherein the attention map has a plurality of attention reliability entries respectively corresponding to the blocks.

The matching-cost reliability computation unit 506 generates a matching-cost reliability map according to the matching-costs of the blocks (i.e., the minimal sum of absolute difference of each of the blocks derived from the disparity computation unit 32 of the computation module 12 depicted in FIG. 1), wherein the matching-cost reliability map has a plurality of matching-cost reliability entries respectively corresponding to the blocks.

Hence, the reliability summing unit 508 is able to compute a reliability map comprising a feature reliability of each of the blocks based on the plurality of feature maps. In other words, the feature reliability of each of the blocks is the sum of the similarity reliability entry, the edge reliability entry, the attention reliability entry and the matching-cost reliability entry of each of the blocks.

The comparator unit 52 receives the reliability map and filters out a plurality of unqualified blocks according to a comparison result between the feature reliability of each of the blocks and at least one reliability threshold to generate a plurality of candidate blocks. When the feature reliability of a specific block is not high enough, the specific block is discarded since the chance that it is the true concave block or the true convex block is relatively low.

Accordingly, the comparator unit 52 further determines the disparity entries of the candidate blocks by referring to the disparity map, and then determines the concave block and the convex block according to a maximum disparity entry and a minimum disparity entry of the candidate blocks. In an embodiment, the concave block corresponds to the maximum disparity entry of the disparity map and the convex block corresponds to the minimum disparity entry of the disparity map.

The stereo matching device 1 in the present disclosure is a reliability-based scheme that is able to detect true concave or convex without using high complexity stereo matching. By extracting the feature information of the blocks, the features of the blocks can be computed easily, in which the cost of the feature-extraction is low. The feature reliability of the blocks can be further derived from the feature strength to select the candidate blocks that have higher feature reliability. Accordingly, the convex and the convex blocks can be selected from the candidate blocks quickly.

FIG. 6 is a flow chart of a stereo matching method 600 in an embodiment of the present disclosure. The stereo matching method 600 can be used in the stereo matching device 1 depicted in FIG. 1. The stereo matching method 600 comprises the steps outlined below (The steps are not recited in the sequence in which the steps are performed. That is, unless the sequence of the steps is expressly indicated, the sequence of the steps is interchangeable, and all or part of the steps may be simultaneously, partially simultaneously, or sequentially performed).

In step 601, the receiving module 10 receives a first view-angle frame 11 and a second view-angle frame 13. The receiving module further divides the first view-angle frame 11 into a plurality of blocks in step 602. In step 603, the computation module 12 generates a disparity map having a plurality of disparity entries respectively corresponding to the plurality of the blocks according to the first view-angle frame 11 and the second view-angle frame 13.

In step 604, the feature extraction module 14 performs a feature extraction process on each of the blocks to generate a plurality of feature maps, wherein each of the feature maps has a plurality of feature entries respectively corresponding to the blocks.

In step 605, the reliability computation unit 50 of the estimation module 16 computes a feature reliability of each of the blocks based on the plurality of the feature maps, wherein the feature reliability is a sum of the feature strength of the features of each of the blocks.

In step 606, the comparator unit 52 of the estimation module 16 filters out a plurality of unqualified blocks according to a comparison result between the feature reliability of each of the blocks and at least one reliability threshold to generate a plurality of candidate blocks. The concave block and the convex block are further determined by the comparator unit 52 according to a maximum disparity entry and a minimum disparity entry of the candidate blocks in step 607. The disparity entry of the candidate blocks may be determined by referring to the disparity map generated in step 603.

It will be apparent to those skilled in the art that various modifications and variations can be made to the structure of the present disclosure without departing from the scope or spirit of the disclosure. In view of the foregoing, it is intended that the present disclosure cover modifications and variations of this disclosure provided they fall within the scope of the following claims.

Hsu, Hung-Min

Patent Priority Assignee Title
9747690, Feb 03 2014 Sony Corporation Image processing device, image processing method, and program
Patent Priority Assignee Title
5179441, Dec 18 1991 The United States of America as represented by the Administrator of the; CALIFORNIA INSTITUTE OF TECHNOLOGY, THE A CORPORATION OF CA; UNITED STATES OF AMERICA, THE, AS REPRESENTED BY THE DIRECTOR OF THE NATIONAL AERONAUTICS SPACE ADMINISTRATION NASA Near real-time stereo vision system
5202928, Sep 09 1988 KAZO IIZUKA, DIRECTOR-GENERAL OF AGENCY OF INDUSTRIAL SCIENCE AND TECHNOLOGY, A CORPORATION OF JAPAN; SANYO ELECTRIC CO , LTD , A CORPORATION OF JAPAN Surface generation method from boundaries of stereo images
5487116, May 25 1993 Matsushita Electric Industrial Co., Ltd. Vehicle recognition apparatus
6011863, Jun 12 1997 NEC Laboratories America, Inc Cylindrical rectification to minimize epipolar distortion
7092015, Sep 22 1999 Subaru Corporation Apparatus and method for stereo matching and method of calculating an infinite distance corresponding point
7227526, Jul 24 2000 Qualcomm Incorporated Video-based image control system
7272256, May 04 2000 Microsoft Technology Licensing, LLC System and method for progressive stereo matching of digital images
8120648, Dec 29 2006 QUANTA COMPUTER INC. Method for displaying stereoscopic image
20030204384,
20030231792,
20040228521,
20050063582,
20060029272,
20080219505,
20090109127,
20100195898,
20100220920,
20100328427,
20110025827,
20110158528,
20110311147,
20120026295,
20120033051,
20120045119,
20120063669,
20120084652,
20120224032,
20120249750,
20120314937,
20130095920,
TW201112161,
TW278225,
TW331872,
TW357987,
//
Executed onAssignorAssigneeConveyanceFrameReelDoc
Jan 12 2012HSU, HUNG-MINHimax Technologies LimitedASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0276920657 pdf
Feb 13 2012Himax Technologies Limited(assignment on the face of the patent)
Date Maintenance Fee Events
Sep 03 2018M1551: Payment of Maintenance Fee, 4th Year, Large Entity.
Aug 31 2022M1552: Payment of Maintenance Fee, 8th Year, Large Entity.


Date Maintenance Schedule
Mar 24 20184 years fee payment window open
Sep 24 20186 months grace period start (w surcharge)
Mar 24 2019patent expiry (for year 4)
Mar 24 20212 years to revive unintentionally abandoned end. (for year 4)
Mar 24 20228 years fee payment window open
Sep 24 20226 months grace period start (w surcharge)
Mar 24 2023patent expiry (for year 8)
Mar 24 20252 years to revive unintentionally abandoned end. (for year 8)
Mar 24 202612 years fee payment window open
Sep 24 20266 months grace period start (w surcharge)
Mar 24 2027patent expiry (for year 12)
Mar 24 20292 years to revive unintentionally abandoned end. (for year 12)