Finding optimal least-significant-bit substitution in image hiding by dynamic programming strategy

Chin Chen Chang, Ju-Yuan Hsiao, Chi Shiang Chan

Research output: Contribution to journalArticle

277 Citations (Scopus)

Abstract

The processing of simple least-significant-bit (LSB) substitution embeds the secret image in the least significant bits of the pixels in the host image. This processing may degrade the host image quality so significantly that grabbers can detect that there is something going on in the image that interests them. To overcome this drawback, an exhaustive least-significant-bit substitution scheme was proposed by Wang et al. but it takes huge computation time. Wang et al. then proposed another method that uses a genetic algorithm to search "approximate" optimal solutions and computation time is no longer so huge. In this paper, we shall use the dynamic programming strategy to get the optimal solution. The experimental results will show that our method consumes less computation time and also gets the optimal solution.

Original languageEnglish
Pages (from-to)1583-1595
Number of pages13
JournalPattern Recognition
Volume36
Issue number7
DOIs
Publication statusPublished - 2003 Jan 1

Fingerprint

Dynamic programming
Substitution reactions
Processing
Image quality
Genetic algorithms
Pixels

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this

@article{98a04341f11d4034ad113b72154c7475,
title = "Finding optimal least-significant-bit substitution in image hiding by dynamic programming strategy",
abstract = "The processing of simple least-significant-bit (LSB) substitution embeds the secret image in the least significant bits of the pixels in the host image. This processing may degrade the host image quality so significantly that grabbers can detect that there is something going on in the image that interests them. To overcome this drawback, an exhaustive least-significant-bit substitution scheme was proposed by Wang et al. but it takes huge computation time. Wang et al. then proposed another method that uses a genetic algorithm to search {"}approximate{"} optimal solutions and computation time is no longer so huge. In this paper, we shall use the dynamic programming strategy to get the optimal solution. The experimental results will show that our method consumes less computation time and also gets the optimal solution.",
author = "Chang, {Chin Chen} and Ju-Yuan Hsiao and Chan, {Chi Shiang}",
year = "2003",
month = "1",
day = "1",
doi = "10.1016/S0031-3203(02)00289-3",
language = "English",
volume = "36",
pages = "1583--1595",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Limited",
number = "7",

}

Finding optimal least-significant-bit substitution in image hiding by dynamic programming strategy. / Chang, Chin Chen; Hsiao, Ju-Yuan; Chan, Chi Shiang.

In: Pattern Recognition, Vol. 36, No. 7, 01.01.2003, p. 1583-1595.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Finding optimal least-significant-bit substitution in image hiding by dynamic programming strategy

AU - Chang, Chin Chen

AU - Hsiao, Ju-Yuan

AU - Chan, Chi Shiang

PY - 2003/1/1

Y1 - 2003/1/1

N2 - The processing of simple least-significant-bit (LSB) substitution embeds the secret image in the least significant bits of the pixels in the host image. This processing may degrade the host image quality so significantly that grabbers can detect that there is something going on in the image that interests them. To overcome this drawback, an exhaustive least-significant-bit substitution scheme was proposed by Wang et al. but it takes huge computation time. Wang et al. then proposed another method that uses a genetic algorithm to search "approximate" optimal solutions and computation time is no longer so huge. In this paper, we shall use the dynamic programming strategy to get the optimal solution. The experimental results will show that our method consumes less computation time and also gets the optimal solution.

AB - The processing of simple least-significant-bit (LSB) substitution embeds the secret image in the least significant bits of the pixels in the host image. This processing may degrade the host image quality so significantly that grabbers can detect that there is something going on in the image that interests them. To overcome this drawback, an exhaustive least-significant-bit substitution scheme was proposed by Wang et al. but it takes huge computation time. Wang et al. then proposed another method that uses a genetic algorithm to search "approximate" optimal solutions and computation time is no longer so huge. In this paper, we shall use the dynamic programming strategy to get the optimal solution. The experimental results will show that our method consumes less computation time and also gets the optimal solution.

UR - http://www.scopus.com/inward/record.url?scp=0037411306&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037411306&partnerID=8YFLogxK

U2 - 10.1016/S0031-3203(02)00289-3

DO - 10.1016/S0031-3203(02)00289-3

M3 - Article

VL - 36

SP - 1583

EP - 1595

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

IS - 7

ER -