Robust watermarking using orthogonal Fourier–Mellin moments and chaotic map for double images

Shao, Zhuhong; Shang, Yuanyuan; Zhang, Yu; Liu, Xilin; Guo, Guodong

doi:10.1016/j.sigpro.2015.10.005

Cited by 101 publications

(35 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The real and imaginary parts of the radial polynomial of EFMs have 2n and 2n+1 zeros in the interval 0 ≤ r ≤ 1, respectively [39]. Meanwhile, the Bessel polynomials and the orthogonal Fourier-Mellion polynomials have n+2 and n zeros in the interval 0 ≤ r ≤ 1, respectively [6,40]. Zernike polynomials only have (n − m)/2 zeros in the interval 0 ≤ r ≤ 1.…”

Section: Properties Of Efms and Other Radial Orthogonal Momentsmentioning

confidence: 99%

“…Moments and moment invariants are global descriptors for image feature extraction that have become a hot topic in the field of image analysis. In recent years, various moments have been widely used in image reconstruction [1,2], image detection [3,4], target classification [5], digital watermarking [6,7], image compression [8], and other applications [9,10]. The study of moments mainly focuses on three directions.…”

Section: Introductionmentioning

confidence: 99%

“…The radial orthogonal moments in Fig. 1 mainly include Zernike moments (ZMs) [13], pseudo-Zernike moments (PZMs) [14], orthogonal Fourier-Mellin moments (OFMMs) [6], Jacobi-Fourier moments (JFMs) [24], Tchebichef-Fourier moments (TFMs) [25], radial harmonic-Fourier moments (RHFMs) [26], Bessel-Fourier moments (BFMs) [18,27], exponent-Fourier moments (EFMs) [7], and radial shifted Legendre moments (RSLMs) [28]. These radial orthogonal moments normally have the basic ability of image reconstruction.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Image analysis using modified exponent-Fourier moments

Cui

Xiao

et al. 2019

J Image Video Proc.

View full text Add to dashboard Cite

Classic exponent-Fourier moments (EFMs) have been popularly used for image reconstruction and invariant classification. However, EFMs lack natively the translation and scaling-invariant; in addition, they exhibit two types of drawbacks, namely numerical instability and reconstruction error, which in turn influence their reconstruction capability and image classification accuracy. This study considers the challenge of defining modified EFMs (MEFMs), which are based on modified exponent polynomials. In our methods, the basis function of traditional EFMs is appropriately modified, and these modified basis functions are used to replace the original ones. The basis function of the proposed moments is composed of piecewise modified exponent polynomials modulated by a variable parameter exponential envelope. Various types of optimal-order moments can be established by slightly adjusting the bandwidth of the modified basis functions. Finally, we extend the rotation-invariant feature of previous works and propose a new method of scaling and rotation-invariant image recognition using the proposed moments in a log-polar coordinate domain. The translation invariance can then be achieved by an image projection operation, which is substituted for the traditional approach based on the calculation of image geometric moments. The experimental results demonstrate that the MEFMs perform better than traditional EFMs and other classic orthogonal moments including the latest image moments in terms of the image reconstruction capability and the invariant recognition accuracy of smoothing filters, in both noise-free and noisy conditions.

show abstract

Section: Properties Of Efms and Other Radial Orthogonal Momentsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Image analysis using modified exponent-Fourier moments

Cui

Xiao

et al. 2019

J Image Video Proc.

View full text Add to dashboard Cite

show abstract

“…al. [24] described a combined watermarking method using Orthogonal Fourier transformation and chaotic maps.…”

Section: Introductionmentioning

confidence: 99%

Lossless Watermarking for Image Ratification: An Implementation based on 12th Root of Exponential Function

S N*,

Kumar,

C R

et al. 2019

IJITEE

View full text Add to dashboard Cite

Abstract: In this article, an exponential transformation based digital image watermarking scheme has been described. The method is employed with 12 th root of exponential function for embedding watermark into the cover image. Due to bulk data capacity of the image, many watermarking techniques uses more time for data insertion and separation processes. Algorithm is designed in such a way to embed a watermark of 1/16 th size of host. The retrieved watermark is examined under various security analysis. Many standard test images are subjected for watermarking process under proposed scheme resulted with better scale and utilizes less computational time compared to other techniques.

show abstract

“…resistência a diversos ataques [2], [3]. As transformadas mais empregadas são a transformada discreta de Fourier (DFT) [2], [4], a transformada Mellin-Fourier [5], a transformada wavelet discreta [6], [7] e a transformada discreta do cosseno (DCT) [3], [8]. A escolha da transformada dependerá de alguns fatores, destacando-se: o esforço computacional, a distorção por manipulação não autorizada ou decorrente de padrões.…”

Section: Introductionunclassified

Sistema de Marca d'água em Imagens Utilizando Sequências Caóticas

Morales¹,

Chaves²,

Pimentel³

2019

Anais De XXXVII Simpósio Brasileiro De Telecomunicações E Processamento De Sinais

View full text Add to dashboard Cite

Resumo-Este artigo descreve um esquema de marca d'água robusto. Os bits inseridos na imagem são os bits de paridade de um código corretor de erro cuja mensagemé formada pela combinação dos bits de marca d'água com bits caóticos. Uma estratégia que propicia robustez e segurançaà marca d'água. A inserção se dá em frequências específicas da transformada discreta do cosseno da imagem. A robustez do método propostó e testada para vários ataques utilizados em processamentos de sinais e ataques geométricos. Comparações com resultados da literatura revelam que a técnica proposta apresenta maior imperceptibilidade e robustez. Palavras-Chave-Marca d'água robusta, códigos corretores de erro, mapas caóticos, ataques geométricos.

show abstract

Robust watermarking using orthogonal Fourier–Mellin moments and chaotic map for double images

Cited by 101 publications

References 23 publications

Image analysis using modified exponent-Fourier moments

Image analysis using modified exponent-Fourier moments

Lossless Watermarking for Image Ratification: An Implementation based on 12th Root of Exponential Function

Sistema de Marca d'água em Imagens Utilizando Sequências Caóticas

Contact Info

Product

Resources

About