10.1.10.8 Matching for Stereo, Dynamic Programming Techniques

Chapter Contents (Back)
Stereo, Matching. Dynamic Programming. Includes point matching, line matching, etc.

Ohta, Y.[Yuichi], and Kanade, T.[Takeo],
Stereo by Intra- and Inter-scanline Search Using Dynamic Programming,
PAMI(7), No. 2, March 1985, pp. 139-154. BibRef 8503
And: CMU-CS-TR-83-162, CMU CS Dept., October, 1983. BibRef
Earlier:
Stereo by Two-Level Dynamic Programming,
IJCAI85(1120-1126). Matching, Edges. Uses rectified stereo pairs, (epipolars are horizontal straight lines) and searches for matches in the same scanline only. The inter-scanline search takes into account the dependency of the adjacent lines, i.e. the scene is coherent. BibRef

Lloyd, S.A.,
Binocular Stereo Algorithm Based on the Disparity-Gradient Limit and Using Optimization Theory,
IVC(3), No. 4, November 1985, pp. 177-181.
Elsevier DOI BibRef 8511

Lloyd, S.A., Haddow, E.R., and Boyce, J.F.,
A Parallel Binocular Stereo Algorithm Utilizing Dynamic Programming and Relaxation Labelling,
CVGIP(39), No. 2, August 1987, pp. 202-225.
Elsevier DOI Relaxation. Using edge points and epi-polar geometry dynamic programming is used to find potential matches for each scan line, then relaxation is used between adjacent scan lines. BibRef 8708

Lloyd, S.A.,
Stereo Matching Using Intra- and Inter-Row Dynamic Programming,
PRL(4), 1986, pp. 273-277. BibRef 8600

Bobick, A.F.[Aaron F.], Intille, S.S.[Stephen S.],
Large Occlusion Stereo,
IJCV(33), No. 3, September 1999, pp. 181-200.
DOI Link
HTML Version. and
PS File. BibRef 9909
And: Vismod--494, May 1999.
PDF File. Dynamic programming based technique. Incorporate reliable ground control points to deal with the cost of unmatched points. BibRef

Intille, S.S., Bobick, A.F.,
Disparity-Space Images and Large Occlusion Stereo,
ECCV94(B:179-186).
Springer DOI BibRef 9400
And: Vismod-220, 1994.
HTML Version. and
PS File. BibRef

Intille, S.S., Bobick, A.F.,
Incorporating Intensity Edges in the Recovery of Occlusion Regions,
ICPR94(A:674-677).
IEEE DOI BibRef 9400 Vismod-246, 1994.
HTML Version. and
PS File. BibRef

Lee, S.H.[Shing-Huan], Leou, J.J.[Jin-Jang],
A Dynamic-Programming Approach to Line Segment Matching in Stereo Vision,
PR(27), No. 8, August 1994, pp. 961-986.
Elsevier DOI BibRef 9408

Li, Z.N.,
Stereo Correspondence Based on Line Matching in Hough Space Using Dynamic Programming,
SMC(24), 1994, pp. 144-152.
See also On Improving The Accuracy Of Line Extraction In Hough Space. BibRef 9400

Bensrhair, A., Miche, P., Debrie, R.,
Fast and Automatic Stereo Vision Matching Algorithm-Based on Dynamic-Programming Method,
PRL(17), No. 5, May 1 1996, pp. 457-466. 9606
BibRef

Yip, R.K.K.[Raymond K.K.], Ho, W.P.[Wing-Ping],
A multi-level dynamic programming method for stereo line matching,
PRL(19), No. 9, 31 July 1998, pp. 839-855. BibRef 9807
Earlier:
Multi-Level Based Stereo Line Matching with Structural Information Using Dynamic Programming,
ICIP96(II: 341-344).
IEEE DOI BibRef

Chan, T.S., Yip, R.K.K.,
Line Segment Detection Algorithm,
ICPR96(II: 126-130).
IEEE DOI 9608
(City Univ. of Hong Kong, HK) BibRef

Ho, W.P., Yip, R.K.K.,
A Dynamic Programming Approach for Stereo Line Matching with Structural Information,
ICPR96(I: 791-794).
IEEE DOI 9608
(City Univ. of Hong Kong, HK) BibRef

Yip, R.K.K.[Raymond K.K.],
A Multi-Level Dynamic Programming Method for Line Segment Matching in Axial Motion Stereo,
PR(31), No. 11, November 1998, pp. 1653-1668.
Elsevier DOI BibRef 9811
Earlier:
Multi-level dynamic programming for axial motion stereo line matching,
CIAP97(I: 612-619).
Springer DOI 9709
Local similarity measure for line segment. BibRef

Park, C.S.[Chang Seob], Park, H.W.[Hyun Wook],
A robust stereo disparity estimation using adaptive window search and dynamic programming search,
PR(34), No. 12, December 2001, pp. 2573-2576.
Elsevier DOI 0110
BibRef

