Disparity map refinement method based on Markov random field
A Markov random field and disparity map technology, applied in the field of computer vision and pattern recognition, can solve problems such as no very effective solutions, and achieve the effect of improving accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0048] The refinement method of disparity map based on Markov random field of the present invention comprises the following steps:
[0049] (1) Read the initial left disparity map. The initial left disparity map is obtained by a certain stereo matching algorithm. For example, a global stereo matching algorithm such as trust propagation algorithm, graph cut algorithm, etc. can be used;
[0050] (2) Generate the right disparity map, and use the left and right correspondence principle of stereo matching, that is, the corresponding right disparity map can be generated according to the left disparity map;
[0051] (3) Abnormal parallax point detection;
[0052] (4) Parallax point classification;
[0053] (5) Establish a Markov random field model;
[0054] (6) Establish the global energy equation;
[0055] (7) Calculation of data items and smoothing items;
[0056] (8) Use the graph cut algorithm to solve;
[0057] (9) Obtain a high-precision disparity map after refinement.
[0...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com
