pith. sign in

arxiv: 1509.09187 · v1 · pith:BTDBB24Pnew · submitted 2015-09-30 · 💻 cs.LG

Deep Haar Scattering Networks

classification 💻 cs.LG
keywords haardeepgraphscatteringunsupervisedclassificationconnectedconnectivity
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.