Fanello, SR; Valentin, J; Kowdle, A; Rhemann, C; Tankovich, V; Ciliberto, C; Davidson, P; Fanello, SR; Valentin, J; Kowdle, A; Rhemann, C; Tankovich, V; Ciliberto, C; Davidson, P; Izadi, S; - view fewer (2017) Low Compute and Fully Parallel Computer Vision with HashMatch. In: Proceedings of the IEEE International Conference on Computer Vision (ICCV) 2017. (pp. pp. 3894-3903). Institute of Electrical and Electronics Engineers (IEEE)

Preview

Text Fanello_Low_Compute_and_ICCV_2017_paper.pdf - Published Version Download (1MB) | Preview

Abstract

Numerous computer vision problems such as stereo depth estimation, object-class segmentation and fore-ground/background segmentation can be formulated as per-pixel image labeling tasks. Given one or many images as input, the desired output of these methods is usually a spatially smooth assignment of labels. The large amount of such computer vision problems has lead to significant research efforts, with the state of art moving from CRF-based approaches to deep CNNs and more recently, hybrids of the two. Although these approaches have significantly advanced the state of the art, the vast majority has solely focused on improving quantitative results and are not designed for low-compute scenarios. In this paper, we present a new general framework for a variety of computer vision labeling tasks, called HashMatch. Our approach is designed to be both fully parallel, i.e. each pixel is independently processed, and low-compute, with a model complexity an order of magnitude less than existing CNN and CRF-based approaches. We evaluate HashMatch extensively on several problems such as disparity estimation, image retrieval, feature approximation and background subtraction, for which HashMatch achieves high computational efficiency while producing high quality results.

Download activity - last month

Export as JSONXMLCSV

Download activity - last 12 months

Export as CSVJSONXML

Downloads by country - last 12 months

Export as CSVJSONXML

Archive Staff Only

View Item