HPC-based Solvers of Minimisation Problems for Signal Processing
arXiv:2311.02039 · doi:10.1016/j.matcom.2024.10.003
Abstract
Several physics and engineering applications involve the solution of a minimisation problem to compute an approximation of the input signal. Modern computing hardware and software apply high-performance computing to solve and considerably reduce the execution time. We compare and analyse different minimisation methods in terms of functional computation, convergence, execution time, and scalability properties, for the solution of two minimisation problems (i.e., approximation and denoising) with different constraints that involve computationally expensive operations. These problems are attractive due to their numerical and analytical properties, and our general analysis can be extended to most signal-processing problems. We perform our tests on the Cineca Marconi100 cluster, at the 26th position in the top500 list. Our experimental results show that PRAXIS is the best optimiser in terms of minima computation: the efficiency of the approximation is 38% with 256 processes, while the denoising has 46% with 32 processes.
References in corpus (7)
- Markov Chain Analysis of Cumulative Step-size Adaptation on a Linear Constrained Problem
- Image Reconstruction in Optical Interferometry
- A Universal Deep Learning Framework for Real-Time Denoising of Ultrasound Images
- Deep Reinforcement Learning for Computational Fluid Dynamics on HPC Systems
- Biomedical Image Reconstruction: From the Foundations to Deep Neural Networks
- Evaluating Accuracy and Efficiency of HPC Solvers for Sparse Linear Systems with Applications to PDEs
- Development of X-ray spectrometer automatic adjustment system based on global optimization algorithm