-
1
-
-
84973862494
-
A global stereo model with mesh alignment regularization for view interpolation
-
6 Anonymous
-
Anonymous. A global stereo model with mesh alignment regularization for view interpolation. Listed on the Middlebury stereo benchmark, 2015. 6
-
(2015)
Listed on the Middlebury Stereo Benchmark
-
-
-
2
-
-
84973880011
-
Using local cues to improve dense stereo matching
-
6 Anonymous
-
Anonymous. Using local cues to improve dense stereo matching. Listed on the Middlebury stereo benchmark, 2015. 6
-
(2015)
Listed on the Middlebury Stereo Benchmark
-
-
-
3
-
-
57549092581
-
Simple but effective tree structures for dynamic programming-based stereo matching
-
1, 2, 4, 7, 8
-
M. Bleyer and M. Gelautz. Simple but effective tree structures for dynamic programming-based stereo matching. In In VISAPP, pages 415-422, 2008. 1, 2, 4, 7, 8
-
(2008)
VISAPP
, pp. 415-422
-
-
Bleyer, M.1
Gelautz, M.2
-
4
-
-
0035509961
-
Fast approximate energy minimization via graph cuts
-
2, Nov.
-
Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23 (11): 1222-1239, Nov. 2001. 2
-
(2001)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.23
, Issue.11
, pp. 1222-1239
-
-
Boykov, Y.1
Veksler, O.2
Zabih, R.3
-
5
-
-
84884591215
-
Information permeability for stereo matching
-
6, Oct.
-
C. Cigla and A. A. Alatan. Information permeability for stereo matching. Signal Processing: Image Communication, 28 (9): 1072-1088, Oct. 2013. 6
-
(2013)
Signal Processing: Image Communication
, vol.28
, Issue.9
, pp. 1072-1088
-
-
Cigla, C.1
Alatan, A.A.2
-
6
-
-
4344665182
-
Computational methods for hidden Markov tree models-an application to wavelet trees
-
2, 3, Sept.
-
J.-B. Durand, P. Goncalves, and Y. Guedon. Computational methods for hidden Markov tree models-an application to wavelet trees. IEEE Transactions on Signal Processing, 52 (9): 2551-2560, Sept. 2004. 2, 3
-
(2004)
IEEE Transactions on Signal Processing
, vol.52
, Issue.9
, pp. 2551-2560
-
-
Durand, J.-B.1
Goncalves, P.2
Guedon, Y.3
-
8
-
-
0015600423
-
The viterbi algorithm
-
2, Mar
-
J. Forney, G. D. The viterbi algorithm. Proceedings of the IEEE, 61 (3): 268-278, Mar. 1973. 2
-
(1973)
Proceedings of the IEEE
, vol.61
, Issue.3
, pp. 268-278
-
-
Forney, J.G.D.1
-
9
-
-
37549015676
-
Stereo processing by semiglobal matching and mutual information
-
1, 2, 4, 6, 7, 8, Feb.
-
H. Hirschmuller. Stereo Processing by Semiglobal Matching and Mutual Information. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30 (2): 328-341, Feb. 2008. 1, 2, 4, 6, 7, 8
-
(2008)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.30
, Issue.2
, pp. 328-341
-
-
Hirschmuller, H.1
-
12
-
-
33750129298
-
Convergent tree-reweighted message passing for energy minimization
-
2, Oct.
-
V. Kolmogorov. Convergent Tree-Reweighted Message Passing for Energy Minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28 (10): 1568-1583, Oct. 2006. 2
-
(2006)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.28
, Issue.10
, pp. 1568-1583
-
-
Kolmogorov, V.1
-
13
-
-
84872319772
-
Real-time stereo matching on CUDA using an iterative refinement method for adaptive support-weight correspondences
-
6, Jan.
-
J. Kowalczuk, E. Psota, and L. Perez. Real-Time Stereo Matching on CUDA Using an Iterative Refinement Method for Adaptive Support-Weight Correspondences. IEEE Transactions on Circuits and Systems for Video Technology, 23 (1): 94-104, Jan. 2013. 6
-
(2013)
IEEE Transactions on Circuits and Systems for Video Technology
, vol.23
, Issue.1
, pp. 94-104
-
-
Kowalczuk, J.1
Psota, E.2
Perez, L.3
-
14
-
-
70350674995
-
On the shortest spanning subtree of a graph and the traveling salesman problem
-
3, Feb.
-
J. B. Kruskal, Jr. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society, 7 (1): 48-50, Feb. 1956. 3
-
(1956)
Proceedings of the American Mathematical Society
, vol.7
, Issue.1
, pp. 48-50
-
-
Kruskal, J.B.1
-
15
-
-
7044232895
-
The minimum spanning tree problem on a planar graph
-
6, Mar.
-
T. Matsui. The minimum spanning tree problem on a planar graph. Discrete Applied Mathematics, 58 (1): 91-94, Mar. 1995. 6
-
(1995)
Discrete Applied Mathematics
, vol.58
, Issue.1
, pp. 91-94
-
-
Matsui, T.1
-
18
-
-
84908693023
-
High-resolution stereo datasets with subpixel-accurate ground truth
-
1, X. Jiang, J. Hornegger, and R. Koch, editors. Springer International Publishing, Jan.
-
D. Scharstein, H. Hirschmuller, Y. Kitajima, G. Krathwohl, N. Nešíc, X. Wang, and P. Westling. High-Resolution Stereo Datasets with Subpixel-Accurate Ground Truth. In X. Jiang, J. Hornegger, and R. Koch, editors, Pattern Recognition, Lecture Notes in Computer Science, pages 31-42. Springer International Publishing, Jan. 2014. 1
-
(2014)
Pattern Recognition, Lecture Notes in Computer Science
, pp. 31-42
-
-
Scharstein, D.1
Hirschmuller, H.2
Kitajima, Y.3
Krathwohl, G.4
Nešíc, N.5
Wang, X.6
Westling, P.7
-
20
-
-
0036537472
-
A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
-
1, 5, Apr.
-
D. Scharstein and R. Szeliski. A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms. International Journal of Computer Vision, 47 (1-3): 7-42, Apr. 2002. 1, 5
-
(2002)
International Journal of Computer Vision
, vol.47
, Issue.1-3
, pp. 7-42
-
-
Scharstein, D.1
Szeliski, R.2
-
22
-
-
0042850432
-
Stereo matching using belief propagation
-
2, July
-
J. Sun, N.-N. Zheng, and H.-Y. Shum. Stereo matching using belief propagation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25 (7): 787-800, July 2003. 2
-
(2003)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.25
, Issue.7
, pp. 787-800
-
-
Sun, J.1
Zheng, N.-N.2
Shum, H.-Y.3
-
23
-
-
43249091850
-
A comparative study of energy minimization methods for markov random fields with smoothness-based priors
-
2, June
-
R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30 (6): 1068-1080, June 2008. 2
-
(2008)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.30
, Issue.6
, pp. 1068-1080
-
-
Szeliski, R.1
Zabih, R.2
Scharstein, D.3
Veksler, O.4
Kolmogorov, V.5
Agarwala, A.6
Tappen, M.7
Rother, C.8
-
25
-
-
84866709607
-
A non-local cost aggregation method for stereo matching
-
1, 2, 7, 8, June
-
Q. Yang. A non-local cost aggregation method for stereo matching. In 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 1402-1409, June 2012. 1, 2, 7, 8
-
(2012)
2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
, pp. 1402-1409
-
-
Yang, Q.1
-
26
-
-
84867863845
-
Recursive bilateral filtering
-
7, 8 A. Fitzgibbon, S. Lazebnik, P. Perona, Y. Sato, and C. Schmid, editors,. Springer Berlin Heidelberg
-
Q. Yang. Recursive Bilateral Filtering. In A. Fitzgibbon, S. Lazebnik, P. Perona, Y. Sato, and C. Schmid, editors, Computer Vision-ECCV 2012, number 7572 in Lecture Notes in Computer Science, pages 399-413. Springer Berlin Heidelberg, 2012. 7, 8
-
(2012)
Computer Vision-ECCV 2012, Number 7572 in Lecture Notes in Computer Science
, pp. 399-413
-
-
Yang, Q.1
-
27
-
-
24644513975
-
Locally adaptive supportweight approach for visual correspondence search
-
2, 3, 8, June
-
K.-J. Yoon and I.-S. Kweon. Locally adaptive supportweight approach for visual correspondence search. In IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005. CVPR 2005, volume 2, pages 924-931 vol. 2, June 2005. 2, 3, 8
-
(2005)
IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005. CVPR 2005
, vol.2
, pp. 924-931
-
-
Yoon, K.-J.1
Kweon, I.-S.2
-
28
-
-
85010188314
-
Non-parametric local transforms for computing visual correspondence
-
5 J.-O. Eklundh, editor. Springer Berlin Heidelberg
-
R. Zabih and J. Woodfill. Non-parametric local transforms for computing visual correspondence. In J.-O. Eklundh, editor, Computer Vision-ECCV '94, number 801 in Lecture Notes in Computer Science, pages 151-158. Springer Berlin Heidelberg, 1994. 5
-
(1994)
Computer Vision-ECCV '94, Number 801 in Lecture Notes in Computer Science
, pp. 151-158
-
-
Zabih, R.1
Woodfill, J.2
|