Deep Haar Scattering Networks

By Xiuyuan Cheng, Xu Chen, Stéphane Mallat. 2015

31 citations recorded by the source corpus.

An orthogonal Haar scattering transform is a deep network computed with a hierarchy of additions, subtractions and absolute values over pairs of coefficients. Unsupervised learning optimizes Haar pairs to obtain sparse representations of training data with an algorithm of polynomial complexity. For signals defined on a graph, a Haar scattering is computed by cascading orthogonal Haar wavelet transforms on the graph, with Haar wavelets having connected supports. It defines a representation which is invariant to local displacements of signal values on the graph. When the graph connectivity is unknown, unsupervised Haar learning can provide a consistent estimation of connected wavelet supports. Classification results are given on image data bases, defined on regular grids or graphs, with a connectivity which may be known or unknown.

Subfields: Aerospace Engineering, Computer Vision and Pattern Recognition, Representation & Self-Supervised Learning, Model Architectures

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Aerospace Engineering

  1. Yoshua Bengio
  2. Joan Bruna
  3. Pascal Vincent
  4. Arthur Szlam
  5. Yann LeCun
  6. Pierre Vandergheynst
  7. Michael M. Bronstein
  8. Vincent Lepetit

In Computer Vision and Pattern Recognition

  1. Yoshua Bengio
  2. Luc Van Gool
  3. Dacheng Tao
  4. Xiaogang Wang
  5. Trevor Darrell
  6. Jitendra Malik
  7. Ming-Hsuan Yang
  8. Andrea Vedaldi

In Representation & Self-Supervised Learning

  1. Yoshua Bengio
  2. Pascal Vincent
  3. Yann LeCun
  4. Guillaume Alain
  5. Joan Bruna
  6. Jason Yosinski
  7. Kyunghyun Cho
  8. L. Yao

In Model Architectures

  1. Yoshua Bengio
  2. Michael M. Bronstein
  3. Joan Bruna
  4. Yann LeCun
  5. Arthur Szlam
  6. Pascal Vincent
  7. Saizheng Zhang
  8. L. Yao

Citations in the corpus