System and method for matching curves of multiple images representing a scene

Abstract

The present invention is embodied in a system and method for curve matching multiple images of a scene. The curve matching produces a geometrical representation of the scene from the images, which can be used for any suitable application, such as computer and stereo vision applications. In general, first, multiple images depicting a scene are digitally received by the system. The images are graphical images digitally received and processed as two dimensional image data, such as bitmap or raster image data. Curve matching of the images is then performed to correlate the two images of the scene for creating three dimensional (3D) curve information, such as 3D vector information, of the scene. This 3D vector information can then be used in any suitable manner, for example, to digitally reconstruct the scene for stereo vision applications.

Description

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates in general to processing digital data, and in particular, to a system and method for matching curves of multiple images representing a scene for stereo vision applications.

2. Related Art

For stereo vision applications, accurate vector or mathematical representations of objects or scenes derived from two dimensional image data are very important. Vector or mathematical representations of a scene can be comprised of curve information derived from an image. Reliable curve matching is a difficult problem but is required in many vision-based applications. Curve matching is particularly difficult when the edges in question, such as for a general scene, are not limited to be on straight lines.

Although many techniques exist for detecting the edges of a scene, these techniques, however, have difficulties when applied to more general scenes. For example, some techniques use line matching methods applied to scenes containing mainly planar surfaces. However, they are not suitable for scenes containing curves because the line model is insufficient to describe curves. In addition, they are not suitable for scenes that are taken by a camera close to the scene, where the local affinity or similarity assumption for long line segments is not valid. Further, the projection of straight lines in 3D onto images may no longer be straight due to radial lens distortion.

Some problems related to curve matching are the design of good unary and binary measurements, and the definition of appropriate similarity and compatibility functions. Previous techniques and methods for curve matching provided examples on the unary measurements and similarity function between curves. Nevertheless, these previous methods were limited when dealing with binary measurements and compatibility functions. Namely, their compatibility functions were usually computed from measurements such as disparity or disparity gradient, which are only suitable for the description of relationships between two pairs of points, and are not scale invariant.

Therefore, what is needed is a system and method that solves the problems that prior methods encounter with general scenes with a system that performs curve matching (including lines) within a probabilistic relaxation framework. What is also needed is a system the uses the relaxation framework to progressively reduce the matching.

SUMMARY OF THE INVENTION

To overcome the limitations in the prior art as described above and other limitations that will become apparent upon reading and understanding the present specification, the present invention is embodied in a system and method for matching curves of multiple images representing a scene. The curve matching produces a geometrical representation of the scene from the images, which can be used for any suitable application, such as computer and stereo vision applications.

In general, first, multiple images depicting a scene are digitally received by the system. The images are graphical images digitally received and processed. For example, the images can be two dimensional image data, such as bitmap or raster image data. Curves of the images are then matched to correlate the two images of the scene for creating three dimensional (3D) curve information, such as 3D vector or mathematical information, of the scene. This 3D vector information can then be used in any suitable manner, for example, to digitally reconstruct the scene for stereo vision applications.

The present invention performs the curve matching (including lines) preferably within a probabilistic relaxation framework. The relaxation framework is used to progressively reduce the matching ambiguity. In other words, the relaxation framework is used to handle the curves and explicitly model uncertainty in line segment measurements. Epipolar geometry can be used to reduce the matching ambiguity between the line segments. Similarity-invariant unary and binary measurements suitable for curves are developed. An additional measurement can be introduced to model the uncertainty of the binary measurements, which can then be used to compute the matching support from neighboring matches. The present invention also includes preprocessing techniques to enhance curve matching.

Other aspects and advantages of the present invention as well as a more complete understanding thereof will become apparent from the following detailed description, taken in conjunction with the accompanying drawings, illustrating by way of example the principles of the invention. Moreover, it is intended that the scope of the invention be limited by the claims and not by the preceding summary or the following detailed description.

BRIEF DESCRIPTION OF THF DRAWINGS

Referring now to the drawings in which like reference numbers represent corresponding parts throughout:

FIG. 1 is a block diagram illustrating an apparatus for carrying out the invention.

FIG. 2 is a general block diagram illustrating a system processing multiple images of a scene for stereo vision applications in accordance with the present invention.

FIG. 3 is a flow diagram for curve matching multiple images of a scene in accordance with the present invention.

FIG. 4 is a working example of FIG. 3 for curve matching two images of a scene in accordance with the present invention.

FIG. 5 is a neighborhood of a seed point in the left image and its correspondence in the right image of the working example of FIG. 4 .

FIG. 6 is a configuration of two pairs of line segments in both images of the working example of FIG. 4 .

FIG. 7 is a computation of the high curvature and the epipolar breakpoint of the working example of FIG. 4 in accordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

In the following description of the invention, reference is made to the accompanying drawings, which form a part hereof, and in which is shown by way of illustration a specific example in which the invention may be practiced. It is to be understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.

I. Exemplary Operating Environment

FIG. 1 and the following discussion are intended to provide a brief, general description of a suitable computing environment in which the invention may be implemented. Although not required, the invention will be described in the general context of computer-executable instructions, such as program modules, being executed by a personal computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located on both local and remote memory storage devices.

