Filtered Variation method for denoising and sparse signal processing
buir.contributor.author | Çetin, A. Enis | |
buir.contributor.orcid | Çetin, A. Enis|0000-0002-3449-1958 | |
dc.citation.epage | 3332 | en_US |
dc.citation.spage | 3329 | en_US |
dc.contributor.author | Köse, Kıvanç | en_US |
dc.contributor.author | Cevher V. | en_US |
dc.contributor.author | Çetin, A. Enis | en_US |
dc.coverage.spatial | Kyoto, Japan | en_US |
dc.date.accessioned | 2016-02-08T12:12:39Z | |
dc.date.available | 2016-02-08T12:12:39Z | |
dc.date.issued | 2012 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description | Date of Conference: 25-30 March 2012 | en_US |
dc.description.abstract | We propose a new framework, called Filtered Variation (FV), for denoising and sparse signal processing applications. These problems are inherently ill-posed. Hence, we provide regularization to overcome this challenge by using discrete time filters that are widely used in signal processing. We mathematically define the FV problem, and solve it using alternating projections in space and transform domains. We provide a globally convergent algorithm based on the projections onto convex sets approach. We apply to our algorithm to real denoising problems and compare it with the total variation recovery. © 2012 IEEE. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T12:12:39Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2012 | en |
dc.identifier.doi | 10.1109/ICASSP.2012.6288628 | en_US |
dc.identifier.issn | 1520-6149 | |
dc.identifier.uri | http://hdl.handle.net/11693/28155 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/ICASSP.2012.6288628 | en_US |
dc.source.title | 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) | en_US |
dc.subject | Filtered variation | en_US |
dc.subject | Alternating projections | en_US |
dc.subject | De-noising | en_US |
dc.subject | Denoising problems | en_US |
dc.subject | Discrete-time filters | en_US |
dc.subject | Filtered variation | en_US |
dc.subject | Globally convergent | en_US |
dc.subject | Ill posed | en_US |
dc.subject | Projection onto convex sets | en_US |
dc.subject | Projections onto convex sets | en_US |
dc.subject | Sparse signals | en_US |
dc.subject | Total variation | en_US |
dc.subject | Transform domain | en_US |
dc.subject | Variation method | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Set theory | en_US |
dc.subject | Signal processing | en_US |
dc.subject | Problem solving | en_US |
dc.title | Filtered Variation method for denoising and sparse signal processing | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Filtered Variation method for denoising and sparse signal processing.pdf
- Size:
- 389.97 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version