A Study on High Embedding Capacity of Image Hiding Based on Run-Length Encoding Scheme

碩士 === 玄奘大學 === 資訊科學學系碩士班 === 97 === In this thesis, two modified image data hiding techniques based on Run-Length encoding scheme were proposed. Run-Length encoding approach in image data hiding was firstly proposed by C.C. Chang et al in 2006. Their embedding process was usually associated with th...

Full description

Bibliographic Details
Main Authors: Shang-Wen Hu, 胡尚文
Other Authors: Rey-Sern Lin
Format: Others
Language:zh-TW
Published: 2009
Online Access:http://ndltd.ncl.edu.tw/handle/87929218407991712282
id ndltd-TW-097HCU08396016
record_format oai_dc
spelling ndltd-TW-097HCU083960162016-04-29T04:19:12Z http://ndltd.ncl.edu.tw/handle/87929218407991712282 A Study on High Embedding Capacity of Image Hiding Based on Run-Length Encoding Scheme 以Run–Length編碼架構為基礎提昇影像資訊隱藏量之研究 Shang-Wen Hu 胡尚文 碩士 玄奘大學 資訊科學學系碩士班 97 In this thesis, two modified image data hiding techniques based on Run-Length encoding scheme were proposed. Run-Length encoding approach in image data hiding was firstly proposed by C.C. Chang et al in 2006. Their embedding process was usually associated with three processing steps. The first stage is to convert a binary bitmap image into a series of long bit stream. For secondary stage, an information pair of run count and run value in each run of the same symbol is used to compress the secret information. Therefore, the third stage is referred as embedding process by modifying the least significant bit and adjusting the pixel gray-level in one of two adjacent pixels block. Most binary bitmap images usually have the feature of self-similarity in neighboring region upon which the Run-Length encoding scheme condense the secret image and enlarge the hiding capacity of stego-image. Both in C.C. Chang et al and our first proposed method, a threshold k is required firstly. But, our modification uses an additional bit-information to record whether the run count value is larger than initial threshold k. After that, the hiding capacity of our recipe almost doubles the original one at most and results equal decrease about the PSNR criteria. Due to the mentioned above methods are just do well for binary bit-map image. For random bit stream information, these approaches will be not right for it. An exclusive OR operator, therefore, is applied on the bit stream for clustering together with same symbol in our opinion. This modification can be regarded as a preprocessing before above mentioned works. Since the operator possesses the advantage of invertible, the original bit stream can be re-obtained from transformed bit stream, and it will condense the RLE information pairs. And then, enlarge the embedding capacity of the image data hiding based on the Run-Length encoding scheme. Finally, the whereabouts merit of PSNR and embedding capacity was compared and the experimental results show the efficiency of proposed method for evaluation. Rey-Sern Lin 林瑞盛 2009 學位論文 ; thesis 0 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 玄奘大學 === 資訊科學學系碩士班 === 97 === In this thesis, two modified image data hiding techniques based on Run-Length encoding scheme were proposed. Run-Length encoding approach in image data hiding was firstly proposed by C.C. Chang et al in 2006. Their embedding process was usually associated with three processing steps. The first stage is to convert a binary bitmap image into a series of long bit stream. For secondary stage, an information pair of run count and run value in each run of the same symbol is used to compress the secret information. Therefore, the third stage is referred as embedding process by modifying the least significant bit and adjusting the pixel gray-level in one of two adjacent pixels block. Most binary bitmap images usually have the feature of self-similarity in neighboring region upon which the Run-Length encoding scheme condense the secret image and enlarge the hiding capacity of stego-image. Both in C.C. Chang et al and our first proposed method, a threshold k is required firstly. But, our modification uses an additional bit-information to record whether the run count value is larger than initial threshold k. After that, the hiding capacity of our recipe almost doubles the original one at most and results equal decrease about the PSNR criteria. Due to the mentioned above methods are just do well for binary bit-map image. For random bit stream information, these approaches will be not right for it. An exclusive OR operator, therefore, is applied on the bit stream for clustering together with same symbol in our opinion. This modification can be regarded as a preprocessing before above mentioned works. Since the operator possesses the advantage of invertible, the original bit stream can be re-obtained from transformed bit stream, and it will condense the RLE information pairs. And then, enlarge the embedding capacity of the image data hiding based on the Run-Length encoding scheme. Finally, the whereabouts merit of PSNR and embedding capacity was compared and the experimental results show the efficiency of proposed method for evaluation.
author2 Rey-Sern Lin
author_facet Rey-Sern Lin
Shang-Wen Hu
胡尚文
author Shang-Wen Hu
胡尚文
spellingShingle Shang-Wen Hu
胡尚文
A Study on High Embedding Capacity of Image Hiding Based on Run-Length Encoding Scheme
author_sort Shang-Wen Hu
title A Study on High Embedding Capacity of Image Hiding Based on Run-Length Encoding Scheme
title_short A Study on High Embedding Capacity of Image Hiding Based on Run-Length Encoding Scheme
title_full A Study on High Embedding Capacity of Image Hiding Based on Run-Length Encoding Scheme
title_fullStr A Study on High Embedding Capacity of Image Hiding Based on Run-Length Encoding Scheme
title_full_unstemmed A Study on High Embedding Capacity of Image Hiding Based on Run-Length Encoding Scheme
title_sort study on high embedding capacity of image hiding based on run-length encoding scheme
publishDate 2009
url http://ndltd.ncl.edu.tw/handle/87929218407991712282
work_keys_str_mv AT shangwenhu astudyonhighembeddingcapacityofimagehidingbasedonrunlengthencodingscheme
AT húshàngwén astudyonhighembeddingcapacityofimagehidingbasedonrunlengthencodingscheme
AT shangwenhu yǐrunlengthbiānmǎjiàgòuwèijīchǔtíshēngyǐngxiàngzīxùnyǐncángliàngzhīyánjiū
AT húshàngwén yǐrunlengthbiānmǎjiàgòuwèijīchǔtíshēngyǐngxiàngzīxùnyǐncángliàngzhīyánjiū
AT shangwenhu studyonhighembeddingcapacityofimagehidingbasedonrunlengthencodingscheme
AT húshàngwén studyonhighembeddingcapacityofimagehidingbasedonrunlengthencodingscheme
_version_ 1718250950266716160