With reference to FIG. 1 , an exemplary system for implementing the invention includes a general-purpose computing device in the form of a conventional personal computer 100 , including a processing unit 102 , a system memory 104 , and a system bus 106 that couples various system components including the system memory 104 to the processing unit 102 . The system bus 106 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. The system memory includes read only memory (ROM) 110 and random access memory (RAM) 112 . A basic input/output system 114 (BIOS), containing the basic routines that help to transfer information between elements within the personal computer 100 , such as during start-up, is stored in ROM 110 . The personal computer 100 further includes a hard disk drive 116 for reading from and writing to a hard disk, not shown, a magnetic disk drive 118 for reading from or writing to a removable magnetic disk 120 , and an optical disk drive 122 for reading from or writing to a removable optical disk 124 such as a CD ROM or other optical media. The hard disk drive 116 , magnetic disk drive 128 , and optical disk drive 122 are connected to the system bus 106 by a hard disk drive interface 126 , a magnetic disk drive interface 128 , and an optical drive interface 130 , respectively. The drives and their associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules and other data for the personal computer 100 . Although the exemplary environment described herein employs a hard disk, a removable magnetic disk 120 and a removable optical disk 124 , it should be appreciated by those skilled in the art that other types of computer readable media which can store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, random access memories (RAMs), read only memories (ROM), and the like, may also be used in the exemplary operating environment.

A number of program modules may be stored on the hard disk, magnetic disk 120 , optical disk 124 , ROM 110 or RAM 112 , including an operating system 132 , one or more application programs 134 , other program modules 136 , and program data 138 . A user may enter commands and information into the personal computer 100 through input devices such as a keyboard 140 and pointing device 142 . Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 102 through a serial port interface 144 that is coupled to the system bus 106 , but may be connected by other interfaces, such as a parallel port, game port or a universal serial bus (USB). A monitor 146 or other type of display device is also connected to the system bus 106 via an interface, such as a video adapter 148 . In addition to the monitor 146 , personal computers typically include other peripheral output devices (not shown), such as speakers and printers.

The personal computer 100 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 150 . The remote computer 150 may be another personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the personal computer 100 , although only a memory storage device 152 has been illustrated in FIG. 1 . The logical connections depicted in FIG. 1 include a local area network (LAN) 154 and a wide area network (WAN) 156 . Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and Internet.

When used in a LAN networking environment, the personal computer 100 is connected to the local network 154 through a network interface or adapter 158 . When used in a WAN networking environment, the personal computer 100 typically includes a modem 160 or other means for establishing communications over the wide area network 156 , such as the Internet. The modem 160 , which may be internal or external, is connected to the system bus 106 via the serial port interface 144 . In a networked environment, program modules depicted relative to the personal computer 100 , or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used, such as a direct connection via an integrated services digital network (ISDN) connection.

II. Introduction

Reliable curve matching of images representing a scene is important and desirable in many vision-based applications, especially when the edges of the images in question are not limited to be on straight lines. The present invention provides reliable curve matching of multiple images representing scenes, including general scenes where edges are not limited to be on straight lines. Curve matching in accordance with the present invention produces a geometrical representation of the scene from the images, which can be used for any suitable application, such as computer and stereo vision applications.

In general, the present invention can be embodied in a computer hardware or software system that matches curves (including lines) within a probabilistic relaxation framework. Similarity-invariant unary and binary measurements suitable for curves are computed. Also, a measurement to model the uncertainty of the binary measurements is computed. This measurement is used for determining matching support from neighboring matches.

III. General Overview

FIG. 2 is a general block diagram illustrating a curve matching system for processing multiple images of a scene in accordance with the present invention. The system 200 can be used for any suitable computer application, such as computer or stereo vision applications. In general, image 1 , image 2 , . . . , image N ( 210 , 212 , 214 ) depicting a scene are digitally received by the system 200 . The images ( 210 , 212 , 214 ) can be graphical images taken by a camera and containing two dimensional image data of the scene, in any suitable format, such as bitmap or raster image data format.

A curve matching module 216 receives the images ( 210 , 212 , 214 ) and correlates the images to each other by matching the curves of the images ( 210 , 212 , 214 ). The matched curves of the images represent geometrical three dimensional (3D) curve information 218 , such as 3D vector information, of the scene. This 3D vector information geometrically represents the scene and can be used in any suitable manner, for example, to digitally reconstruct the scene for stereo vision applications 220 .

The present invention reliably performs curve matching for a scene given at least two images of the scene. The present invention can also reliably perform curve matching when the edges of an object of the scene in question are not limited to be on straight lines. The present invention solves the problems discussed above that prior methods encounter with general scenes by performing curve matching (including lines) within a probabilistic relaxation framework. The relaxation framework is used to progressively reduce the matching ambiguity and will be discussed in detail below.

FIG. 3 is a flow diagram for curve matching multiple images of a scene in accordance with the present invention. In general, referring to FIG. 2 along with FIG. 3 , first, images ( 210 , 212 , 214 ) are received by the system (step 310 ). The images ( 210 , 212 , 214 ) are graphical images, such as two dimensional bitmap or raster image data. Second, curves of the images ( 210 , 212 , 214 ) are represented as line segments (step 312 ) and the line segments are matched (step 314 ). Optionally, epipolar geometry can be used to break curves appropriately in order to reduce the matching ambiguity. Epipolar breaking techniques of the present invention (step 316 ) reduce matching complexity and will be discussed in detail below.

With regard to the line segments, a piecewise linear model is used to approximate curves with the line segments. The line segments of the images ( 210 , 212 , 214 ) are matched by computing unary and binary measurements (steps 318 , 320 ). The relaxation framework of the present invention deals with curves and explicitly models the uncertainty in the binary measurements. For example, a set of binary measurements for the line segments can be computed, which are similarity-invariant and measured in the same physical space. The set of binary measurements are then integrated to provide a set of binary measurements and a compatibility function for the complete curve.

