Coarse-To-Fine Deep Kernel Networks

Hichem Sahbi; Proceedings of the IEEE International Conference on Computer Vision (ICCV), 2017, pp. 1131-1139

Abstract


In this paper, we address the issue of efficient computation in deep kernel networks. We propose a novel framework that reduces dramatically the complexity of evaluating these deep kernels. Our method is based on a coarse-to-fine cascade of networks designed for efficient computation; early stages of the cascade are cheap and reject many patterns efficiently while deep stages are more expensive and accurate. The design principle of these reduced complexity networks is based on a variant of the cross-entropy criterion that reduces the complexity of the networks in the cascade while preserving all the positive responses of the original kernel network. Experiments conducted -- on the challenging and time demanding change detection task, on very large satellite images -- show that our proposed coarse-to-fine approach is effective and highly efficient.

Related Material


[pdf] [arXiv]
[bibtex]
@InProceedings{Sahbi_2017_ICCV,
author = {Sahbi, Hichem},
title = {Coarse-To-Fine Deep Kernel Networks},
booktitle = {Proceedings of the IEEE International Conference on Computer Vision (ICCV) Workshops},
month = {Oct},
year = {2017}
}