Pub Date : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509723
S. Iqbal, A. K. Chowdhury
Delivering messages in Delay Tolerant Networks is a nontrivial challenge due to its sparse nature and intermittent connectivity. Therefore efficient routing of messages is vital for these networks. In this work, we aim to adapt the spray phase of the Binary Spray and Wait routing scheme in Delay Tolerant Networks to avoid large communication overhead suffered by the scheme. We define an adaptive spraying scheme to allow nodes to switch to the wait phase without lingering the spray phase unnecessarily. Binary Spray and Wait routing permits nodes to enter the wait phase when the remaining number of copies of a message reaches one. However, we permit nodes to consider the time to live value of a message instead of the number of copies to enter the wait phase. We formulate an equation to obtain a switch value to compare against the time to live value of a message to migrate to the wait phase. Furthermore, we compare our scheme with that of other schemes through simulations. Simulation results show that our proposed adaptive spraying scheme performs better than that of others in different network scenarios.
{"title":"Adaptation of spray phase to improve the binary spray and Wait routing in Delay Tolerant Networks","authors":"S. Iqbal, A. K. Chowdhury","doi":"10.1109/ICCITECHN.2012.6509723","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509723","url":null,"abstract":"Delivering messages in Delay Tolerant Networks is a nontrivial challenge due to its sparse nature and intermittent connectivity. Therefore efficient routing of messages is vital for these networks. In this work, we aim to adapt the spray phase of the Binary Spray and Wait routing scheme in Delay Tolerant Networks to avoid large communication overhead suffered by the scheme. We define an adaptive spraying scheme to allow nodes to switch to the wait phase without lingering the spray phase unnecessarily. Binary Spray and Wait routing permits nodes to enter the wait phase when the remaining number of copies of a message reaches one. However, we permit nodes to consider the time to live value of a message instead of the number of copies to enter the wait phase. We formulate an equation to obtain a switch value to compare against the time to live value of a message to migrate to the wait phase. Furthermore, we compare our scheme with that of other schemes through simulations. Simulation results show that our proposed adaptive spraying scheme performs better than that of others in different network scenarios.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125005310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509780
Tamanna Tabassum, S. Islam
Digital video watermarking was introduced at the end of the last century to provide means of enforcing video copyright protection. Video watermarking involves embedding a secret information in the video. In this paper, we proposed a digital video watermarking technique based on identical frame extraction in 3-Level Discrete Wavelet Transform (DWT). In the proposed method, first the host video is divided into video shots. Then from each video shot one video frame called identical frame is selected for watermark embedding. Each identical frame is decomposed into 3-level DWT, then select the higher subband coefficients to embed the watermark and the watermark are adaptively embedded to these coefficients and thus guarantee the perceptual invisibility of the watermark. For watermark detection, the correlation between the watermark signal and the watermarked video is compared with a threshold value obtained from embedded watermark signal. The experimental results demonstrate that the watermarking method has strong robustness against some common attacks such as cropping, Gaussian noise adding, Salt & pepper noise adding, frame dropping and frame adding.
{"title":"A digital video watermarking technique based on identical frame extraction in 3-Level DWT","authors":"Tamanna Tabassum, S. Islam","doi":"10.1109/ICCITECHN.2012.6509780","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509780","url":null,"abstract":"Digital video watermarking was introduced at the end of the last century to provide means of enforcing video copyright protection. Video watermarking involves embedding a secret information in the video. In this paper, we proposed a digital video watermarking technique based on identical frame extraction in 3-Level Discrete Wavelet Transform (DWT). In the proposed method, first the host video is divided into video shots. Then from each video shot one video frame called identical frame is selected for watermark embedding. Each identical frame is decomposed into 3-level DWT, then select the higher subband coefficients to embed the watermark and the watermark are adaptively embedded to these coefficients and thus guarantee the perceptual invisibility of the watermark. For watermark detection, the correlation between the watermark signal and the watermarked video is compared with a threshold value obtained from embedded watermark signal. The experimental results demonstrate that the watermarking method has strong robustness against some common attacks such as cropping, Gaussian noise adding, Salt & pepper noise adding, frame dropping and frame adding.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116425058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-12-01DOI: 10.1109/ICCITechn.2012.6509783
M. A. Rahman, Atanu Barai, Md. Asadul Islam, M. Hashem
We present a new integrated, portable device to provide a convenient solution for remote monitoring heart rate at the fingertip and body temperature using Ethernet technology and widely spreading internet. Now a day, heart related disease is rising. Most of the times in these cases, patients may not realize their actual conditions and even it is a common fact that there are no doctors by their side, especially in rural areas, but now a day's most of the diseases are curable if detected in time. We have tried to make a system which may give information about one's physical condition and help him/her to detect these deadly but curable diseases. The system gives information of heart rate and body temperature simultaneously acquired on the portable side in realtime and transmits results to web. In this system, the condition of heart and body temperature can be monitored from remote places. Eventually, this device provides a low-cost, easily accessible human health monitor solution bridging the gaps between patients and doctors.
{"title":"Development of a device for remote monitoring of heart rate and body temperature","authors":"M. A. Rahman, Atanu Barai, Md. Asadul Islam, M. Hashem","doi":"10.1109/ICCITechn.2012.6509783","DOIUrl":"https://doi.org/10.1109/ICCITechn.2012.6509783","url":null,"abstract":"We present a new integrated, portable device to provide a convenient solution for remote monitoring heart rate at the fingertip and body temperature using Ethernet technology and widely spreading internet. Now a day, heart related disease is rising. Most of the times in these cases, patients may not realize their actual conditions and even it is a common fact that there are no doctors by their side, especially in rural areas, but now a day's most of the diseases are curable if detected in time. We have tried to make a system which may give information about one's physical condition and help him/her to detect these deadly but curable diseases. The system gives information of heart rate and body temperature simultaneously acquired on the portable side in realtime and transmits results to web. In this system, the condition of heart and body temperature can be monitored from remote places. Eventually, this device provides a low-cost, easily accessible human health monitor solution bridging the gaps between patients and doctors.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122817247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509715
A. Mehrab, P. Debnath, G. M. Mashrur-E-Elahi
Face is the most visible organ of human which can be used to differentiate one person from another. Embedded face recognition is quite a challenging era of biometric which can be used in different applications. There are currently commercially available systems for face recognition, but they are bulky, expensive, and proprietary. In this paper we will discuss about a real-time, portable, low cost face recognition system, developed by us, we named it as RPIPD-v1 (Real Time Portable Image Processing Device Version 1) which can work as a standalone system. This system can detect and recognize human faces and there is no such portable device that is capable of having this feature together. Our main aim was to glue these two tasks (Face Detection & Face Recognition) and build a system with the hardware and software to demonstrate the performance. The accuracy of our device is about 60% in distinguishing known and unknown faces. This is a general output of our device for critical situations. For the best performance of recognizing a face we need to highlight the individuals face with proper lighting and the individual's face must be in front of the camera properly. This device is made totally portable and standalone. Small size and low power enables this device to be placed in unique environments, collecting images autonomously for face recognition and other image processing applications. Low cost is another advantage which will allow this device to be used in various places as an effective solution.
脸是人类最明显的器官，可以用来区分一个人和另一个人。嵌入式人脸识别是一个具有挑战性的生物识别技术，可用于不同的应用领域。目前市面上有人脸识别系统，但它们体积庞大，价格昂贵，而且是专有的。在本文中，我们将讨论一个实时、便携、低成本的人脸识别系统，我们将其命名为RPIPD-v1 (Real Time portable Image Processing Device Version 1)，它可以作为一个独立的系统工作。该系统可以检测和识别人脸，目前还没有这样的便携式设备能够同时具备这一功能。我们的主要目的是粘合这两个任务(人脸检测和人脸识别)，并构建一个系统，用硬件和软件来演示性能。我们的设备在区分已知和未知面孔方面的准确率约为60%。这是我们的设备在紧急情况下的一般输出。为了最好地识别人脸，我们需要用适当的照明突出个人的脸，并且个人的脸必须正确地在相机前面。这个设备是完全便携和独立的。小尺寸和低功耗使该设备能够放置在独特的环境中，自动收集图像，用于面部识别和其他图像处理应用。低成本是另一个优势，这将使该设备作为一种有效的解决方案在各种地方使用。
{"title":"An approach to real-time portable device for face recognition system","authors":"A. Mehrab, P. Debnath, G. M. Mashrur-E-Elahi","doi":"10.1109/ICCITECHN.2012.6509715","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509715","url":null,"abstract":"Face is the most visible organ of human which can be used to differentiate one person from another. Embedded face recognition is quite a challenging era of biometric which can be used in different applications. There are currently commercially available systems for face recognition, but they are bulky, expensive, and proprietary. In this paper we will discuss about a real-time, portable, low cost face recognition system, developed by us, we named it as RPIPD-v1 (Real Time Portable Image Processing Device Version 1) which can work as a standalone system. This system can detect and recognize human faces and there is no such portable device that is capable of having this feature together. Our main aim was to glue these two tasks (Face Detection & Face Recognition) and build a system with the hardware and software to demonstrate the performance. The accuracy of our device is about 60% in distinguishing known and unknown faces. This is a general output of our device for critical situations. For the best performance of recognizing a face we need to highlight the individuals face with proper lighting and the individual's face must be in front of the camera properly. This device is made totally portable and standalone. Small size and low power enables this device to be placed in unique environments, collecting images autonomously for face recognition and other image processing applications. Low cost is another advantage which will allow this device to be used in various places as an effective solution.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129780641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509707
G. M. Daiyan, M. Mottalib, Muhammad Mizanur Rahman
A high performance decision based median filter is proposed for removal of salt and pepper in images. It is an enhanced Adaptive Switching Median filter which initially detects noise pixels iteratively through several phases and replaces the noisy pixels with median value. It calculates median value without considering noisy pixels to improve the performance of median filter for high density noise. Detection of noise is done by expanding the mask until 7×7 to maintain local information extraction. Moreover, the processing pixel is replaced by last processed pixel if the algorithm fails to detect noise free pixel at 7×7. If the noise free median value is not available at 7×7 processing window, the last processed pixel take into consideration if it is noise free. If the last processed pixel is noisy, the algorithm select a window size with 15×15 dimension and calculate the number of 0's and 255's in the processing window. Then replace the processing pixel with 0 or 255 which is more in number in the selected window. Experiment result shows that it can provide very high quality restored images for images that are contaminated by “salt & pepper” noise, especially when the noise density is large.
{"title":"High performance decision based median filter for salt and pepper noise removal in images","authors":"G. M. Daiyan, M. Mottalib, Muhammad Mizanur Rahman","doi":"10.1109/ICCITECHN.2012.6509707","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509707","url":null,"abstract":"A high performance decision based median filter is proposed for removal of salt and pepper in images. It is an enhanced Adaptive Switching Median filter which initially detects noise pixels iteratively through several phases and replaces the noisy pixels with median value. It calculates median value without considering noisy pixels to improve the performance of median filter for high density noise. Detection of noise is done by expanding the mask until 7×7 to maintain local information extraction. Moreover, the processing pixel is replaced by last processed pixel if the algorithm fails to detect noise free pixel at 7×7. If the noise free median value is not available at 7×7 processing window, the last processed pixel take into consideration if it is noise free. If the last processed pixel is noisy, the algorithm select a window size with 15×15 dimension and calculate the number of 0's and 255's in the processing window. Then replace the processing pixel with 0 or 255 which is more in number in the selected window. Experiment result shows that it can provide very high quality restored images for images that are contaminated by “salt & pepper” noise, especially when the noise density is large.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128805187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509797
M. Akhand, A. B. M. Junaed, Md. Forhad Hossain, K. Murase
The goal of Traveling Salesman Problem (TSP) is to find the shortest circular tour visiting every city exactly once. TSP has many real world applications and a number of methods have been investigated to solve TSP. Recently, nature inspired algorithms are also attracted to solve it. Here we studied Group Search Optimizer(GSO), the recently proposed nature inspired algorithm, to solve TSP. GSO is a population based optimization technique on the metaphor of producer-scrounger based social behavior of animals where producer searches for finding foods and scrounger searches for joining opportunities. GSO has found as an efficient method for solving function optimization problems for which it modeled. In this study we employ the concept of Swap Operator (SO) and Swap Sequence (SS) to modify GSO for TSP. The modified GSO (mGSO) was tested on a number of benchmark TSPs and results compared with some existing approaches. mGSO has shown best results (best tour cost) for some problems and competitive performance in other cases.
{"title":"Group Search Optimization to solve Traveling Salesman Problem","authors":"M. Akhand, A. B. M. Junaed, Md. Forhad Hossain, K. Murase","doi":"10.1109/ICCITECHN.2012.6509797","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509797","url":null,"abstract":"The goal of Traveling Salesman Problem (TSP) is to find the shortest circular tour visiting every city exactly once. TSP has many real world applications and a number of methods have been investigated to solve TSP. Recently, nature inspired algorithms are also attracted to solve it. Here we studied Group Search Optimizer(GSO), the recently proposed nature inspired algorithm, to solve TSP. GSO is a population based optimization technique on the metaphor of producer-scrounger based social behavior of animals where producer searches for finding foods and scrounger searches for joining opportunities. GSO has found as an efficient method for solving function optimization problems for which it modeled. In this study we employ the concept of Swap Operator (SO) and Swap Sequence (SS) to modify GSO for TSP. The modified GSO (mGSO) was tested on a number of benchmark TSPs and results compared with some existing approaches. mGSO has shown best results (best tour cost) for some problems and competitive performance in other cases.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126426493","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509746
M. Mahiuddin, Md. Atikur Rahman, Md. Monirul Islam, B. Roy
Digital Subscriber Line (DSL) combines the advantages of providing fast means of internet access with the usage of an existent infrastructure known as the plain old telephone service (POTS). Transmissions that use higher frequencies are more subject to attenuation and to crosstalk. Crosstalk is the undesired radiation of energy among wires. It is more likely to occur among/between similar frequencies and results in a received wave form that differs from the original wave form that was sent. In this article we analysis the crosstalk in various DSL systems by evaluating power spectral density function, i.e. functional principles of DSL and impairment caused by crosstalk. It is performed by the analysis of the results obtained from the Matlab program.
{"title":"Crosstalk analysis in digital subscriber line by evaluating power spectral density function","authors":"M. Mahiuddin, Md. Atikur Rahman, Md. Monirul Islam, B. Roy","doi":"10.1109/ICCITECHN.2012.6509746","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509746","url":null,"abstract":"Digital Subscriber Line (DSL) combines the advantages of providing fast means of internet access with the usage of an existent infrastructure known as the plain old telephone service (POTS). Transmissions that use higher frequencies are more subject to attenuation and to crosstalk. Crosstalk is the undesired radiation of energy among wires. It is more likely to occur among/between similar frequencies and results in a received wave form that differs from the original wave form that was sent. In this article we analysis the crosstalk in various DSL systems by evaluating power spectral density function, i.e. functional principles of DSL and impairment caused by crosstalk. It is performed by the analysis of the results obtained from the Matlab program.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132004637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509789
Ditipriya Sinha, R. Chaki, U. Bhattacharya
Sharing of secret values in MANET is inconsistent and computationally insecure due to its dynamic nature. Over the years, key generation, encryption and decryption have evolved as important techniques for providing secure routing in MANETs. Many researchers are involved in solving the secret sharing problem. Shamir's proposal is one of the eminent secret sharing schemes. However, this scheme does not include secure key generation. This paper proposes the use of the mathematical theory of Chinese remainder theorem coupled with the commonly used RSA for generating keys. Computational complexity of CRT is less than RSA modular exponentiation scheme. This helps to reduce the computational overhead. Once a secure key has been generated, it has been used for finding a secure route between source and destination. The final route is selected based on the highest weighted trust value of the routes. The three phased approach is aimed to increase the overall performance.
{"title":"A secure routing scheme in MANET with CRT based secret sharing","authors":"Ditipriya Sinha, R. Chaki, U. Bhattacharya","doi":"10.1109/ICCITECHN.2012.6509789","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509789","url":null,"abstract":"Sharing of secret values in MANET is inconsistent and computationally insecure due to its dynamic nature. Over the years, key generation, encryption and decryption have evolved as important techniques for providing secure routing in MANETs. Many researchers are involved in solving the secret sharing problem. Shamir's proposal is one of the eminent secret sharing schemes. However, this scheme does not include secure key generation. This paper proposes the use of the mathematical theory of Chinese remainder theorem coupled with the commonly used RSA for generating keys. Computational complexity of CRT is less than RSA modular exponentiation scheme. This helps to reduce the computational overhead. Once a secure key has been generated, it has been used for finding a secure route between source and destination. The final route is selected based on the highest weighted trust value of the routes. The three phased approach is aimed to increase the overall performance.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132617794","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Information hiding is a historical but on demand fascinating research area. Now, in today's world, the availability of information has become so easy that the security and insecurity of information goes side by side. In order to provide security of information a science called, Steganography has emerged. Steganography conceals the existence of information into images to formulate a secure communication. In this paper, a Steganographic method based on Pixel Value Differencing (PVD) and LSB Substitution method is proposed. To meet the increasing demand for privacy and secrecy the method focused mainly on making it a robust, secured technique of information hiding. An efficient and dynamic embedding algorithm is proposed in this paper that not only hides the secret data with an imperceptible visual quality and increased capacity but also make secret code breaking a good annoyance for the attacker. This method also represents an extraction algorithm that effectively extracts the entire secret message without any loss of a single data. Finally, experimental results show that, the proposed method achieves an increased embedding capacity and lower image degradation with improved security as compared to LSB substitution method and some recent existing methods of data hiding.
{"title":"A block based data hiding method in images using pixel value differencing and LSB substitution method","authors":"Tasnuva Mahjabin, Syed Monowar Hossain, Md Shariful Haque","doi":"10.1109/ICCITECHN.2012.6509770","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509770","url":null,"abstract":"Information hiding is a historical but on demand fascinating research area. Now, in today's world, the availability of information has become so easy that the security and insecurity of information goes side by side. In order to provide security of information a science called, Steganography has emerged. Steganography conceals the existence of information into images to formulate a secure communication. In this paper, a Steganographic method based on Pixel Value Differencing (PVD) and LSB Substitution method is proposed. To meet the increasing demand for privacy and secrecy the method focused mainly on making it a robust, secured technique of information hiding. An efficient and dynamic embedding algorithm is proposed in this paper that not only hides the secret data with an imperceptible visual quality and increased capacity but also make secret code breaking a good annoyance for the attacker. This method also represents an extraction algorithm that effectively extracts the entire secret message without any loss of a single data. Finally, experimental results show that, the proposed method achieves an increased embedding capacity and lower image degradation with improved security as compared to LSB substitution method and some recent existing methods of data hiding.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131314245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509724
Moinul Hossain, S. Farhad, M. Riasat
In this paper recursive least (RLS) square and variable step size least mean (VSS-LMS) square adaptive channel estimator are described for multiple input multiple output (MIMO) orthogonal frequency division multiplexing (OFDM) system. Both the techniques uses adaptive estimator which are capable of updating the parameters of estimator continuously and therefore knowledge of channel and noise statistics are not necessary, only knowledge of receive signal is required. From the simulation result it is observed that RLS CE method works better in terms of quick convergence rate than VSS-LMS CE for MIMO OFDM system. In addition, the utilization of more multiple antennas at the transmitter and/or receiver provides a much higher performance compared with fewer antennas.
{"title":"Performance analysis of RLS and VSS-LMS channel estimation techniques for 4G MIMO OFDM systems","authors":"Moinul Hossain, S. Farhad, M. Riasat","doi":"10.1109/ICCITECHN.2012.6509724","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509724","url":null,"abstract":"In this paper recursive least (RLS) square and variable step size least mean (VSS-LMS) square adaptive channel estimator are described for multiple input multiple output (MIMO) orthogonal frequency division multiplexing (OFDM) system. Both the techniques uses adaptive estimator which are capable of updating the parameters of estimator continuously and therefore knowledge of channel and noise statistics are not necessary, only knowledge of receive signal is required. From the simulation result it is observed that RLS CE method works better in terms of quick convergence rate than VSS-LMS CE for MIMO OFDM system. In addition, the utilization of more multiple antennas at the transmitter and/or receiver provides a much higher performance compared with fewer antennas.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123981937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：