Tree structured sparse coding on cubes

01/16/2013
by   Arthur Szlam, et al.
0

A brief description of tree structured sparse coding on the binary cube.

READ FULL TEXT
research
02/28/2012

Fast approximations to structured sparse coding and applications to object classification

We describe a method for fast approximation of sparse coding. The input ...
research
06/18/2012

Learning Efficient Structured Sparse Models

We present a comprehensive framework for structured sparse coding and mo...
research
07/15/2019

Single-Component Privacy Guarantees in Helper Data Systems and Sparse Coding

We investigate the privacy of two approaches to (biometric) template pro...
research
02/12/2021

Querying collections of tree-structured records in the presence of within-record referential constraints

In this paper, we consider a tree-structured data model used in many com...
research
10/11/2016

Restoring STM images via Sparse Coding: noise and artifact removal

In this article, we present a denoising algorithm to improve the interpr...
research
10/22/2022

Structure-Unified M-Tree Coding Solver for MathWord Problem

As one of the challenging NLP tasks, designing math word problem (MWP) s...
research
04/12/2011

From a Modified Ambrosio-Tortorelli to a Randomized Part Hierarchy Tree

We demonstrate the possibility of coding parts, features that are higher...

Please sign up or login with your details

Forgot password? Click here to reset