Analog system for computing sparse codes

Patent · Tue Aug 24 00:00:00 EDT 2010

OSTI ID:1013614

Rozell, Christopher John ^[1]; Johnson, Don Herrick ^[2]; Baraniuk, Richard Gordon ^[2]; Olshausen, Bruno A ^[3]; Ortman, Robert Lowell ^[2]

---

1. El Cerrito, CA
2. Houston, TX
3. San Francisco, CA

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.

• Research Organization: William Marsh Rice University (Houston, TX)
• Sponsoring Organization: USDOE
• DOE Contract Number: FC02-01ER25462
• Assignee: William Marsh Rice University (Houston, TX)
• Patent Number(s): 7,783,459
• Application Number: 12/035,424
• OSTI ID: 1013614
• Country of Publication: United States
• Language: English