2D Partial Unwinding-A Novel Non-Linear Phase Decomposition of Images

被引:25
作者
Li, Yanting [1 ]
Zhang, Liming [2 ]
Qian, Tao [3 ]
机构
[1] Univ Macau, Fac Sci & Technol, Dept Math, Taipa 999078, Macao, Peoples R China
[2] Univ Macau, Dept Comp & Informat Sci, Fac Sci & Technol, Taipa 999078, Macao, Peoples R China
[3] Macau Univ Sci & Technol, Macau Inst Syst Engn, Taipa 999078, Macao, Peoples R China
关键词
Fourier transform; hardy space; greedy algorithm; adaptive Fourier decomposition; unwinding Blaschke decomposition; Nevanlinna factorization; WATERMARKING; ALGORITHM; ROBUST; TRANSFORM;
D O I
10.1109/TIP.2019.2914000
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper aims at proposing a novel 2D non-linear phase decomposition of images, which performs the image processing tasks better than the traditional Fourier transformation (linear phase decomposition), but further, it has additional mathematical properties allowing more effective image analysis, including adaptive decomposition components and positive instantaneous phase derivatives. 1D unwinding Blaschke decomposition has recently been proposed and studied. Through factorization it expresses arbitrary 1D signal into an infinite linear combination of Blaschke products. It offers fast converging positive frequency decomposition in the form of rational approximation. However, in the multi-dimensional cases, the usual factorization mechanism does not work. As a consequence, there is no genuine unwinding decomposition for multi-dimensions. In this paper, a 2D partial unwinding decomposition based on algebraic transforms reducing multi-dimensions to the 1D case is proposed and analyzed. The result shows that the fast convergence offers efficient image reconstruction. The tensor type decomposing terms are mutually orthogonal, giving rise to 2D positive frequency decomposition. The comparison results show that the proposed method outperforms the standard greedy algorithm and the most commonly used methods in the Fourier category. An application in watermarking is presented to demonstrate its potential in applications.
引用
收藏
页码:4762 / 4773
页数:12
相关论文
共 49 条
[11]   Automated processing of shoeprint images based on the Fourier transform for use in forensic science [J].
de Chazal, P ;
Flynn, J ;
Reilly, RB .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (03) :341-350
[12]  
Dereventsov A., 2018, A unified way of analyzing some greedy algorithms
[13]   Some remarks on greedy algorithms [J].
DeVore, RA ;
Temlyakov, VN .
ADVANCES IN COMPUTATIONAL MATHEMATICS, 1996, 5 (2-3) :173-187
[14]  
He C, 2015, 2015 IEEE 20TH INTERNATIONAL WORKSHOP ON COMPUTER AIDED MODELLING AND DESIGN OF COMMUNICATION LINKS AND NETWORKS (CAMAD), P27, DOI 10.1109/CAMAD.2015.7390475
[15]   A Novel LSB Based Quantum Watermarking [J].
Heidari, Shahrokh ;
Naseri, Mosayeb .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2016, 55 (10) :4205-4218
[16]   Multiresolution Graph Fourier Transform for Compression of Piecewise Smooth Images [J].
Hu, Wei ;
Cheung, Gene ;
Ortega, Antonio ;
Au, Oscar C. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2015, 24 (01) :419-433
[17]   Hiding biometric data [J].
Jain, AK ;
Uludag, U .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2003, 25 (11) :1494-1498
[18]  
Kim JS, 2009, PROC CVPR IEEE, P1730, DOI 10.1109/CVPRW.2009.5206666
[19]   A robust DCT-based watermarking for copyright protection [J].
Lin, SD ;
Chen, CF .
IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, 2000, 46 (03) :415-421
[20]   Fourier Lucas-Kanade Algorithm [J].
Lucey, Simon ;
Navarathna, Rajitha ;
Ashraf, Ahmed Bilal ;
Sridharan, Sridha .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (06) :1383-1396