H. Mathkour, G. Assassa, Abdulaziz Al Muharib, Ibrahim Kiady
{"title":"一种隐藏图像信息的新方法","authors":"H. Mathkour, G. Assassa, Abdulaziz Al Muharib, Ibrahim Kiady","doi":"10.1109/ICSAP.2009.36","DOIUrl":null,"url":null,"abstract":"In this paper, a spiral-based Least Significant Bit (LSB) approach for hiding messages in images is presented. The proposed approach is based on the LSB substitution technique applied on RGB color components of BMP images. The key idea is to divide the image into segments and process them differently. The presented approach considers three algorithms corresponding to three spiral substitution. The proposed algorithms are presented and their performance against attacks and processing time are evaluated. The embedding time was compared for the proposed algorithms as function of the message length up to 20 KB. Numerical experimentation suggests that the embedding time varies linearly with the message length. The assessment of the proposed algorithms against attacks was also evaluated using a chi-square analysis technique exhibiting superior performance","PeriodicalId":176934,"journal":{"name":"2009 International Conference on Signal Acquisition and Processing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"36","resultStr":"{\"title\":\"A Novel Approach for Hiding Messages in Images\",\"authors\":\"H. Mathkour, G. Assassa, Abdulaziz Al Muharib, Ibrahim Kiady\",\"doi\":\"10.1109/ICSAP.2009.36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a spiral-based Least Significant Bit (LSB) approach for hiding messages in images is presented. The proposed approach is based on the LSB substitution technique applied on RGB color components of BMP images. The key idea is to divide the image into segments and process them differently. The presented approach considers three algorithms corresponding to three spiral substitution. The proposed algorithms are presented and their performance against attacks and processing time are evaluated. The embedding time was compared for the proposed algorithms as function of the message length up to 20 KB. Numerical experimentation suggests that the embedding time varies linearly with the message length. The assessment of the proposed algorithms against attacks was also evaluated using a chi-square analysis technique exhibiting superior performance\",\"PeriodicalId\":176934,\"journal\":{\"name\":\"2009 International Conference on Signal Acquisition and Processing\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"36\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Signal Acquisition and Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSAP.2009.36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Signal Acquisition and Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSAP.2009.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, a spiral-based Least Significant Bit (LSB) approach for hiding messages in images is presented. The proposed approach is based on the LSB substitution technique applied on RGB color components of BMP images. The key idea is to divide the image into segments and process them differently. The presented approach considers three algorithms corresponding to three spiral substitution. The proposed algorithms are presented and their performance against attacks and processing time are evaluated. The embedding time was compared for the proposed algorithms as function of the message length up to 20 KB. Numerical experimentation suggests that the embedding time varies linearly with the message length. The assessment of the proposed algorithms against attacks was also evaluated using a chi-square analysis technique exhibiting superior performance