Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726609
Shefaly Sharma, J. Kaur, Shipra Gupta
With the explosive growth of internet technology, many innovative applications requiring exchange of large amount of data have become feasible and hence security of data have become a critical issue. In this paper, a robust and secure visible image watermarking algorithm is purposed. This purposed algorithm is based on Multi Wavelets with Modified fast Haar Wavelet transform [MFHWT]. MFHWT is the latest technique used for wavelets transformation which is used to perform image analysis at faster rate than previous techniques. The main idea of the purposed algorithm is to decompose the original image into fine scale sub bands using MFHWT according to the size of the Watermark. In this algorithm, the obtained watermarked image. In this algorithm has very high Peak Signal to Noise Ratio [PSNR].
{"title":"Improved modified fast Haar Wavelet transformation [MFHWT] based visible watermarking","authors":"Shefaly Sharma, J. Kaur, Shipra Gupta","doi":"10.1109/ICCCNT.2013.6726609","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726609","url":null,"abstract":"With the explosive growth of internet technology, many innovative applications requiring exchange of large amount of data have become feasible and hence security of data have become a critical issue. In this paper, a robust and secure visible image watermarking algorithm is purposed. This purposed algorithm is based on Multi Wavelets with Modified fast Haar Wavelet transform [MFHWT]. MFHWT is the latest technique used for wavelets transformation which is used to perform image analysis at faster rate than previous techniques. The main idea of the purposed algorithm is to decompose the original image into fine scale sub bands using MFHWT according to the size of the Watermark. In this algorithm, the obtained watermarked image. In this algorithm has very high Peak Signal to Noise Ratio [PSNR].","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"19 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88063684","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-07-04DOI: 10.1109/ICCCNT.2013.6726665
S. Khurana, Khyati Marwah
The concept Cloud computing has not only reshaped the field of distributed systems but also fundamentally changed how business potential extends today. In recent advancements, Cloud computing applications are provided as services to end-users. The application services hosted under Cloud computing model have complex provisioning, configuration, and deployment requirements How to use Cloud computing resources efficiently and gain the maximum profits with efficient utilization of resources is one of the Cloud computing service providers' ultimate goals. Repetitive evaluation of the performance of Cloud provisioning policies, application workload models, and resources performance models in dynamic system are difficult to achieve and rather a time consuming and costly approach. To overcome this challenge, Cloud analyst simulator based on Cloud Sim has been proposed which enables the modeling and simulation in cloud's ambience. The objective of this paper is to prove that the choice of VM Scheduling Policy in Cloud computing model significantly improves the application performance under resource and service demand variations. We will discuss different Virtual Machine (VM) Scheduling Policies implemented and their performance analysis in Virtual environment of cloud computing in order to achieve better Quality of Service (QoS).
{"title":"Performance evaluation of Virtual Machine (VM) scheduling policies in Cloud computing (spaceshared & timeshared)","authors":"S. Khurana, Khyati Marwah","doi":"10.1109/ICCCNT.2013.6726665","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726665","url":null,"abstract":"The concept Cloud computing has not only reshaped the field of distributed systems but also fundamentally changed how business potential extends today. In recent advancements, Cloud computing applications are provided as services to end-users. The application services hosted under Cloud computing model have complex provisioning, configuration, and deployment requirements How to use Cloud computing resources efficiently and gain the maximum profits with efficient utilization of resources is one of the Cloud computing service providers' ultimate goals. Repetitive evaluation of the performance of Cloud provisioning policies, application workload models, and resources performance models in dynamic system are difficult to achieve and rather a time consuming and costly approach. To overcome this challenge, Cloud analyst simulator based on Cloud Sim has been proposed which enables the modeling and simulation in cloud's ambience. The objective of this paper is to prove that the choice of VM Scheduling Policy in Cloud computing model significantly improves the application performance under resource and service demand variations. We will discuss different Virtual Machine (VM) Scheduling Policies implemented and their performance analysis in Virtual environment of cloud computing in order to achieve better Quality of Service (QoS).","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"16 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88078422","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-07-04DOI: 10.1109/ICCCNT.2013.6726500
Chengani VinodChandra, S. Ramasamy
The test generation problem for circuits is known to be NP-hard. Efficient techniques for test generation are essential in order to reduce the test generation time. Test patterns were generated using ATPG (Automatic Test Pattern Generation) and faults were inserted in the netlist file generated using DFT (Design for Test). Here ATPG is achieved using the combination of Design Compiler and the Tetramax. Fault coverage and test patterns were generated. It was observed that neither a comprehensive functional verification sequence nor a sequence with high stuck-at fault coverage gives high transition fault coverage for sequential circuits. A customized LFSR algorithm is used to find the fault coverage and pattern used to detect the faults. It is found that LFSR techniqque seems to be good when compared to the ATPG tool for the small and medium circuits. LFSR technique yields 100% fault coverage where as Tetramax is giving about 97% fault coverage.
{"title":"Test pattern generation for benchmark circuits using LFSR","authors":"Chengani VinodChandra, S. Ramasamy","doi":"10.1109/ICCCNT.2013.6726500","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726500","url":null,"abstract":"The test generation problem for circuits is known to be NP-hard. Efficient techniques for test generation are essential in order to reduce the test generation time. Test patterns were generated using ATPG (Automatic Test Pattern Generation) and faults were inserted in the netlist file generated using DFT (Design for Test). Here ATPG is achieved using the combination of Design Compiler and the Tetramax. Fault coverage and test patterns were generated. It was observed that neither a comprehensive functional verification sequence nor a sequence with high stuck-at fault coverage gives high transition fault coverage for sequential circuits. A customized LFSR algorithm is used to find the fault coverage and pattern used to detect the faults. It is found that LFSR techniqque seems to be good when compared to the ATPG tool for the small and medium circuits. LFSR technique yields 100% fault coverage where as Tetramax is giving about 97% fault coverage.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"16 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88100063","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-07-04DOI: 10.1109/ICCCNT.2013.6726799
C. Sur, A. Shukla
In this paper a new biological phenomenon following meta-heuristics called Green Heron Optimization Algorithm (GHOA) is being discussed, for the first time, which acquired its inspiration from the Green Heron birds, their intelligence, perception analysis capability and technique for food acquisition. The natural phenomenon of the bird has been capped into some unique operations which favour the graph based and discrete combinatorial optimization problems but with slight modification can also be utilized for other wide variety of problems of the real world which have discrete representation of data and variables having several constraints. In this work we have mainly concentrated on the description, mathematical representations, presentations, features, limitations and performance analysis of the algorithm on the scattered dimensional datasets of the Quadratic Assignment Problem (QAP) & 0/1 Knapsack Problem (KSP) to clearly demarcate its performance with change in dimension that is scalability. The results of the simulation clearly reveal how the algorithm has worked optimally for the various datasets of the problem. GHOA is one of the few members in the discrete domain algorithms of the bio-inspired computation family which favours suitably the graph based problems like path planning, process scheduling etc and has the capability of recombination and local search for global optimization and refinement of the solutions.
{"title":"Dealing QAP & KSP with Green Heron optimization algorithm — A new bio-inspired meta-heuristic","authors":"C. Sur, A. Shukla","doi":"10.1109/ICCCNT.2013.6726799","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726799","url":null,"abstract":"In this paper a new biological phenomenon following meta-heuristics called Green Heron Optimization Algorithm (GHOA) is being discussed, for the first time, which acquired its inspiration from the Green Heron birds, their intelligence, perception analysis capability and technique for food acquisition. The natural phenomenon of the bird has been capped into some unique operations which favour the graph based and discrete combinatorial optimization problems but with slight modification can also be utilized for other wide variety of problems of the real world which have discrete representation of data and variables having several constraints. In this work we have mainly concentrated on the description, mathematical representations, presentations, features, limitations and performance analysis of the algorithm on the scattered dimensional datasets of the Quadratic Assignment Problem (QAP) & 0/1 Knapsack Problem (KSP) to clearly demarcate its performance with change in dimension that is scalability. The results of the simulation clearly reveal how the algorithm has worked optimally for the various datasets of the problem. GHOA is one of the few members in the discrete domain algorithms of the bio-inspired computation family which favours suitably the graph based problems like path planning, process scheduling etc and has the capability of recombination and local search for global optimization and refinement of the solutions.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"148 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88278984","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-07-04DOI: 10.1109/ICCCNT.2013.6726496
C. C. Kavar, S. Parmar
The process takes less time for handling instructions then would be speedy and efficient. The speed of the process is not only depends on architectural features and operational frequency, but also depends on the algorithm and data structure, which is used for that process. There are many page replacement algorithms such as least recently used (LRU), first-in-first-out (FIFO), Optimal and the combination of LRU and least frequently used (LFU) are available in memory management. We can improve the performance of page replacement algorithm either develop a new algorithm from scratch or using augmentation of data structure and algorithm design. In this paper we use augmented doubly circular link list, skip list, splay tree and hash table and apply all these on LRU page replacement algorithm. We implement all these augmented data structure with LRU page replacement algorithm and traced using Standard Performance Evaluation Corporation (SPEC) benchmark files. This paper show that augmentation of data structure can improve the performance of LRU page replacement algorithm.
{"title":"Improve the performance of LRU page replacement algorithm using augmentation of data structure","authors":"C. C. Kavar, S. Parmar","doi":"10.1109/ICCCNT.2013.6726496","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726496","url":null,"abstract":"The process takes less time for handling instructions then would be speedy and efficient. The speed of the process is not only depends on architectural features and operational frequency, but also depends on the algorithm and data structure, which is used for that process. There are many page replacement algorithms such as least recently used (LRU), first-in-first-out (FIFO), Optimal and the combination of LRU and least frequently used (LFU) are available in memory management. We can improve the performance of page replacement algorithm either develop a new algorithm from scratch or using augmentation of data structure and algorithm design. In this paper we use augmented doubly circular link list, skip list, splay tree and hash table and apply all these on LRU page replacement algorithm. We implement all these augmented data structure with LRU page replacement algorithm and traced using Standard Performance Evaluation Corporation (SPEC) benchmark files. This paper show that augmentation of data structure can improve the performance of LRU page replacement algorithm.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"9 4 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83611297","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-07-04DOI: 10.1109/ICCCNT.2013.6726744
Kumar Ayush, N. Agarwal
Simultaneous localization and map-building (SLAM) continues to draw considerable attention in the robotics community due to the advantages it can offer in building autonomous robots. However, few approaches to this problem scale up to handle a large number of landmarks present in real environments. The processing resource requirement to carry out SLAM in real time can be quite high. In this paper we present a novel system which employs resources provided by infrastructure as a service (IaaS) and parallelism for effective processing. Using private cloud infrastructure employing virtualized resources based on MPI the task of global map building is performed in real time simultaneously carrying out loop detection and bundle adjustment for indoor environments. Through implementation in various challenging environments with moving obstacles, visually homogeneous areas having few features, regions with large changes in lighting and relatively fast camera motion we demonstrate our system to be one which is effective as well as robust.
{"title":"Real time visual SLAM using cloud computing","authors":"Kumar Ayush, N. Agarwal","doi":"10.1109/ICCCNT.2013.6726744","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726744","url":null,"abstract":"Simultaneous localization and map-building (SLAM) continues to draw considerable attention in the robotics community due to the advantages it can offer in building autonomous robots. However, few approaches to this problem scale up to handle a large number of landmarks present in real environments. The processing resource requirement to carry out SLAM in real time can be quite high. In this paper we present a novel system which employs resources provided by infrastructure as a service (IaaS) and parallelism for effective processing. Using private cloud infrastructure employing virtualized resources based on MPI the task of global map building is performed in real time simultaneously carrying out loop detection and bundle adjustment for indoor environments. Through implementation in various challenging environments with moving obstacles, visually homogeneous areas having few features, regions with large changes in lighting and relatively fast camera motion we demonstrate our system to be one which is effective as well as robust.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"111 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89274992","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}
Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm that has been widely used for different combinational optimization problem and inspired by the foraging behavior of real ant colonies. It has strong robustness and easy to combine with other methods in optimization. In this paper, an efficient modified ant colony optimization algorithm with uniform mutation using self-adaptive approach for the travelling salesman problem (TSP) has been proposed. Here mutation operator is used for enhancing the algorithm escape from local optima. The algorithm converges to the final optimal solution, by accumulating most effective sub-solutions. Experimental results show that the proposed algorithm is better than the algorithm previously proposed.
{"title":"Modified ant colony optimization algorithm with uniform mutation using self-adaptive approach for travelling salesman problem","authors":"R. S. Jadon, U. Datta","doi":"10.5120/12943-9931","DOIUrl":"https://doi.org/10.5120/12943-9931","url":null,"abstract":"Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm that has been widely used for different combinational optimization problem and inspired by the foraging behavior of real ant colonies. It has strong robustness and easy to combine with other methods in optimization. In this paper, an efficient modified ant colony optimization algorithm with uniform mutation using self-adaptive approach for the travelling salesman problem (TSP) has been proposed. Here mutation operator is used for enhancing the algorithm escape from local optima. The algorithm converges to the final optimal solution, by accumulating most effective sub-solutions. Experimental results show that the proposed algorithm is better than the algorithm previously proposed.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"23 6","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91468841","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-07-04DOI: 10.1109/ICCCNT.2013.6726670
Ishwari Aghav, Vishal Tathe, Aashay Zajriya, M. Emmanuel
Abstract Syntax Trees (AST) are useful to understand program semantics. Data flow analysis of interests to program developers. In this paper we use effectively AST to reveal data flow information. Computer programs larger part in static form is declaration of data. Analyzing data dependency helps to design and development of source programs. We consider data flow analysis with more importance and focus in the design and implementation of method. We propose an utility that lists the data dependency in static source code by analyzing data flow. Data flow analysis is used to improve the process of software development as it helps in analyzing the existing code and in developing new program by modifying or extracting modules. In the implementation we have used open source compiler LLVM with Clang as its front end to interpret C/C++ code.
{"title":"Automated static data flow analysis","authors":"Ishwari Aghav, Vishal Tathe, Aashay Zajriya, M. Emmanuel","doi":"10.1109/ICCCNT.2013.6726670","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726670","url":null,"abstract":"Abstract Syntax Trees (AST) are useful to understand program semantics. Data flow analysis of interests to program developers. In this paper we use effectively AST to reveal data flow information. Computer programs larger part in static form is declaration of data. Analyzing data dependency helps to design and development of source programs. We consider data flow analysis with more importance and focus in the design and implementation of method. We propose an utility that lists the data dependency in static source code by analyzing data flow. Data flow analysis is used to improve the process of software development as it helps in analyzing the existing code and in developing new program by modifying or extracting modules. In the implementation we have used open source compiler LLVM with Clang as its front end to interpret C/C++ code.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"60 6","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91510267","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-07-04DOI: 10.1109/ICCCNT.2013.6726624
Shradha P. Dugam, S. Pingat
The area of study and work presented in this paper is on a method of routing in sensor networks that is a part of Geographic Routing protocol known as Greedy Forwarding. This is an much more efficient version of methods that are applicable in GR. This works on the principle of progressing in the process of forwarding by selecting a peer that is nearer to the final node where the packets are destined. But with the benefits of reducing the total distance between two end points this method incurs limitations regarding collection of proper network topology information thus creating voids while sending packets. To avoid this an improvised version of previous works is presented over here that highlights mainly of increasing performance as well as energy efficiency of GF method in GR. A more enhanced method that will collect more accurate topological information and support the forwarding process with energy saving to increase networks lifetime is presented. Here the discussion about the work done by previous methods will be shown along with we introduce to you a newer version. The basic aim is to consider maximum energy paths and nodes with maximum energy remains.
{"title":"Performace and energy efficient Greedy forwarding method for sensor networks","authors":"Shradha P. Dugam, S. Pingat","doi":"10.1109/ICCCNT.2013.6726624","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726624","url":null,"abstract":"The area of study and work presented in this paper is on a method of routing in sensor networks that is a part of Geographic Routing protocol known as Greedy Forwarding. This is an much more efficient version of methods that are applicable in GR. This works on the principle of progressing in the process of forwarding by selecting a peer that is nearer to the final node where the packets are destined. But with the benefits of reducing the total distance between two end points this method incurs limitations regarding collection of proper network topology information thus creating voids while sending packets. To avoid this an improvised version of previous works is presented over here that highlights mainly of increasing performance as well as energy efficiency of GF method in GR. A more enhanced method that will collect more accurate topological information and support the forwarding process with energy saving to increase networks lifetime is presented. Here the discussion about the work done by previous methods will be shown along with we introduce to you a newer version. The basic aim is to consider maximum energy paths and nodes with maximum energy remains.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"38 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78123147","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-07-04DOI: 10.1109/ICCCNT.2013.6726593
E. Kumar, Remya Elizabeth Philip, P. S. Kumar, M. Sumithra
There are different ways to protect medical images, most commonly used are steganography, watermarking, encryption etc. Due to the advantages of watermarking it has achieved a great importance in the field of image security. This paper gives a comparative analysis on applying SVD on different sub bands of a Haar wavelet transformed medical image. The experimentation is done using MRI and CT scan medical images.
{"title":"DWT-SVD based reversible watermarking algorithm for embedding the secret data in medical images","authors":"E. Kumar, Remya Elizabeth Philip, P. S. Kumar, M. Sumithra","doi":"10.1109/ICCCNT.2013.6726593","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726593","url":null,"abstract":"There are different ways to protect medical images, most commonly used are steganography, watermarking, encryption etc. Due to the advantages of watermarking it has achieved a great importance in the field of image security. This paper gives a comparative analysis on applying SVD on different sub bands of a Haar wavelet transformed medical image. The experimentation is done using MRI and CT scan medical images.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"181 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80686329","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
扫码关注我们
求助内容：
应助结果提醒方式：