{"title":"通过自相关序列的一致扩展从盲压缩测量中重建信号","authors":"Veena Narayanan , 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":"{\"title\":\"Reconstructing signals from their blind compressed measurements through consistent extension of autocorrelation sequence\",\"authors\":\"Veena Narayanan , 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}","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}
Reconstructing signals from their blind compressed measurements through consistent extension of autocorrelation sequence
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 .
期刊介绍:
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,