Solving the Depth Interpolation Problem on a Parallel Architecture with a Multigrid Approach
Abstract
The authors discuss solving the depth interpolation problem on a parallel architecture, a fine-grained SIMD (single-instruction, multiple data stream) machine with local and global communication networks. Many constraint propagation problems in early vision, including depth interpolation, can be cast as solving a large system of linear equations where the resulting matrix is symmetric and positive definite (SPD). Usually, the resulting SPD matrix is sparse. The authors show how the adaptive Chebyshev acceleration and the conjugate gradient methods accelerated further with a multigrid approach can be run on this parallel architecture for sparse SPD matrices. They give numerical results for fairly large synthetic images, and compare them with the results from the Gauss-Seidel method accelerated also with a multigrid approach.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Choi and Kender. "Solving the Depth Interpolation Problem on a Parallel Architecture with a Multigrid Approach." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988. doi:10.1109/CVPR.1988.196235Markdown
[Choi and Kender. "Solving the Depth Interpolation Problem on a Parallel Architecture with a Multigrid Approach." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988.](https://mlanthology.org/cvpr/1988/choi1988cvpr-solving/) doi:10.1109/CVPR.1988.196235BibTeX
@inproceedings{choi1988cvpr-solving,
title = {{Solving the Depth Interpolation Problem on a Parallel Architecture with a Multigrid Approach}},
author = {Choi, Dong J. and Kender, John R.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1988},
pages = {189-194},
doi = {10.1109/CVPR.1988.196235},
url = {https://mlanthology.org/cvpr/1988/choi1988cvpr-solving/}
}