Phase Transition of Total Variation Based on Approximate Message Passing Algorithm
In compressed sensing (CS), one seeks to down-sample some high-dimensional signals and recover them accurately by exploiting the sparsity of the signals. However, the traditional sparsity assumption cannot be directly satisfied in most practical applications. Fortunately, many signals-of-interest do...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-08-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/11/16/2578 |
| _version_ | 1797445788043837440 |
|---|---|
| author | Xiang Cheng Hong Lei |
| author_facet | Xiang Cheng Hong Lei |
| author_sort | Xiang Cheng |
| collection | DOAJ |
| description | In compressed sensing (CS), one seeks to down-sample some high-dimensional signals and recover them accurately by exploiting the sparsity of the signals. However, the traditional sparsity assumption cannot be directly satisfied in most practical applications. Fortunately, many signals-of-interest do at least exhibit a low-complexity representation with respect to a certain transformation. Particularly, total variation (TV) minimization is a notable example when the transformation operator is a difference matrix. Presently, many theoretical properties of total variation have not been completely explored, e.g., how to estimate the precise location of phase transitions and their rigorous understanding is still in its infancy. So far, the performance and robustness of the existing algorithm for phase transition prediction of TV model are not satisfactory. In this paper, we design a new approximate message passing algorithm to solve the above problems, called total variation vector approximate message passing (TV-VAMP) algorithm. To be specific, we first consider the problem from the Bayesian perspective, and formulate it as an optimization problem. Then, the vector factor graph for the TV model is constructed based on the formulized problem. Finally, the TV-VAMP algorithm is derived according to the idea of probabilistic inference in machine learning. Compared with the existing algorithm, our algorithm can be applied to a wider range of measurements distributions, including the non-zero-mean Gaussian distribution measurements matrix and ill-conditioned measurements matrix. Furthermore, in experiments with various settings, including different measurement distribution matrices, signal gradient sparsity, and measurement times, the proposed algorithm can almost reach the target mean squared error (−60 dB) with fewer iterations and better fit the empirical phase transition curve. |
| first_indexed | 2024-03-09T13:31:52Z |
| format | Article |
| id | doaj.art-1d2d329727254cc3a33b8b3618ad0552 |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-09T13:31:52Z |
| publishDate | 2022-08-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-1d2d329727254cc3a33b8b3618ad05522023-11-30T21:16:54ZengMDPI AGElectronics2079-92922022-08-011116257810.3390/electronics11162578Phase Transition of Total Variation Based on Approximate Message Passing AlgorithmXiang Cheng0Hong Lei1Department of Space Microwave Remote Sensing System, Aerospace Information Research Institute, Chinese Academy of Sciences, Beijing 100190, ChinaDepartment of Space Microwave Remote Sensing System, Aerospace Information Research Institute, Chinese Academy of Sciences, Beijing 100190, ChinaIn compressed sensing (CS), one seeks to down-sample some high-dimensional signals and recover them accurately by exploiting the sparsity of the signals. However, the traditional sparsity assumption cannot be directly satisfied in most practical applications. Fortunately, many signals-of-interest do at least exhibit a low-complexity representation with respect to a certain transformation. Particularly, total variation (TV) minimization is a notable example when the transformation operator is a difference matrix. Presently, many theoretical properties of total variation have not been completely explored, e.g., how to estimate the precise location of phase transitions and their rigorous understanding is still in its infancy. So far, the performance and robustness of the existing algorithm for phase transition prediction of TV model are not satisfactory. In this paper, we design a new approximate message passing algorithm to solve the above problems, called total variation vector approximate message passing (TV-VAMP) algorithm. To be specific, we first consider the problem from the Bayesian perspective, and formulate it as an optimization problem. Then, the vector factor graph for the TV model is constructed based on the formulized problem. Finally, the TV-VAMP algorithm is derived according to the idea of probabilistic inference in machine learning. Compared with the existing algorithm, our algorithm can be applied to a wider range of measurements distributions, including the non-zero-mean Gaussian distribution measurements matrix and ill-conditioned measurements matrix. Furthermore, in experiments with various settings, including different measurement distribution matrices, signal gradient sparsity, and measurement times, the proposed algorithm can almost reach the target mean squared error (−60 dB) with fewer iterations and better fit the empirical phase transition curve.https://www.mdpi.com/2079-9292/11/16/2578machine learningsignal processingcompressed sensingtotal variation minimizationphase transitionapproximate message passing |
| spellingShingle | Xiang Cheng Hong Lei Phase Transition of Total Variation Based on Approximate Message Passing Algorithm Electronics machine learning signal processing compressed sensing total variation minimization phase transition approximate message passing |
| title | Phase Transition of Total Variation Based on Approximate Message Passing Algorithm |
| title_full | Phase Transition of Total Variation Based on Approximate Message Passing Algorithm |
| title_fullStr | Phase Transition of Total Variation Based on Approximate Message Passing Algorithm |
| title_full_unstemmed | Phase Transition of Total Variation Based on Approximate Message Passing Algorithm |
| title_short | Phase Transition of Total Variation Based on Approximate Message Passing Algorithm |
| title_sort | phase transition of total variation based on approximate message passing algorithm |
| topic | machine learning signal processing compressed sensing total variation minimization phase transition approximate message passing |
| url | https://www.mdpi.com/2079-9292/11/16/2578 |
| work_keys_str_mv | AT xiangcheng phasetransitionoftotalvariationbasedonapproximatemessagepassingalgorithm AT honglei phasetransitionoftotalvariationbasedonapproximatemessagepassingalgorithm |