Compressive Sampling: The Future of Efficiency and Signal Processing
2009-04-08
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Compressive Sampling: The Future of Efficiency and Signal Processing
Authors
Published Date
2009-04-08
Publisher
Type
Presentation
Abstract
The majority of data stored in a computer or in a signal are place-holding zeroes. Compressive sampling enables us to reduce the memory a set amount of data takes up until we need to use it again. Additionally, the limiting factor most people are worried about is time. Compressive sampling allows the sending of signals and data with less time and effort. The process is based on probability and the principles of random number generators which is built in to most computers. This makes the process of compressive sampling widely available.
Description
Additional contributors: Emmanuel Candès; Stephen Boyd; Michael Grant; Yinyu Ye; Ronald DeVore; Terrence Tao; Willard Miller (faculty mentor)
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Mueller, Peter. (2009). Compressive Sampling: The Future of Efficiency and Signal Processing. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/59951.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.