|
Search the dblp DataBase
Daniel Scharstein:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Matthew Dickerson, Daniel Scharstein
The Rotation Diagram and Optimal Containing Placements of a Convex Polygon. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1996, pp:0-9 [Conf]
- Daniel Scharstein
Stereo Vision for View Synthesis. [Citation Graph (0, 0)][DBLP] CVPR, 1996, pp:852-0 [Conf]
- Daniel Scharstein, Richard Szeliski
High-Accuracy Stereo Depth Maps Using Structured Light. [Citation Graph (0, 0)][DBLP] CVPR (1), 2003, pp:195-202 [Conf]
- Daniel Scharstein, Richard Szeliski
Stereo Matching with Non-Linear Diffusion. [Citation Graph (0, 0)][DBLP] CVPR, 1996, pp:343-350 [Conf]
- Steven M. Seitz, Brian Curless, James Diebel, Daniel Scharstein, Richard Szeliski
A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms. [Citation Graph (0, 0)][DBLP] CVPR (1), 2006, pp:519-528 [Conf]
- Richard Szeliski, Daniel Scharstein
Symmetric Sub-Pixel Stereo Matching. [Citation Graph (0, 0)][DBLP] ECCV (2), 2002, pp:525-540 [Conf]
- Richard Szeliski, Ramin Zabih, Daniel Scharstein, Olga Veksler, Vladimir Kolmogorov, Aseem Agarwala, Marshall F. Tappen, Carsten Rother
A Comparative Study of Energy Minimization Methods for Markov Random Fields. [Citation Graph (0, 0)][DBLP] ECCV (2), 2006, pp:16-29 [Conf]
- Amy J. Briggs, Daniel Scharstein, Darius Braziunas, Cristian Dima, Peter Wall
Mobile Robot Navigation using Self-Similar Landmarks. [Citation Graph (0, 0)][DBLP] ICRA, 2000, pp:1428-1434 [Conf]
- Matthew Dickerson, Daniel Scharstein
Optimal Placement of Convex Polygons to Maximize Point Containment. [Citation Graph (0, 0)][DBLP] SODA, 1996, pp:114-121 [Conf]
- Matthew Dickerson, Daniel Scharstein
Optimal placement of convex polygons to maximize point containment. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1998, v:11, n:1, pp:1-16 [Journal]
- Daniel Scharstein, Richard Szeliski
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms. [Citation Graph (0, 0)][DBLP] International Journal of Computer Vision, 2002, v:47, n:1-3, pp:7-42 [Journal]
- Amy J. Briggs, Carrick Detweiler, Daniel Scharstein, Alexander Vandenberg-Rodes
Expected Shortest Paths for Landmark-Based Robot Navigation. [Citation Graph (0, 0)][DBLP] I. J. Robotic Res., 2004, v:23, n:7-8, pp:717-728 [Journal]
- Daniel Scharstein, Amy J. Briggs
Real-time recognition of self-similar landmarks. [Citation Graph (0, 0)][DBLP] Image Vision Comput., 2001, v:19, n:11, pp:763-772 [Journal]
- Alberto Maria Segre, Daniel Scharstein
Bounded-Overhead Caching for Definite-Clause Theorem Proving. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 1993, v:11, n:1, pp:83-113 [Journal]
- Richard Szeliski, Daniel Scharstein
Sampling the Disparity Space Image. [Citation Graph (0, 0)][DBLP] IEEE Trans. Pattern Anal. Mach. Intell., 2003, v:26, n:3, pp:419-425 [Journal]
- Heiko Hirschmüller, Daniel Scharstein
Evaluation of Cost Functions for Stereo Matching. [Citation Graph (0, 0)][DBLP] CVPR, 2007, pp:- [Conf]
- Daniel Scharstein, Chris Pal
Learning Conditional Random Fields for Stereo. [Citation Graph (0, 0)][DBLP] CVPR, 2007, pp:- [Conf]
A Database and Evaluation Methodology for Optical Flow. [Citation Graph (, )][DBLP]
Robot Navigation using 1D Panoramic Images. [Citation Graph (, )][DBLP]
Matching scale-space features in 1D panoramas. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs
|