-
1
-
-
23744452484
-
A fast, parallel spanning tree algorithm for symmetric multiprocessors (smps)
-
D. Bader and G. Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (smps). Journal of Parallel and Distributed Computing, 65:994-1006, 2005.
-
(2005)
Journal of Parallel and Distributed Computing
, vol.65
, pp. 994-1006
-
-
Bader, D.1
Cong, G.2
-
2
-
-
0033356588
-
Large occlusion stereo
-
A. Bobick and S. Intille. Large occlusion stereo. IJCV, 33:181-200, 1999.
-
(1999)
IJCV
, vol.33
, pp. 181-200
-
-
Bobick, A.1
Intille, S.2
-
3
-
-
0035509961
-
Fast approximate energy minimization via graph cuts
-
Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. PAMI, 23(11):1222-1239, 2001.
-
(2001)
PAMI
, vol.23
, Issue.11
, pp. 1222-1239
-
-
Boykov, Y.1
Veksler, O.2
Zabih, R.3
-
5
-
-
35148812651
-
Spatialdepth super resolution for range images
-
Q. Yang, R. Yang, J. Davis, and D. Nistér. Spatialdepth super resolution for range images. In CVPR, 2007.
-
(2007)
CVPR
-
-
Yang, Q.1
Yang, R.2
Davis, J.3
Nistér, D.4
-
6
-
-
33144482417
-
Adaptive support weight approach for correspondence search
-
K.-J. Yoon and I.-S. Kweon. Adaptive support weight approach for correspondence search. PAMI, 28(4):650-656, 2006.
-
(2006)
PAMI
, vol.28
, Issue.4
, pp. 650-656
-
-
Yoon, K.-J.1
Kweon, I.-S.2
-
7
-
-
80052908093
-
Fast cost-volume filtering for visual correspondence and beyond
-
C.Rhemann, A. Hosni, M. Bleyer, C. Rother, and M. Gelautz. Fast cost-volume filtering for visual correspondence and beyond. In CVPR, pages 3017-3024, 2011.
-
(2011)
CVPR
, pp. 3017-3024
-
-
Rhemann, C.1
Hosni, A.2
Bleyer, M.3
Rother, C.4
Gelautz, M.5
-
8
-
-
0005090507
-
Summed-area tables for texture mapping
-
F. Crow. Summed-area tables for texture mapping. In Siggraph, 1984.
-
(1984)
Siggraph
-
-
Crow, F.1
-
10
-
-
7044232895
-
The minimum spanning tree problem on a planar graph
-
T. Matsui. The minimum spanning tree problem on a planar graph. Discrete Applied Mathematics, pages 91-94, 1995.
-
(1995)
Discrete Applied Mathematics
, pp. 91-94
-
-
Matsui, T.1
-
11
-
-
84863011842
-
A revisit to cost aggregation in stereo matching: How far can we reduce its computational redundancy?
-
D. Min, J. Lu, and M. Do. A revisit to cost aggregation in stereo matching: How far can we reduce its computational redundancy? In ICCV, 2011.
-
(2011)
ICCV
-
-
Min, D.1
Lu, J.2
Do, M.3
-
12
-
-
58049134708
-
A fast approximation of the bilateral filter using a signal processing approach
-
January
-
S. Paris and F. Durand. A fast approximation of the bilateral filter using a signal processing approach. IJCV, 81:24-52, January 2009.
-
(2009)
IJCV
, vol.81
, pp. 24-52
-
-
Paris, S.1
Durand, F.2
-
13
-
-
0034291933
-
Learning low-level vision
-
W. T. Freeman, E. Pasztor, and O. T. Carmichael. Learning low-level vision. IJCV, 40(1):25-47, 2000.
-
(2000)
IJCV
, vol.40
, Issue.1
, pp. 25-47
-
-
Freeman, W.T.1
Pasztor, E.2
Carmichael, O.T.3
-
14
-
-
0042850432
-
Stereo matching using belief propagation
-
J. Sun, N. Zheng, and H. Y. Shum. Stereo matching using belief propagation. PAMI, 25(7):787-800, 2003.
-
(2003)
PAMI
, vol.25
, Issue.7
, pp. 787-800
-
-
Sun, J.1
Zheng, N.2
Shum, H.Y.3
-
15
-
-
77955985724
-
A constant-space belief propagation algorithm for stereo matching
-
Q. Yang, L. Wang, and N. Ahuja. A constant-space belief propagation algorithm for stereo matching. In CVPR, pages 1458-1465, 2010.
-
(2010)
CVPR
, pp. 1458-1465
-
-
Yang, Q.1
Wang, L.2
Ahuja, N.3
-
16
-
-
59549096783
-
Stereo matching with color-weighted correlation, hierachical belief propagation and occlusion handling
-
Q. Yang, L.Wang, R. Yang, H. Stewenius, and D. Nister. Stereo matching with color-weighted correlation, hierachical belief propagation and occlusion handling. PAMI, 31(3):492-504, 2009.
-
(2009)
PAMI
, vol.31
, Issue.3
, pp. 492-504
-
-
Yang, Q.1
Wang, L.2
Yang, R.3
Stewenius, H.4
Nister, D.5
-
17
-
-
51949114567
-
Constant time o(1) bilateral filtering
-
F. Porikli. Constant time o(1) bilateral filtering. InCVPR, 2008.
-
(2008)
CVPR
-
-
Porikli, F.1
-
18
-
-
78149342852
-
Real-time spatiotemporal stereo matching using the dual-cross-bilateral grid
-
C. Richardt, D. Orr, I. Davies, A. Criminisi, and N. Dodgson. Real-time spatiotemporal stereo matching using the dual-cross-bilateral grid. In ECCV, pages510-523, 2010.
-
(2010)
ECCV
, pp. 510-523
-
-
Richardt, C.1
Orr, D.2
Davies, I.3
Criminisi, A.4
Dodgson, N.5
-
19
-
-
78149318033
-
Guided image filtering
-
K. He, J. Sun, and X. Tang. Guided image filtering. In ECCV, pages 1-14, 2010.
-
(2010)
ECCV
, pp. 1-14
-
-
He, K.1
Sun, J.2
Tang, X.3
-
21
-
-
0036537472
-
A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
-
D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV, 47:7-42, 2002.
-
(2002)
IJCV
, vol.47
, pp. 7-42
-
-
Scharstein, D.1
Szeliski, R.2
-
22
-
-
0032319446
-
Bilateral filtering forgray and color images
-
C. Tomasi and R. Manduchi. Bilateral filtering forgray and color images. In ICCV, pages 839-846, 1998.
-
(1998)
ICCV
, pp. 839-846
-
-
Tomasi, C.1
Manduchi, R.2
-
23
-
-
24644500353
-
Stereo correspondence by dynamic programming on a tree
-
O. Veksler. Stereo correspondence by dynamic programming on a tree. In CVPR, pages 384-390, 2005.
-
(2005)
CVPR
, pp. 384-390
-
-
Veksler, O.1
-
25
-
-
70450192877
-
Real-time o(1)bilateral filtering
-
Q. Yang, K.-H. Tan, and N. Ahuja. Real-time o(1)bilateral filtering. In CVPR, 2009.
-
(2009)
CVPR
-
-
Yang, Q.1
Tan, K.-H.2
Ahuja, N.3
-
26
-
-
77956008934
-
Svm for edge preserving filtering
-
Q. Yang, S. Wang, and N. Ahuja. Svm for edge preserving filtering. In CVPR, pages 775-1782, 2010.
-
(2010)
CVPR
, pp. 775-1782
-
-
Yang, Q.1
Wang, S.2
Ahuja, N.3
|