US20050123191A1 - System and method for progressive stereo matching of digital images - Google Patents
System and method for progressive stereo matching of digital images Download PDFInfo
- Publication number
- US20050123191A1 US20050123191A1 US11/028,416 US2841604A US2005123191A1 US 20050123191 A1 US20050123191 A1 US 20050123191A1 US 2841604 A US2841604 A US 2841604A US 2005123191 A1 US2005123191 A1 US 2005123191A1
- Authority
- US
- United States
- Prior art keywords
- pixel
- correlation
- pixels
- progressive
- module
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/97—Determining parameters from multiple pictures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/50—Depth or shape recovery
- G06T7/55—Depth or shape recovery from multiple images
- G06T7/593—Depth or shape recovery from multiple images from stereo images
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/20—Image preprocessing
- G06V10/24—Aligning, centring, orientation detection or correction of the image
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V20/00—Scenes; Scene-specific elements
- G06V20/60—Type of objects
- G06V20/64—Three-dimensional objects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/10—Image acquisition modality
- G06T2207/10004—Still image; Photographic image
- G06T2207/10012—Stereo images
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N13/00—Stereoscopic video systems; Multi-view video systems; Details thereof
- H04N13/20—Image signal generators
- H04N13/204—Image signal generators using stereoscopic image cameras
- H04N13/239—Image signal generators using stereoscopic image cameras using two 2D image sensors having a relative position equal to or related to the interocular distance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N13/00—Stereoscopic video systems; Multi-view video systems; Details thereof
- H04N13/20—Image signal generators
- H04N13/204—Image signal generators using stereoscopic image cameras
- H04N13/243—Image signal generators using stereoscopic image cameras using three or more 2D image sensors
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N13/00—Stereoscopic video systems; Multi-view video systems; Details thereof
- H04N2013/0074—Stereoscopic image analysis
- H04N2013/0081—Depth or disparity estimation from stereoscopic image signals
Abstract
System and method for progressive stereo matching of digital images representing a scene. In general, the progressive stereo matching system includes an initialization module, that obtains a set of previous unambiguous matches of pixels within the digital images, and a search range module, that determines a search range in the first and second digital images to look for a candidate pixel match. The progressive stereo matching system also includes a correlation module, that computes a correlation score between the candidate pixel match, and a classification module, that classifies the pixel match based on its correlation score.
Description
- This application is a divisional application of U.S. patent application Ser. No. 09/564,839, entitled “System and Method for Progressive Stereo Matching of Digital Images,” filed May 4, 2004, now U.S. Pat. No. 6,606,406, issued Aug. 12, 2003, the entire contents of which are hereby incorporated by reference.
- 1. Field of the Invention
- The present invention relates in general to computer vision and more particularly to a method and a system for progressive stereo matching of digital images that represent a scene.
- 2. Related Art
- Stereo matching of digital images is widely used in many computer vision applications (such as, for example, fast object modeling and prototyping for computer-aided drafting (CAD), object segmentation and detection for human-computer interaction (HCI), video compression, and visual surveillance) to provide three-dimensional (3-D) depth information. Stereo matching obtains images of a scene from two or more cameras positioned at different locations and orientations in the scene. These digital images are obtained from each camera at approximately the same time and points in each of the image are matched corresponding to a 3-D point in space. In general, points from different images are matched by searching a portion of the images and using constraints (such as an epipolar constraint) to correlate a point in one image to a point in another image.
- Several types of matching techniques exist and generally may be classified into two broad categories: feature matching and template matching. Feature matching extracts salient features from the images (such as corners and edge segments) and matches these features across two or more views. One disadvantage of feature matching, however, is that only a small subset of image pixels is used to match features. This means that if image pixels used in the matching process are unreliable then only a coarse and inaccurate 3-D representation of the actual scene is produced. Template matching uses an assumption that portions of images have some similarity and attempts to correlate these similarities across views. Although this assumption may be valid for relatively textured portions of an image and for image pairs having only small differences, the assumption may lead to unreliable matching at occlusion boundaries and within featureless regions of an image. In addition, template matching yields many false matches due in part to the unreliability of matched image pixels.
- These and other existing stereo matching techniques have the disadvantage of having difficulty specifying an appropriate search range and being unable to adapt the search range depending on the observed scene structure. Existing dense matching techniques use the same search range (such as a small search window) for the entire image and thus may yield many false matches. In addition, some matching techniques consider only one match at a time and propagate the match in a small area, which also has the disadvantage of yield many false matches.
- Accordingly, what is needed is a method and system for stereo matching that is capable of reducing false matches by adapting a search range depending on the scene structure. Further, this method and system would start with reliable pixel matches and progressively add reliable and unambiguous matches. What is also needed is a method and system for stereo matching that uses an adaptable search range that is dynamically determined by unambiguous pixel matches. Whatever the merits of the above-mentioned systems and methods, they do not achieve the benefits of the present 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 includes a method and system for performing progressive stereo matching of digital images. In particular, the present invention uses a progressive iterative technique that uses a disparity gradient limit principle and a least commitment strategy to determine generally unambiguous pixel matches. The progressive iterative method of the present invention begins with a few reliable pixel matches and during successive iterations finds progressively more unambiguous pixel matches based on a novel correlation technique and a correlation score associated with a pixel match. Unambiguous pixel matches found in a previous iteration are used to define search ranges for subsequent pixels to reliably and efficiently determine matches in a current iteration. The present invention eliminates the problems of dense matching techniques whereby the same search range is used for the entire image. In the present invention, potentially false matches are reduced by dynamically changing the search range based on unambiguous matches found in previous iterations.
- The present invention provides reliable and accurate pixel matching that begins with a reliable set of pixel matches and quickly adds a greater number of reliable pixel matches based on a pixel correlation. In addition, because at each step of the process the pixel matches are unambiguous, the present invention is highly efficient and fast because backtracking due to unreliable pixel matches is eliminated. Unlike many prior stereo matching techniques, the present invention works well with images containing featureless regions and is capable of changing an orientation of a search range based on the current set of reliable pixel matches.
- In general, the method of the present invention includes determining a set of reliable (or unambiguous) pixel matches and progressively adding a greater number of unambiguous pixel matches to the set. The initial set of reliable pixel matches may be obtained either automatically (using a suitable matching technique that yields reliable pixel matches) or manually (such as through user input). Pixel matches are sought by defining a search range for each image and examining pixels within the search ranges for potential matches. The search range is capable of being rotated, and is part of a novel correlation technique of the present invention that provides a more robust estimate of pixel match reliability. After an iteration the set of reliable pixel matches acts as a constraint and helps define a new search range. This dynamic search range reduces potential matching ambiguities and increases the robustness of the process. Potential pixel matches found in the search ranges are tested for ambiguity and any unambiguous matches are selected and added to the set of reliable pixels matches. The ambiguity testing includes determining a correlation score for the pixel match and classifying the match based on the correlation score. The present invention also includes a system for progressive image matching that incorporates the method of the present invention.
- 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.
- The present invention can be further understood by reference to the following description and attached drawings that illustrate the preferred embodiments. Other features and advantages will be apparent from the following detailed description of the invention, taken in conjunction with the accompanying drawings, which illustrate, by way of example, the principles of the present invention.
- 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 present invention. -
FIG. 2 is a general block diagram illustrating a system incorporating the stereo matching module of the present invention for computer vision applications. -
FIG. 3 is a general block diagram of the stereo matching module of the present invention shown inFIG. 2 . -
FIG. 4 is a general flow diagram of the operation of the present invention. -
FIG. 5 is a general flow diagram of the operation of the search range module shown inFIG. 3 . -
FIG. 6 is a detailed flow diagram illustrating a preferred embodiment of the present invention. -
FIG. 7 illustrates the novel correlation technique between two images of the present invention -
FIG. 8 is a working example ofFIG. 4 whereby stereo matching of images representing a scene is performed in accordance with the present invention. -
FIGS. 9A-9D illustrate the standard deviations of the predicted disparities for various iterations of the working example ofFIG. 8 . -
FIG. 10 illustrates a view of a 3-D Euclidean reconstruction of the scene of the working example ofFIG. 8 . - In the following description of the invention, reference is made to the accompanying drawings, which form a part thereof, and in which is shown by way of illustration a specific example whereby 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 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 a variety of computer system configurations, including personal computers, server computers, 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 computer storage media including 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 conventionalpersonal computer 100, including aprocessing unit 102, asystem memory 104, and asystem bus 106 that couples various system components including thesystem memory 104 to theprocessing unit 102. Thesystem 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 (BIOS) 114, containing the basic routines that help to transfer information between elements within thepersonal computer 100, such as during start-up, is stored inROM 110. Thepersonal computer 100 further includes ahard disk drive 116 for reading from and writing to a hard disk, not shown, amagnetic disk drive 118 for reading from or writing to a removablemagnetic disk 120, and anoptical disk drive 122 for reading from or writing to a removableoptical disk 124 such as a CD-ROM or other optical media. Thehard disk drive 116,magnetic disk drive 128 andoptical disk drive 122 are connected to thesystem bus 106 by a harddisk drive interface 126, a magneticdisk drive interface 128 and an opticaldisk 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 thepersonal computer 100. - Although the exemplary environment described herein employs a hard disk, a removable
magnetic disk 120 and a removableoptical disk 124, it should be appreciated by those skilled in the art that other types of computer readable media that 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 (ROMs), 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 orRAM 112, including anoperating system 132, one ormore application programs 134,other program modules 136 andprogram data 138. A user (not shown) may enter commands and information into thepersonal computer 100 through input devices such as akeyboard 140 and apointing device 142. In addition, a camera 143 (or other types of imaging devices) may be connected to thepersonal computer 100 as well as other input devices (not shown) including, for example, a microphone, joystick, game pad, satellite dish, scanner, or the like. These other input devices are often connected to theprocessing unit 102 through aserial port interface 144 that is coupled to thesystem bus 106, but may be connected by other interfaces, such as a parallel port, a game port or a universal serial bus (USB). Amonitor 146 or other type of display device is also connected to thesystem bus 106 via an interface, such as avideo adapter 148. In addition to themonitor 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 aremote computer 150. Theremote 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 thepersonal computer 100, although only amemory storage device 152 has been illustrated inFIG. 1 . The logical connections depicted inFIG. 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 the Internet. - When used in a LAN networking environment, the
personal computer 100 is connected to thelocal network 154 through a network interface oradapter 158. When used in a WAN networking environment, thepersonal computer 100 typically includes amodem 160 or other means for establishing communications over thewide area network 156, such as the Internet. Themodem 160, which may be internal or external, is connected to thesystem bus 106 via theserial port interface 144. In a networked environment, program modules depicted relative to thepersonal computer 100, or portions thereof, may be stored in the remotememory storage device 152. 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. - II. Introduction
- The method and system of the present invention includes a progressive matching technique that uses a disparity gradient limit principle and a least commitment strategy to provide reliable and efficient image matching. The disparity gradient limit principle states that a disparity should vary smoothly throughout an image, and that disparity gradient should not exceed a certain threshold. The least commitment strategy states that the most reliable pixel matches should be selected first and decisions about unreliable pixel matches should be deferred until the more confidence can be achieved that the pixel match is reliable. The two approaches, along with a correlation approach that, in a preferred embodiment, uses a Bayesian inference framework, are used to provide reliable, efficient and rapid matching of images.
- In general, the present invention includes an iterative matching technique that may be embodied in a computer hardware or software system that progressively matches digital images representing a scene to obtain 3-D structure information about the scene. The iterative matching process begins with a few reliable pixel matches that have been obtained in a suitable manner (such as from user input). For each iteration additional reliable pixel matches are added to the initial set of pixel matches according to the least commitment strategy so that the number of unmatched pixel is rapidly reduced. The set of reliable pixel matches constrains a search range for neighboring pixels according to the disparity gradient limit principle, thereby reducing potential matching ambiguities of the neighbors. A novel correlation technique allows a correlation window representing the search range to be rotated to provide a more robust estimate of the reliability of a pixel match.
- III. General Overview
- As shown in
FIGS. 2-10 for the purposes of illustration, the invention is embodied in a method and a system for progressive stereo matching of digital images that represent a scene.FIG. 2 is a general block diagram illustrating a system incorporating the stereo matching module of the present invention for computer vision applications. The system illustrated is only one example of several systems that could incorporate the progressive stereo matching method and system of the present invention. In general, thesystem 200 receives an input of digital images depicting a scene, shown inFIG. 2 as image (1) 210, image (2) 220 through image (N) 230. Each of theimages - The
system 200 includes astereo matching module 240 that receives theimages images computer vision applications 260 in any suitable manner such as, for example, to digitally reconstruct the scene for stereo vision applications. - The present invention reliably and accurately determines a 3-D structure of a scene using at least two input images. The present invention solves the problems discussed above of prior matching techniques by starting with a few reliable initial point matches and progressively adding new pixel matches during an iterative matching process. At each iteration only reliable and unambiguous matches are selected and added to a set of reliable pixel matches. In addition, the robustness of the present invention is increased by using a correlation match measure that allows rotation of the match template used to search for pixel matches.
- IV. Component Overview
-
FIG. 3 is a general block diagram of thestereo matching module 240 of the present invention shown inFIG. 2 . Thestereo matching module 240 illustrates a single iteration of themodule 240. In general, thestereo matching module 240 includes aninitialization module 310, which obtains reliable initial pixel matches and asearch range module 320, which determines a search range to look for candidate pixel matches. Moreover, thestereo matching module 240 includes acorrelation module 330, for computing a correlation score between pixel matches and aclassification module 340, for classifying a pixel match based on its correlation score. - The
stereo matching module 240 receives as input multiple images (box 350) representing a scene. At least two images are needed as input, and the multiple images may be obtained in any suitable manner, such as from a camera. Theinitialization module 310 obtains a few reliable seed pixel matches. These initial matches may be obtained either automatically or through user input. The initial pixel matches are sent to thesearch range module 320 that defines a search range based on the pixel matches. Pixels from each image within the search range are correlated by thecorrelation module 330. Based on how well the pixels correlate, theclassification module 340 assign a match label to the pixel match to indicate a pixel match, no pixel match or an unknown match at this time. Once enough pixel matches have been found (or a maximum number of iterations has occurred), thestereo matching module 240 outputs 3-D image information (box 360) regarding the 3-D structure of the scene. - V. Details of the Components and Operation
- The present invention uses a progressive technique to match pixels from different images and makes use of a disparity gradient strategy and a least commitment strategy. Based on these two approaches, the present invention provides a iterative progressive technique that starts with a few reliable seed matches and then finds progressively more pixel matches based on these two approaches. The following discussion describes these two approaches.
- 1. Disparity Gradient Limit Principle
- Disparity is a parameter that is directly related to depth. Accordingly, a change in disparity coincides with a change in depth. The disparity gradient limit principle states that the disparity should vary smoothly almost everywhere, and the disparity gradient should not exceed a certain value. Psychophysical studies have shown that in order for the human visual system to binocularly fuse two dots of a simple stereogram, a disparity gradient (the ratio of the disparity difference) between the dots to their cyclopean separation must not exceed a limit of 1. Objects in the real-world are usually bounded by continuous opaque surfaces, and the disparity gradient can be considered as a measure of continuity. The disparity gradient limit principle provides a constraint on scene jaggedness embracing simultaneously the ideas of opacity, scene continuity, and continuity between views. As explained further below, the disparity gradient limit principle is used in the present invention to estimate the uncertainty of a predicted disparity for a particular pixel. That uncertainty is then used to define search ranges for candidate pixel matches.
- 2. Least Commitment Strategy
- A least commitment strategy states that only the most reliable decisions should be selected first and any unreliable decisions should be postponed until enough confidence in the decision is accumulated. Because no irreversible decision is made (in other words, only reliable decisions are made), this strategy offers significant flexibility in avoiding a locking search into a possibly incorrect step where an expensive refinement (such as backtracking) would have to be exploited.
- The present invention uses the least commitment strategy in the following ways. First, the least commitment strategy is used by the present invention when defining a search range. If the match of a pixel has to be searched in a wide range, there is a high probability that the found match is not a correct one. It is preferable to defer matching of these pixels for as long as possible because the search range may be reduced later after more reliable matches are established.
- Second, the least commitment strategy is used by the present invention when search for matching pixels. In particular, a pixel is more discriminating in a highly textured neighborhood and it is difficult to distinguish pixels in the same neighborhood having similar intensity. Thus, more reliable matches for pixels are found in areas with strong textures, and the present invention attempts to match pixels in these areas first.
- Third, the present invention uses the least commitment strategy when determining whether a pixel has a match. Specifically, there may be several candidate matches for a pixel, and rather than using expensive techniques (such as dynamic programming) to resolve the ambiguity, the present invention defers any decision. Once more reliable matches are found in the future, the ambiguity will become lower because of a better disparity estimate having a smaller uncertainty.
- Finally, the present invention uses the least commitment strategy to efficiently keep track of the status of pixel matches. If a pixel does not have any candidate match, there is a good possibility the pixel is occluded by other pixels or is not in the camera's field of view. In this case, there is no need to search for a match for the pixel in the future. Similarly, if a match has already been found for the pixel, further search is not necessary. Both types of pixels are kept tracked by the present invention to increase efficiency and speed.
- 3. General Operation
- In general, the present invention uses a progressive iterative process to determine a set of previous unambiguous pixel matches, define a search range based on this set of previous unambiguous pixel matches, search for current unambiguous pixel matches within the search range and append current unambiguous pixel matches to the set of previous unambiguous pixel matches. This iterative process of increasing the set of previous unambiguous pixel matches by appending current unambiguous pixel matches and redefining the search range based on the set of previous unambiguous pixel matches continues until suitable matching has been achieved. The iterative process of the present invention progressively finds more and more unambiguous pixel matches and dynamically defines a search range based on these reliable pixel matches to reduce potential false matches and increase reliability and efficiency.
-
FIG. 4 is a general flow diagram of the operation of the present invention. Initially, at least two images are received as input (box 410). A set of previous unambiguous pixel matches then are determined (box 420). In general, if this is the first iteration the set of previous unambiguous pixel matches are obtained by finding a few reliable pixel matches in order to begin an iteration matching process. Otherwise, if this is a subsequent iteration, a set of previous unambiguous pixel matches obtained from previous iterations generally is used. The set of previous unambiguous pixel matches is used to define a search range (box 430). In particular, a size and an orientation of the search range is defined based on the set of previous unambiguous pixel matches and determines the location where the present invention will search for additional pixel matches within each of the images. - As discussed further below, the correlation technique of the present invention includes a search range that may be rotated in an image to permit a more reliable matching process. Pixels within the search range are obtained from each image and a correlation between the pixels is performed to compute a correlation score (box 440). Depending on the correlation score, a match label is assigned to the pixel (box 450). This match label specifies whether the pixel has been matched, not matched, or is still unknown. By way of example, one set of match labels (that are used in the example below) are MATCHED, NOMATCH and UNKNOWN.
- When pixels within the search range are matched these current unambiguous pixel matches are appended to the set of previous unambiguous pixel matches (box 460). This updated set of previous unambiguous pixel matches is used in subsequent iterations to redefine the search range (box 470). The present invention continues this iterative process of progressively finding new unambiguous pixel matches, adding them to the set of previous unambiguous pixel matches and redefining the search range until the images have been suitably matched. Suitably matched generally means, for example, that a maximum number of iterations have occurred or that no further pixel matches can be found.
-
FIG. 5 is a general flow diagram of the operation of the search range module shown inFIG. 3 . In general, a pixel from a first image is an input (box 510) and the disparity of the pixel is predicted (box 520). Next, an estimate is made concerning the uncertainty of the predicted disparity (box 530). A determination is made as to whether the predicted disparity is reliable (box 540) and, if not, a decision is deferred, and another pixel is selected pixel and the matching iteration is performed again. If the predicted disparity is reliable, the pixel is sent to thecorrelation module 330 to determine how well the pixel in the first image and the pixel in the second image correlate. - 4. Detailed Operation
-
FIG. 6 is a detailed flow diagram illustrating a preferred embodiment of the present invention. It should be noted that the present invention may be implemented in a variety of ways and actual implementation may vary from the following description. In this preferred embodiment, pixels in highly textured areas are considered first. Textureness is measured as the sample deviation of the intensity within a correlation window. Moreover, in order for a pixel in the first image to be considered its sample deviation must be larger than an intensity threshold value, TσI (called ThresholdSigmalntensity). The ThresholdSigmalntensity, TσI, evolves with each iteration and is given by a monotonic function that never increases with iteration. Similarly, if a given pixel in the first image has a large uncertainty of its disparity vector, then in a preferred embodiment the pixel should be considered as late as possible. For a pixel to be considered, the standard deviation of its predicted disparity vector must be smaller than a threshold TσD (called ThresholdSigmaDisparity). The ThresholdSigmaDisparity, TσD, evolves with each iteration and is given by a monotonic function that never decreases with iteration. Thus, only pixels having a good prediction of the disparity vector are considered at the beginning of an iteration. - As shown in
FIG. 6 , the present invention computes an intensity threshold value and a disparity threshold value (box 600). These threshold values may be determined in a suitable manner such as, for example, by a user. In this preferred embodiment, the present invention gives a pixel in a first image one the following match labels: (a) MATCHED (indicating the pixel has been matched); (b) NOMATCH (indicating no pixel matches have been found); and (c) UNKNOWN (not yet decided). Initially, all pixels are given a match label of UNKNOWN, and a few reliable pixel matches are obtained (box 605) using a reliable technique. Once a few seed pixel matches have been obtained, the matching process iteration begins. - An ambiguous pixel from a first image is input (box 610), labeled as UNKNOWN and a pixel disparity of that pixel is predicted as well as the uncertainty of that disparity prediction (box 615). Next, a list of candidate pixels in the second image is computed (box 620) that satisfies the epipolar constraint and disparity gradient limit constraint. A normalized cross correlation, which is discussed in detail below, is used as a matching criterion. For a pair of pixels between two images, a normalized cross correlation score is computed (box 630) between two search ranges, one for each image. In a preferred embodiment, the search range uses two small windows (called correlation windows) centered at the pixel being examined. The correlation score ranges from −1, for two correlation windows that are not similar at all, to +1, for two correlation windows that are approximately identical.
- A pair of pixels is considered as a potential match if their correlation score is larger than the intensity threshold value. The list of candidate pixels is ordered on the epipolar line (box 650) and the correlation scores are plotted to form a correlation curve (box 660). A determination is then made as to whether two or more peaks of the correlation curve exceed the intensity threshold value (box 665). If so, then the pixel match is ambiguous (box 670) and, in accordance with the least commitment strategy, the decision about the pixel match is deferred to a later time and the pixel remains labeled as UNKNOWN.
- If not, then a determination is made as to whether the correlation curve exceeds the intensity threshold value (box 675). If there is no peak exceeding the intensity threshold value then there is no pixel match (box 680) and the pixel is label as NOMATCH. Alternatively, if there is one peak on the correlation curve exceeds the intensity threshold value then the pixel at the peak is considered as the match of the given pixel in the first image (box 685) and the given pixel is labeled as MATCHED. Another iteration is performed in accordance with the present invention and another pixel from the first image (labeled UNKNOWN) is selected for matching (box 690). The matching process of the present invention continues this progressive iterative process until no more matches can be found or the maximum number of iterations is attained.
- The preferred embodiment of the present invention as shown in
FIG. 6 has a number of important properties. For example, the present invention uses a progressive matching technique. Accordingly, the number of pixels examined in each iteration becomes progressively smaller. In addition, as discussed further below, a search range for a pixel is reduced when the disparity is updated with more matched pixels. The progressive property of the present invention guarantees that the iterative matching technique is actually making some progress and that the search space is being reduced. - The present invention also has the property of monotonicity. For example, in a preferred embodiment the present invention uses the monotonic functions ThresholdSigmalntensity, TσI and ThresholdSigmaDisparity, TσD. For each iteration, the ThresholdSigmalntensity, TσI is getting smaller and the ThresholdSigmaDisparity, TσD is getting larger. This means that the probability that a pixel labeled as UNKNOWN is selected for a matching test becomes higher and eventually results in more pixels having MATCHED or NOMATCH labels. Together with the up-date of disparity vectors and their uncertainty, the property of monotonicity guarantees that the set of UNKNOWN pixels considered is truly different from that prior to refinement. In other words, the set of UNKNOWN pixels is different in the sense of the actual pixels considered and also of their candidate pixels to match in the other image.
- The present invention also has the property of completeness, which means that adding more pixels labeled as MATCHED or NOMATCH will not lose any potential matches. This property is desirable because it eliminates the need to perform an expensive refinement procedure (such as backtracking). Completeness is achieved because of the least commitment strategy, provided that the disparity gradient limit constraint is satisfied over the entire observed scene.
- 5. Correlation Technique
- The present invention uses a novel correlation technique (including a dynamic search range that permits rotation of a correlation window) to correlate pixels of one image to pixels of another image. In particular, a search range is determined that includes a correlation window capable of being rotated within an image. This rotation of the correlation window provides a more robust estimate of a correlation between pixels.
-
FIG. 7 illustrates the novel correlation technique between afirst image 700 and asecond image 710 of the present invention. In particular, consider a pair of points m 715 and m′ 720 as shown inFIG. 7 , where the correspondingepipolar lines l 730 and l′ 740 are also drawn. A Euclidean transformation is computed where R(θ) is a 2D rotation matrix
m i ′=R(θ)(m i −m)+m, (10)
with a rotation angle equal to θ, which is the angle between the twoepipolar lines m 715 to m′ 720 and a point onl 730 to a point on l′ 740. - A
first correlation window 750 is chosen for thefirst image 700 that is centered atm 715 and having one side parallel to theepipolar line l 730. Similarly, asecond correlation window 760 is chosen for thesecond image 710 that is centered at m′ 720. In order to have one side of thesecond correlation window 760 parallel to the epipolar line l′ 740 the correlation technique of the present invention allows rotation of thesecond correlation window 760. Although the shape of the first andsecond correlation windows - A
point m i 770 within thefirst correlation window 750 corresponds to a point mi′ 780 within thesecond correlation window 760 as given by equation (10). Point mi′ 780 is generally not on the pixel grid, and its intensity is computed through bilinear interpolation from its four neighboring pixels. A correlation score is then computed betweenpoint m i 770 in thefirst correlation window 750 and point mi′ 780 in thesecond correlation window 760 according to equation (10). A normalized cross correlation is used, which set the correlation score equal to 1 for two identical sets of pixels and equal to −1 for two completely different sets. - VI. Working Example and Exemplary Implementation
-
FIG. 8 is a working example ofFIG. 4 whereby stereo matching of images representing a scene is performed in accordance with the present invention. In this working example, aleft image 800 and aright image 810 of a scene are input images of the scene (box 820). Points within the left andright images stereo matching module 240 ofFIG. 2 . Matched points represent a 3-D point in space and are used to determine 3-D structure information of a scene (box 840), which, for example, may be used to perform a 3-D scene reconstruction. - An exemplary implementation of the working example of
FIG. 8 will now be discussed. In this exemplary implementation, the present invention is formulated within a Bayesian inference framework. Bayesian inference, which is well-known to those skilled in the art, is discussed in detail by D. S. Sivia in “Data Analysis: a Bayesian tutorial” (Oxford University Press, 1996), the entire contents of which are hereby incorporated by reference. In this working example using a Bayesian inference framework, a first term, p(d|m,B), corresponds to a prior density distribution of the disparity, where d is a disparity of the given pixel m, and B denotes relevant background information (such as an epipolar geometry and a set of matched pixels). A second term corresponds to a sampling distribution p(I′|d,m,B), which includes the likelihood of observed data (within a second image I′) when given d, m and B. Bayes rule is then used to combine the information in the data with the prior probability, which yields a posterior density distribution,
where p(I′|m,B) does not depend on d and can be considered constant because the second image I′ is fixed. Accordingly, the factor p(I′|m,B) can be omitted and an unnormalized posterior density distribution, p(I′|d,m,B)p(d|m,B), is considered (denoted by p(d|I′,m,B)). Computations that summarize p(d|I′,m,B) are performed and a pixel is considered to determine whether the pixel should be classified as MATCHED or NOMATCH, or classified as UNKNOWN for a future decision.
1. Prediction of Pixel Disparity and Uncertainty - As discussed above, the present invention uses a novel correlation technique (including a dynamic search range capable of rotation) to constrain a search for potential pixel matches based on a disparity gradient limit. The disparity gradient limit is exploited to estimate an uncertainty of a predicted disparity for a particular pixel, and this uncertainty is used to dynamically define a search range for candidate pixel matches. In this working example, the disparity gradient limit principle is used to predict pixel disparity and uncertainty as follows.
- Disparity is well defined for parallel cameras where the two image planes are identical. In this case, without any loss of generality, an assumption may be made that the horizontal axis in both images is aligned. Given a first pixel of coordinates (u,v) in a first image and a corresponding second pixel of coordinates (u′,v′) in a second image, disparity is defined as the difference d=v′−v. Disparity is inversely proportional to the distance of the 3-D point to the cameras. Thus, a disparity of zero implies that the 3-D point is at infinity.
- Consider two 3-D points whose projections are m1=[u1,v1]T and m2=[u2,v2]T in the first image, and m1′=[u1′,v1′]T and m2′=[u2′,v2′]T in the second image (where u1′=u1 and u2′=u2 when the two camera are parallel). The disparity gradient of these two points is defined to be the ratio of their difference in disparity to their distance in the cyclopean image. For example, for a pair of pixels in correspondence with coordinates (u, v) and (u′,v′) the cyclopean image point is at ((u+u′)/2,(v+v′)/2). In the first image, the disparity gradient is given by
- Experiments in psychophysics have shown that human perception imposes a constraint that the disparity gradient DG is upper-bounded by a limit K. In other words, if a point on an object is perceived, neighboring points having DG>K are not perceived correctly. For example, a theoretical limit for opaque surfaces is K=2 to ensure that the opaque surfaces are visible to both eyes. Although the range of allowable surfaces is large with K=2, disambiguating power is weak because false matches receive and exchange as much support as correct ones. In another example (and an extreme limit), K≈0, which allows only nearly front-parallel surfaces. In the PMF algorithm described by S. B. Pollard, J. E. W. Mayhew and J. P. Frisby entitled “PMF: a stereo correspondence algorithm using a disparity gradient constraint” in Perception (14:449-470, 1985), the entire contents of which are hereby incorporated by reference, the disparity gradient limit K is a free parameter, which can be varied over range from 0 to 2. An intermediate value (such as a value between 0.5 and 1) allows selection of a convenient tradeoff point between allowable scene surface jaggedness and disambiguating power because most false matches produce relatively high disparity gradients.
- When the cameras are in “general position” (that is, image planes of the cameras do not lie on the same plane), it is not reasonable to define scalar disparity as a simple function of the image coordinates of two pixels in correspondence. In this working example, a disparity vector d=[u′−u,v′−v]T is used. In general terms, this disparity vector is the same as a flow vector used in optical flow computation. If a scalar value is necessary, we use d=∥d∥ and call the scalar value the disparity. If objects are observed that are smooth almost everywhere, both the disparity vector (d) and the disparity (d) should vary smoothly. Similar to equation (2), for two points m1 and m2 in the first image, we define the disparity gradient as,
- Imposing a gradient limit constraint that DG≦K yields,
∥d 2 −d 1 ∥≦K∥m 2 −m 1+(d 2 −d)/2∥.
Using an inequality ∥v1+v2∥≦∥v1∥+∥v2∥ for any vectors v1 and v2, gives,
∥d 2 −d 1 ∥≦K∥m 2 −m 1 ∥+K∥(d 2 −d 1)/2∥
which leads immediately, for K<2, to,
where D=∥m2−m1∥ is the distance between m1 and m2. This leads to the following result: - Lemma 1: Given a pair of matched points (m1, m1′) and a point m2 in the neighborhood of m1, the corresponding point m2′ that satisfies the disparity gradient constraint with limit K must be inside a disk centered at m2+d1 with radius equal to
which is called the continuity disk. In other words, in absence of other knowledge, the best prediction of the disparity of m2 is equal to d1 with the continuity disk defining the uncertainty of the disparity prediction. - In some cases it may be desirable to have the actual disparity at the central part of the continuity disk. Further, it may desirable to consider a small probability that the actual disparity is outside of the continuity disk (due to, for example, an occlusion or a surface discontinuity). Therefore, in this working example, the uncertainty is modeled as an isotropic Gaussian distribution with a standard deviation equal to half of the radius of the continuity disk. More precisely, given a pair of matched points (mi, mi′), the disparity of a point m is modeled as
d=d i +D i n i, (5)
where di=mi′−mi,Di=∥m−mi∥, and ni≠N(0,σi 2I) with σi=K/(2−K). Note that disparity di also has its own uncertainty due to limited image resolution. The density distribution of di is also modeled in this working example as a Gaussian, namely, p(di)=N(di|{overscore (d)}i,σdi 2I). Thus, the density distribution of disparity d is given by
p(d|(m i ,m i′),m)=N(d|{overscore (d)} i,(σdi 2 +D i 2σ i 2)I). (6) - Given a set of point matches {(mi,mi′)|i=1, . . . , n}, equation (6) then provides n independent predictions of disparity d. The prior density distribution of the disparity, p(d|m,B), can be obtained by combining these predictions with a minimum variance estimator,
p(d|m,B)=N(d|{overscore (d)},σ 2I), (7)
where
Further, this may be made more robust by first identifying the Gaussian with smallest variance and then combining it with those Gaussians whose means fall within two or three standard deviations. - Next, σi (which as mentioned above is related to the disparity gradient limit K) is chosen. Considering that the disparity gradient constraint is still a local one, it should become less restrictive when a point being considered is away from a matched point. Hence, a range [σmin,σmax] is specified and σi is given by
σi=(σmax−σmin)(1−exp(−D i 2/τ2))+σmin. (8)
When Di=0,σi=σmin, and when Di=χ,σi=σmax. The parameter τ in equation (8) controls how fast the transition from σmin to σmax is expected. In this working example, σmin=0.3 pixels, σmax=1.0 pixel, and τ=30. This is equivalent to Kmin=0.52 and Kmax=1.34.
2. Computation of Pixel Disparity Likelihood - The sampling distribution, p(I′|d,m,B), is computed next to obtain a likelihood that, given d, m and B, a pixel in the second image I′ is a match for a first pixel. Because of the epipolar constraint, there is no need to compute the density for each pixel in I′. Further, there is also no need to compute the density for each pixel on the epipolar line of m because the prior density has been computed in equation (7). A list of pixels of interest (called candidate pixels and denoted by Q(m)) is an intersection of the epipolar line of m with a continuity disk as defined in
Lemma 1. - Densities are related to correlation scores Cj between m in the first image and each candidate pixel mj′εQ(m) in the second image. Using the correlation technique of the present invention as described above, a correlation score C that is approximately equal to −1 means that pixels are not similar at all while a correlation score C that is approximately equal to +1 means that pixels are generally identical. Correlation scores are mapped to densities by adding 1 followed by a normalization. More precisely, the correlation score Cj of a pixel mj′ is converted into a density as
where d(j)=mj′−m.
3. Match Label Inference - Using a posterior density distribution, an inference can be made as to the type of match between two pixels. In this working example, a match label is assigned to a pixel based on this inference. Namely, as discussed above, a pixel match may be assigned a label of MATCHED, NOMATCH or UNKNOWN. In this working example, the posterior density distribution p(d|I′,m,B) is a multiplication of p(I′(mj′)|d(j),m,B) in equation (9) with p(d(j)|m,B) in equation (7) for each candidate pixel mj′.
- Based on the posterior density distribution, p(d|I′,m,B), a number of inferences may be made. For example, if there is only one prominent peak (i.e., the peak is above a certain threshold value), the probability that this is a correct match is very high, and thus the pixel in the first image is given a match label of MATCHED. If there are two or more prominent peaks above the threshold, the matching ambiguity is high (in other words, the probability of making a wrong decision is high). Using the least commitment principle, this pixel is given a match label of UNKNOWN and is left to evolve. If there is no prominent peak at all above the threshold, the probability that the corresponding pixel in the second image is not visible is very high (meaning that the pixel may be either occluded by other pixels or out of the field of view). In this case, the pixel in the first image is given a match label of NOMATCH.
- In order to facilitate the task of choosing an appropriate threshold on the posterior density distribution, and because the posterior density distribution otherwise unnormalized, the prior and likelihood functions are normalized differently. The prior function in equation (7) is multiplied by σ{square root}{square root over (2π)} so that its maximum value is equal to one. The likelihood function in equation (9) is changed to (Cj+1)/2 so that it is equal to 1 for identical pixels and 0 for completely different pixels. Thus, in this working example, a peak in the posterior density distribution is considered a prominent peak (i.e., above a threshold value) if its value is greater than 0.3. For example, this corresponds to a situation where Cj=0.866 and the disparity is at 1.5σ.
- 4. Results
- In the working example of
FIG. 8 (using the above exemplary implementation) a scene that included an office scene with books and a telephone on a desk was used. Although the images in the office scene were recorded in color, only black and white information was used. The image resolution for the office scene was 740×480 pixels. - In order to reduce computation cost, instead of using all previously found matches in predicting disparities and their uncertainties, only three neighboring points defined by a Delaunay triangulation were used. In particular, a dynamic Delaunay triangulation technique was used because of its efficiency in updating the triangulation when more point matches are available. This technique is discussed in detail by O. Devillers, S. Meiser and M. Teilluad in “Fully dynamic Delaunay triangulation in logarithmic expected time per operation” (Comput. Geom. Theory Appl., 2(2):55-80, 1992), the entire contents of which are hereby incorporated by reference. It is reasonable to use only three neighboring points because other points are usually much farther away, resulting in a larger uncertainty in its predicted disparity, hence contributing little to the combined prediction of the disparity given in equation (7).
- Initial point matches (together with the fundamental matrix) were obtained automatically using a robust image matching technique. This matching technique is described by Z. Zhang, R. Deriche, O. Faugeras and Q. T. Luong in “A robust technique for matching two uncalibrated images through the recovery of the unknown epipolar geometry” (Artificial Intelligence Journal, 78:87-119, October 1995), the entire contents of which are hereby incorporated by reference. A search range of [−60,60] (pixels) for both horizontal and vertical directions was used for the scene.
- Table 1 illustrates the number of pixel matches after each iteration. The number of matches for iteration 0 indicates the number of initial matches found by the robust matching algorithm. Note that instead of working on each pixel, only one every four pixels actually was considered because of the memory limitation in the Delaunay triangulation algorithm. Further, the values of the functions ThresholdSigmalntensity, Tσ
I and ThresholdSigmaDisparity, TσD with respect to the iteration number are given in the second and third rows of Table 1. For example, for iteration 4, TσI =4 and TσD =18.TABLE 1 Number of matched pixels in each iteration Iteration 0 1 2 3 4 5 6 Tσ 1 7 6 5 4 3 2 Tσ D 12 14 16 18 20 20 Number 141 455 712 939 1239 1440 1500 of Pixel Matches - After the initial set of point matches was obtained, the disparity and its uncertainty were predicted for each iteration after iteration 0. In particular, disparity vectors were displayed for every 10 pixels and their lengths were half of their actual magnitudes. In addition, the standard deviation of the predicted disparities was calculated.
FIGS. 9A-9D illustrate the standard deviation of the predicted disparities of the working example for various iterations. Each figure is shown in gray levels after having been multiplied by 5 and truncated at 255. Thus, inFIGS. 9A-9D , a “black” pixel in a figure means that the predicted disparities were quite reliable, while a “white” pixel implies that the predicted disparities were very uncertain. -
FIG. 9A illustrates the predicted disparity for the images shown inFIG. 8 after the initial point matches. Adark area 900 is the area where the predicted disparities were quite reliable and alight area 910 is the area where the predicted disparities were uncertain. It should be noted inFIG. 9A that thedark area 900 and thelight area 910 are approximately equal in size.FIG. 9B illustrates the predicted disparity after the second iteration, where adark area 920 has grown to be larger than alight area 930, meaning that there is a larger number of pixels having reliable predicted disparities.FIG. 9C , which illustrates the predicted disparity after the fourth iteration, showsdark area 940 much larger than alight area 950. Further,FIG. 9D illustrates the predicted disparity after the sixth iteration and shows adark area 960 even larger still than alight area 970, with thedark area 960 nearly engulfing the entire image. Clearly, it can be seen how quickly reliable pixel matches evolve using the present invention. In particular, as shown inFIGS. 9A-9D , the uncertainty image becomes darker quickly, indicating that the predicted disparity of the pixel matches is becoming increasingly reliable after only a few iterations. - Once the stereo matching of the images in
FIG. 8 was performed in accordance with the present invention, a 3-D Euclidean reconstruction was obtained.FIG. 10 illustrates a view of the 3-DEuclidean reconstruction 1000 using 3-D structure information obtained in accordance with the present invention. It should be noted that the office scene (especially the book structure 1010) has been precisely recovered. - The foregoing description of the preferred embodiments 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 of the invention, but rather by the claims appended hereto.
Claims (20)
1. A progressive stereo matching system for matching digital images off a scene, comprising:
a search range module that defines a size and orientation of a search range in the digital images;
a correlation module that determines a correlation score between a pixel match in the search range; and
a classification module that classifies the pixel match based on its correlation score.
2. The progressive stereo matching system as set forth in claim 1 , further comprising an initialization module that obtains a reliable initial pixel match between pixels in the digital images.
3. The progressive stereo matching system as set forth in claim 2 , further comprising correlation windows that define and encompass the search range.
4. The progressive stereo matching system as set forth in claim 3 , wherein the correlation windows are rectangular.
5. The progressive stereo matching system as set forth in claim 4 , wherein the correlation windows may be rotated in the digital images to permit a more reliable pixel match.
6. The progressive stereo matching system as set forth in claim 4 , further comprising epipolar lines in the digital images and wherein the correlation windows are rotated such that at least one side of the correlation windows are parallel to the epipolar lines.
7. The progressive stereo matching system as set forth in claim 1 , further comprising a match label that is assigned to pixels in the digital images based on the correlation score.
8. The progressive stereo matching system as set forth in claim 7 , wherein the match label is at least one of: (a) MATCHED, signifying that a pixel has been matched; (b) NOMATCH, signifying that the pixel has not been matched; (c) UNKNOWN, signifying that it is unknown whether the pixel has been matched.
9. A progressive matching system for progressively matching digital images, comprising:
an initialization module that obtains a set of previous unambiguous matches of pixels within the digital images;
a search range module that dynamically defines a search range based on the set of previous unambiguous pixel matches and searches for pixels from each of the digital images within the search range;
a correlation module that correlates the pixels from each of the digital images; and
a classification module that assigns a match label based on the correlation between pixels.
10. The progressive matching system of claim 9 , wherein the system iterates through the initialization module, search range module, correlation module and classification module until the digital images have been suitably matched.
11. The progressive matching system of claim 9 , wherein the classification module appends any pixel matches to the set of previous unambiguous pixel matches.
12. The progressive matching system of claim 10 , wherein the search range module further comprises:
a first module that predicts a disparity of a pixel; and
a second module that estimates an uncertainty of the predicted pixel disparity.
13. The progressive matching system of claim 12 , further comprising an intensity threshold that is compared to a pair of pixels to determine a potential pixel match.
14. The progressive matching system of claim 13 , further comprising a disparity threshold that is compared to a disparity vector of each of the pixels to determine which order the pixels should be considered in the iteration.
15. The progressive matching system of claim 10 , further comprising correlation scores that are associated with each of the pixels.
16. The progressive matching system of claim 15 , further comprising a correlation curve constructed by plotting the correlation scores for each of the pixels.
17. A progressive stereo matching system for matching pixels in a first digital image and pixels in a second digital image, comprising:
an initialization module that obtains a set of previous unambiguous matches of pixels within the digital images;
a search range module that determines a search range in the first and second digital images to look for a candidate pixel match;
a correlation module that computes a correlation score between the candidate pixel match; and
a classification module that classifies the pixel match based on its correlation score.
18. The progressive stereo matching system of claim 17 , further comprising a correlation curve that is a plot of correlation scores for candidate pixel matches.
19. The progressive stereo matching system of claim 18 , further comprising an intensity threshold value such that if a candidate pixel match exceeds the intensity threshold value then the candidate pixel match is considered a pixel match.
20. The progressive stereo matching system of claim 19 , further comprising a match label is assigned to the pixel match that reads “MATCHED” to indicate that pixels in the pixel match have been matched.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/028,416 US20050123191A1 (en) | 2000-05-04 | 2004-12-30 | System and method for progressive stereo matching of digital images |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/564,839 US6606406B1 (en) | 2000-05-04 | 2000-05-04 | System and method for progressive stereo matching of digital images |
US11/028,416 US20050123191A1 (en) | 2000-05-04 | 2004-12-30 | System and method for progressive stereo matching of digital images |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/564,839 Division US6606406B1 (en) | 2000-05-04 | 2000-05-04 | System and method for progressive stereo matching of digital images |
Publications (1)
Publication Number | Publication Date |
---|---|
US20050123191A1 true US20050123191A1 (en) | 2005-06-09 |
Family
ID=27663446
Family Applications (6)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/564,839 Expired - Lifetime US6606406B1 (en) | 2000-05-04 | 2000-05-04 | System and method for progressive stereo matching of digital images |
US10/462,947 Expired - Fee Related US6931150B2 (en) | 2000-05-04 | 2003-06-16 | System and method for progressive stereo matching of digital images |
US11/028,388 Expired - Fee Related US7272256B2 (en) | 2000-05-04 | 2004-12-30 | System and method for progressive stereo matching of digital images |
US11/028,416 Abandoned US20050123191A1 (en) | 2000-05-04 | 2004-12-30 | System and method for progressive stereo matching of digital images |
US11/082,600 Expired - Fee Related US7164790B2 (en) | 2000-05-04 | 2005-03-17 | System and method for progressive stereo matching of digital images |
US11/082,444 Expired - Fee Related US7106899B2 (en) | 2000-05-04 | 2005-03-17 | System and method for progressive stereo matching of digital images |
Family Applications Before (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/564,839 Expired - Lifetime US6606406B1 (en) | 2000-05-04 | 2000-05-04 | System and method for progressive stereo matching of digital images |
US10/462,947 Expired - Fee Related US6931150B2 (en) | 2000-05-04 | 2003-06-16 | System and method for progressive stereo matching of digital images |
US11/028,388 Expired - Fee Related US7272256B2 (en) | 2000-05-04 | 2004-12-30 | System and method for progressive stereo matching of digital images |
Family Applications After (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/082,600 Expired - Fee Related US7164790B2 (en) | 2000-05-04 | 2005-03-17 | System and method for progressive stereo matching of digital images |
US11/082,444 Expired - Fee Related US7106899B2 (en) | 2000-05-04 | 2005-03-17 | System and method for progressive stereo matching of digital images |
Country Status (1)
Country | Link |
---|---|
US (6) | US6606406B1 (en) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100772319B1 (en) | 2006-11-03 | 2007-10-31 | 포항공과대학교 산학협력단 | System for stereo image matching based on message propagation |
US20090324114A1 (en) * | 2008-06-26 | 2009-12-31 | Sony Corporation | Image compression apparatus and image compression method |
US20110188736A1 (en) * | 2010-02-01 | 2011-08-04 | Sanbao Xu | Reduced-Complexity Disparity MAP Estimation |
US20110279652A1 (en) * | 2010-05-14 | 2011-11-17 | Honda Research Institute Europe Gmbh | Two-stage correlation method for correspondence search |
US8913826B2 (en) * | 2010-05-20 | 2014-12-16 | Digitalglobe, Inc. | Advanced cloud cover assessment for panchromatic images |
CN109615646A (en) * | 2018-12-17 | 2019-04-12 | 石家庄爱赛科技有限公司 | Stereo matching system and solid matching method |
US11205064B1 (en) * | 2020-06-15 | 2021-12-21 | Google Llc | Measuring quality of depth images in real time |
Families Citing this family (95)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100307883B1 (en) * | 1998-04-13 | 2001-10-19 | 박호군 | Method for measuring similarity by using a matching pixel count and apparatus for implementing the same |
US7050646B2 (en) * | 1999-12-10 | 2006-05-23 | British Telecommunications Public Limited Company | Image processing system and method for image segmentation using intensity contrast and depth contrast values |
ATE346278T1 (en) * | 2000-03-30 | 2006-12-15 | Topcon Corp | STEREO IMAGE MEASUREMENT DEVICE |
US7224357B2 (en) * | 2000-05-03 | 2007-05-29 | University Of Southern California | Three-dimensional modeling based on photographic images |
US6606406B1 (en) * | 2000-05-04 | 2003-08-12 | Microsoft Corporation | System and method for progressive stereo matching of digital images |
JP4193342B2 (en) * | 2000-08-11 | 2008-12-10 | コニカミノルタホールディングス株式会社 | 3D data generator |
US7031497B2 (en) * | 2001-11-05 | 2006-04-18 | Koninklijke Philips Electronics N.V. | Method for computing optical flow under the epipolar constraint |
US7840250B2 (en) * | 2001-11-13 | 2010-11-23 | Electrical Geodesics, Inc. | Method for neural current imaging |
US7054491B2 (en) * | 2001-11-16 | 2006-05-30 | Stmicroelectronics, Inc. | Scalable architecture for corresponding multiple video streams at frame rate |
JP2003294416A (en) * | 2002-04-03 | 2003-10-15 | Eng Kk | Stereoscopic image processor |
US7515173B2 (en) * | 2002-05-23 | 2009-04-07 | Microsoft Corporation | Head pose tracking system |
US7428330B2 (en) * | 2003-05-02 | 2008-09-23 | Microsoft Corporation | Cyclopean virtual imaging via generalized probabilistic smoothing |
US6956469B2 (en) * | 2003-06-13 | 2005-10-18 | Sarnoff Corporation | Method and apparatus for pedestrian detection |
US7778328B2 (en) * | 2003-08-07 | 2010-08-17 | Sony Corporation | Semantics-based motion estimation for multi-view video coding |
US7161606B2 (en) * | 2003-09-08 | 2007-01-09 | Honda Motor Co., Ltd. | Systems and methods for directly generating a view using a layered approach |
US7747067B2 (en) * | 2003-10-08 | 2010-06-29 | Purdue Research Foundation | System and method for three dimensional modeling |
US7333652B2 (en) * | 2004-08-03 | 2008-02-19 | Sony Corporation | System and method for efficiently performing a depth map recovery procedure |
JP2006221603A (en) * | 2004-08-09 | 2006-08-24 | Toshiba Corp | Three-dimensional-information reconstructing apparatus, method and program |
TWI272852B (en) * | 2004-12-21 | 2007-02-01 | Ali Corp | Motion estimation method for adaptive dynamic searching range |
US7612832B2 (en) * | 2005-03-29 | 2009-11-03 | Microsoft Corporation | Method and system for video clip compression |
US7822000B2 (en) * | 2005-06-30 | 2010-10-26 | Symbol Technologies, Inc. | Time division multiplexing for access ports in a wireless network |
US7720282B2 (en) * | 2005-08-02 | 2010-05-18 | Microsoft Corporation | Stereo image segmentation |
US7929801B2 (en) * | 2005-08-15 | 2011-04-19 | Sony Corporation | Depth information for auto focus using two pictures and two-dimensional Gaussian scale space theory |
US20070189750A1 (en) * | 2006-02-16 | 2007-08-16 | Sony Corporation | Method of and apparatus for simultaneously capturing and generating multiple blurred images |
US7616254B2 (en) * | 2006-03-16 | 2009-11-10 | Sony Corporation | Simple method for calculating camera defocus from an image scene |
US7711201B2 (en) * | 2006-06-22 | 2010-05-04 | Sony Corporation | Method of and apparatus for generating a depth map utilized in autofocusing |
KR100776805B1 (en) * | 2006-09-29 | 2007-11-19 | 한국전자통신연구원 | Efficient image transmission method and apparatus using stereo vision processing for intelligent service robot system |
KR101311896B1 (en) * | 2006-11-14 | 2013-10-14 | 삼성전자주식회사 | Method for shifting disparity of three dimentions and the three dimentions image apparatus thereof |
KR100834577B1 (en) * | 2006-12-07 | 2008-06-02 | 한국전자통신연구원 | Home intelligent service robot and method capable of searching and following moving of target using stereo vision processing |
US8077964B2 (en) * | 2007-03-19 | 2011-12-13 | Sony Corporation | Two dimensional/three dimensional digital information acquisition and display device |
US7671891B2 (en) * | 2007-05-22 | 2010-03-02 | Microsoft Corporation | Online camera calibration |
US20100220932A1 (en) * | 2007-06-20 | 2010-09-02 | Dong-Qing Zhang | System and method for stereo matching of images |
US8467451B2 (en) * | 2007-11-07 | 2013-06-18 | Industrial Technology Research Institute | Methods for selecting a prediction mode |
US8344998B2 (en) * | 2008-02-01 | 2013-01-01 | Wimm Labs, Inc. | Gesture-based power management of a wearable portable electronic device with display |
CN100592338C (en) * | 2008-02-03 | 2010-02-24 | 四川虹微技术有限公司 | Multi-visual angle video image depth detecting method and depth estimating method |
JP4886716B2 (en) * | 2008-02-26 | 2012-02-29 | 富士フイルム株式会社 | Image processing apparatus and method, and program |
US8280194B2 (en) * | 2008-04-29 | 2012-10-02 | Sony Corporation | Reduced hardware implementation for a two-picture depth map algorithm |
JP5121681B2 (en) * | 2008-04-30 | 2013-01-16 | 株式会社日立製作所 | Biometric authentication system, authentication client terminal, and biometric authentication method |
US8194995B2 (en) * | 2008-09-30 | 2012-06-05 | Sony Corporation | Fast camera auto-focus |
US8553093B2 (en) * | 2008-09-30 | 2013-10-08 | Sony Corporation | Method and apparatus for super-resolution imaging using digital imaging devices |
KR20100051359A (en) * | 2008-11-07 | 2010-05-17 | 삼성전자주식회사 | Method and apparatus for generating of image data |
CN101790103B (en) | 2009-01-22 | 2012-05-30 | 华为技术有限公司 | Parallax calculation method and device |
US20110025830A1 (en) | 2009-07-31 | 2011-02-03 | 3Dmedia Corporation | Methods, systems, and computer-readable storage media for generating stereoscopic content via depth map creation |
WO2011014419A1 (en) | 2009-07-31 | 2011-02-03 | 3Dmedia Corporation | Methods, systems, and computer-readable storage media for creating three-dimensional (3d) images of a scene |
US9380292B2 (en) | 2009-07-31 | 2016-06-28 | 3Dmedia Corporation | Methods, systems, and computer-readable storage media for generating three-dimensional (3D) images of a scene |
WO2011014420A1 (en) * | 2009-07-31 | 2011-02-03 | 3Dmedia Corporation | Methods, systems, and computer-readable storage media for selecting image capture positions to generate three-dimensional (3d) images |
US20110032341A1 (en) * | 2009-08-04 | 2011-02-10 | Ignatov Artem Konstantinovich | Method and system to transform stereo content |
US8385689B2 (en) * | 2009-10-21 | 2013-02-26 | MindTree Limited | Image alignment using translation invariant feature matching |
US20120249751A1 (en) * | 2009-12-14 | 2012-10-04 | Thomson Licensing | Image pair processing |
TWI402479B (en) * | 2009-12-15 | 2013-07-21 | Ind Tech Res Inst | Depth detection method and system using thereof |
JP5387856B2 (en) * | 2010-02-16 | 2014-01-15 | ソニー株式会社 | Image processing apparatus, image processing method, image processing program, and imaging apparatus |
KR101802238B1 (en) * | 2010-02-23 | 2017-11-29 | 삼성전자주식회사 | Apparatus and method for generating a three-dimension image data in portable terminal |
US8213708B2 (en) * | 2010-03-22 | 2012-07-03 | Eastman Kodak Company | Adjusting perspective for objects in stereoscopic images |
WO2011143813A1 (en) * | 2010-05-19 | 2011-11-24 | 深圳泰山在线科技有限公司 | Object projection method and object projection sysytem |
US8970672B2 (en) * | 2010-05-28 | 2015-03-03 | Qualcomm Incorporated | Three-dimensional image processing |
RU2010123652A (en) * | 2010-06-10 | 2011-12-20 | Корпорация "САМСУНГ ЭЛЕКТРОНИКС Ко., Лтд." (KR) | SYSTEM AND METHOD FOR VISUALIZING STEREO IMAGES AND MULTI-VIEW IMAGES FOR CONTROL THE PERCEPTION OF DEPTH OF A STEREOSCOPIC IMAGE CREATED BY A TV RECEIVER |
US8320627B2 (en) * | 2010-06-17 | 2012-11-27 | Caterpillar Inc. | Machine control system utilizing stereo disparity density |
US9344701B2 (en) | 2010-07-23 | 2016-05-17 | 3Dmedia Corporation | Methods, systems, and computer-readable storage media for identifying a rough depth map in a scene and for determining a stereo-base distance for three-dimensional (3D) content creation |
TWI424376B (en) | 2010-08-25 | 2014-01-21 | Ind Tech Res Inst | Method for processing image and system processing the same |
US8704879B1 (en) | 2010-08-31 | 2014-04-22 | Nintendo Co., Ltd. | Eye tracking enabling 3D viewing on conventional 2D display |
GB2483434A (en) * | 2010-08-31 | 2012-03-14 | Sony Corp | Detecting stereoscopic disparity by comparison with subset of pixel change points |
US8655093B2 (en) * | 2010-09-02 | 2014-02-18 | Edge 3 Technologies, Inc. | Method and apparatus for performing segmentation of an image |
US9185388B2 (en) | 2010-11-03 | 2015-11-10 | 3Dmedia Corporation | Methods, systems, and computer program products for creating three-dimensional video sequences |
US9380285B2 (en) | 2010-12-20 | 2016-06-28 | Samsung Display Co., Ltd. | Stereo image processing method, stereo image processing device and display device |
US10200671B2 (en) | 2010-12-27 | 2019-02-05 | 3Dmedia Corporation | Primary and auxiliary image capture devices for image processing and related methods |
US8274552B2 (en) | 2010-12-27 | 2012-09-25 | 3Dmedia Corporation | Primary and auxiliary image capture devices for image processing and related methods |
EP2490452A1 (en) | 2011-02-21 | 2012-08-22 | Advanced Digital Broadcast S.A. | A method and system for rendering a stereoscopic view |
JP5170276B2 (en) * | 2011-03-31 | 2013-03-27 | カシオ計算機株式会社 | Image reconstruction device, image reconstruction method, and image reconstruction program |
US8582821B1 (en) * | 2011-05-23 | 2013-11-12 | A9.Com, Inc. | Tracking objects between images |
US8867825B2 (en) * | 2011-08-30 | 2014-10-21 | Thompson Licensing | Method and apparatus for determining a similarity or dissimilarity measure |
EP2570990A1 (en) | 2011-09-13 | 2013-03-20 | Thomson Licensing | Apparatus and method for determining a confidence value of a disparity estimate |
JP2013073598A (en) * | 2011-09-29 | 2013-04-22 | Sony Corp | Image processing device, image processing method, and program |
CN103339651B (en) * | 2011-10-11 | 2016-12-07 | 松下知识产权经营株式会社 | Image processing apparatus, camera head and image processing method |
US9692991B2 (en) * | 2011-11-04 | 2017-06-27 | Qualcomm Incorporated | Multispectral imaging system |
US8989481B2 (en) * | 2012-02-13 | 2015-03-24 | Himax Technologies Limited | Stereo matching device and method for determining concave block and convex block |
CN102595185B (en) * | 2012-02-27 | 2014-06-25 | 宁波大学 | Stereo image quality objective evaluation method |
TWI459308B (en) * | 2012-03-12 | 2014-11-01 | Himax Tech Ltd | Stereo matching device and method for determining concave block and convex block |
TWI485653B (en) * | 2012-06-28 | 2015-05-21 | Imec Taiwan Co | Imaging system and method |
JP5949319B2 (en) * | 2012-08-21 | 2016-07-06 | 富士通株式会社 | Gaze detection apparatus and gaze detection method |
CN103279973A (en) * | 2013-06-13 | 2013-09-04 | 清华大学 | Three-dimensional image matching system based on mixing and parallel |
JP6377970B2 (en) | 2014-06-12 | 2018-08-22 | トヨタ自動車株式会社 | Parallax image generation apparatus and parallax image generation method |
EP3241349A4 (en) | 2014-12-31 | 2018-08-15 | Nokia Corporation | Stereo imaging |
US9948914B1 (en) | 2015-05-06 | 2018-04-17 | The United States Of America As Represented By The Secretary Of The Air Force | Orthoscopic fusion platform |
US10287049B2 (en) * | 2015-07-27 | 2019-05-14 | Arthur Julius Beutler | Bag opener component for plastic bag dispenser |
US9875427B2 (en) * | 2015-07-28 | 2018-01-23 | GM Global Technology Operations LLC | Method for object localization and pose estimation for an object of interest |
JP2017045124A (en) * | 2015-08-24 | 2017-03-02 | 株式会社日本自動車部品総合研究所 | Parallax detection device |
US10823950B2 (en) * | 2016-01-07 | 2020-11-03 | Digital Surigcals PTE. LTD. | Camera system with balanced monocular cues for use in digital stereo microscopes |
TW201742001A (en) * | 2016-05-30 | 2017-12-01 | 聯詠科技股份有限公司 | Method and device for image noise estimation and image capture apparatus |
US10462445B2 (en) | 2016-07-19 | 2019-10-29 | Fotonation Limited | Systems and methods for estimating and refining depth maps |
US10839535B2 (en) | 2016-07-19 | 2020-11-17 | Fotonation Limited | Systems and methods for providing depth map information |
GB2565775A (en) * | 2017-08-21 | 2019-02-27 | Nokia Technologies Oy | A Method, an apparatus and a computer program product for object detection |
CN110647925A (en) * | 2019-09-06 | 2020-01-03 | 重庆邮电大学 | Rigid object identification method and device based on improved LINE-MOD template matching |
CN111046906B (en) * | 2019-10-31 | 2023-10-31 | 中国资源卫星应用中心 | Reliable encryption matching method and system for planar feature points |
CN111010558B (en) * | 2019-12-17 | 2021-11-09 | 浙江农林大学 | Stumpage depth map generation method based on short video image |
US11782254B2 (en) * | 2020-07-24 | 2023-10-10 | United Scope LLC | Digital microscopy system and graphical user interface |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6243494B1 (en) * | 1998-12-18 | 2001-06-05 | University Of Washington | Template matching in 3 dimensions using correlative auto-predictive search |
US6411326B1 (en) * | 1997-05-21 | 2002-06-25 | Olympus Optical Co., Ltd. | Stereo image display unit |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5179441A (en) * | 1991-12-18 | 1993-01-12 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Near real-time stereo vision system |
JP3242529B2 (en) * | 1994-06-07 | 2001-12-25 | 松下通信工業株式会社 | Stereo image matching method and stereo image parallax measurement method |
US6028672A (en) * | 1996-09-30 | 2000-02-22 | Zheng J. Geng | High speed three dimensional imaging method |
JP3539788B2 (en) * | 1995-04-21 | 2004-07-07 | パナソニック モバイルコミュニケーションズ株式会社 | Image matching method |
JP3020898B2 (en) * | 1997-07-22 | 2000-03-15 | 株式会社エイ・ティ・アール人間情報通信研究所 | A linear estimation method of three-dimensional position by affine camera correction |
US6519358B1 (en) * | 1998-10-07 | 2003-02-11 | Sony Corporation | Parallax calculating apparatus, distance calculating apparatus, methods of the same, and information providing media |
US7224357B2 (en) * | 2000-05-03 | 2007-05-29 | University Of Southern California | Three-dimensional modeling based on photographic images |
US6606406B1 (en) * | 2000-05-04 | 2003-08-12 | Microsoft Corporation | System and method for progressive stereo matching of digital images |
-
2000
- 2000-05-04 US US09/564,839 patent/US6606406B1/en not_active Expired - Lifetime
-
2003
- 2003-06-16 US US10/462,947 patent/US6931150B2/en not_active Expired - Fee Related
-
2004
- 2004-12-30 US US11/028,388 patent/US7272256B2/en not_active Expired - Fee Related
- 2004-12-30 US US11/028,416 patent/US20050123191A1/en not_active Abandoned
-
2005
- 2005-03-17 US US11/082,600 patent/US7164790B2/en not_active Expired - Fee Related
- 2005-03-17 US US11/082,444 patent/US7106899B2/en not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6411326B1 (en) * | 1997-05-21 | 2002-06-25 | Olympus Optical Co., Ltd. | Stereo image display unit |
US6243494B1 (en) * | 1998-12-18 | 2001-06-05 | University Of Washington | Template matching in 3 dimensions using correlative auto-predictive search |
Cited By (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100772319B1 (en) | 2006-11-03 | 2007-10-31 | 포항공과대학교 산학협력단 | System for stereo image matching based on message propagation |
WO2008054109A1 (en) * | 2006-11-03 | 2008-05-08 | Postech Academy-Industry Foundation | Message propagation-based stereo image matching system |
US20090315976A1 (en) * | 2006-11-03 | 2009-12-24 | Hong Jeong | Message propagation- based stereo image matching system |
US8427524B2 (en) * | 2006-11-03 | 2013-04-23 | Postech Academy-Industry Foundation | Message propagation-based stereo image matching system |
US8204319B2 (en) * | 2008-06-26 | 2012-06-19 | Sony Corporation | Image compression apparatus and image compression method |
US20090324114A1 (en) * | 2008-06-26 | 2009-12-31 | Sony Corporation | Image compression apparatus and image compression method |
US20110188736A1 (en) * | 2010-02-01 | 2011-08-04 | Sanbao Xu | Reduced-Complexity Disparity MAP Estimation |
US8369609B2 (en) * | 2010-02-01 | 2013-02-05 | Telefonaktiebolaget Lm Ericsson (Publ) | Reduced-complexity disparity map estimation |
US20110279652A1 (en) * | 2010-05-14 | 2011-11-17 | Honda Research Institute Europe Gmbh | Two-stage correlation method for correspondence search |
US9208576B2 (en) * | 2010-05-14 | 2015-12-08 | Honda Research Institute Europe Gmbh | Two-stage correlation method for correspondence search |
US8913826B2 (en) * | 2010-05-20 | 2014-12-16 | Digitalglobe, Inc. | Advanced cloud cover assessment for panchromatic images |
CN109615646A (en) * | 2018-12-17 | 2019-04-12 | 石家庄爱赛科技有限公司 | Stereo matching system and solid matching method |
US11205064B1 (en) * | 2020-06-15 | 2021-12-21 | Google Llc | Measuring quality of depth images in real time |
Also Published As
Publication number | Publication date |
---|---|
US20050123190A1 (en) | 2005-06-09 |
US20050163366A1 (en) | 2005-07-28 |
US20030231792A1 (en) | 2003-12-18 |
US7106899B2 (en) | 2006-09-12 |
US20050163367A1 (en) | 2005-07-28 |
US7272256B2 (en) | 2007-09-18 |
US7164790B2 (en) | 2007-01-16 |
US6931150B2 (en) | 2005-08-16 |
US6606406B1 (en) | 2003-08-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7272256B2 (en) | System and method for progressive stereo matching of digital images | |
Zhang et al. | A progressive scheme for stereo matching | |
US7567703B2 (en) | System for combining multiple disparity maps | |
US20190304134A1 (en) | Multiview Estimation of 6D Pose | |
USRE42999E1 (en) | Method and system for estimating the accuracy of inference algorithms using the self-consistency methodology | |
US8009897B2 (en) | Method and apparatus for image matching | |
EP1296279B1 (en) | Method and computer program product for locating facial features | |
US7539327B2 (en) | System and process for bootstrap initialization of nonparametric color models | |
US20040213460A1 (en) | Method of human figure contour outlining in images | |
US20030091225A1 (en) | Method for forming a depth image from digital image data | |
US6963662B1 (en) | Method and system for detecting changes in three dimensional shape | |
EP3665651B1 (en) | Hierarchical disparity hypothesis generation with slanted support windows | |
US6480620B1 (en) | Method of and an apparatus for 3-dimensional structure estimation | |
US20230334727A1 (en) | 2d and 3d floor plan generation | |
US6718062B1 (en) | System and method for matching curves of multiple images representing a scene | |
US6665440B1 (en) | System and method for performing corner guided curve matching of multiple images representing a scene | |
Tong et al. | Simultaneous two-view epipolar geometry estimation and motion segmentation by 4D tensor voting | |
Cord et al. | Three-dimensional building detection and modeling using a statistical approach | |
Bassier et al. | BIM reconstruction: Automated procedural modeling from point cloud data | |
Kruse | Scene segmentation from dense displacement vector fields using randomized Hough transform | |
Lin et al. | Study of occlusions problem in stereo vision | |
Kostková | Stereoscopic matching: Problems and solutions | |
Kerkaou et al. | Omnidirectional spatio-temporal matching based on machine learning | |
CN116485758A (en) | Method, system, electronic equipment and medium for determining number of nodules | |
CN116843754A (en) | Visual positioning method and system based on multi-feature fusion |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |
|
AS | Assignment |
Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICROSOFT CORPORATION;REEL/FRAME:034766/0001 Effective date: 20141014 |