Lim, H.S.[Han Shin], Park, H.W.[Hyun Wook],
A Dense Disparity Estimation Method using Color Segmentation and Energy Minimization,
ICIP06(1033-1036).
IEEE DOI 0610
BibRef

Gimel'farb, G.L.[Georgy L.],
Probabilistic Regularisation and Symmetry in Binocular Dynamic Programming Stereo,
PRL(23), No. 4, February 2002, pp. 431-442.
Elsevier DOI 0202
BibRef

Gimel'farb, G.L., Lipowezky, U.,
Accuracy of the regularised dynamic programming stereo,
ICPR02(III: 619-622).
IEEE DOI 0211
BibRef

Jawahar, C.V., Narayanan, P.J.,
An adaptive multifeature correspondence algorithm for stereo using dynamic programming,
PRL(23), No. 5, March 2002, pp. 549-556.
Elsevier DOI 0202
BibRef

Jawahar, C.V., Narayanan, P.J.,
Generalised correlation for multi-feature correspondence,
PR(35), No. 6, June 2002, pp. 1303-1313.
Elsevier DOI 0203
Different kinds of features. BibRef

van Meerbergen, G., Vergauwen, M., Pollefeys, M., Van Gool, L.J.,
A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming,
IJCV(47), No. 1-3, April-June 2002, pp. 275-285.
DOI Link 0203
BibRef
Earlier:
A hierarchical stereo algorithm using dynamic programming,
SMBV01(xx-yy). 0110
BibRef

Agrawal, M.[Motilal], Davis, L.S.[Larry S.],
Trinocular Stereo Using Shortest Paths and the Ordering Constraint,
IJCV(47), No. 1-3, April-June 2002, pp. 43-50.
DOI Link 0203
BibRef SMBV01(xx-yy). 0110
3 Cameras, right angle configuration. Dynamic Programming approach. (Note Davis was partially left off the web version.) BibRef

Torr, P.H.S., Criminisi, A.,
Dense stereo using pivoted dynamic programming,
IVC(22), No. 10, 1 September 2004, pp. 795-806.
Elsevier DOI 0409
BibRef
Earlier: BMVC02(3D and Video). 0208
BibRef

Criminisi, A., Blake, A., Rother, C., Shotton, J.D.J., Torr, P.H.S.,
Efficient Dense Stereo with Occlusions for New View-Synthesis by Four-State Dynamic Programming,
IJCV(71), No. 1, January 2007, pp. 89-110.
Springer DOI 0609
With view synthesis. 4-state matching to deal with occlusions. Synthesis by direct projection of minimal cost surface. BibRef

Gong, M.L.[Ming-Lun], Yang, Y.H.[Yee-Hong],
Fast unambiguous stereo matching using reliability-based dynamic programming,
PAMI(27), No. 6, June 2005, pp. 998-1003.
IEEE Abstract. 0506
BibRef
Earlier:
Fast stereo matching using reliability-based dynamic programming and consistency constraints,
ICCV03(610-617).
IEEE DOI 0311
BibRef

Gong, M.L.[Ming-Lun], Yang, Y.H.[Yee-Hong],
Real-Time Stereo Matching Using Orthogonal Reliability-Based Dynamic Programming,
IP(16), No. 3, March 2007, pp. 879-884.
IEEE DOI 0703
BibRef
Earlier:
Disparity Flow Estimation using Orthogonal Reliability-based Dynamic Programming,
ICPR06(II: 70-73).
IEEE DOI 0609
BibRef
Earlier:
Near Real-Time Reliable Stereo Matching Using Programmable Graphics Hardware,
CVPR05(I: 924-931).
IEEE DOI 0507

See also Estimate Large Motions Using the Reliability-Based Motion Estimation Algorithm.
See also Genetic-Based Stereo Algorithm and Disparity Map Evaluation. BibRef

Lei, C.[Cheng], Selzer, J.[Jason], Yang, Y.H.[Yee-Hong],
Region-Tree Based Stereo Using Dynamic Programming Optimization,
CVPR06(II: 2378-2385).
IEEE DOI 0606
BibRef

Leung, S.C.[S. Carlos], Appleton, B.[Ben], Sun, C.M.[Chang-Ming],
Iterated dynamic programming and quadtree subregioning for fast stereo matching,
IVC(26), No. 10, 1 October 2008, pp. 1371-1383.
Elsevier DOI 0804
BibRef
Earlier:
Fast Stereo Matching by Iterated Dynamic Programming and Quadtree Subregioning,
BMVC04(xx-yy).
HTML Version. 0508
Stereo matching; Energy minimisation; Iterated dynamic programming; Quadtree subregioning BibRef

Xu, Z.L.[Zhi-Liang], Ma, L.Z.[Li-Zhuang], Kimachi, M.[Masatoshi], Suwa, M.[Masaki],
Efficient contrast invariant stereo correspondence using dynamic programming with vertical constraint,
VC(24), No. 1, January 2008, pp. 45-55.
Springer DOI 0712
BibRef

