Data-Driven Redundant Transform Based on Parseval Frames

The sparsity of images in a certain transform domain or dictionary has been exploited in many image processing applications. Both classic transforms and sparsifying transforms reconstruct images by a linear combination of a small basis of the transform. Both kinds of transform are non-redundant. How...

Full description

Bibliographic Details
Main Authors: Min Zhang, Yunhui Shi, Na Qi, Baocai Yin
Format: Article
Language:English
Published: MDPI AG 2020-04-01
Series:Applied Sciences
Subjects:
Online Access:https://www.mdpi.com/2076-3417/10/8/2891
_version_ 1797569954244984832
author Min Zhang
Yunhui Shi
Na Qi
Baocai Yin
author_facet Min Zhang
Yunhui Shi
Na Qi
Baocai Yin
author_sort Min Zhang
collection DOAJ
description The sparsity of images in a certain transform domain or dictionary has been exploited in many image processing applications. Both classic transforms and sparsifying transforms reconstruct images by a linear combination of a small basis of the transform. Both kinds of transform are non-redundant. However, natural images admit complicated textures and structures, which can hardly be sparsely represented by square transforms. To solve this issue, we propose a data-driven redundant transform based on Parseval frames (DRTPF) by applying the frame and its dual frame as the backward and forward transform operators, respectively. Benefitting from this pairwise use of frames, the proposed model combines a synthesis sparse system and an analysis sparse system. By enforcing the frame pair to be Parseval frames, the singular values and condition number of the learnt redundant frames, which are efficient values for measuring the quality of the learnt sparsifying transforms, are forced to achieve an optimal state. We formulate a transform pair (i.e., frame pair) learning model and a two-phase iterative algorithm, analyze the robustness of the proposed DRTPF and the convergence of the corresponding algorithm, and demonstrate the effectiveness of our proposed DRTPF by analyzing its robustness against noise and sparsification errors. Extensive experimental results on image denoising show that our proposed model achieves superior denoising performance, in terms of subjective and objective quality, compared to traditional sparse models.
first_indexed 2024-03-10T20:18:33Z
format Article
id doaj.art-9cc19be78e3b4d8189bfb63d2fe7e3f0
institution Directory Open Access Journal
issn 2076-3417
language English
last_indexed 2024-03-10T20:18:33Z
publishDate 2020-04-01
publisher MDPI AG
record_format Article
series Applied Sciences
spelling doaj.art-9cc19be78e3b4d8189bfb63d2fe7e3f02023-11-19T22:21:35ZengMDPI AGApplied Sciences2076-34172020-04-01108289110.3390/app10082891Data-Driven Redundant Transform Based on Parseval FramesMin Zhang0Yunhui Shi1Na Qi2Baocai Yin3Beijing Key Laboratory of Multimedia and Intelligent Software Technology, Faculty of Information Technology, Beijing University of Technology, Beijing 100124, ChinaBeijing Key Laboratory of Multimedia and Intelligent Software Technology, Faculty of Information Technology, Beijing University of Technology, Beijing 100124, ChinaBeijing Key Laboratory of Multimedia and Intelligent Software Technology, Faculty of Information Technology, Beijing University of Technology, Beijing 100124, ChinaBeijing Key Laboratory of Multimedia and Intelligent Software Technology, Faculty of Information Technology, Beijing University of Technology, Beijing 100124, ChinaThe sparsity of images in a certain transform domain or dictionary has been exploited in many image processing applications. Both classic transforms and sparsifying transforms reconstruct images by a linear combination of a small basis of the transform. Both kinds of transform are non-redundant. However, natural images admit complicated textures and structures, which can hardly be sparsely represented by square transforms. To solve this issue, we propose a data-driven redundant transform based on Parseval frames (DRTPF) by applying the frame and its dual frame as the backward and forward transform operators, respectively. Benefitting from this pairwise use of frames, the proposed model combines a synthesis sparse system and an analysis sparse system. By enforcing the frame pair to be Parseval frames, the singular values and condition number of the learnt redundant frames, which are efficient values for measuring the quality of the learnt sparsifying transforms, are forced to achieve an optimal state. We formulate a transform pair (i.e., frame pair) learning model and a two-phase iterative algorithm, analyze the robustness of the proposed DRTPF and the convergence of the corresponding algorithm, and demonstrate the effectiveness of our proposed DRTPF by analyzing its robustness against noise and sparsification errors. Extensive experimental results on image denoising show that our proposed model achieves superior denoising performance, in terms of subjective and objective quality, compared to traditional sparse models.https://www.mdpi.com/2076-3417/10/8/2891parseval frametransformsparse representation
spellingShingle Min Zhang
Yunhui Shi
Na Qi
Baocai Yin
Data-Driven Redundant Transform Based on Parseval Frames
Applied Sciences
parseval frame
transform
sparse representation
title Data-Driven Redundant Transform Based on Parseval Frames
title_full Data-Driven Redundant Transform Based on Parseval Frames
title_fullStr Data-Driven Redundant Transform Based on Parseval Frames
title_full_unstemmed Data-Driven Redundant Transform Based on Parseval Frames
title_short Data-Driven Redundant Transform Based on Parseval Frames
title_sort data driven redundant transform based on parseval frames
topic parseval frame
transform
sparse representation
url https://www.mdpi.com/2076-3417/10/8/2891
work_keys_str_mv AT minzhang datadrivenredundanttransformbasedonparsevalframes
AT yunhuishi datadrivenredundanttransformbasedonparsevalframes
AT naqi datadrivenredundanttransformbasedonparsevalframes
AT baocaiyin datadrivenredundanttransformbasedonparsevalframes