{"title":"基于LCS映射的图像隐写实现","authors":"Ratnakirti Roy, S. Changder","doi":"10.1109/IC3.2014.6897176","DOIUrl":null,"url":null,"abstract":"Image Realization Steganography aims in devising techniques that realize a secret message from a cover image using a suitable cover-to-secret mapping with low embedding rates. This paper presents an Image Realization Steganography technique which maps a secret image as a Longest Common Subsequence of a given cover image. The cover image being a string of high degree of randomness and a very large length as compared to the secret image, the length of the LCS between them is expected to be close to the length of the binary string equivalent of the secret image. This enables the proposed technique to realize a secret image with very little or no modification of the cover. Experimental results validate this fact strongly. The results also indicate that any given cover image can be used to realize a secret image as large as itself thereby establishing the high hiding capacity of the technique.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Image realization steganography with LCS based mapping\",\"authors\":\"Ratnakirti Roy, S. Changder\",\"doi\":\"10.1109/IC3.2014.6897176\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Image Realization Steganography aims in devising techniques that realize a secret message from a cover image using a suitable cover-to-secret mapping with low embedding rates. This paper presents an Image Realization Steganography technique which maps a secret image as a Longest Common Subsequence of a given cover image. The cover image being a string of high degree of randomness and a very large length as compared to the secret image, the length of the LCS between them is expected to be close to the length of the binary string equivalent of the secret image. This enables the proposed technique to realize a secret image with very little or no modification of the cover. Experimental results validate this fact strongly. The results also indicate that any given cover image can be used to realize a secret image as large as itself thereby establishing the high hiding capacity of the technique.\",\"PeriodicalId\":444918,\"journal\":{\"name\":\"2014 Seventh International Conference on Contemporary Computing (IC3)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Seventh International Conference on Contemporary Computing (IC3)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3.2014.6897176\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Seventh International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2014.6897176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Image realization steganography with LCS based mapping
Image Realization Steganography aims in devising techniques that realize a secret message from a cover image using a suitable cover-to-secret mapping with low embedding rates. This paper presents an Image Realization Steganography technique which maps a secret image as a Longest Common Subsequence of a given cover image. The cover image being a string of high degree of randomness and a very large length as compared to the secret image, the length of the LCS between them is expected to be close to the length of the binary string equivalent of the secret image. This enables the proposed technique to realize a secret image with very little or no modification of the cover. Experimental results validate this fact strongly. The results also indicate that any given cover image can be used to realize a secret image as large as itself thereby establishing the high hiding capacity of the technique.