Three-dimensional matching method based on interactive image segmentation
A technology for image segmentation and stereo matching, applied in image analysis, image enhancement, image data processing, etc., can solve the problems of insufficient utilization of segmentation information, complex calculation framework, and high difficulty in implementation, so as to reduce the amount of calculation and increase sub-pixel accuracy , reduce the effect of building nodes
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0059] Taking the Tsukaba image pair as an example, the test environment is Windows 7 64-bit system, the CPU is 3.0GHz, the memory is 8G, and the compiler is Visual Studio 2010.
[0060] Carry out stereo matching according to the method of the present invention, concrete steps are as follows:
[0061] (1) The segmentation of the target of interest, the process is as follows figure 1 shown.
[0062] (1.1) The user sets the seed points in the left and right views of the Tsukaba image respectively according to the needs, marks the foreground image and the background image, marks the background part as blue, and the foreground part as red; figure 2 , image 3 .
[0063] (1.2) In the left and right views, the image segmentation method based on the color index value is used to segment the object of interest to the user;
[0064] The image segmentation method based on the color index value refers to the paper "One-time Fast Graph Cut Algorithm" (Tang M, Gorelick L, Veksler O, et...
Embodiment 2
[0083] In this embodiment, step (1.3) is specifically: the user judges that the segmented object of interest meets the needs, if the segmentation result is not satisfactory, then return to step (1.1) to reset the seed point; if the segmentation result is satisfactory, obtain the segmentation template , proceed to the next step.
[0084] The graph cut algorithm called in step (2.3) can also refer to the Fulkerson maximum flow algorithm (Ford‐Fulkerson algorithm) invented by L.R. Ford and D.R. Fulkerson in 1956.
[0085] Other steps are the same as in Embodiment 1 to obtain a disparity map.
Embodiment 3
[0087] In this embodiment, taking the sawtooth image pair as an example, stereo matching is performed according to the method of the present invention, and the specific steps are as follows:
[0088] (1) Segmentation of the target of interest, specifically:
[0089] (1.1) The user sets the seed points in the left and right views of the sawtooth image according to the needs, marks the foreground image and the background image, and marks the background part as blue and the foreground part as red; Figure 12 , Figure 13 .
[0090] (1.2) In the left and right views, the image segmentation method based on the color index value is used to segment the object of interest to the user;
[0091] The image segmentation method based on the color index value refers to the paper "One-time Fast Graph Cut Algorithm" (Tang M, Gorelick L, Veksler O, et al. GrabCut in One Cut) published at the International Computer Vision Conference in 2013 [C] / / Computer Vision (ICCV), 2013IEEE International...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com