2008
DOI: 10.1007/s11859-008-0517-2
|View full text |Cite
|
Sign up to set email alerts
|

A binary images watermarking algorithm based on adaptable matrix

Abstract: A watermarking algorithm of binary images using adaptable matrix is presented. An adaptable matrix is designed to evaluate the smoothness and the connectivity of binary images. The watermark is embedded according to the adaptable matrix in this algorithm. In the proposed watermarking algorithm, each image block implements a XOR operation with the binary adaptable matrix, which has the same size with the image block, and in order to embed the watermark data, a multiplication operation are also implemented with … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…Given a Markov tree T for variable X = {X1, X2, … Xn} with a root RT and the tree topology [25] is determined by the parent information as π function [26]. The proposed MSkT modelled distribution 𝑃 𝑇 (Χ) is defined as (4):…”
Section: Optimization Of Kullback-leilber Divergencementioning
confidence: 99%
“…Given a Markov tree T for variable X = {X1, X2, … Xn} with a root RT and the tree topology [25] is determined by the parent information as π function [26]. The proposed MSkT modelled distribution 𝑃 𝑇 (Χ) is defined as (4):…”
Section: Optimization Of Kullback-leilber Divergencementioning
confidence: 99%
“…4 shows three external contour edge section gray curves in the image of the 1000 0 C forging. Zhang Yongjun [6] proposed to take the intermediate pixel of the gray upheaval range as an edge pixel, such as the position of point 1 in Fig. As can be seen, the curve has one obvious trough 1.…”
Section: Extraction Of Contourmentioning
confidence: 99%