3D entity-based stereo matching with ground control points and joint second-order smoothness prior
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605540276 | ||
| 003 | CHVBK | ||
| 005 | 20210128100911.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150901xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00371-014-1009-3 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00371-014-1009-3 | ||
| 245 | 0 | 0 | |a 3D entity-based stereo matching with ground control points and joint second-order smoothness prior |h [Elektronische Daten] |c [Jing Liu, Chunpeng Li, Feng Mei, Zhaoqi Wang] |
| 520 | 3 | |a Disparity estimation for a scene with complex geometric characteristics such as slanted or highly curved surfaces is a basic and important issue in stereo matching. Traditional methods often use first-order smoothness priors that always lead to low-curvature frontal-parallel disparity maps. We propose a stereo framework that views the scene as a set of 3D entities with compact and smooth disparity distributions. The 3D entity-based representation enables some contributions to obtain a precise disparity estimation. A GCPs-plane constraint based on ground control points is used to strengthen the compact distributions of the disparities in each entity by restricting the scope of the disparity variance and reducing matching ambiguities in repetitive or low-texture areas. Furthermore, we have formulated a joint second-order smoothness prior, which combines a geometric weight with the derivative of disparity values. This prior encourages smooth disparity variations inside each entity and means that each entity is biased towards being a 3D planar surface. Segmentation is incorporated as soft constraint by effectively fusing the advantages of the image color gradient and GCPs-plane. This avoids blending of the foreground and background and retains only the disparity discontinuities from geometrically smooth regions with strong texture gradients. Our framework is formulated as a maximum a posteriori probability estimation problem that is optimized using the fusion-move approach. Evaluation results on the Middlebury benchmark show that the proposed method ranks second among the approximately $$152$$ 152 listed algorithms. In addition, it performs well in real-world scenes. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Stereo matching |2 nationallicence | |
| 690 | 7 | |a Joint second-order smoothness prior |2 nationallicence | |
| 690 | 7 | |a GCPs-plane |2 nationallicence | |
| 690 | 7 | |a Fusion-move |2 nationallicence | |
| 690 | 7 | |a 3D entity |2 nationallicence | |
| 700 | 1 | |a Liu |D Jing |u The Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, No.6 Kexueyuan South Road Zhongguancun, Haidian District, 100190, Beijing, China |4 aut | |
| 700 | 1 | |a Li |D Chunpeng |u The Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, No.6 Kexueyuan South Road Zhongguancun, Haidian District, 100190, Beijing, China |4 aut | |
| 700 | 1 | |a Mei |D Feng |u The Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, No.6 Kexueyuan South Road Zhongguancun, Haidian District, 100190, Beijing, China |4 aut | |
| 700 | 1 | |a Wang |D Zhaoqi |u The Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, No.6 Kexueyuan South Road Zhongguancun, Haidian District, 100190, Beijing, China |4 aut | |
| 773 | 0 | |t The Visual Computer |d Springer Berlin Heidelberg |g 31/9(2015-09-01), 1253-1269 |x 0178-2789 |q 31:9<1253 |1 2015 |2 31 |o 371 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00371-014-1009-3 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00371-014-1009-3 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Liu |D Jing |u The Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, No.6 Kexueyuan South Road Zhongguancun, Haidian District, 100190, Beijing, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Li |D Chunpeng |u The Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, No.6 Kexueyuan South Road Zhongguancun, Haidian District, 100190, Beijing, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Mei |D Feng |u The Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, No.6 Kexueyuan South Road Zhongguancun, Haidian District, 100190, Beijing, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Wang |D Zhaoqi |u The Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, No.6 Kexueyuan South Road Zhongguancun, Haidian District, 100190, Beijing, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t The Visual Computer |d Springer Berlin Heidelberg |g 31/9(2015-09-01), 1253-1269 |x 0178-2789 |q 31:9<1253 |1 2015 |2 31 |o 371 | ||