1 |
3D Shape Measurements Using Stereo Vision MethodSong, Chia-Ming 27 November 2007 (has links)
This paper presents a novel technique which actually restructures the 3D image profiled by stereovision method. Correspondence between two images is addressed by projecting a 2D fringe pattern. These projected patterns fix their positions to the tested object during two segmented measurements. Finding two matched surface points becomes a problem of searching for two identical phases in the fused data sets. The proposed method is superior to the other methods because of the following reasons:
(1)We successfully designed a 2-D fringe pattern whose the transmittance is sinusoidal and the accuracy of the sinusoidal fringe pattern was of the order of sub-microns.
(2)By using the 2-D fringe pattern, image registration was achieved more easily.
(3)By using the optical spot method, the 3d image profiled was restructured such that the computational time was reduced and the crabwise accuracy was better than that of a single CCD system.
|
2 |
Point, Line Segment, and Region-Based Stereo Matching for Mobile RoboticsMcKinnon, Brian Paul 04 September 2009 (has links)
At the heart of every stereo vision algorithm is a solution to the matching problem - the problem of finding points in the right and left image that correspond to a single point in the real world. Applying assumptions regarding the epipolar rectification and color similarity between two frames is often not possible for real-world image capture systems, like those used in urban search and rescue robots. More flexible and robust feature descriptors are necessary to operate under harsh real world conditions. This thesis compares the accuracy of disparity images generated using local features including points, line segments, and regions, as well as a global framework implemented using loopy belief propagation. This thesis will introduce two new algorithms for stereo matching using line segments and regions, as well as several support structures that optimize the algorithms performance and accuracy. Since few complete frameworks exist for line segment and region features, new algorithms that were developed during the research for this thesis will be outlined and evaluated. The comparison includes quantitative evaluation using the Middlebury stereo image pairs and qualitative evaluation using images from a less structured environment. Since this evaluation is grounded in urban search and rescue robotics, processing time is a significant constraint which will be evaluated for each algorithm. This thesis will show that line segment-based stereo vision with a gradient descriptor achieves at least a 10% better accuracy than all other methods used in this evaluation while maintaining the low runtime associated with local feature based stereo vision.
|
3 |
Point, Line Segment, and Region-Based Stereo Matching for Mobile RoboticsMcKinnon, Brian Paul 04 September 2009 (has links)
At the heart of every stereo vision algorithm is a solution to the matching problem - the problem of finding points in the right and left image that correspond to a single point in the real world. Applying assumptions regarding the epipolar rectification and color similarity between two frames is often not possible for real-world image capture systems, like those used in urban search and rescue robots. More flexible and robust feature descriptors are necessary to operate under harsh real world conditions. This thesis compares the accuracy of disparity images generated using local features including points, line segments, and regions, as well as a global framework implemented using loopy belief propagation. This thesis will introduce two new algorithms for stereo matching using line segments and regions, as well as several support structures that optimize the algorithms performance and accuracy. Since few complete frameworks exist for line segment and region features, new algorithms that were developed during the research for this thesis will be outlined and evaluated. The comparison includes quantitative evaluation using the Middlebury stereo image pairs and qualitative evaluation using images from a less structured environment. Since this evaluation is grounded in urban search and rescue robotics, processing time is a significant constraint which will be evaluated for each algorithm. This thesis will show that line segment-based stereo vision with a gradient descriptor achieves at least a 10% better accuracy than all other methods used in this evaluation while maintaining the low runtime associated with local feature based stereo vision.
|
4 |
Underwater Stereo Matching and its CalibrationGedge, Jason Unknown Date
No description available.
|
5 |
Shape-Time PhotographyFreeman, William T., Zhang, Hao 10 January 2002 (has links)
We introduce a new method to describe, in a single image, changes in shape over time. We acquire both range and image information with a stationary stereo camera. From the pictures taken, we display a composite image consisting of the image data from the surface closest to the camera at every pixel. This reveals the 3-d relationships over time by easy-to-interpret occlusion relationships in the composite image. We call the composite a shape-time photograph. Small errors in depth measurements cause artifacts in the shape-time images. We correct most of these using a Markov network to estimate the most probable front surface, taking into account the depth measurements, their uncertainties, and layer continuity assumptions.
|
6 |
Human Facial Animation Based on Real Image SequenceChang, Ying-Liang 19 May 2003 (has links)
none
|
7 |
Stereoselective bond formation via lithiation of asymmetric acyclic sulfidesCondon, Brian D. 12 1900 (has links)
No description available.
|
8 |
Machine vision for shape and object recognitionD'Souza, Collin January 2000 (has links)
No description available.
|
9 |
HRTF lösning för stereodipolRessem, Björn January 2014 (has links)
No description available.
|
10 |
Stereophonic sound and its impact upon the Communications industrySunier, John Henry January 1959 (has links)
Thesis (M.S.)--Boston University
|
Page generated in 0.0767 seconds