Analog system for computing sparse codes
US7783459B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 21, 2008 |
| Grant date | Aug 24, 2010 |
| Priority date | — |
| Expiry date | Dec 11, 2028 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06G7/26
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A parallel dynamical system for computing sparse representations of data, i.e., where the data can be fully represented in terms of a small number of non-zero code elements, and for reconstructing compressively sensed images. The system is based on the principles of thresholding and local competition that solves a family of sparse approximation problems corresponding to various sparsity metrics. The system utilizes Locally Competitive Algorithms (LCAs), nodes in a population continually compete with neighboring units using (usually one-way) lateral inhibition to calculate coefficients representing an input in an over complete dictionary.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.