title: Edge-preserving image denoising via group coordinate descent on the GPU.
abstract: Image denoising is a fundamental operation in image processing, and its applications range from the direct (photographic enhancement) to the technical (as a subproblem in image reconstruction algorithms). In many applications, the number of pixels has continued to grow, while the serial execution speed of computational hardware has begun to stall. New image processing algorithms must exploit the power offered by massively parallel architectures like graphics processing units (GPUs). This paper describes a family of image denoising algorithms well-suited to the GPU. The algorithms iteratively perform a set of independent, parallel 1D pixel-update subproblems. To match GPU memory limitations, they perform these pixel updates in-place and only store the noisy data, denoised image, and problem parameters. The algorithms can handle a wide range of edge-preserving roughness penalties, including differentiable convex penalties and anisotropic total variation. Both algorithms use the majorize-minimize framework to solve the 1D pixel update subproblem. Results from a large 2D image denoising problem and a 3D medical imaging denoising problem demonstrate that the proposed algorithms converge rapidly in terms of both iteration and run-time.
authors: Madison Gray
authors: MG
authors: McGaffin
authors: Jeffrey A
authors: JA
authors: Fessler
mesh_terms: D016477:Artifacts; D003196:Computer Graphics / Q000295:instrumentation*; D004867:Equipment Design; D019544:Equipment Failure Analysis; D006801:Humans; D000069550:Machine Learning; D064847:Multimodal Imaging / Q000379:methods*; D011856:Radiographic Image Enhancement / Q000295:instrumentation* / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D012815:Signal Processing, Computer-Assisted / Q000295:instrumentation; D059629:Signal-To-Noise Ratio; D014057:Tomography, X-Ray Computed / Q000295:instrumentation / Q000379:methods*