Pub Date : 2013-05-13DOI: 10.1109/IADCC.2013.6514261
K. N. Ashraf, V. Amarsinh, D. Satish
Mobile devices often change their location which triggers the handover from one access router to another. Mobility management provides a way to retain the ongoing session of the mobile node. It is crucial to provide efficient handoff mechanism support for mobile devices. Mobile IPv6 (MIPv6) and its extensions have been proposed for this purpose. Fast Mobile IPv6 (FMIPv6) and Hierarchical Mobile IPv6 (HMIPv6) have been developed as host-based mobility management protocols whereas Proxy Mobile IPv6 (PMIPv6) and Fast Proxy Mobile IPv6 (FPMIPv6) have been proposed as network-based mobility management protocols. In this paper, survey and detailed signaling of each protocol is presented followed by analysis of these protocols based on handover latency and signaling cost. Finally numerical results are presented and commented.
{"title":"Survey and analysis of mobility management protocols for handover in wireless network","authors":"K. N. Ashraf, V. Amarsinh, D. Satish","doi":"10.1109/IADCC.2013.6514261","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514261","url":null,"abstract":"Mobile devices often change their location which triggers the handover from one access router to another. Mobility management provides a way to retain the ongoing session of the mobile node. It is crucial to provide efficient handoff mechanism support for mobile devices. Mobile IPv6 (MIPv6) and its extensions have been proposed for this purpose. Fast Mobile IPv6 (FMIPv6) and Hierarchical Mobile IPv6 (HMIPv6) have been developed as host-based mobility management protocols whereas Proxy Mobile IPv6 (PMIPv6) and Fast Proxy Mobile IPv6 (FPMIPv6) have been proposed as network-based mobility management protocols. In this paper, survey and detailed signaling of each protocol is presented followed by analysis of these protocols based on handover latency and signaling cost. Finally numerical results are presented and commented.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"64 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128021057","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514373
A. Pal, S. Singh, Kusum Deep
This paper presents strategy of particle swarm optimization (PSO) algorithm introduced by Kennedy and Eberhart [1] for solving fractional programming problems. Particle swarm optimization (PSO) is a population-based optimization technique, which is an alternative tool to genetic algorithm (GA) and other evolutionary algorithms (EA) and has gained lot of attention in recent years. PSO is a stochastic search technique with reduced memory requirement, computationally effective and easier to implement as compared to EA. In this paper, possibility of using particle swarm optimization algorithm for solving fractional programming problems has been considered. The particle swarm optimization technique has been tried on a set of 12 test problems taken from the literature whose optimal solutions are known. A penalty function approach [2] is incorporated for handling constraints of the problem. Our experiences has shown that it can be effectively used to solve fractional programming problems also.
{"title":"Solution of fractional programming problems using PSO algorithm","authors":"A. Pal, S. Singh, Kusum Deep","doi":"10.1109/IADCC.2013.6514373","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514373","url":null,"abstract":"This paper presents strategy of particle swarm optimization (PSO) algorithm introduced by Kennedy and Eberhart [1] for solving fractional programming problems. Particle swarm optimization (PSO) is a population-based optimization technique, which is an alternative tool to genetic algorithm (GA) and other evolutionary algorithms (EA) and has gained lot of attention in recent years. PSO is a stochastic search technique with reduced memory requirement, computationally effective and easier to implement as compared to EA. In this paper, possibility of using particle swarm optimization algorithm for solving fractional programming problems has been considered. The particle swarm optimization technique has been tried on a set of 12 test problems taken from the literature whose optimal solutions are known. A penalty function approach [2] is incorporated for handling constraints of the problem. Our experiences has shown that it can be effectively used to solve fractional programming problems also.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128441079","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514259
S. Kumar, D. K. Lobiyal
Efficient sensor deployment scheme for target detection is one of the fundamental issues in wireless sensor networks. In this paper, we have proposed a deployment algorithm named linear order deployment algorithm (LODA). LODA uses transferable belief model (TBM) for target detection. This technique improves the overall performance in comparison to probability theory. The simulation results show that LODA improves the sensing coverage with limited number of sensors than the random deployment method.
{"title":"Linear order sensor network deployment for coverage analysis based on TBM theory","authors":"S. Kumar, D. K. Lobiyal","doi":"10.1109/IADCC.2013.6514259","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514259","url":null,"abstract":"Efficient sensor deployment scheme for target detection is one of the fundamental issues in wireless sensor networks. In this paper, we have proposed a deployment algorithm named linear order deployment algorithm (LODA). LODA uses transferable belief model (TBM) for target detection. This technique improves the overall performance in comparison to probability theory. The simulation results show that LODA improves the sensing coverage with limited number of sensors than the random deployment method.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129401669","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514454
R. Sarkar, S. Das, D. Rudrapal
Due to the lack of vision, the blind people cannot easily access the latest information and the technologies which can provide them an alternating communication expertise. Modern technological enhancements cannot be easily affordable to the visually impaired people because of their higher cost and the less portability. That is why it has become pretty necessary to develop a low cost, portable and a fast Braille System for the visually impaired people. This paper introduces a new communication channel for the deaf blind and visually impaired people which consist of three different subsystems providing different facilities to improve the communication skill of the visually impaired people. The system consists of the following three modules: i) a portable low cost refreshable Body-Braille system for displaying Braille characters using six micro vibrators. ii) an easy Braille writer for writing the Braille characters and iii) a remote communication system through SMS. This new communication system is cheap, portable, fast and accurate.
{"title":"A low cost microelectromechanical Braille for blind people to communicate with blind or deaf blind people through SMS subsystem","authors":"R. Sarkar, S. Das, D. Rudrapal","doi":"10.1109/IADCC.2013.6514454","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514454","url":null,"abstract":"Due to the lack of vision, the blind people cannot easily access the latest information and the technologies which can provide them an alternating communication expertise. Modern technological enhancements cannot be easily affordable to the visually impaired people because of their higher cost and the less portability. That is why it has become pretty necessary to develop a low cost, portable and a fast Braille System for the visually impaired people. This paper introduces a new communication channel for the deaf blind and visually impaired people which consist of three different subsystems providing different facilities to improve the communication skill of the visually impaired people. The system consists of the following three modules: i) a portable low cost refreshable Body-Braille system for displaying Braille characters using six micro vibrators. ii) an easy Braille writer for writing the Braille characters and iii) a remote communication system through SMS. This new communication system is cheap, portable, fast and accurate.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117321620","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514314
A. K. Pani, H. Mohanta
Soft sensors play an important role in predicting the values of unmeasured process variables from knowledge of easily measured process variables. Online estimation of particle size is vital for efficient control of a grinding circuit. Due to high energy consumption in cement grinding processes and unavailability of reliable hardware sensors for continuous monitoring, soft sensors have tremendous scope of application in cement mills. Modern cement plants are increasingly using vertical roller mills for clinker grinding. While there have been some works reported in the literature about modelling of ball mills, very few research work is available on vertical roller mill modelling. In the present work a PCA based neural network model of a cement mill is developed based on the actual plant data for estimation of cement fineness. Real time data for all process variables relevant to cement grinding process were collected from a cement plant having a clinker grinding capacity of 235 TPH. The collected raw industrial data were pre processed for outlier removal and missing value imputation. Principal component analysis of the input data was performed to transform the original variables to a less number of un correlated principal components. The selected principal component scores were divided to a training set and a validation set using Kennard-Stone subset selection algorithm. The training set was used to develop a back propagation neural network model which was subsequently tested with the validation set. Simulations results show satisfactory prediction capabilities of the developed model over that of linear regression and principal component regression models.
{"title":"A hybrid soft sensing approach of a cement mill using principal component analysis and artificial neural networks","authors":"A. K. Pani, H. Mohanta","doi":"10.1109/IADCC.2013.6514314","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514314","url":null,"abstract":"Soft sensors play an important role in predicting the values of unmeasured process variables from knowledge of easily measured process variables. Online estimation of particle size is vital for efficient control of a grinding circuit. Due to high energy consumption in cement grinding processes and unavailability of reliable hardware sensors for continuous monitoring, soft sensors have tremendous scope of application in cement mills. Modern cement plants are increasingly using vertical roller mills for clinker grinding. While there have been some works reported in the literature about modelling of ball mills, very few research work is available on vertical roller mill modelling. In the present work a PCA based neural network model of a cement mill is developed based on the actual plant data for estimation of cement fineness. Real time data for all process variables relevant to cement grinding process were collected from a cement plant having a clinker grinding capacity of 235 TPH. The collected raw industrial data were pre processed for outlier removal and missing value imputation. Principal component analysis of the input data was performed to transform the original variables to a less number of un correlated principal components. The selected principal component scores were divided to a training set and a validation set using Kennard-Stone subset selection algorithm. The training set was used to develop a back propagation neural network model which was subsequently tested with the validation set. Simulations results show satisfactory prediction capabilities of the developed model over that of linear regression and principal component regression models.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115512674","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514278
S. Prasad, Zaheeruddin, D. K. Lobiyal
The transmission of real time multimedia services in wireless ad hoc networks requires optimal multicast routing protocol that satisfies the quality of service guarantees. However, multicast routing protocol in wireless ad hoc networks must also be energy aware since the nodes are energy constrained due to limited battery life. This gives rise to the need for efficient multicast routing protocol that is able to determine multicast routes which satisfies the quality of service guarantees and at the same time conserves energy. The design of such protocol can be formulated as a Multiobjective Multicast Routing Problem (MMRP) that attempts to optimize the objectives simultaneously. The paper proposes a novel multiobjective algorithm based on Ant Colony Optimization (ACO) for MMRP problem. Our protocol attempts to optimize the end-to-end delay and total transmitted power simultaneously to obtain the Pareto-optimal solutions. The simulation results are very promising and show that our algorithm is able to find near optimal solution efficiently.
{"title":"Multiobjective multicast routing in wireless ad hoc networks - An Ant Colony approach","authors":"S. Prasad, Zaheeruddin, D. K. Lobiyal","doi":"10.1109/IADCC.2013.6514278","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514278","url":null,"abstract":"The transmission of real time multimedia services in wireless ad hoc networks requires optimal multicast routing protocol that satisfies the quality of service guarantees. However, multicast routing protocol in wireless ad hoc networks must also be energy aware since the nodes are energy constrained due to limited battery life. This gives rise to the need for efficient multicast routing protocol that is able to determine multicast routes which satisfies the quality of service guarantees and at the same time conserves energy. The design of such protocol can be formulated as a Multiobjective Multicast Routing Problem (MMRP) that attempts to optimize the objectives simultaneously. The paper proposes a novel multiobjective algorithm based on Ant Colony Optimization (ACO) for MMRP problem. Our protocol attempts to optimize the end-to-end delay and total transmitted power simultaneously to obtain the Pareto-optimal solutions. The simulation results are very promising and show that our algorithm is able to find near optimal solution efficiently.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115738079","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514416
Susheela Dahiya, P. Garg, M. Jat
In this paper, an object oriented approach for automatic building extraction from high resolution satellite image is developed. Firstly, Single Feature Classification is applied on the high resolution satellite image. After that, the high resolution image is segmented by using the split and merge segmentation so that the pixels that are grouped as raster objects have probability attributes associated with them. Then different filters are applied on the image to remove the objects which are not of our interest. After filtering the segments, the output raster image is converted into vector image. After converting the raster image into vector image, the building objects are extracted on the basis of area. The cleanup methods are applied to smoothen the extracted buildings and also to increase the accuracy of extraction of buildings. Imagine Objective tool of ERDAS 2011 has been used. The approach is applied on three different satellite images. The extracted buildings are compared with the manually digitized buildings. For one satellite image it has picked up all the buildings with a slight change in the area of footprints of buildings. Only one patch of road is extracted as a building. For the other two satellite images, the overall accuracy is low as compared to the first satellite image. Some patches of road and ground are also extracted as buildings. The branching factor, miss factor, building detection percentage and quality percentage were also calculated for accuracy assessment. Nonetheless, the overall accuracy of building extraction with respect to area was found to be 85.38% in a set of 66 buildings, 73.81% in a set of 94 buildings and 70.64% in a set of 102 buildings.
{"title":"Object oriented approach for building extraction from high resolution satellite images","authors":"Susheela Dahiya, P. Garg, M. Jat","doi":"10.1109/IADCC.2013.6514416","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514416","url":null,"abstract":"In this paper, an object oriented approach for automatic building extraction from high resolution satellite image is developed. Firstly, Single Feature Classification is applied on the high resolution satellite image. After that, the high resolution image is segmented by using the split and merge segmentation so that the pixels that are grouped as raster objects have probability attributes associated with them. Then different filters are applied on the image to remove the objects which are not of our interest. After filtering the segments, the output raster image is converted into vector image. After converting the raster image into vector image, the building objects are extracted on the basis of area. The cleanup methods are applied to smoothen the extracted buildings and also to increase the accuracy of extraction of buildings. Imagine Objective tool of ERDAS 2011 has been used. The approach is applied on three different satellite images. The extracted buildings are compared with the manually digitized buildings. For one satellite image it has picked up all the buildings with a slight change in the area of footprints of buildings. Only one patch of road is extracted as a building. For the other two satellite images, the overall accuracy is low as compared to the first satellite image. Some patches of road and ground are also extracted as buildings. The branching factor, miss factor, building detection percentage and quality percentage were also calculated for accuracy assessment. Nonetheless, the overall accuracy of building extraction with respect to area was found to be 85.38% in a set of 66 buildings, 73.81% in a set of 94 buildings and 70.64% in a set of 102 buildings.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125252839","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}
Analyzed the particularity of the TBM work environment and the superiority of virtual instrument for condition monitoring, and built a virtual instrument-based TBM condition monitoring systems. Researched the collected method of certainty feature vectors based on wavelet packet transform, and verified the applicability of this approach. A combination diagnostic methods of wavelet packet transform and BP neural network for fault diagnosis was proposed. In the process of applying this method, presented the method to adjust the weights of neural netwoek by the second learning to influent oefficient weighting method. Built a TBM condition monitoring and fault diagnosis system using LabVIEW and Matlab software. And shared the system online by using the web publishing tool. The technical feasibility were validated by the results of the operation of the system.
{"title":"Research on fault diagnosis for TBM Based on wavelet packet transforms and BP neural network","authors":"Tianrui Zhang, Zhenyu Wang, Tianbiao Yu, Wanshan Wang, Haifeng Zhao","doi":"10.1109/IADCC.2013.6514308","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514308","url":null,"abstract":"Analyzed the particularity of the TBM work environment and the superiority of virtual instrument for condition monitoring, and built a virtual instrument-based TBM condition monitoring systems. Researched the collected method of certainty feature vectors based on wavelet packet transform, and verified the applicability of this approach. A combination diagnostic methods of wavelet packet transform and BP neural network for fault diagnosis was proposed. In the process of applying this method, presented the method to adjust the weights of neural netwoek by the second learning to influent oefficient weighting method. Built a TBM condition monitoring and fault diagnosis system using LabVIEW and Matlab software. And shared the system online by using the web publishing tool. The technical feasibility were validated by the results of the operation of the system.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125433514","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514356
R. Raju, R. G. Babukarthik, D. Chandramohan, P. Dhavachelvan, T. Vengattaraman
Cloud computing technologies offer major benefits to the IT industries in terms of elasticity and rapid provisioning, pay-as-you-go-model, reduced capital cost, access to unlimited resources, flexibility. Job scheduling is a combinatorial optimization problem in the fields of computer science where the ideal jobs are assigned to required resource at a particular instant of time. In this paper we proposed Hybrid algorithm which combine the advantage of ACO and Cuckoo search. The makespan or completion time can be reduced with the help of hybrid algorithm, since the jobs have been executed with in the specified time interval by allocation of required resources using the Hybrid algorithm. The obtain results shows that Hybrid algorithm performs well than compared with the ACO algorithm in terms of performance of the algorithm and makespan.
{"title":"Minimizing the makespan using Hybrid algorithm for cloud computing","authors":"R. Raju, R. G. Babukarthik, D. Chandramohan, P. Dhavachelvan, T. Vengattaraman","doi":"10.1109/IADCC.2013.6514356","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514356","url":null,"abstract":"Cloud computing technologies offer major benefits to the IT industries in terms of elasticity and rapid provisioning, pay-as-you-go-model, reduced capital cost, access to unlimited resources, flexibility. Job scheduling is a combinatorial optimization problem in the fields of computer science where the ideal jobs are assigned to required resource at a particular instant of time. In this paper we proposed Hybrid algorithm which combine the advantage of ACO and Cuckoo search. The makespan or completion time can be reduced with the help of hybrid algorithm, since the jobs have been executed with in the specified time interval by allocation of required resources using the Hybrid algorithm. The obtain results shows that Hybrid algorithm performs well than compared with the ACO algorithm in terms of performance of the algorithm and makespan.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125578980","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514397
A. K. Verma, M. Singhal, C. Patvardhan
This paper presents a robust watermarking scheme of digital videos using YCbCr color space and Wavelet based techniques. The proposed scheme divides the given watermark in two parts. One smaller part is embedded in Y channel with lesser embedding strength, while other larger part is embedded in Cr channel with higher embedding strength to achieve good balance of imperceptibility and robustness. Embedding in the Y channel provides robustness against compression attacks while embedding in Cr channel provides robustness against other types of attacks. Spread Spectrum Technique of watermarking is used. In the proposed scheme, the watermark is embedded in a plane which is specifically prepared by the temporal information of the video to achieve maximum imperceptibility. The proposed algorithm is tested against various types of attacks. The results are presented on the basis of PSNR between original and modified video as well as correlation of the original and extracted watermark. It is demonstrated that the proposed algorithm performs well on both the counts.
{"title":"Robust temporal video watermarking using YCbCr color space in Wavelet domain","authors":"A. K. Verma, M. Singhal, C. Patvardhan","doi":"10.1109/IADCC.2013.6514397","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514397","url":null,"abstract":"This paper presents a robust watermarking scheme of digital videos using YCbCr color space and Wavelet based techniques. The proposed scheme divides the given watermark in two parts. One smaller part is embedded in Y channel with lesser embedding strength, while other larger part is embedded in Cr channel with higher embedding strength to achieve good balance of imperceptibility and robustness. Embedding in the Y channel provides robustness against compression attacks while embedding in Cr channel provides robustness against other types of attacks. Spread Spectrum Technique of watermarking is used. In the proposed scheme, the watermark is embedded in a plane which is specifically prepared by the temporal information of the video to achieve maximum imperceptibility. The proposed algorithm is tested against various types of attacks. The results are presented on the basis of PSNR between original and modified video as well as correlation of the original and extracted watermark. It is demonstrated that the proposed algorithm performs well on both the counts.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128169493","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
扫码关注我们
求助内容：
应助结果提醒方式：