Last, the uncertainty in the combined binary measurements is progressively modeled for reducing ambiguities in the combined binary measurements by integrating line matching for curve matching (step 322 ). Namely, criteria of the line matching is integrated into criteria of curve matching. This is accomplished by first computing an individual variance or uncertainty of combined binary measurements for matched line segments of each curve (step 324 ). A global minimal variance criterion is then used to compute an integrated variance for the entire curve based on the individual variance of each matched line segment (step 328 ), which will be discussed in detail below.

IV. Operation

Referring back to FIG. 2 along with FIG.3 , information that can be used for curve matching falls into three categories, i.e., the geometrical constraint, the similarity between the curves, and the compatibility among the neighborhood matches. One important geometric constraint between views is the epipolar constraint, which is typically used in curve-based stereo matching systems for reducing the search space. Epipolar lines can be defined as horizontal scan lines, but are not restricted to be horizontal (the fundamental matrix can be used to define the epipolar geometry).

The similarity function between two curves is usually defined in a high dimensional feature space. The features may include attributes such as the intensity in the neighborhood, orientation, and the local shape characteristics. These are the unary measurements. The compatibility function among neighboring matches is usually defined by the relationship between neighboring pairs of matches. The compatibility function is usually related to the local affinity or similarity assumption, and the binary measurements, defining the relationship, could be the angle and distance between a pair of neighboring curves.

The relaxation technique of the present invention integrates the similarity function and the compatibility function to progressively reduce the matching ambiguity. Curves include both straight and non-straight edges. Edge points can be detected in sub-pixel accuracy by finding the zero-crossing between the integer pixels on the DOG (difference of Gausian) image. Adjacent edge points are then linked together into connected edge chains (also called curves for simplicity). The linking process does not include any heuristic processing such as one-pixel gap filling or straight line fitting. An edge chain (curve) is represented as a linked list, and is parameterized by the index variable.

The present invention also considers the uncertainty in the binary measurements. It should be noted that the local affinity or similarity assumption is only valid within a limited area of the image. Binary measurements obtained from curves far away from each other have more uncertainty than those from nearby curves. In the present invention, this is reflected in the computation of the compatibility function.

IV. Working Example and Real World Implementation

FIG. 4 is a working example of FIG. 3 for curve matching two images of a scene in accordance with the present invention. In the example 400 , in general, a left image 410 and a right image 412 of a scene 414 are captured by any suitable means. Edges or curves 420 of each image 410 , 412 defining the objects of the scene 414 are matched with the curve matching module 216 of FIG. 2 . The matched curves 425 are used to determine a geometrical representation of the scene 414 in the form of curve information 430 , which can be used in stereo matching applications.

A. A Probabilistic Relaxation Framework

A probabilistic relaxation framework for structural matching is used by the present invention. For notational purposes, curve matching is modeled as a labeling problem from the object space (left image 410 ) to the model space (right image 412 ). There are curves in the left image, and in the right. The curves in the left image form the object space, denoted by ={a 1 , . . . , a}. The curves in the right image form the model space, each labeled as ω j . As discussed above, the object 410 is matched to the model 412 . Thus, assigned to each object, a i is a label θ i , which may take as its value any of the +1 model labels that form the set Ω={ω 0 , ω 1 , . . . ,ω}, where ω 0 is the null label used to label curves for which no match in the right image is appropriate. Four sets of indices are defined for convenience as:

0 ≡{1, . . . ,}, i ≡{j|jε 0 ,j≠i},

0 ≡{0, . . . ,}, and i ≡{j|jε 0 ,j≠i}.

The unary measurement set is defined as ={x i |i ε 0 } where x i is the unary measurement vector for the object a i . Unary measurements include intensity similarity, and will be addressed below. The binary measurement set for the object a i is defined as i ={A ij |jε i }, where A ij is the vector of binary measurements between objects a i and a j . Binary measurements include distance between two curves, and will be discussed below. A special measurement set i ={B ij |jε i } is also defined, where B ij is the uncertainty measurement to be defined later. Upper-case P is used to denote the probability of an event, lower-case p is used to denote the probability density function, and v (μ,Σ) to denote the Gaussian probability density function of a random vector v with the mean μ and the covariance matrix Σ.

1. A Framework With Uncertainty Measurement:

With the above notation, the matching problem becomes that of finding for object a i a model label ω θ i with the highest probability given the measurements , i , and i : $$ P ⁡ ( θ i = ω θ i | 𝒳 , 𝒜 i , ℬ i ) = max ωλ ∈ Ω ⁢ P ⁡ ( θ i = ω λ | 𝒳 , 𝒜 i , ℬ i ) ( 1 )

For the convenience of the discussion that follows, the notation of the event set is introduced as λ ={θ i =ω λ }∪{θ j =ω θ j |jεN i } to indicate that object a i is labeled with a given label ω λ while other objects can change their labels. For θ i , the ith event i θ i is equivalent to event θ i =ω θ i . Using Bayes' formula and the theorem of total probability, the result is: $$ p ⁡ ( ℒ i θ i | 𝒳 , 𝒜 i , ℬ i ) = p ⁡ ( ℒ i θ i , 𝒳 , 𝒜 i , ℬ i ) p ⁡ ( 𝒳 , 𝒜 i , ℬ i ) = ∑ { ω θ j ∈ Ω , j ∈ N i } ⁢ p ⁡ ( ℒ θ i , 𝒳 , 𝒜 i , ℬ i ) ∑ ω λ ∈ Ω ⁢ ∑ { ω θ j ∈ Ω , j ∈ N i } ⁢ p ⁡ ( ℒ λ , 𝒳 , 𝒜 i , ℬ i ) ( 2 )

