{"title":"Extended performance comparison of hybrid wavelet transform for image compression with varying proportions of constituent transforms","authors":"Sudeep D. Thepade, J. Dewan, A. Lohar","doi":"10.1109/ICACT.2013.6710497","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710497","url":null,"abstract":"The rapid growth of digital imaging applications have increased the need for effective image compression techniques. Image compression minimizes the size of the image without degrading the quality of the image to an unacceptable level. Image compression in transform domain is one of the most popular techniques. Previous work has proved that the hybrid wavelet transforms (HWT) are better than the respective constituent orthogonal transforms in image compression[1, 2]. Here the extended performance comparison of HWT for image compression is presented with varying the constituent transforms and the proportions of the constituent transforms to test the effect on quality of image compression. The experimentation is done on set of 20 images by varying the constituent transforms, proportion of constituent transforms and compression ratios (CR). The constituent transforms used to generated HWT are Cosine transform, Sine transform, Slant transform, Kekre transform, Walsh transform and Haar transform. Here five proportions of constituent transforms alias 1:16, 1:4, 1:1, 4:1, 16:1 are considered for generation of HWT. Results prove that 4:1, 1:1, 1:4 proportions of constituent transforms in HWT gives better performance as compared to 1:1 proportion of constituent transforms for different compression ratios. Also for 95% compression ratio, 4:1 ratio of DCT-Haarconstituent transforms in HWT gives better results. 1:1 ratio of DCT-Haarconstituent transforms give better results for compression ratios between 70% and 90%. For lower compression ratios, 1:4 proportions of DCT-Haarconstituent transformsin HWT gives better performance.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127091844","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}
{"title":"A robust image watermarking scheme using simplified significant wavelet tree quantization","authors":"L. Sumalatha, V. Krishna, M. R. Kumar","doi":"10.1109/ICACT.2013.6710545","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710545","url":null,"abstract":"In this present work a wavelet based watermarking technique is discussed. The proposed method transforms the image into wavelet coefficients by using DWT. A Simplified Significant Wavelet Tree (SSWT) is formed with wavelet coefficients (other than at lowest level) at higher level subband descending towards lower levels. The proposed scheme quantizes the SSWT coefficients to embed a bit of watermark into the frequency part of the image. In the watermark extraction the wavelet trees are formed on the received image to retrieve the watermark bits. The proposed scheme uses adaptive casting energy at different levels and hence achieves high robustness. Various attacks were performed to test the performance and the proposed method has shown high robustness against these attacks.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128976941","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}
{"title":"A survey of cyber crime in India","authors":"Vinit Kumar Gunjan, Amit Kumar, Sharda Avdhanam","doi":"10.1109/ICACT.2013.6710503","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710503","url":null,"abstract":"Cybercrime is all about the crimes in which communication channel and communication device has been used directly or indirectly as a medium whether it is a Laptop, Desktop, PDA, Mobile phones, Watches, Vehicles. The report titled “Global Risks for 2012”, predicts cyber-attacks as one of the top five risks in the World for Government and business sector. Cyber crime is a crime which is harder to detect and hardest to stop once occurred causing a long term negative impact on victims. With the increasing popularity of online banking, online shopping which requires sensitive personal and financial data, it is a term that we hear in the news with some frequency. Now, in order to protect ourselves from this crime we need to know what it is and how it does works against us. This paper presents a brief overview of all about cyber criminals and crime with its evolution, types, case study, preventive majors and the department working to combat this crime.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115291873","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}
{"title":"Towards on high performance computing of medical imaging based on graphical processing units","authors":"K. Suresh, M. Babu","doi":"10.1109/ICACT.2013.6710504","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710504","url":null,"abstract":"The Design of GPU(Graphical Processing Unit) will well suitable for express the data parallel computations because GPU will specialized for parallel and today's digital images in medical are huge volume of collections in every day, however medical imaging produces demand to improve the medical diagnosis and procedures. This survey is provide graphical processing computations and hardware require to compute and give better information for diagnosis of Cancer Treatment using Radiation Therapy. It is important techniques to increase quality of medical image data clinically under pressure to make enriched data and improve accurate treatment and decrease the complications.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133853152","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}
Spandana Paramkusham, Kunda M. M. Rao, B. V. V. S. N. Prabhakar Rao
{"title":"Early stage detection of breast cancer using novel image processing techniques, Matlab and Labview implementation","authors":"Spandana Paramkusham, Kunda M. M. Rao, B. V. V. S. N. Prabhakar Rao","doi":"10.1109/ICACT.2013.6710511","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710511","url":null,"abstract":"Early detection of breast cancer is carried out by using mammographic images. Due to low contrast nature of these images, it is difficult to detect signs such as micro calcifications and masses. This paper describes novel algorithms for early detection of breast cancer using image processing techniques. Novel algorithms are implemented for 1) Mass region extraction to get exact shape of the mass 2) Superposition of boundary of mass on mammogram helps doctors to view the boundary easily as mass region overlaps with breast parenchyma 3) Extraction of texture features like mean, standard deviation, entropy, kurtosis etc, geometric features like area perimeter L:S, ENC, (Elliptical normalized circumference) wavelet based features, so that signatures can be assigned for identification and classification of benign and malignant masses. Fourteen patients' mammograms have been processed. Features of six patients have been extracted that have masses.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114576213","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}
{"title":"Vector based hysteresis current control scheme for vector controlled induction motor drives","authors":"M. Rama Prasad Reddy, T. Reddy, B. Brahmaiah","doi":"10.1109/ICACT.2013.6710537","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710537","url":null,"abstract":"Simple and novel vector based hysteresis current control schemes are presented for vector controlled induction motor drives. The proposed algorithm combines the principles of direct torque control (DTC) and field oriented control (FOC). The proposed algorithm generates the reference currents as per the principle of vector control algorithm. The, the vector based hysteresis comparators integrated with look-up tables are proposed for vector controlled induction motor drive. The proposed lookup tables based vector control gives good dynamic response with reduced harmonic distortion. This paper presents 6-sector and 12-sector based vector control algorithms. To validate the proposed methods numerical simulation studies have been carried out and compared with the existing algorithms. The simulation results show the effectiveness of the proposed technique.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129511410","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}
{"title":"PAPR reduction in OFDM systems using PTS and various modulation schemes","authors":"Srinu Pyla, K. Raju, N. BalaSubrahmanyam","doi":"10.1109/ICACT.2013.6710486","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710486","url":null,"abstract":"Day by day number of users and services are increasing rapidly. To accommodate all, very high speed communication systems are required. Orthogonal Frequency Division Multiplexing (OFDM) is an suitable technique for achieving high data rate transmission but the main drawback of OFDM is increase in peak power termed as high peak to average power ratio (PAPR). This high PAPR leads to an in-band distortion due to clipping and out of band radiation due to spectral broadening in power limited devices especially in wireless applications. There are number of techniques have been proposed to attack this problem. In this paper, Partial Transmit Sequence (PTS) technique is considered as it is a distortionless one and reduces peak power significantly. The improvement of PAPR with order of digital modulation schemes is investigated and minimum PAPR phase factors are identified. These phase factors information is transmitted as side information along with desired data. Data is encoded using Low Density Parity Check (LDPC) code as the performance of this code is nearest to the shannon's channel capacity and the results are simulated using MATLAB.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129598036","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}
Radha Chintapalli, Amit Kumar, Laxminarayana Parayitam
{"title":"Multiple sequence alignment a quick tour","authors":"Radha Chintapalli, Amit Kumar, Laxminarayana Parayitam","doi":"10.1109/ICACT.2013.6710499","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710499","url":null,"abstract":"Sequence alignment has a lot of significance in the field of bioinformatics. Since multiple sequence alignment (MSA) carries more information than pairwise alignment of the sequences, it has more number of applications. In the past few decades many algorithms and tools have been developed for the computation of multiple sequence alignment. However, accuracy of MSA still remains an open problem for further research. As more and more experimental data is being generated through sequencing technologies of second generation, there is an urgent need to develop tools that make use of integrative methods to derive biologically meaningful information from these immense data and use it to improve the accuracy of MSA. MSA tools that can scale upto the full length genome will also find wide applications in the near future.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133628321","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}
{"title":"Reactive power optimization using repeated genetic algorithm and data prediction","authors":"H. Jayatheertha, J. Yadagiri","doi":"10.1109/ICACT.2013.6710533","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710533","url":null,"abstract":"This paper gives 3000 solutions for reactive power optimization using repeated genetic algorithm. The objective function is minimization of voltage deviations at load buses and the control actions are changes in generator excitations, capacitor switching and tap changing transformers. IEEE30 bus system is the test data and simulated on MATLAB. New data prediction algorithm is given.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131676327","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}
{"title":"A novel fault-tolerant task scheduling algorithm for computational grids","authors":"K. Naik, N. Satyanarayana","doi":"10.1109/ICACT.2013.6710529","DOIUrl":"https://doi.org/10.1109/ICACT.2013.6710529","url":null,"abstract":"A computational grid is a hardware and software infrastructure that provides consistent, dependable, pervasive and expensive access to high-end computational capabilities in a multi-institutional virtual organization. Computational grids provide computing power needed for execution of tasks. Scheduling the task in computing grid is an important problem. To select and assign the best resources for task, we need a good scheduling algorithm in grids. As grids typically consist of strongly varying and geographically distributed resources, choosing a fault-tolerant computational resource is an important issue. The main scheduling strategy of most fault-tolerant scheduling algorithms depends on the response time and fault indicator when selecting a resource to execute a task. In this paper, a scheduling algorithm is proposed to select the resource, which depends on a new factor called Scheduling Success indicator (SSI). This factor consists of the response time, success rate and the predicted Experience of grid resources. Whenever a grid scheduler has tasks to schedule on grid resources, it uses the Scheduling Success indicator to generate the scheduling decisions. The main scheduling strategy of the Fault-tolerant algorithm is to select resources that have lowest tendency to fail and having more experience in task execution. Extensive experiment simulations are conducted to quantify the performance of the proposed algorithm on GridSim. GridSim is a Java based discrete-event Grid simulation toolkit. Experiments have shown that the proposed algorithm can considerably improve grid performance in terms of throughput, failure tendency and worth.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133152666","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}