Towards Generalizable Distance Estimation by Leveraging Graph Information
Abstract
Approximating the distance of objects present in an image remains an important problem for computer vision applications. Current SOTA methods rely on formulating this problem to convenience depth estimation at every pixel; however, there are limitations that make such solutions non-generalizable (i.e varying focal length). To address this issue, we propose reformulating distance approximation to a per-object detection problem and leveraging graph information extracted from the image to potentially achieve better generalizability on data acquired at multiple focal lengths.
Cite
Text
Cava et al. "Towards Generalizable Distance Estimation by Leveraging Graph Information." IEEE/CVF International Conference on Computer Vision Workshops, 2019. doi:10.1109/ICCVW.2019.00565Markdown
[Cava et al. "Towards Generalizable Distance Estimation by Leveraging Graph Information." IEEE/CVF International Conference on Computer Vision Workshops, 2019.](https://mlanthology.org/iccvw/2019/cava2019iccvw-generalizable/) doi:10.1109/ICCVW.2019.00565BibTeX
@inproceedings{cava2019iccvw-generalizable,
title = {{Towards Generalizable Distance Estimation by Leveraging Graph Information}},
author = {Cava, John Kevin and Houghton, Todd and Yu, Hongbin},
booktitle = {IEEE/CVF International Conference on Computer Vision Workshops},
year = {2019},
pages = {4603-4605},
doi = {10.1109/ICCVW.2019.00565},
url = {https://mlanthology.org/iccvw/2019/cava2019iccvw-generalizable/}
}