|
|
|
|
RI | Publications | Kernel Correlation as an Affinity Measure in
Point-Sampled Vision Problems
|
|
Text only version of this site
Kernel Correlation as an Affinity Measure in
Point-Sampled Vision Problems
Y. Tsin
doctoral dissertation, tech. report CMU-RI-TR-03-36, Robotics Institute, Carnegie Mellon University, September, 2003.
Jump to: Download | Abstract | Notes | Text Reference | BibTeX Reference
| Download [Help] |
Adobe portable document format (pdf) [8789 KB]
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
| Abstract |
Range sensors, such as laser range finder and stereo vision systems, return point-samples of a scene. Typical point-sampled vision problems include registration, regularization and merging. We introduce a robust distance minimization approach to solving the three classes of problems. The approach is based on correlating kernels centered at point-samples, a technique we call kernel correlation. Kernel correlation is an affinity measure, and it contains an M-estimator mechanism for distance mini- mization. Kernel correlation is also an entropy measure of the point set configuration. Maximizing kernel correlation implies enforcing compact point set.
The effectiveness of kernel correlation is evaluated by the three classes of problems. First, the kernel correlation based registration method is shown to be efficient, accurate and robust, and its performance is com- pared with the iterative closest point (ICP) algorithm. Second, kernel correlation is adopted as an object space regularizer in the stereo vision problem. Kernel correlation is discontinuity preserving and usually can be applied in large scales, resulting in smooth appearance of the estimated model. The performance of the algorithm is evaluated both quantitatively and qualitatively. Finally, kernel correlation plays a point-sample merg- ing role in a multiple view stereo algorithm. Kernel correlation enforces smoothness on point samples from all views, not just within a single view. As a result we can put both the photo-consistency and the model merg- ing constraints into a single energy function. Convincing reconstruction results are demonstrated.
| Notes |
Associated center: VASC
Number of pages: 200
| Text Reference |
Y. Tsin, Kernel Correlation as an Affinity Measure in Point-Sampled Vision Problems, doctoral dissertation, tech. report CMU-RI-TR-03-36, Robotics Institute, Carnegie Mellon University, September, 2003.
| BibTeX Reference |
@phdthesis{Tsin_2003_4630,
author = "Yanghai Tsin",
title = "Kernel Correlation as an Affinity Measure in
Point-Sampled Vision Problems",
school = "Robotics Institute, Carnegie Mellon University",
month = "September",
year = "2003",
address = "Pittsburgh, PA"
}