By applying the product rule for p( λ ,, i , i ), the following is produced: $$ p ⁡ ( ℒ λ , 𝒳 , 𝒜 i , ℬ i ) =   ⁢ p ⁡ ( 𝒳 | ℒ λ , 𝒜 i , ℬ i ) ⁢ p ⁡ ( ℒ λ , 𝒜 i , ℬ i ) =   ⁢ p ⁡ ( 𝒳 | ℒ λ ) ⁢ p ⁡ ( 𝒜 i | ℒ λ , ℬ i ) ⁢ p ⁡ ( ℒ λ , ℬ i ) =   ⁢ p ⁡ ( 𝒳 | ℒ λ ) ⁢ P ⁡ ( ℒ λ ) ⁢ p ⁡ ( 𝒜 i | ℒ λ , ℬ i ) ⁢ p ⁡ ( ℬ i ) =   ⁢ P ⁡ ( ℒ λ | 𝒳 ) ⁢ p ⁡ ( 𝒜 i | ℒ λ , ℬ i ) ⁢ p ⁡ ( 𝒳 ) ⁢ p ⁡ ( ℬ i ) ( 3 )

where the second equation holds because (unary measurement set) does not depend on i (binary measurement set) and i (uncertainty of the binary measurement set), and the third equation holds because λ and i are independent. Since there is no knowledge about and i , p() and p( i ) are constants. Substituting (3) into (2) produces: $$ p ⁡ ( ℒ i θ i | 𝒳 , 𝒜 i , ℬ i ) = ∑ { ω θ j ∈ Ω , j ∈ N i } ⁢ P ⁡ ( ℒ θ i | 𝒳 ) ⁢ p ⁡ ( 𝒜 i | ℒ θ i , ℬ i ) ∑ ω λ ∈ Ω ⁢ ∑ { ω θ j ∈ Ω , j ∈ N i } ⁢ P ⁡ ( ℒ λ | 𝒳 ) ⁢ p ⁡ ( 𝒜 i | ℒ λ , ℬ i ) ( 4 )

Assuming that the events in the λ are independent, it follows that: $$ P ⁡ ( ℒ λ | 𝒳 ) = P ⁡ ( θ i = ω λ | x i ) ⁢ ∏ j ∈ N i ⁢   ⁢ P ⁡ ( θ j = ω θ j | x j )

Since A ij only depends on the ith and jth events in λ and B ij , and since A ij s are independent from each other, the following is true: $$ p ⁡ ( 𝒜 i | ℒ λ , ℬ i ) = ∏ j ∈ N i ⁢ p ⁡ ( 𝒜 ij | θ i = ω λ , θ j = ω θ j , B ij )

With the following simple notation $$ P j λ = P ⁡ ( θ j = ω θ j | x j ) ⁢ p ⁡ ( 𝒜 ij | θ i = ω λ , θ j = ω θ j , B ij )

it follows that: $$ ∑ { ω θ j ∈ Ω , j ∈ N i } ⁢ P ⁡ ( ℒ λ | 𝒳 ) ⁢ p ⁡ ( 𝒜 i | ℒ λ , ℬ i ) ⁢ ⁢ =   ⁢ P ⁡ ( θ i = ω λ | x i ) ⁢ ∑ ω θ i ∈ Ω ⁢ P 1 λ ⁢   ⁢ … ⁢   ⁢ ∑ ω θ N ∈ Ω ⁢ P 𝒩 λ =   ⁢ P ⁡ ( θ i = ω λ | x i ) ⁢ ∏ j ∈ N i ⁢ ∑ ω θ j ∈ Ω ⁢ P j λ ( 5 )

Substituting (5) into (4) leads immediately to $$ P ⁡ ( θ i = ω θ i | 𝒳 , 𝒜 i , ℬ i ) = P ⁡ ( θ i = ω θ i | x i ) ⁢ 𝒬 ⁡ ( θ i = ω θ i )   ⁢ ∑ ω λ ∈ Ω ⁢ P ⁡ ( θ i = ω λ ) ⁢ 𝒬 ( n ) ⁡ ( θ i = ω λ ) ( 6 )

where the support function is given by $$ 𝒬 ⁡ ( θ i = ω α ) =   ⁢ ∏ j ∈ N i ⁢   ⁢ ∑ ω β ∈ Ω ⁢ P j β =   ⁢ ∏ j ∈ N i ⁢ ∑ ω β ∈ Ω ⁢ P ⁡ ( θ j = ω β | x j )   ⁢ p ⁡ ( 𝒜 ij | θ i = ω α , θ j = ω β , B ij ) ( 7 )

where the first item in the summation is the similarity function, and the second is the compatibility function that takes into account explicitly the uncertainty measurement Bij.

Based on (6), the labeling probability is updated in a relaxation scheme according to the following iterative equation: $$   P ⁡ ( n + 1 ) ⁢ ( θ i = ω θ i ) = P ( n ) ⁡ ( θ i = ω θ i ) ⁢ 𝒬 ( n ) ⁡ ( θ i = ω θ i )   ⁢ ∑ ω λ ∈ Ω ⁢ P ( n ) ⁡ ( θ i = ω λ ) ⁢ 𝒬 ( n ) ⁡ ( θ i = ω λ ) ( 8 )

Where n is the iteration number, and P (0) (θ i =ω θ i )=P(θ i =ω θ i |x i ). The iteration process terminates if the change in the probabilities is less than a predefined small value or the maximum number of iterations is reached.

As has been mentioned above, candidate curves in the right view for the current curve a j in the left view are found by the epipolar geometry. This is equivalent to reducing the model label set for a j from Ω to Ω j in the above derivations. Since the size of Ω j is usually much smaller than that of Ω, the computational efficiency of the relaxation process is increased considerably.

