Method of estimating disparity for 3D object recognition

Abstract

There is provided a method of estimating disparity for 3D object recognition. The method includes obtaining a plurality of images having different resolutions for the stereo image, estimating a disparity map for a lowest-resolution level image, estimating a coarse disparity map for an upper resolution level image by using the disparity, obtaining a fine disparity map for the upper resolution level image by using the coarse disparity, and outputting the fine disparity map as a final disparity map for the stereo image if the upper resolution level image has a resolution of a highest level.

Description

CROSS-REFERENCE TO RELATED APPLICATION

This application claims the benefit of Korean Patent Application No. 10-2004-0055089, filed on Jul. 15, 2004, in the Korean Intellectual Property Office, the disclosure of which is incorporated herein in its entirety by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

Embodiments of the present invention relate to a method and apparatus for estimating a disparity for 3D object recognition, and more particularly, to a method of estimating a disparity for 3D object recognition from a stereo image picked up with two cameras separated from each other by a predetermined distance.

2. Description of the Related Art

Stereo matching is a process for extracting depth information from two images of the same scene picked up at different viewpoints. The depth information is calculated based on relative positions of the same object projected on the two images. In the stereo matching process, it is difficult to point out pixels representing the same object in the two images.

Positions of the corresponding pixels in the two images are related to a one-dimensional variation in the epi-polar line direction, that is, a disparity for the images. A disparity is estimated by locating a pixel of the one image relative to the corresponding pixel of the other image. The estimation of the disparity presents an energy minimization problem. In order to solve the energy minimization problem, there are proposed various algorithms including a graph cut algorithm.

In the graph cut algorithm, the estimation of the disparity begins with obtaining a disparity map f which minimizes an energy E(f) represented with Equation 1, E(f)=E_data(f)+E_smooth(f),  (1) where E_data(f) denotes a data energy obtained by measuring disagreement between the corresponding pixels of the stereo image, and E_smooth(f) denotes a smooth energy obtained by measuring smoothness of the disparity map.

