Analog system for computing sparse codes

dc.contributor.assigneeRice Universityen_US
dc.contributor.publisherUnited States Patent and Trademark Officeen_US
dc.creatorRozell, Christopher Johnen_US
dc.creatorJohnson, Don H.en_US
dc.creatorBaraniuk, Richard G.en_US
dc.creatorOlshausen, Bruno A.en_US
dc.creatorOrtman, Robert Lowellen_US
dc.date.accessioned2015-05-04T19:05:54Z
dc.date.available2015-05-04T19:05:54Z
dc.date.filed2008-02-21en_US
dc.date.issued2010-08-24en_US
dc.description.abstractA 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.en_US
dc.digitization.specificationsThis patent information was downloaded from the US Patent and Trademark website (http://www.uspto.gov/) as image-PDFs. The PDFs were OCRed for access purposes.en_US
dc.format.extent26 ppen_US
dc.identifier.citationRozell, Christopher John, Johnson, Don H., Baraniuk, Richard G., Olshausen, Bruno A. and Ortman, Robert Lowell, "Analog system for computing sparse codes." Patent US7783459B2. issued 2010-08-24. Retrieved from https://hdl.handle.net/1911/80031.
dc.identifier.patentIDUS7783459B2en_US
dc.identifier.urihttps://hdl.handle.net/1911/80031
dc.language.isoengen_US
dc.titleAnalog system for computing sparse codesen_US
dc.typeUtility patenten_US
dc.type.dcmiTexten_US
dc.type.genrepatentsen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
US7783459B2.pdf
Size:
2.12 MB
Format:
Adobe Portable Document Format
Collections