2. Adapted Framework With Combined Measurements

In the present invention, the unary and binary measurements depend on information in both object and model space (i.e., left and right image 410 , 412 ). Therefore, measurements for combined object-model pairs are considered. Namely, let x i (α) (αε 0 ) be the combined unary measurement defined for the pair of the ith object and the αth model. The unary measurement of object a i , x i , is then itself a set of combined unary measurements, i.e., {x i (α) |αε 0 }. Let A ij (αβ) (αε 0 ,βε 0 ) be the combined binary measurement defined for two object-model pairs (i,α) and (j,β). Then, the binary measurement A ij is itself a set of combined binary measurements, i.e., {A ij (αβ) |αε 0 ,βε 0 }.

In order to adapt the framework for working with the combined measurements, a similarity function is first considered, as discussed in Structural matching in computer vision using probabilistic relaxation by William J. Christmas, Josef Kittler, and Maria Petrou, IEEE Trans. PAMI, 17(8):749-764, August 1995, which is incorporated herein by reference. Since the event θ j =ω β does not depend on the combined unary measurements other than the x j (β) , it follows that:

P (θ j =ω β |{x j (β) |βε 0 })= P (θ j =ω β |x j (β) )  (9)

Similarly, ij (αβ) 's are independent of each other, and hence: $$ p ⁡ ( A ij | θ i = ω α , θ j = ω β , B ij ) $$ = p ⁡ ( { A ij kl } | θ i = ω α , θ j = ω β , B ij ) = ∏ k ∈ ℳ 0 l ∈ ℳ 0 ⁢   ⁢ p ⁡ ( A ij kl | θ i = ω α , θ j = ω β , B ij )

For A ij (kl) which are not equal to A ij (αβ) (i.e., k and l are not matched with i and j), there is no information about how to compute the binary measurement A ij (kl) . Hence, it is assumed that the density function is a uniform distribution, i.e., a constant, within its domain. In consequence, it follows that: $$ p ⁡ ( A ij | θ i = ω α , θ j = ω β , B ij ) = ε ⁢   ⁢ p ⁡ ( A ij ( αβ ) | θ i = ω α , θ j = ω β , B ij ) ( 10 )

where {A ij (kl) } is the abbreviation of {A ij (kl) |kε 0 ,lε 0 } and ε=Π {kl≠αβ} p(A ij (kl) |B ij ) is a constant. Thus, by substituting (10) and (9) into (7),(7) into (6), and eliminating the constant, ε, (6) can be rewritten as: $$ P ⁡ ( θ i = ω θ i | 𝒳 , 𝒜 i , ℬ i ) = P ⁡ ( θ i = ω θ i | x i ( θ i ) ) ⁢ 𝒬 ⁡ ( θ i = ω θ i ) ∑ ω γ ∈ Ω ⁢ P ⁡ ( θ i = ω λ | x i ( λ ) ) ⁢ 𝒬 ⁡ ( θ i = ω γ ) ( 11 )

and (7) as: $$ 𝒬 ⁡ ( θ i = ω α ) =   ⁢ ∏ j ∈ 𝒩 i ⁢   ⁢ ∑ ω β ∈ Ω ⁢ P j β =   ⁢ ∏ j ∈ N i ⁢ ∑ ω β ∈ Ω ⁢ P ⁡ ( θ = ω β | x j ( β ) ) =   ⁢ p ⁡ ( 𝒜 ij ( αβ ) | θ i = ω α , θ j = ω β , B ij ) ( 12 )

B. The Combined Unary Measurement and the Similarity Function

A combined unary measurement invariant to similarity (scaled Euclidean) transformation is developed below and the similarity function is computed based on it. It should be noted that preferably only selected seed points on both the left and the right curves are considered; the right seed points are obtained by intersecting the epipolar lines of the left seed points with the curve in the right image; and for each seed point on the left curve and its corresponding point on the right curve, a correlation score is computed between their neighborhoods. In addition, it is ensured that the score computation is less sensitive to the image transformation.

1. Seed Score

FIG. 5 is a neighborhood of a seed point in the left image and its correspondence in the right image of the working example of FIG. 4 . For each seed point k L in the left image, a neighborhood (k L ) is assigned. The neighborhood (l R ) of the corresponding seed point l R on the right image is defined by (k L ) and a similarity transformation.

A similarity transformation can be of the following form:

  x′=sR θ x+t   (23)