MacLean, W.J.[W. James], Sabihuddin, S.[Siraj], Islam, J.[Jamin],
Leveraging cost matrix structure for hardware implementation of stereo disparity computation using dynamic programming,
CVIU(114), No. 11, November 2010, pp. 1126-1138.
Elsevier DOI 1011
Stereo disparity; Dynamic programming; Field programmable gate arrays; Pipeline processing; Real-time systems; Hardware BibRef


Psota, E.T., Kowalczuk, J., Mittek, M., Perez, L.C.,
MAP Disparity Estimation Using Hidden Markov Trees,
ICCV15(2219-2227)
IEEE DOI 1602
Algorithm design and analysis BibRef

Hu, T.B.[Ting-Bo], Wu, T.[Tao], Song, J.[Jingze], Liu, Q.[Qixu], Zhang, B.[Bo],
A New Tree Structure for Weighted Dynamic Programming Based Stereo Algorithm,
ICIG11(100-105).
IEEE DOI 1109
BibRef

Sin, C.H.[Chin-Hong], Cheng, C.M.[Chia-Ming], Lai, S.H.[Shang-Hong], Yang, S.Y.[Shan-Yung],
Geodesic tree-based dynamic programming for fast stereo reconstruction,
EmbedCV09(801-807).
IEEE DOI 0910
BibRef

Salmen, J.[Jan], Schlipsing, M.[Marc], Edelbrunner, J.[Johann], Hegemann, S.[Stefan], Lüke, S.[Stefan],
Real-Time Stereo Vision: Making More Out of Dynamic Programming,
CAIP09(1096-1103).
Springer DOI 0909
BibRef

Sung, M.C.[Min Chul], Lee, S.H.[Sang Hwa], Cho, N.I.[Nam Ik],
Stereo Matching using Multi-Directional Dynamic Programming and Edge Orientations,
ICIP07(I: 233-236).
IEEE DOI 0709
BibRef

Srivastava, S.[Sumit], Ha, S.J.[Seong Jong], Lee, S.H.[Sang Hwa], Cho, N.I.[Nam Ik], Lee, S.U.[Sang Uk],
Stereo matching using hierarchical belief propagation along ambiguity gradient,
ICIP09(2085-2088).
IEEE DOI 0911
BibRef

Deng, Y.[Yi], Lin, X.Y.[Xue-Yin],
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming,
ECCV06(III: 201-212).
Springer DOI 0608
BibRef

Sorgi, L.[Lorenzo],
Two-View Geometry estimation using the Rodrigues Rotation Formula,
ICIP11(1009-1012).
IEEE DOI 1201
BibRef

Sorgi, L.[Lorenzo],
Partial Overlap Stereo,
3DTV07(1-4).
IEEE DOI 0705
BibRef

Sorgi, L.[Lorenzo], Neri, A.,
Bidirectional Dynamic Programming for Stereo Matching,
ICIP06(1013-1016).
IEEE DOI 0610
BibRef

Kim, J.C.[Jae Chul], Lee, K.M.[Kyoung Mu], Choi, B.T.[Byoung Tae], Lee, S.U.[Sang Uk],
A Dense Stereo Matching Using Two-Pass Dynamic Programming with Generalized Ground Control Points,
CVPR05(II: 1075-1082).
IEEE DOI 0507
BibRef

Forstmann, S.[Sven], Kanou, Y.[Yutaka], Ohya, J.[Jun], Thuering, S.[Sven], Schmitt, A.[Alfred],
Real-Time Stereo by using Dynamic Programming,
Sensor3D04(29).
IEEE DOI 0406
BibRef

Ueshiba, T., Kawai, Y., Sumi, Y., Tomita, F., Ishiyama, Y.,
An Efficient Matching Algorithm for Segment-based Stereo Vision Using Dynamic Programming Technique,
MVA98(xx-yy). BibRef 9800

Shao, Y., Mayhew, J.E.W.[John E.W.],
A Model-Driven Stereo Correspondence Algorithm Using Dynamic Programming,
BMVC96(Poster Session 2). 9608
University of Sheffield BibRef

Wu, Y.F., Maitre, H.,
A New Dynamic Programming Method for Stereovision Ignoring Epipolar Geometry,
ICPR88(I: 146-148).
IEEE DOI 8811

See also Improving Dynamic Programming to Solve Image Registration. BibRef

Ohta, Y., Yamamoto, T., and Ikeda, K.,
Collinear Trinocular Stereo Using Two-Level Dynamic Programming,
ICPR88(II: 658-662).
IEEE DOI
See also Stereo by Intra- and Inter-scanline Search Using Dynamic Programming. BibRef 8800

Ohta, Y., Takano, K., Ikeda, K.,
A Highspeed Stereo Matching System Based on Dynamic Programming,
ICCV87(335-342). BibRef 8700

Ohta, Y., Watanabe, M., and Ikeda, K.,
Improving Depth Map by Right-Angled Trinocular Stereo,
ICPR86(519-521). BibRef 8600

Chapter on Stereo: Three Dimensional Descriptions from Two or More Views, Binocular, Trinocular continues in
Other Stereo Work .


Last update:Mar 16, 2024 at 20:36:19