Deep Haar scattering networks

From MaRDI portal
Publication:4603720

DOI10.1093/IMAIAI/IAW007zbMATH Open1380.68331arXiv1509.09187OpenAlexW2230873857MaRDI QIDQ4603720FDOQ4603720


Authors: Xiuyuan Cheng, Xu Chen, Stéphane Mallat Edit this on Wikidata


Publication date: 19 February 2018

Published in: Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Abstract: An orthogonal Haar scattering transform is a deep network, computed with a hierarchy of additions, subtractions and absolute values, over pairs of coefficients. It provides a simple mathematical model for unsupervised deep network learning. It implements non-linear contractions, which are optimized for classification, with an unsupervised pair matching algorithm, of polynomial complexity. A structured Haar scattering over graph data computes permutation invariant representations of groups of connected points in the graph. If the graph connectivity is unknown, unsupervised Haar pair learning can provide a consistent estimation of connected dyadic groups of points. Classification results are given on image data bases, defined on regular grids or graphs, with a connectivity which may be known or unknown.


Full work available at URL: https://arxiv.org/abs/1509.09187




Recommendations




Cites Work


Cited In (12)

Uses Software





This page was built for publication: Deep Haar scattering networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603720)