where s is the scale, R θ is the rotation matrix with angle θ, and t is the translation vector. It maps a point x in one image to a point x′ in the other. If there are two pairs of matched points (p 1 ,p′ 1 ) and (p 2 ,p′ 2 ) the following can be obtained: $$ &AutoLeftMatch; { s = &LeftBracketingBar; &RightBracketingBar; ⁢ p 1 ′ - p 2 ′ ⁢ &LeftBracketingBar; &RightBracketingBar; &LeftBracketingBar; &RightBracketingBar; ⁢ p 1 - p 2 ⁢ &LeftBracketingBar; &RightBracketingBar; cos ⁢   ⁢ θ = ( p 1 - p 2 ) _ · ( p 1 ′ - p 2 ′ ) _ t = [ ( p 1 ′ + p 2 ′ ) - s ⁢   ⁢ R θ ⁡ ( p 1 + p 2 ) ] ⁢ 2

where {overscore (v)} denotes the normalized vector of v.

The similarity transformation can be estimated from a pair of points inside the neighborhood and their corresponding points in the right image. The pair of seed points are already obtained, and another pair requires selection. The extreme point of (k L ) can be chosen along the curve, p 1 , and its corresponding point p′ 1 can be computed by intersecting the epipolar line of p 1 , p1 , with the curve in the right image. The estimation of the similarity transformation from two pairs of points was given above.

The seed score is computed as the correlation between these two corresponding neighborhoods, and is given by: $$ S ⁡ ( k ℒ , l ℛ ) = ∑ ξ ∈ 𝒩 ⁡ ( k ℒ ) η ∈ 𝒩 ⁡ ( l ℛ ) ⁢ [ I ℒ ⁡ ( ξ ) - I _ ⁡ ( k ℒ ) ] ⁢ ⌊ I ℛ ⁡ ( η ) - I _ ⁡ ( l ℛ ) ⌋ 𝒩 n ⁢ σ ⁡ ( I k ℒ ) ⁢ σ ⁡ ( I l ℛ ) ( 13 )

where I i (χ) is the intensity value on a point χ in the ith image, (χ) is the neighborhood for seed point χ, η is a point in the second image corresponding to point ξ in the first image according to the similarity transformation described above, and n is the number of points in the neighborhood. The details of computing the mean ({overscore (I)}(χ)) and the standard deviation (σ(χ)) in (χ) can be found in Epipolar geometry in stereo by Gang Xu and Zhengyou Zhang. Motion and Object Recognition, Kluwer Academic Publishers, 1996, which is incorporated herein by reference. The correlation score thus computed is invariant under the similarity transformation.

2. The Curve Score as the Combined Unary Measurement

The curve score (i,j) for the ith curve in the left image 410 and the jth curve in the right image 412 , which is the combined unary measurement in the context, is the average of all possible seed scores. That is, $$ ℒ ⁡ ( i ℒ , j ℛ ) = 1 𝒩 i ⁢ ∑ k ℒ ∈ Sd ⁡ ( i ℒ ) l ℛ ∈ Sd ⁡ ( j ℛ ) ⁢ S ⁡ ( k ℒ , l ℛ ) ( 14 )

where , is total number of seed points on i, and Sd(i) and Sd(j) are the seed point sets of the left and right curves, respectively.

3. Similarity Function

The similarity function can be computed as follows. The combined unary measurement x i (α) in (11) is a scalar, and is denoted by χ i α . It is equal to (θ i ,ω α ) computed above. According to Bayes' theorem, $$ P ⁡ ( θ i = ω θ i | x i ( α ) ) = p ⁡ ( x i ( α ) | θ i = ω α ) ⁢ P ^ ⁡ ( θ i = ω α ) ∑ ω λ ∈ Ω ⁢ p ⁡ ( x i ( α ) | θ i = ω λ ) ⁢ P ^ ⁡ ( θ i = ω λ ) ( 15 )

where {circumflex over (P)}(θ i =ω λ ) is the prior probability equal to a prefixed value ζ if λ=0(i.e., no match), and to (1−ζ)/ 0 otherwise. It is assumed that p(x i (λ) |θ i =ω λ )=(μ l ,σ l ). The value of μ l and σ l can be computed from the histogram of x i (λ) using the initial matches. The initial matches could be obtained by selecting only the labeling with x i (λ) that is the highest in both {x i (β) |βε 0 } and {x j (γ) |jε 0 }.

The unary measurements are used in (15) to compute P(θ i =ω α |x i (α) ). It is then used to initialize the relaxation scheme, that is:

P (0) (θ i =ω α )= P (θ i =ω α |x i (α) ).

It should be noted that since the unary measurement is similarity invariant, there is no need to introduce a motion related term for the computation of the similarity function.

C. The Combined Binary Measurement and the Compatibility Function

In order to efficiently compute combined binary measurements, a curve is approximated by a set of line segments connected by the seed points mentioned above. This approximation is accurate provided that an edge chain is broken at the high curvature points (to be detailed below), and that seed points are not very far from each other. A set of combined binary measurements for the line segments is developed in the present invention. These measurements are grouped together in an optimal way to form the combined binary measurements for curves. The compatibility function for curves can then be computed. The uncertainty measurements for the combined binary measurements are also provided.

1. Combined Binary Measurements for Line Segments

As mentioned above, the similarity transformation is a reasonable mapping from a neighborhood in one image to the corresponding neighborhood in the other. FIG. 6 , is a configuration of two pairs of line segments in both images of the working example of FIG. 4 wherein two pairs of line segments are shown. The similarity transformation x′=sR θ x+t can be computed from (p 1 ,p′ 1 ) and (p 2 ,p′ 2 ) as described above for similarity transformation.

The following expression, b 1 =sR θ q 1 +t, b 2 =sR θ q 2 +t, is computed and forms a random vector z as the follows:

z=[v 1 (χ) ,v 1 (y) ,v 2 (χ) ,v 2 (y) ] T   (16)

where v 1 =b 1 −q′ 1 , and v 2 =b 2 −q′ 2 . Ideally, if the local similarity transformation is valid and the point coordinates are noise-free, the result is z=0. Typically, these conditions are not satisfied in practice, and thus, it is assumed that the components of z are i.i.d, and have the same standard deviations σ, i.e., z= z (0,Σ) where Σ=diag({σ}).

There are several advantages of the binary measurements z given here over the traditional ones. First, measurements are invariant under the similarity transformation. Traditional measurement, such as the distance between the midpoints of line segments, may suffer from the scale change between views. Also, the set of binary measurements is complete. Under similarity transformation, two pairs of line segments have 8 equations, and there are 4 degrees of freedom for the similarity transformation. Therefore, the number of invariants is equal to 4, and the same number of measurements is produced. Further, measurements are evaluated in the same physical space, namely, they are quantified in pixels in the second image. This means that only one a for all the measurements is needed, whose computation is given below.

2. Combined Binary Measurement for Curves and the Compatibility Function

A pair of curves a i and a j is now considered. The numbers of line segments are defined as i and j , respectively. For each line segment on the shorter curve, the closest segment from the other curve is selected, and measurement z as defined in (16) is computed. The rationale of choosing the closest line segments is that the similarity transformation better applies to a small neighborhood than to a larger one. For the vector set {z j |jε[1, . . . , ]}, where =min ( i , j ), the following measurement vector is considered:

{tilde over (z)}=ζ 1 z 1 + . . . +ζ z   (17)

where ζ's are coefficients and $$ ∑ k = 1 K ⁢   ⁢ Ϛ k = 1.

It is obvious that {tilde over (z)} is also a joint Gaussian with {tilde over (z)}= {tilde over (z)} (0,{tilde over (Σ)}) where {tilde over (Σ)}=diag[{{tilde over (σ)}}], and

{tilde over (σ)} 2 =ζ 1 2 σ 1 2 + . . . +ζ 2 σ 2   (18)

Next, ζ j is selected to minimize (18), which yields $$ Ϛ i = [ σ i 2 ⁢ ∑ j = 1 K ⁢   ⁢ σ j - 2 ] - 1 ( 19 )

Equation (17) is an unbiased estimate of the measurement error with minimal variance. The compatibility function is then given by $$ p ⁡ ( A ij ( αβ ) | θ i = ω α , θ j = ω β , B ij ) = p ⁡ ( z ~ | θ i = ω α , θ j = ω β , ∑ ~ ) = 𝒩 z ~ ⁡ ( 0 , ∑ ~ ) ( 20 )

where A ij (αβ) ={tilde over (z)} is the combined binary measurements, and B ij ={tilde over (Σ)} is the uncertainty measurements.

3. The Distance Between Segments and the Standard Deviation

The standard deviation σ of vector z in (17) should be a function of the distance between the line segments. This is because the local similarity assumption becomes weaker when becomes larger. The function that is used is: $$ σ ⁡ ( d ) = ρ 2 ⁢ π ⁡ [ ( 1 - γ ) ⁢ ( 1 - l - λ 2 r 2 ) + γ ] ( 21 )

where ρ=min(,), and are respectively the image width and height, τ is a positive scalar that controls the range within which the contribution from neighboring segment is effective, and γ={square root over (2πσ 0 /ρ)} where σ 0 is the desired standard deviation when the neighboring segment is very close to the segment under consideration. Several observations can be made for the function defined in (21):

Namely, when is small, σ()≈σ 0 a which is the desired standard deviation when neighboring segments are close. Also, when is much larger than τ,σ()≈ρ/{square root over (2π)}. In this case, z (0,Σ)≈1/ρ 4 , indicating that the probabilistic density function approaches to a uniform distribution, and provides no information about the compatibility between the two pairs of line segments. Further, the intermediate value of or σ() varies smoothly between the above two extreme cases.

As a consequence of the second point above, when all the distance measurements { j |jε[1, . . . , ]} are much larger than τ, the compatibility function in (20) is approximately a constant 1/ρ 4 . As a result, if all the other curves are far from the current curve a i , it is not difficult to see, from (8) and the definition of , that P (n+1) (θ i =ω θ i )=P (n) (θ i =ω θ i ). This is in accordance with the above that the labeling probability cannot be improved when the neighborhood support is weak.

The adjustment of the parameter τ depends on the type of the scene in question. If the scene is close to the image producing device, such as a camera, there is a severe perspective distortion, and τ needs to be small enough to discard the support from curves far away. On the other hand, if the scene is far from the camera, τ could be large in order to include support from as many neighboring curves as possible.

D. Preprocessing

In the present invention, as described above, computational complexity is reduced if a seed point on one curve matches at most one seed point on the other. Also, it is assumed that in computing binary measurements, a curve is approximated by a piece-wise linear model with line segments. Two preprocessing techniques described below can be used to ensure that a seed point on one curve matches at most one seed point (epipolar breaking) and that the binary measurements are computed with a curve approximated by a piece-wise linear model (high curvature breaking). It should be noted that any suitable technique can be used to achieve the above.

1. Epipolar Breaking

When intersecting with a curve, an epipolar line may cut the same curve several times. In order to reduce the matching complexity, the epipolar line of a seed point in one image cuts at most once the corresponding curve in the other image. The technique described below breaks curves into shorter pieces, and thus, each piece only cuts an epipolar line once.

FIG. 7 is a computation of the high curvature and the epipolar breakpoint of the working example of FIG. 4 in accordance with the present invention. The epipolar breaking technique of the present invention is based on the following observations. First, the only epipolar line passing through a given point p on a curve in one image is the line connecting point p and epipole l in that image, as shown in FIG. 7 . Second, it is impossible for a curve to have multiple intersections with an epipolar line if there is no point on the curve whose tangent vector is parallel to the epipolar line passing through that point. As such, it follows that if a curve can be broken at the point p where the tangent vector T(p) is parallel to the epipolar line e p , the problem will be solved.

Namely, the cosine of the angle between the tangent vector and the epipolar line is computed:

ε p ={overscore (T( p ))}· {overscore (e p )}

where {overscore (v)} is the normalized vector of v. As depicted in FIG. 7 , an index worm w p (s)=p+s,s=[−, . . . , ] of size 2+1, centered on the pth edge point, crawls along the edge chain, and ε p is computed each time when an edge point is visited. The tangent vector T(p) is approximated by V 2 in FIG. 7 . The original edge chain is broken at point p if its ε p is the local maxima or minima, and the absolute value |ε p | is larger than a predefined threshold (for example, 0.99 in one implementation). Therefore, curves are preferably not broken at reflection points.

2. High Curvature Breaking

In order to have a good piecewise linear approximation to a curve, it is necessary to break the curve at points with high curvature. The high curvature breaking technique works in a very similar way as the epipolar breaking technique described above. For instance, the curvature is approximated by $$ 𝒦 p = &LeftBracketingBar; &RightBracketingBar; ⁢ 𝒯 1 _ - 𝒯 2 _ ⁢ &LeftBracketingBar; &RightBracketingBar; &LeftBracketingBar; &RightBracketingBar; ⁢ 𝒯 1 ⁢ &LeftBracketingBar; &RightBracketingBar; + &LeftBracketingBar; &RightBracketingBar; ⁢ 𝒯 2 ⁢ &LeftBracketingBar; &RightBracketingBar; ( 22 )

where 1 =C(w p ())−C(w p (0)), 2 =C(w p (0))−C(w p (−)), and j denotes the normalized vector of j . The original edge chain is broken at point p if its curvature p is the local maxima and is larger than a predefined threshold (0.85 in one implementation).

VI. Conclusion

The present invention performs curve matching within a probabilistic relaxation framework for determining a geometrical representation of a scene. Novel combined unary and binary measurements of the present invention are used in this framework, which are similarity-invariant. Also, the uncertainty in binary measurements is explicitly modeled, which is very important in computing the matching support from neighboring matches. Preprocessing techniques, such as epipolar breaking and high curvature breaking, contributing to the success of the curve matching have been developed and described.

The foregoing description of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto.

Claims

1. A method for matching sets of corresponding curves, wherein each curve represents a portion of corresponding images, comprising:performing epipolar breaking to break the curves into shorter pieces so that a seed point on one of the curves matches no more than one seed point on another corresponding curve, wherein said epipolar breaking comprises breaking a curve into parts at points where a tangent line of the curve is parallel to the epipolar line passing through that point; representing each curve with line segments; computing representative measurements for each line segment of each curve; matching the line segments between corresponding curves of the images; and progressively modeling uncertainty in the representative measurements for reducing ambiguities in the matching.

2. The method of claim 1, wherein matching the line segments includes computing similarity-invariant measurements for each line segment.

3. The method of claim 2, wherein the similarity-invariant measurements are computed with binary measurements.

4. The method of claim 1, further comprising computing similarity-invariant unary measurements for each line segment.

5. The method of claim 1, wherein the line segments are created by approximating a piece-wise linear model with the line segments.

6. The method of claim 1, wherein the similarity-invariant measurements for each line segment includes a combination of unary and binary measurements.

7. The method of claim 1, further comprising determining similarities between the curves and compatibilities of the curves among neighborhood matches of the curves.

8. A method for matching a first curve of a first image to at least a second curve of a second image, comprising:performing epipolar breaking to break the curves into shorter pieces so that a seed point on one of the curves matches no more than one seed point on the other curve, wherein said epipolar breaking comprises breaking a curve into parts at points where a tangent line of the curve is parallel to the epipolar line passing through that point, unless said point is a reflection point; representing each curve with plural line segments; matching the line segments of the first curve to the line segments of the second curve by computing similarity-invariant binary measurements for each line segment of each curve; combining the binary measurements; and progressively modeling uncertainty in the combined binary measurements for reducing ambiguities in matching.

9. The method of claim 8 further comprising computing similarity-invariant unary measurements for each line segment for corner guidance.

10. The method of claim 9, wherein the unary measurements determine attributes representing at least one of orientation of a curve, intensity in a predefined neighborhood of a curve and local shape characteristics of a curve.

11. The method of claim 9, wherein the similarity-invariant measurements for each line segment includes a combination of unary and binary measurements.

12. The method of claim 8, wherein the binary measurements include attributes representing angle and distance between a pair of neighboring curves.

13. The method of claim 8, wherein the line segments are created by approximating a piece-wise linear model with the line segments.

14. A method for matching a first curve of a first image to a second curve of a second image, each being represented by line segments in an epipolar geometrical relationship, the method comprising:determining whether each curve intersects an epipolar line more than once; breaking the curve into multiple curves if the curve intersects an epipolar line more than once, wherein said breaking comprises breaking the curve at Points where a tangent line of the curve is parallel to the epipolar line passing through that point; representing each curve associated with the first and second curves with plural line segments; matching the line segments of the curves associated with the first curve to the line segments of the curves associated with the second curve by computing similarity-invariant measurements for each line segment of each curve; and progressively modeling uncertainty in the measurements for reducing ambiguities in matching.

15. The method of claim 14, further comprising ensuring that the curves approximate a suitable piece-wise linear model.

16. The method of claim 15, wherein ensuring that the curves approximate a suitable piece-wise linear model includes breaking the curves at high curvature points.

17. The method of claim 15, wherein the similarity-invariant measurements are computed with binary measurements.

18. The method of claim 17, further comprising computing similarity-invariant unary measurements for each line segment.

19. The method of claim 18, wherein the similarity-invariant measurements for each line segment includes a combination of the unary and the binary measurements.

20. The method of claim 18, wherein the binary measurements determine similarities between the curves and compatibilities of the curves among neighborhood matches of the curves.

21. The method of claim 18, wherein the unary measurements determine attributes representing at least one of orientation of a curve, intensity in a predefined neighborhood of a curve and local shape characteristics of a curve.

22. The method of claim 15, further comprising determining similarities between the curves and compatibilities of the curves among neighborhood matches of the curves.