资源论文Filter Forests for Learning Data-Dependent Convolutional Kernels

Filter Forests for Learning Data-Dependent Convolutional Kernels

2019-12-11 | |  65 |   37 |   0

Abstract

We propose fifilter forests(FF), an effificient new discriminative approach for predicting continuous variables given a signal and its context. FF can be used for general signal restoration tasks that can be tackled via convolutional fifiltering, where it attempts to learn the optimal fifiltering kernels to be applied to each data point. The model can learn both the size of the kernel and its values, conditioned on the observation and its spatial or temporal context. We show that FF compares favorably to both Markov random fifield based and recently proposed regression forest based approaches for labeling problems in terms of effificiency and accuracy. In particular, we demonstrate how FF can be used to learn optimal denoising fifilters for natural images as well as for other tasks such as depth image refifinement, and 1D signal magnitude estimation. Numerous experiments and quantitative comparisons show that FFs achieve accuracy at par or superior to recent state of the art techniques, while being several orders of magnitude faster

上一篇:Newton Greedy Pursuit: a Quadratic Approximation Method for Sparsity-Constrained Optimization

下一篇:Learning Everything about Anything: Webly-Supervised Visual Concept Learning

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...