In the graph cut algorithm, the data energy E_data(f) is calculated from a difference between pixel values (or intensities) corresponding to the same real object in the two images. The smooth energy E_smooth(f) is calculated by using Equation 2, $\begin{array}{cc}{E}_{\mathrm{smooth}}\left(f\right)=\sum _{\left\{p,q\right\}\mathrm{EN}}{V}_{p,q}\left(f_p,f_q\right)T\left(f\left(p\right)=f\left(q\right)\right)T\left(a\right)=\{\begin{array}{c}0a\mathrm{is}\mathrm{false}\\ 1a\mathrm{is}\mathrm{true}\end{array}{V}_{p,q}\left(f_p,f_q\right)=\{\begin{array}{cc}0& f_p=f_q\\ \lambda & \left(f_p\ne f_q\right)\&\left(I_L\left(p\right)-I_L\left(q\right)>5\right)\\ 2\lambda & \left(f_p\ne f_q\right)\&\left(I_L\left(p\right)-I_L\left(q\right)\le 5\right)\end{array},& \left(2\right)\end{array}$ where p and q denote neighboring pixels in one image, and f(p) and f(q) denote disparities for the pixels p and q, respectively. N denotes a set of neighboring pixels p and q. V_p,q(f_p,f_q) denotes a penalty. If disparities for the two neighboring pixels p and q are different from each other, the penalty V_p,q(f_p,f_q) increases the smooth energy as described in Equation 2. λ denotes a smooth energy coefficient.

In the graph cut algorithm for estimating the disparity, how the smooth energy coefficient λ is determined is important.

FIGS. 1 and 2 show original images and associated disparity maps. More specifically, FIGS. 1A and 1B show left and right original images, respectively. FIG. 1C shows a ground-truth disparity map. FIGS. 2A to 2C show disparity maps for the smooth energy coefficients λ of 2, 6, and 12, respectively, obtained by using the graph cut algorithm. FIG. 2A shows a disparity map of an under-smooth case, which contains a large amount of noise. FIG. 2C shows a disparity map of an over-smooth case, which hardly represents discontinuities between the objects. FIG. 2B shows more distinguishable objects than the cases of FIGS. 2A and 2C.

FIG. 3 shows gross error ratios of disparity maps with respect to the ground-truth disparity map according to the smooth energy coefficient λ when an image has different resolutions. As shown in FIG. 3, it can be understood that an optimal smooth energy coefficient λ for a half-resolution image is completely different from an optimal smooth energy coefficient λ for a double-resolution image.

Therefore, in order to obtain an optimal disparity map for a stereo image, it is necessary to calculate different smooth energy coefficients for images.

SUMMARY OF THE INVENTION

An embodiment of the present invention provides a method of estimating a disparity for adaptively obtaining smooth energy coefficients according to resolutions of images and applying the obtained smooth energy coefficients to a hierarchical graph cut algorithm.

According to an aspect of the present invention, there is provided a method of estimating a disparity of a stereo image. The method comprises obtaining a plurality of images having different resolution levels for the stereo image, estimating a disparity map for a lowest-resolution level image, estimating a coarse disparity map for an upper resolution level image by using the disparity map, obtaining a fine disparity map for the upper resolution level image by using the coarse disparity map, and outputting the fine disparity map as a final disparity map for the stereo image if the upper resolution level image has a resolution of a highest level.

According to another aspect of the present invention, there is provided a computer storage to control a computer according to a method of estimating a disparity of a stereo image. The method comprises obtaining a plurality of images having different resolution levels for the stereo image, estimating a disparity map for a lowest-resolution level image, estimating a coarse disparity map for an upper resolution level image by using the disparity, obtaining a fine disparity map for the upper resolution level image by using the coarse disparity, and outputting the fine disparity map as a final disparity map for the stereo image if the upper resolution level image has a resolution of a highest level.

Additional aspects and/or advantages of the invention will be set forth in part in the description which follows and, in part, will be apparent from the description, or may be learned by practice of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

These and/or other aspects and advantages of the invention will become apparent and more readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:

FIG. 1A shows a left image of an original image;

FIG. 1B shows a right image of the original image;

FIG. 1C shows a ground-truth disparity map;

FIGS. 2A to 2C show disparity maps having smooth energy coefficients of 2, 6, and 12, respectively, obtained by using a graph cut algorithm;

FIG. 3 shows gross error ratios of disparity maps with respect to a ground-truth disparity map according to smooth energy coefficients when an image has different resolutions;

FIG. 4 is a flowchart of a disparity estimation method according to an embodiment of the present invention;

FIG. 5 is a graph showing a relation between a smooth energy coefficient and an average texture of an image;

FIG. 6 is a diagram obtained by using an a-expansion scheme in a coarse-to-fine graph cut algorithm when initial disparities for two neighboring pixels are equal to each other, according to an embodiment of the present invention;

FIG. 7 is a diagram obtained by using an a-expansion scheme in a coarse-to-fine graph cut algorithm when initial disparities for two neighboring pixels are not equal to each other, according to an embodiment of the present invention;

FIGS. 8A to 8E show results obtained by applying conventional disparity estimation methods and the disparity estimation method according to an embodiment of the present invention to images of FIGS. 1A and 1B;

FIG. 9 is a graph showing gross error ratios of disparity maps obtained by using a hierarchical graph cut algorithm having three layers and a constant smooth energy coefficient, according to an embodiment of the present invention;

FIG. 10A shows an image of a room where there are humans picked up with a camera installed in a ceiling;

FIG. 10B shows an image of a room where there is no human picked up with the camera installed in the ceiling;

FIGS. 10C and 10D show disparity maps for the images of FIGS. 10A and 10B, respectively, according to an embodiment of the present invention;

FIG. 11A shows an image of a garden where there is a tree;

FIG. 11B shows a disparity map for image segmentation with respect to the image of FIG. 11A, according to an embodiment of the present invention;

FIG. 12A shows an image of a human being; and

FIG. 12B shows a disparity map for a face region in the image of FIG. 12A, according to an embodiment of the present invention.

FIG. 13 is a schematic representation of a storage and a computer.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Reference will now be made in detail to the embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to the like elements throughout. The embodiments are described below to explain the present invention by referring to the figures.

FIG. 4 is a flowchart of a disparity estimation method according to an embodiment of the present invention. In an embodiment of the present invention, a hierarchical graph cut algorithm is used to estimate the disparity. Here, the term “hierarchical” is related to a process for obtaining the disparity map by obtaining various resolution images for an original image and applying the graph cut algorithm to the various resolution images sequentially in order from a lowest to a highest resolution to obtain the disparity map. The smooth energy coefficients applied to layers may be different depending on the resolutions.

Firstly, a plurality of resolution levels are obtained from an original image (Operation 40). The number of resolution levels is determined based on the number of selected layers. Each of the images has ½′n-times resolution of the original image, where n is a natural number.

Next, smooth energy coefficients λ for the resolution levels are calculated (Operation 41). Although smooth energy coefficients may be set to be equal for all resolution levels, the smooth energy coefficients according to an embodiment of the present invention may adaptively vary with the resolution levels. Each of the smooth energy coefficients can be calculated by using textures of the image. If there is a single texture of the image, the disparity can be easily calculated by using pixel matching. However, in general, most images have multiple textures. Therefore, the disparity calculation involves a smooth term in addition to a pixel correspondence term.

In general, in the estimation of a disparity for an image with many textures, the smooth term dominates over the pixel correspondence term. On the contrary, in the estimation of a disparity for an image with fewer textures, the pixel correspondence term dominates over the smooth term.

In other words, a smooth energy coefficient λ for an image is related to textures of the image. In an embodiment of the present invention, a texture T(x,y) of a pixel located at a position (x,y) is defined as Equation 3, $\begin{array}{cc}T\left(x,y\right)=\sqrt{{\left(\frac{1}{x_k}\sum _{i=1}^{x_k}\frac{I\left(x+i,y\right)-I\left(x-i,y\right)}{2i}\right)}^2+{\left(\frac{1}{y_k}\sum _{i=1}^{y_k}\frac{I\left(x,y-i\right)-I\left(x,y-i\right)}{2i}\right)}^2},& \left(3\right)\end{array}$ where x=1, 2, . . . , width, and y=1, 2, . . . , height. The terms ‘width’ and ‘height’ denote a width and height of an image, respectively. In addition, x_k=min(x−1, width−x, 2), y_k=min(y−1, height−y, 2), and l(x, y) is an image pixel value. In addition, if x_k=0 and y_k=0, then T(x,y) =0.

The smooth energy coefficient λ can be directly calculated based on the texture T(x,y) of Equation 3 by using Equation 4, $\begin{array}{cc}\lambda =\sum _{i=m}^n{a}_i{T\left(x,y\right)}^i,& \left(4\right)\end{array}$ where m and n satisfy a predetermined range: m<0<n.

In Equation 4, a parameter a_i should be determined. In order to determine the parameter a_i, a large number of learning samples are required. In addition, the parameter a_i needs to be determined, so that an optimal smooth energy coefficient λ for a given original image and ground-truth disparity map can be obtained.

Therefore, several learning samples having a stereo image and a ground-truth disparity map are collected. Next, each of the learning samples is subjected to scaling and segmentation to increase the number of learning samples. And then, the smooth energy coefficients λ are calculated.

FIG. 5 is a graph showing a relation between the smooth energy coefficient λ and the average texture of the image. As shown in FIG. 5, it can be understood that the smooth energy coefficient λ is inversely proportional to the average texture.

In an alternative method of determining the smooth energy coefficient λ, the smooth energy coefficient λ is assumed to be an integer number. In the alternative method, available smooth energy coefficients λ are searched, and a suitable smooth energy coefficient λ is selected among the searched smooth energy coefficients λ.

The above methods of determining the smooth energy coefficient λ result in a large amount of calculation. Therefore, the smooth energy coefficient λ may be calculated by the following algorithm: λ_k+1=λ_k−β·M(D_k, G)  (5) where λ_k denotes a smooth energy coefficient λ of k-th iteration, and β denotes a step size. D_k denotes a disparity map estimated based on the smooth energy coefficient λ_k by using the graph cut algorithm. G denotes the ground-truth disparity map. M(D_k,G) denotes a function for measuring smoothness between the disparity map D_k and the ground-truth disparity map G. For example, if the disparity map D_k is less than the ground-truth disparity map G, then M(D_k,G)>0. If not, M(D_k,G)<0. In an embodiment of the present invention, the disparity map D_k is determined by using edge information of the disparity map.

Next, a disparity map for a lowest-resolution level image is estimated (Operation 42). The disparity map for the lowest-resolution level image may be estimated by using a conventional graph cut algorithm. One of the conventional graph cut algorithms is disclosed in an article, by Y Boykov et al., titled “Fast Approximate Energy Minimization via Graph Cuts,” (IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 23, Issue 11, November 2001, pp.1222 - 1239).

Next, a coarse disparity map for an upper level image is estimated based on the estimated disparity map for the lowest-resolution level image (Operation 43). More specifically, in an embodiment of the present invention, a resolution of an upper layer is set to be double that of a resolution of the lower layer. In other words, a pixel of a lower level image corresponds to 4 pixels of an upper level image, so that a disparity for 4 pixels is double that of the disparity for the corresponding pixel of the lower level image. As a result, a coarse disparity map for the upper level image can be obtained by doubling the disparity of the disparity map for the lower level image.

Next, a fine disparity map for the upper level image is obtained based on the coarse disparity map for the upper level image and the smooth energy coefficient λ calculated in Operation 41 (Operation 44). The fine disparity map may be obtained by using a coarse-to-fine graph cut algorithm according to an embodiment of the present invention.

Now, the coarse-to-fine graph cut algorithm will be described in detail.

FIG. 6 is a diagram obtained by using an α-expansion scheme in the coarse-to-fine graph cut algorithm when initial disparities for two neighboring pixels are equal to each other, according to an embodiment of the present invention. Here, the initial disparities are disparities A0 and B0 obtained from the coarse disparity map. A value of α is a maximum disparity heuristically set based on a distance between two cameras, being used to classify various regions included in an image into (α+1) labels from 0 to α.

In the graph of FIG. 6, two neighboring pixels A and B are designated as vertexes. A source and a sink are referred to as super vertexes or terminals. Here, the two neighboring pixels are, for example, pixel A and pixel B (one of four pixels located at left, right, upper, and lower positions centered around pixel A). The source is labeled as α, and the sink is labeled properly in order to maintain initial disparities A0 and B0 of pixels.

In FIG. 6, Ta and Tb denote weights of edges from the source to the vertexes. Va and Vb denote weights of edges from the vertexes to the sink. Vab denotes a weight of two edges between two vertexes. $\begin{array}{cc}\mathrm{Tb}=D\left(B,\mathrm{source}\right)+\sum _{\begin{array}{c}p\in N\left(B\right)\\ p\notin P\left(\mathrm{source}\right)\end{array}}V\left(B,\mathrm{source},p,f_p\right)\mathrm{Ta}=D\left(A,\mathrm{source}\right)+\sum _{\begin{array}{c}p\in N\left(A\right)\\ p\notin P\left(\mathrm{source}\right)\end{array}}V\left(A,\mathrm{source},p,f_p\right)\mathrm{Vab}=V\left(A,\mathrm{source},B,\mathrm{B0}\right)=V\left(A,\mathrm{A0},B,\mathrm{source}\right)\mathrm{if}\mathrm{A0}=\mathrm{source},\mathrm{then}\mathrm{Va}=\mathrm{MAX\_ENERGY}\mathrm{else}\mathrm{Va}=D\left(A,\mathrm{A0}\right)+\sum _{\begin{array}{c}p\in N\left(A\right)\\ p\notin P\left(\mathrm{source}\right)\end{array}}V\left(A,\mathrm{A0},p,f_p\right)\mathrm{if}\mathrm{B0}=\mathrm{source},\mathrm{then}\mathrm{Vb}=\mathrm{MAX\_ENERGY}\mathrm{else}\mathrm{Vb}=D\left(B,\mathrm{B0}\right)+\sum _{\begin{array}{c}p\in N\left(B\right)\\ p\notin P\left(\mathrm{source}\right)\end{array}}V\left(B,\mathrm{B0},p,f_p\right)\mathrm{if}& \left(6\right)\end{array}$

Here, p∉P(source) means that the disparity for the pixel p is not in a range of [α−1, α+1], and accordingly, there is no vertex corresponding to the pixel p in the graph. N(A) denotes a set of neighboring pixels for the pixel A. In addition, p∈E N(A) means that the pixel p is one of the neighboring pixels for the pixel A. D(A, source) is a data energy when the pixel A has the disparity a for the source. D(A, A0) denotes a data energy when the disparity for the pixel A is A0. V(A, source, p, f_p) denotes a smooth energy between the pixel A and p obtained by using Equation 2 when a disparity for the pixel A is α and a disparity for the pixel p is the disparity f(p) (=f_p). MAX_ENERGY denotes a maximum energy.

Now, the a-expansion of the coarse-to-fine graph cut algorithm in an embodiment of the present invention will be described in detail. The disparity for the pixel A having an initial disparity of A0 can vary among the disparities of A0−1, A0, and A0+1. Therefore, if the maximum disparity a satisfies a condition: A0−1≦α≦A0+1, then the pixel A has a corresponding vertex in the graph. If A0−1>α or A0+1<α, then the pixel A has no corresponding vertex in the graph. As a result, only the pixels whose disparities are in a range of [α−1, α+1] can have corresponding vertexes in the graph.

FIG. 7 is a diagram obtained by using the α-expansion scheme in the coarse-to-fine graph cut algorithm when the initial disparities A0 and B0 of the two neighboring pixels A and B are not equal to each other, according to an embodiment of the present invention.

Vertexes and terminals of FIG. 7 are the same as those of FIG. 6. In the graph, a vertex C does not correspond to any pixel in the original image and added to the graph when the initial disparities A0 and B0 are not equal to each other. Each edge weight is determined as follows. $\begin{array}{cc}\mathrm{Ta}=D\left(A,\mathrm{source}\right)+\sum _{\begin{array}{c}p\in N\left(A\right)\\ p\notin P\left(\mathrm{source}\right)\end{array}}V\left(A,\mathrm{source},p,f_p\right)\mathrm{Tb}=D\left(B,\mathrm{source}\right)+\sum _{\begin{array}{c}p\in N\left(B\right)\\ p\notin P\left(\mathrm{source}\right)\end{array}}V\left(B,\mathrm{source},p,f_p\right)\mathrm{Vbc}=V\left(A,\mathrm{source},B,\mathrm{B0}\right)\mathrm{Vac}=V\left(A,\mathrm{A0},B,\mathrm{source}\right)\mathrm{Vc}=V\left(A,\mathrm{A0},B,\mathrm{B0}\right)\mathrm{if}\mathrm{A0}=\mathrm{source},\mathrm{then}\mathrm{Va}=\mathrm{MAX\_ENERGY}\mathrm{else}\mathrm{Va}=D\left(A,\mathrm{A0}\right)+\sum _{\begin{array}{c}p\in N\left(A\right)\\ p\notin P\left(\mathrm{source}\right)\end{array}}V\left(A,\mathrm{A0},p,f_p\right)\mathrm{if}\mathrm{B0}=\mathrm{source},\mathrm{then}\mathrm{Vb}=\mathrm{MAX\_ENERGY}\mathrm{else}\mathrm{Vb}=D\left(B,\mathrm{B0}\right)+\sum _{\begin{array}{c}p\in N\left(B\right)\\ p\notin P\left(\mathrm{source}\right)\end{array}}V\left(B,\mathrm{B0},p,f_p\right)& \left(7\right)\end{array}$

In the graphs shown in FIGS. 6 and 7, some edges whose sum of weights is minimal among the edges directed from the source to the sink through the vertexes are subjected to cutting. As the result of cutting, the labels of pixels connected to the source are maintained, and the labels of pixels connected to the sink are converted to α. The disparity map is formed so that different pixels are labeled differently from each other.

Next, it is determined whether or not the upper level in Operation 44 is the highest level (Operation 45). If the upper level is the highest level, the disparity obtained for the highest level is output as a final disparity map (Operation 46). If not, the procedure returns to Operation 43 to estimate the coarse disparity map for the next upper level by using the disparity map for the current level.

FIGS. 8A to 8E show results obtained by applying conventional disparity estimation methods and the disparity estimation method according to an embodiment of the present invention to images of FIGS. 1A and 1B. More specifically, FIGS. 8A to 8C show results obtained by applying a conventional simulated annealing method, a conventional normal correlation method, and a conventional graph cut algorithm, respectively. FIG. 8D shows the result obtained by applying a smooth energy coefficient to the hierarchical graph cut algorithm according to an embodiment of the present invention. FIG. 8E shows the result obtained by applying an adaptive smooth energy coefficient to the hierarchical graph cut algorithm according to an embodiment of the present invention. In the experiment, two of upper and lower layers are adopted. A resolution of an original image is 768×576; and a range of disparity is [0, 31].

As shown in the figures, it can be understood that regions obtained in the case of FIG. 8E according to an embodiment of the present invention are most distinguishable.

FIG. 9 shows gross error ratios of disparity maps obtained by applying a hierarchical graph cut algorithm having three layers to an image having a resolution of 768×576 and applying a constant smooth energy coefficient to the three layers, according to an embodiment of the present invention. As shown in the figure, it can be understood that the gross error ratio has a lowest value of 7.12% at the smooth energy coefficient of 9.

In another experiment, the smooth energy coefficients for the respective layers were adaptively estimated and applied to the three-layered hierarchical graph cut algorithm. The gross error ratio became 5.46%.

Table 1 shows the comparison of calculation times and gross error ratios according to the aforementioned disparity estimation methods.

	TABLE 1
	Disparity estimation	Calculation	Gross error
	method	Time (sec)	ratio (%)
	Simulation Annealing	10,000	12.23
	Normal Correlation	16	15.12
	Graph Cut	134	5.63
	Hierarchical Graph	12.01	7.12
	Cut + Constant
	Smooth energy coefficient
	Hierarchical Graph	12.03	5.46
	Cut + Adaptive
	Smooth energy coefficient

As shown in Table 1, it can be understood that the method applying the adaptive smooth energy coefficient to the hierarchical graph cut algorithm according to an embodiment of the present invention has the best results in terms of the calculation time and the gross error ratio.

FIGS. 10A to 10D show examples of applying the hierarchical graph cut algorithm according to an embodiment of the present invention to people counting. More specifically, FIG. 10A shows an image of a room where there are humans picked up with a camera installed in a ceiling; and FIG. 10B shows an image of a room where there is no human picked up with the camera installed in the ceiling. FIGS. 10C and 10D show disparity maps for the images of FIGS. 10A and 10B, respectively, according to an embodiment of the present invention.

As shown in FIGS. 10C and 10D, it can be understood that, since there is a difference between a head of a human and a floor by a height of the human in a view from the ceiling, the head of the human is more highlighted than the floor. Therefore, it is possible to count people passing through the door by estimating the disparity of the image.

In addition, as shown in FIGS. 11A and 11B, the hierarchical graph cut algorithm according to an embodiment of the present invention may be applied to image segmentation. More specifically, FIG. 11A shows an image of a garden where there is a tree; and FIG. 11B shows a disparity for the image of FIG. 11A, according to an embodiment of the present invention. As shown in FIG. 11B, it can be understood the image is well segmented into various regions. FIGS. 12A and 12B show still another example of applying the hierarchical graph cut algorithm according to an embodiment of the present invention to human face recognition. More specifically, FIG. 12A shows an image of a human; and FIG. 12B shows disparity map for a face region in the image of FIG. 12A, according to an embodiment of the present invention. As shown in FIG. 12B, the face region is well segmented in order to be applied to face recognition.

According to an embodiment of the present invention, resolution of an image is divided into multiple levels, different smooth energy coefficients are applied to different resolution levels, and a hierarchical graph cut algorithm is applied to the resolution level images. Therefore, it is possible to reduce calculation time and gross error ratio.

FIG. 13 is a schematic representation of a storage (i.e. a computer readable medium) and a computer. The invention can also be embodied as computer readable code on a computer readable medium. The computer readable medium is any data storage device that can store data which can be thereafter be read by a computer system. Examples of the computer readable medium include read-only memory (ROM), random-access memory (RAM), CD-ROMs, magnetic tapes, floppy disks, optical data storage devices, and carrier waves (such as data transmission through the Internet). The computer readable medium can also be distributed over network coupled computer systems so that the computer readable code is stored and executed in a distributed fashion. Also, functional programs, codes, and code segments for accomplishing embodiments of the present invention can be easily construed by programmers skilled in the art to which embodiments of the present invention pertain.

Although a few embodiments of the present invention have been shown and described, it would be appreciated by those skilled in the art that changes may be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the claims and their equivalents.

Claims

1. A method of estimating a disparity of a stereo image, comprising: obtaining a plurality of images having different resolution levels for the stereo image; estimating a disparity map for a lowest-resolution level image; estimating a coarse disparity map for an upper resolution level image by using the disparity map; obtaining a fine disparity map for the upper resolution level image by using the coarse disparity map; and outputting the fine disparity map as a final disparity map for the stereo image if the upper resolution level image has a resolution of a highest level.

2. The method of claim 1, wherein the resolutions of the plurality of images is ½″ times a resolution of the stereo image, and wherein n is a natural number.

3. The method of claim 2, wherein the coarse disparity map is estimated so that disparities for pixels of the upper resolution level image are double that of disparities for corresponding pixels of a lower resolution level image of which level is lowered by one level from the upper resolution level image.

4. The method of claim 1, wherein the disparity map is obtained so that a sum of data energy measured for the stereo image and smooth energy measured by using a predetermined smooth energy coefficient λ are minimized, and the predetermined smooth energy coefficient is determined based on an amount of texture according to a resolution of each resolution level.

5. The method of claim 4, wherein, the predetermined smooth energy coefficient λ is represented with the following equation: λ=∑i=mn⁢ai⁢T⁡(x,y)i,where T(x, y) is a texture amount of a pixel located at a position (x, y), m<0<n, and ai is a coefficient.

6. The method of claim 5, wherein the texture amount T(x, y) is represented with the following equation: T⁡(x,y)=(1xk⁢∑i=1xk⁢I⁢(x+i,y)-I⁡(x-i,y)2⁢i)2+(1yk⁢∑i=1yk⁢I⁢(x,y-i)-I⁡(x,y-i)2⁢i)2,where x=1, 2, . . . , image-width, y=1, 2, . . . , image-height, xk=min(x−1, image-width−x, 2), yk=min(y−1, image-height−y, 2), and l(x, y) is an image pixel value.

7. The method of claim 4, wherein the predetermined smooth energy coefficient λ is determined so that k-th and (k+1)-th smooth energy coefficients are iteratively determined by using a function for measuring smoothness between a ground-truth disparity map and a disparity map obtained based on the k-th smooth energy coefficient, and k is a natural number.

8. The method of claim 7, wherein the function for measuring the smoothness is determined by using edge information of the disparity map obtained based on the k-th smooth energy coefficient.

9. The method of claim 1, wherein the fine disparity map is obtained by: designating two neighboring pixels A and B as vertexes, if disparities A0 and B0 of the two pixels are equal to each other; setting a source and a sink connected to the two vertexes; forming a graph where the two vertexes, the source, and the sink are connected with edges having predetermined weights; and maintaining labels of pixels connected to the source, and converting labels of pixels connected to the sink into a label for the source by cutting edges so that a sum of weights of edges directed from the source to the sink is minimized.

10. The method of claim 9, wherein each of weights of edges between the source and the two vertexes is represented with a sum of data energy when each pixel has a disparity for the source and smooth energy between each pixel and its neighboring pixels when the neighboring pixels satisfy a first predetermined condition, wherein each of weights of edges between the two vertexes and the sink is represented with a sum of data energy when each pixel has an initial disparity and the smooth energy between each pixel and its neighboring pixels when the neighboring pixels satisfy a second predetermined condition, and wherein weights of edges between the two vertexes are represented with smooth energy between two pixels when one of the two pixels has the disparity for the source.

11. The method of claim 10, wherein at least one of the first and second predetermined conditions is that disparities of the neighboring pixels are not in a range of [maximum disparity−1, maximum disparity+1], and corresponding vertexes are not provided to the graph.

12. The method of claim 9, wherein the fine disparity map is obtained by: designating two neighboring pixels A and B as first and second vertexes respectively, if disparities A0 and B0 of the two pixels are not equal to each other; setting a source and a sink connected to the first and second vertexes, respectively; setting a third vertex between the first and second vertexes not to correspond to pixels of the upper resolution level image; forming a graph where the three vertexes, the source, and the sink are connected with edges having predetermined weights; and maintaining labels of pixels connected to the source, and converting labels of pixels connected to the sink into a label for the source by cutting edges so that a sum of weights of edges directed from the source to the sink is minimized.

13. The method of claim 12, wherein each of weights of edges between the source and the first and second vertexes is represented with a sum of data energy when each pixel has a disparity for the source and smooth energy between each pixel and its neighboring pixels when the neighboring pixels satisfy a first predetermined condition, wherein each of weights of edges between the first and second vertexes and the sink is represented with a sum of data energy when each pixel has an initial disparity and the smooth energy between each pixel and its neighboring pixels when the neighboring pixels satisfy a second predetermined condition, wherein a weight of an edge between the first or second vertexes and the third vertex is represented with smooth energy between two pixels when a pixel corresponding to the first or second vertex has a disparity for the source, and wherein a weight of an edge between the third vertex and the sink is represented with smooth energy between two pixels when the two pixels have initial disparities.

14. The method of claim 13, wherein at least one of the first and second predetermined conditions is that disparities of the neighboring pixels are not in a range of [maximum disparity−1, maximum disparity+1], and corresponding vertexes are not provided to the graph.

15. A method of estimating a disparity of a stereo image, comprising: estimating a disparity map for an image having a first resolution level; estimating a course disparity map for an image having a second resolution level; and obtaining a fine disparity map for the image having the second resolution level using the course disparity map.

16. The method of claim 15, wherein the second resolution is higher than the first resolution.

17. The method of claim 15, further comprising: outputting the fine disparity map if the second resolution is a highest resolution.

18. A method of estimating a disparity of a stereo image, comprising: obtaining a plurality of resolution levels; calculating a plurality of smooth energy coefficients for the plurality of resolution levels; estimating a disparity map for a lowest resolution level; estimating a course disparity map for a resolution level higher than the lowest resolution level; obtaining a fine disparity map for the resolution level higher than the lowest resolution level; repeating the steps of estimating a course disparity map and obtaining of a fine disparity map for additional resolution levels higher than the lowest resolution level; and outputting a fine disparity map for the highest resolution level.

19. A computer storage to control a computer according to a method of estimating a disparity of a stereo image, wherein the method comprises: obtaining a plurality of images having different resolution levels for the stereo image; estimating a disparity map for a lowest-resolution level image; estimating a coarse disparity map for an upper resolution level image by using the disparity; obtaining a fine disparity map for the upper resolution level image by using the coarse disparity; and outputting the fine disparity map as a final disparity map for the stereo image if the upper resolution level image has a resolution of a highest level.