ACHIEVING HIGHER STABILITY IN WATERMARKING ACCORDING TO IMAGE COMPLEXITY

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

JAMZAD M.; YAGHMAEI FARZIN

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: SCIENTIA IRANICA Year:2006 | Volume:13 | Issue:4 Page(s): 404-412

Download Full-Text

View:

418

Download:

188

Cites:

Information Journal Paper

Title

ACHIEVING HIGHER STABILITY IN WATERMARKING ACCORDING TO IMAGE COMPLEXITY

Author(s)

JAMZAD M. | YAGHMAEI FARZIN | Issue Writer Certificate

Keywords

Not Registered.

Abstract

One of the main objectives of all watermarking algorithms is to provide a secure method for detecting all or part of the watermark pattern in case of the usual attacks on a watermarked image. In this paper, a method is introduced that is suitable for any spatial domain watermarking algorithm, so that it can provide a measure for the level of robustness when a given watermark is supposed to be embedded in a known host image. In order to increase the robustness of the watermarked image, for a watermark of M bits, it was embedded N = s×M times, where s is a small integer. Doing this, the entire image is divided into 16 equal size blocks. For each block, the complexity of the sub-image in that block is measured. The amount of repetition of the watermark bits saved in each block is determined, according to the complexity level of that block. The complexity of a sub-image is measured using its quad tree representation. This approach not only secures the watermarked image with respect to usual attacks, but also, enables one to save longer bit patterns of the watermark, while maintaining a good level of similarity between the original image and the watermarked one. For evaluating the performance of this method, it has been tested on 2000 images having low, medium and high levels of complexity and the result have been compared with the same set of images, without considering the complexity of sub-images in blocks. The new method provided 17% higher stability.

Cites

No record.

References

No record.

Cite

APA: Copy

JAMZAD, M., & YAGHMAEI, FARZIN. (2006). ACHIEVING HIGHER STABILITY IN WATERMARKING ACCORDING TO IMAGE COMPLEXITY. SCIENTIA IRANICA, 13(4), 404-412. SID. https://sid.ir/paper/289369/en

Vancouver: Copy

JAMZAD M., YAGHMAEI FARZIN. ACHIEVING HIGHER STABILITY IN WATERMARKING ACCORDING TO IMAGE COMPLEXITY. SCIENTIA IRANICA[Internet]. 2006;13(4):404-412. Available from: https://sid.ir/paper/289369/en

IEEE: Copy

M. JAMZAD, and FARZIN YAGHMAEI, “ACHIEVING HIGHER STABILITY IN WATERMARKING ACCORDING TO IMAGE COMPLEXITY,” SCIENTIA IRANICA, vol. 13, no. 4, pp. 404–412, 2006, [Online]. Available: https://sid.ir/paper/289369/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops