Efficient $\ell^0$ gradient-based Super Resolution for simplified image segmentation
From MaRDI portal
Publication:6347368
arXiv2008.08470MaRDI QIDQ6347368
Author name not available (Why is that?)
Publication date: 19 August 2020
Abstract: We consider a variational model for single-image super-resolution based on the assumption that the gradient of the target image is sparse. We enforce this assumption by considering both an isotropic and an anisotropic regularisation on the image gradient combined with a quadratic data fidelity, similarly as studied in [1] for general signal recovery problems. For the numerical realisation of the model, we propose a novel efficient ADMM splitting algorithm whose substeps solutions are computed efficiently by means of hard-thresholding and standard conjugate-gradient solvers. We test our model on highly-degraded synthetic and real-world data and quantitatively compare our results with several variational approaches as well as with state-of-the-art deep-learning techniques. Our experiments show that gradient-regularised super-resolved images can be effectively used to improve the accuracy of standard segmentation algorithms when applied to QR and cell detection, and landcover classification problems, in comparison to the results achieved by other approaches.
Has companion code repository: https://github.com/pcascarano/PottsSR
No records found.
This page was built for publication: Efficient $\ell^0$ gradient-based Super Resolution for simplified image segmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6347368)
