Please use this identifier to cite or link to this item:
http://ri.uaemex.mx/handle20.500.11799/79904| Title: | A New Optimization Strategy for Solving the Fall-Off Boundary Value Problem in Pixel-Value Di®erencing Steganography | Keywords: | Optimization;Steganography;tri-way pixel value differencig;info:eu-repo/classification/cti/5 | Publisher: | International Journal of Pattern Recognition and Artificial Intelligence | Description: | In Digital Image Steganography, Pixel-Value Di®erencing (PVD) methods use the di®erence between neighboring pixel values to determine the amount of data bits to be inserted. The main advantage of these methods is the size of input data that an image can hold. However, the fall- o® boundary problem and the fall in error problem are persistent in many PVD steganographic methods. This results in an incorrect output image. To ¯x these issues, usually the pixel values are either somehow adjusted or simply not considered to carry part of the input data. In this paper, we enhance the Tri-way Pixel-Value Di®erencing method by ¯nding an optimal pixel value for each pixel pair such that it carries the maximum input data possible without ignoring any pair and without yielding incorrect pixel values. | URI: | http://ri.uaemex.mx/handle20.500.11799/79904 | Other Identifiers: | http://hdl.handle.net/20.500.11799/79904 | Rights: | info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/4.0 |
| Appears in Collections: | Producción |
Show full item record
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.