5 August 2015 Linear Bregman algorithm implemented in parallel GPU
Author Affiliations +
Abstract
At present, most compressed sensing (CS) algorithms have poor converging speed, thus are difficult to run on PC. To deal with this issue, we use a parallel GPU, to implement a broadly used compressed sensing algorithm, the Linear Bregman algorithm. Linear iterative Bregman algorithm is a reconstruction algorithm proposed by Osher and Cai. Compared with other CS reconstruction algorithms, the linear Bregman algorithm only involves the vector and matrix multiplication and thresholding operation, and is simpler and more efficient for programming. We use C as a development language and adopt CUDA (Compute Unified Device Architecture) as parallel computing architectures. In this paper, we compared the parallel Bregman algorithm with traditional CPU realized Bregaman algorithm. In addition, we also compared the parallel Bregman algorithm with other CS reconstruction algorithms, such as OMP and TwIST algorithms. Compared with these two algorithms, the result of this paper shows that, the parallel Bregman algorithm needs shorter time, and thus is more convenient for real-time object reconstruction, which is important to people’s fast growing demand to information technology.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Pengyan Li, Pengyan Li, Jue Ke, Jue Ke, Dong Sui, Dong Sui, Ping Wei, Ping Wei, } "Linear Bregman algorithm implemented in parallel GPU", Proc. SPIE 9622, 2015 International Conference on Optical Instruments and Technology: Optoelectronic Imaging and Processing Technology, 962216 (5 August 2015); doi: 10.1117/12.2193282; https://doi.org/10.1117/12.2193282
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT


Back to Top