Data Hiding Method Based on Graph Coloring and Pixel Block‘s Correlation in Color Image

نویسندگان

  • A. H. Heydari Department of Electrical and Electronic Engineering, Amirkabir University of Technology, Tehran, Iran
  • G. Ghadimi Dept. of Electrical Engineering, Emam Ali University, Tehran, Iran
  • M. Nejati Jahromi Dept. of Electrical Engineering, Shahid Sattary Aeronautical University of Science and Technology, Tehran, Iran
چکیده مقاله:

An optimized method for data hiding into a digital color image in spatial domainis provided. The graph coloring theory with different color numbers is applied. To enhance thesecurity of this method, block correlations method in an image is used. Experimental results showthat with the same PSNR, the capacity is improved by %8, and also security has increased in themethod compared with other methods. In the correlation block-based image method, data hidingcapacity of the host image varies according to image type and defined threshold level. In theproposed algorithm, during graph explanation, independent pixels placed side by side were colored.Then, based on “pixel block correlation data hiding” process is done. This method grows thesecurity and capacity of hiding process. Besides, this increases the effects of image format andcorrelation threshold on security and capacity.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Service Composition Based on Graph Coloring

Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...

متن کامل

Automatic Service Composition Based on Graph Coloring

Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...

متن کامل

Receiver Compatible Data Hiding in Color Image

Network Security for data transmission is the most vital issue in modern communication system. In this paper, we have discussed a new steganographic technique. The effectiveness of the proposed method is described through which idea of enhanced security of data can be achieved. To hide data in a binary image, no key is needed here rather this algorithm is based on the number of occurrence of 0s...

متن کامل

Cryptography and Image Steganography Using Dynamic Encryption on LSB and Color Image Based Data Hiding

Cryptography and steganography are two conventional techniques used to cipher or hide information or data in existing communication. Cryptography is the art of saving information by encrypting it into an obscure format. On the other hand, steganography is the art and science of secret communication to send messages in a way which hides even the existence of the communication. In cryptography me...

متن کامل

Hiding Signatures in Graph Coloring Solutions

One way to protect a digital product is to embed an au thor s signature into the object in the form of minute errors However this technique cannot be directly applied to protect intellectual proper ties such as solutions to hard problems which must maintain the cor rect functionality This paper proposes a constraint based watermarking technique and lays out a theoretical framework to evaluate t...

متن کامل

Data Hiding approach based on Eight-Queens Problem and Pixel Mapping Method

A new steganographic algorithm is presented using pixel mapping method based on eight queens and number of ones in pixel intensity value. In our method, we are sequentially selecting 81 pixel blocks to embed message bit. The method works with randomizing the bit selection in the 81 pixel block using eight queens’ solutions. This approach finds relationship between secret message and cover ima...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 49  شماره 2

صفحات  123- 130

تاریخ انتشار 2017-12-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023