Reconstructing signals from their blind compressed measurements through consistent extension of autocorrelation sequence

IF 2.9 3区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
Veena Narayanan , G Abhilash
{"title":"Reconstructing signals from their blind compressed measurements through consistent extension of autocorrelation sequence","authors":"Veena Narayanan ,&nbsp;G Abhilash","doi":"10.1016/j.dsp.2025.105262","DOIUrl":null,"url":null,"abstract":"<div><div>The main challenge in blind compressive sensing is to uniquely reconstruct a sparse signal from its undersampled measurements without prior knowledge of the representing basis. This paper proposes a reconstruction algorithm that estimates a signal from its blind compressed measurements using a linear prediction method of autocorrelation sequence extension. The method extends the lower dimensional autocorrelation sequence of the blind compressed measurement vector to a higher dimensional autocorrelation sequence. The autocorrelation matrix associated with the extended autocorrelation sequence is symmetric and diagonalisable. The matrix that diagonalises the extended autocorrelation matrix exhibits performance close to the Karhunen-Loeve transform. Hence, it is identified as the matrix of sparsifying basis with respect to which the underlying signal exhibits sparsity. This matrix of sparsifying basis is utilised to retrieve the sparse set of representing coefficients using the orthogonal matching pursuit algorithm. The sparse signal is estimated maintaining consistency with the available measurements. The algorithm is formulated as a cascade of three lifting steps, namely, the autocorrelation extension, identification of the sparsifying transform, and the recovery and reconstruction of signals. The signals are reconstructed uniquely with the reconstruction error lower bounded to the order of <span><math><msup><mrow><mn>10</mn></mrow><mrow><mo>−</mo><mn>3</mn></mrow></msup></math></span>.</div></div>","PeriodicalId":51011,"journal":{"name":"Digital Signal Processing","volume":"164 ","pages":"Article 105262"},"PeriodicalIF":2.9000,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Signal Processing","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1051200425002842","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

The main challenge in blind compressive sensing is to uniquely reconstruct a sparse signal from its undersampled measurements without prior knowledge of the representing basis. This paper proposes a reconstruction algorithm that estimates a signal from its blind compressed measurements using a linear prediction method of autocorrelation sequence extension. The method extends the lower dimensional autocorrelation sequence of the blind compressed measurement vector to a higher dimensional autocorrelation sequence. The autocorrelation matrix associated with the extended autocorrelation sequence is symmetric and diagonalisable. The matrix that diagonalises the extended autocorrelation matrix exhibits performance close to the Karhunen-Loeve transform. Hence, it is identified as the matrix of sparsifying basis with respect to which the underlying signal exhibits sparsity. This matrix of sparsifying basis is utilised to retrieve the sparse set of representing coefficients using the orthogonal matching pursuit algorithm. The sparse signal is estimated maintaining consistency with the available measurements. The algorithm is formulated as a cascade of three lifting steps, namely, the autocorrelation extension, identification of the sparsifying transform, and the recovery and reconstruction of signals. The signals are reconstructed uniquely with the reconstruction error lower bounded to the order of 103.

Abstract Image

通过自相关序列的一致扩展从盲压缩测量中重建信号
盲压缩感知的主要挑战是在不知道表示基的情况下,从欠采样测量中唯一地重建稀疏信号。本文提出了一种利用自相关序列扩展的线性预测方法从盲压缩测量中估计信号的重建算法。该方法将盲压缩测量向量的低维自相关序列扩展为高维自相关序列。扩展自相关序列所对应的自相关矩阵是对称的、可对角的。对角化扩展自相关矩阵的矩阵表现出接近Karhunen-Loeve变换的性能。因此,它被确定为相对于底层信号显示稀疏性的稀疏基矩阵。利用该稀疏化基矩阵,利用正交匹配追踪算法检索表示系数的稀疏集。稀疏信号的估计保持与可用测量值的一致性。该算法被表述为三个提升步骤的级联,即自相关扩展、稀疏化变换的识别以及信号的恢复和重建。信号被唯一地重构,重构误差下界为10−3数量级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Digital Signal Processing
Digital Signal Processing 工程技术-工程:电子与电气
CiteScore
5.30
自引率
17.20%
发文量
435
审稿时长
66 days
期刊介绍: Digital Signal Processing: A Review Journal is one of the oldest and most established journals in the field of signal processing yet it aims to be the most innovative. The Journal invites top quality research articles at the frontiers of research in all aspects of signal processing. Our objective is to provide a platform for the publication of ground-breaking research in signal processing with both academic and industrial appeal. The journal has a special emphasis on statistical signal processing methodology such as Bayesian signal processing, and encourages articles on emerging applications of signal processing such as: • big data• machine learning• internet of things• information security• systems biology and computational biology,• financial time series analysis,• autonomous vehicles,• quantum computing,• neuromorphic engineering,• human-computer interaction and intelligent user interfaces,• environmental signal processing,• geophysical signal processing including seismic signal processing,• chemioinformatics and bioinformatics,• audio, visual and performance arts,• disaster management and prevention,• renewable energy,
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信