P-HGRMS: A Parallel Hypergraph Based Root Mean Square Algorithm for Image Denoising
This paper presents a parallel Salt and Pepper (SP) noise removal algorithm in a grey level digital image based on the Hypergraph Based Root Mean Square (HGRMS) approach. HGRMS is generic algorithm for identifying noisy pixels in any digital image using a two level hierarchical serial approach. However, for SP noise removal, we reduce this algorithm to a parallel model by introducing a cardinality matrix and an iteration factor, k, which helps us reduce the dependencies in the existing approach. We also observe that the performance of the serial implementation is better on smaller images, but once the threshold is achieved in terms of image resolution, its computational complexity increases drastically. We test P-HGRMS using standard images from the Berkeley Segmentation dataset on NVIDIAs Compute Unified Device Architecture (CUDA) for noise identification and attenuation. We also compare the noise removal efficiency of the proposed algorithm using Peak Signal to Noise Ratio (PSNR) to the existing approach. P-HGRMS maintains the noise removal efficiency and outperforms its sequential counterpart by 6 to 18 times (6x - 18x) in computational efficiency.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational EfficiencyDenoisingImage DenoisingSimilar Papers 제목 키워드 기반
POO-LPSP: Parallel Osprey Optimized Least Penalty-Squared Prioritization Methods for Priority Derivation in the Analytic Hierarchy Process
Pairwise comparison (PC) via pairwise reciprocal matrices (PRMs) is central to the Analytic Hierarchy Process (AHP). Although the traditional eigenvector method is widely applied to derive priorities, its theoretical rob…
Computational EfficiencyA Square-Root Kalman Filter Using Only QR Decompositions
The Kalman filter operates by storing a Gaussian description of the state estimate in the form of a mean and covariance. Instead of storing and manipulating the covariance matrix directly, a square-root Kalman filter onl…
Two Efficient Ridge Solutions for the Incremental Broad Learning System on Added Inputs
This paper proposes the recursive and square-root BLS algorithms to improve the original BLS for new added inputs, which utilize the inverse and inverse Cholesky factor of the Hermitian matrix in the ridge inverse, respe…
LEMMASimulation of square-root processes made simple: applications to the Heston model
We introduce a simple, efficient and accurate nonnegative preserving numerical scheme for simulating the square-root process. The novel idea is to simulate the integrated square-root process first instead of the square-r…
Influence of parallel computing strategies of iterative imputation of missing data: a case study on missForest
Machine learning iterative imputation methods have been well accepted by researchers for imputing missing data, but they can be time-consuming when handling large datasets. To overcome this drawback, parallel computing s…
Imputation