Pub Date : 2011-12-01DOI: 10.1109/ICOAC.2011.6165186
Madderi Sivalingam Saravanan, R. Sree
In the recent research area, the association rule mining is one of the popular technique in the domain of data mining. The association rule mining is first implemented in dyeing unit in my previous research papers. But already this association rule mining technique is used in the area of finance, healthcare, automobile and sales and distribution, etc. In this article, the dyeing process, generate the simple process model for the dyeing unit. The simplified process model is not in the form of diagram, instead rules. These rules are developing using association rule mining algorithms. The process mining algorithms, Heuristic Miner (HM) and Disjunctive Workflow Schema (DWS) are used to generate the association rule mining rules. Hence, the proposed LinkRuleMiner (LRM) association rule mining algorithm is implemented in the dyeing unit using HM or DWS algorithm. The dyeing process is dynamic and unstructured in nature. The dyeing process is recorded and stored in the form of event logs. These event logs are converted in to the log file. These log files are given as input to the LRM algorithm. The LRM algorithm produces the simple association rules. These rules can be easily understood by the dyeing expert called dyer to process the colouring process of the dyeing unit. These generated association rules can also be grouped for the same or different shades using the clustering approach. Therefore, this article simplify the dyeing process using LRM algorithm to give better knowledge to the dyer and to reduce the dyeing processing problems of the dyeing unit.
{"title":"A simple process model generation using a new association rule mining algorithm and clustering approach","authors":"Madderi Sivalingam Saravanan, R. Sree","doi":"10.1109/ICOAC.2011.6165186","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165186","url":null,"abstract":"In the recent research area, the association rule mining is one of the popular technique in the domain of data mining. The association rule mining is first implemented in dyeing unit in my previous research papers. But already this association rule mining technique is used in the area of finance, healthcare, automobile and sales and distribution, etc. In this article, the dyeing process, generate the simple process model for the dyeing unit. The simplified process model is not in the form of diagram, instead rules. These rules are developing using association rule mining algorithms. The process mining algorithms, Heuristic Miner (HM) and Disjunctive Workflow Schema (DWS) are used to generate the association rule mining rules. Hence, the proposed LinkRuleMiner (LRM) association rule mining algorithm is implemented in the dyeing unit using HM or DWS algorithm. The dyeing process is dynamic and unstructured in nature. The dyeing process is recorded and stored in the form of event logs. These event logs are converted in to the log file. These log files are given as input to the LRM algorithm. The LRM algorithm produces the simple association rules. These rules can be easily understood by the dyeing expert called dyer to process the colouring process of the dyeing unit. These generated association rules can also be grouped for the same or different shades using the clustering approach. Therefore, this article simplify the dyeing process using LRM algorithm to give better knowledge to the dyer and to reduce the dyeing processing problems of the dyeing unit.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116982377","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165196
D. A. A. G. Singh, E. Leavline
Mobile Ad hoc networks are a class of dynamic networks without any centralized administration. A major problem in Mobile Ad hoc networks (MANETs) is the anonymity threat arises among the nodes usually when they mobile. Many researches are concentred on the part of avoiding anonymity threat in MANET with different approaches using simulators. This paper presents an implementation of (ATARPA) Anonymity Threat Avoidance Routing Protocol Architecture in order to agonist the anonymity threat such as traceability, intrusion, observability and linkability. The ATARPA has been designed with the principle of reactive routing protocol. It provides strong security with anonymity protection and scalability.
{"title":"IATARPA: Implementation of anonymity threat avoidance routing protocol architecture for MANET","authors":"D. A. A. G. Singh, E. Leavline","doi":"10.1109/ICOAC.2011.6165196","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165196","url":null,"abstract":"Mobile Ad hoc networks are a class of dynamic networks without any centralized administration. A major problem in Mobile Ad hoc networks (MANETs) is the anonymity threat arises among the nodes usually when they mobile. Many researches are concentred on the part of avoiding anonymity threat in MANET with different approaches using simulators. This paper presents an implementation of (ATARPA) Anonymity Threat Avoidance Routing Protocol Architecture in order to agonist the anonymity threat such as traceability, intrusion, observability and linkability. The ATARPA has been designed with the principle of reactive routing protocol. It provides strong security with anonymity protection and scalability.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125112202","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165200
A. L. A. Adline, G. Mahalakshmi
Content evaluation is important as it has a direct impact on the learners' performance. It helps us know about the content being delivered, based on which we can refine the content for enhanced learning. E-learning is more embryonic as it allows learner to learn on his own ease. In e-learning environment, the availability of varieties of documents makes chaos for readers to which they have to depend upon. However, finding the right information is a big challenge and enough support is essential to making the information-seeking experience satisfying. This necessitates document evaluation to bring reliability and trust towards documents. Though various systems exist for content evaluation, they still lack in advanced methodologies for assessing content quality. In this paper, we have arrived at exploring various parameters for content evaluation which incorporate both content quality as well as content aesthetics.
{"title":"A novel framework for E-learning content evaluation","authors":"A. L. A. Adline, G. Mahalakshmi","doi":"10.1109/ICOAC.2011.6165200","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165200","url":null,"abstract":"Content evaluation is important as it has a direct impact on the learners' performance. It helps us know about the content being delivered, based on which we can refine the content for enhanced learning. E-learning is more embryonic as it allows learner to learn on his own ease. In e-learning environment, the availability of varieties of documents makes chaos for readers to which they have to depend upon. However, finding the right information is a big challenge and enough support is essential to making the information-seeking experience satisfying. This necessitates document evaluation to bring reliability and trust towards documents. Though various systems exist for content evaluation, they still lack in advanced methodologies for assessing content quality. In this paper, we have arrived at exploring various parameters for content evaluation which incorporate both content quality as well as content aesthetics.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126189035","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165195
P. Sivaprakasam, R. Gunavathi
In the last two decades, there is magnetism in the use of internet and Communication Technology in the field of Mobile Ad Hoc Network. It motivates the researchers to turn over in those areas. There were some algorithms proposed for electing the efficient Clusterheads. Clusterheads are having more responsibilities like to minimize the re-affiliation, topology changes, and the stability of the on demand networks. We proposed a new efficient clusterhead selection algorithm based on the maximum weight in which it takes consideration of five different weight parameters. In this paper we analyses the clusterhead changes, energy consumption, life time of the network and end to end delay of the nodes. The experimental result also shows that proposed algorithm is better than the existing Weighted Clustering Algorithms.
{"title":"An efficient clusterhead election algorithm based on maximum weight for MANET","authors":"P. Sivaprakasam, R. Gunavathi","doi":"10.1109/ICOAC.2011.6165195","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165195","url":null,"abstract":"In the last two decades, there is magnetism in the use of internet and Communication Technology in the field of Mobile Ad Hoc Network. It motivates the researchers to turn over in those areas. There were some algorithms proposed for electing the efficient Clusterheads. Clusterheads are having more responsibilities like to minimize the re-affiliation, topology changes, and the stability of the on demand networks. We proposed a new efficient clusterhead selection algorithm based on the maximum weight in which it takes consideration of five different weight parameters. In this paper we analyses the clusterhead changes, energy consumption, life time of the network and end to end delay of the nodes. The experimental result also shows that proposed algorithm is better than the existing Weighted Clustering Algorithms.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115042271","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165164
T. Chandrasekhar, K. Thangavel, E. Elayaraja
Microarrays are made it possible to simultaneously monitor the expression profiles of thousands of genes under various experimental conditions. Identification of co-expressed genes and coherent patterns is the central goal in microarray or gene expression data analysis and is an important task in bioinformatics research. In this work the unsupervised Gene selection methods and CCIA with K-Means algorithms have been applied for clustering of Gene Expression Data. This proposed clustering algorithm overcomes the drawbacks in terms of specifying the optimal number of clusters and initialization of good cluster centroids. Gene Expression Data show that could identify compact clusters with performs well in terms of the Silhouette Coefficients cluster measure.
{"title":"Gene expression data clustering using unsupervised methods","authors":"T. Chandrasekhar, K. Thangavel, E. Elayaraja","doi":"10.1109/ICOAC.2011.6165164","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165164","url":null,"abstract":"Microarrays are made it possible to simultaneously monitor the expression profiles of thousands of genes under various experimental conditions. Identification of co-expressed genes and coherent patterns is the central goal in microarray or gene expression data analysis and is an important task in bioinformatics research. In this work the unsupervised Gene selection methods and CCIA with K-Means algorithms have been applied for clustering of Gene Expression Data. This proposed clustering algorithm overcomes the drawbacks in terms of specifying the optimal number of clusters and initialization of good cluster centroids. Gene Expression Data show that could identify compact clusters with performs well in terms of the Silhouette Coefficients cluster measure.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131491030","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165205
M. Malleswaran, V. Vaidehi, M. Mohankumar
In the field of navigation, two system depends for the navigation is Inertial Navigation System (INS) and Global Positioning System (GPS). INS is an autonomous, standalone system which is available in the aircraft which gives the latitude, longitude and altitude position of the aircraft by the accelerometer and gyroscope measurements. GPS is used to provide accurate position information for the navigation. Both the system having its own drawbacks like bias error and drift error of accelerometer and gyroscope and satellite clock errors and multipath reflection errors of GPS. In order to overcome its drawback, both the systems are integrated to provide reliable navigation solution. Typically Kalman Filter (KF) is used to integrate the system. In recent years, AI (Artificial Intelligence) based systems are used for the same. In this paper, the hybrid approach of using Input delayed Dynamic Neural Network (IDNN) and KF is introduced for GPS/INS integration.
{"title":"A hybrid approach for GPS/INS integration using Kalman filter and IDNN","authors":"M. Malleswaran, V. Vaidehi, M. Mohankumar","doi":"10.1109/ICOAC.2011.6165205","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165205","url":null,"abstract":"In the field of navigation, two system depends for the navigation is Inertial Navigation System (INS) and Global Positioning System (GPS). INS is an autonomous, standalone system which is available in the aircraft which gives the latitude, longitude and altitude position of the aircraft by the accelerometer and gyroscope measurements. GPS is used to provide accurate position information for the navigation. Both the system having its own drawbacks like bias error and drift error of accelerometer and gyroscope and satellite clock errors and multipath reflection errors of GPS. In order to overcome its drawback, both the systems are integrated to provide reliable navigation solution. Typically Kalman Filter (KF) is used to integrate the system. In recent years, AI (Artificial Intelligence) based systems are used for the same. In this paper, the hybrid approach of using Input delayed Dynamic Neural Network (IDNN) and KF is introduced for GPS/INS integration.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116861435","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165193
Dept Of, S. R. Bhagya, Shree Shree
This paper deals with the design of a Modbus Enabled Zigbee Wireless Sensor Network “WSN” for better Interactive Industrial Automation. The Modbus protocol is embedded into Zigbee stack, providing a friendly interface to observe the information in the wireless network efficiently and to provide the On Demand Response to the requests. It consists of a Coordinator and the sensor nodes. The coordinator is a centralized unit which is attached to the monitoring PC. It collects the information from all other nodes on demand and provides to the end user through TCP/IP network. The sensor nodes are made intelligent for controlling the plant. These nodes are attached with the Zigbee for remote controlling in case of changing the preset values and handling any issues. The coordinator is implemented using the ARM9 controller and the Sensor Nodes are implemented using the ARM7 microcontroller. RTLinux is used at the coordinator for real time operations and the Sensor nodes are programmed using the Embedded C. The experimental results obtained demonstrate the usefulness of the proposed system in terms of the low power consumption, low cost, targeted towards automation and remote control applications.
{"title":"Zigbee Wireless Sensor Network for better Interactive Industrial Automation","authors":"Dept Of, S. R. Bhagya, Shree Shree","doi":"10.1109/ICOAC.2011.6165193","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165193","url":null,"abstract":"This paper deals with the design of a Modbus Enabled Zigbee Wireless Sensor Network “WSN” for better Interactive Industrial Automation. The Modbus protocol is embedded into Zigbee stack, providing a friendly interface to observe the information in the wireless network efficiently and to provide the On Demand Response to the requests. It consists of a Coordinator and the sensor nodes. The coordinator is a centralized unit which is attached to the monitoring PC. It collects the information from all other nodes on demand and provides to the end user through TCP/IP network. The sensor nodes are made intelligent for controlling the plant. These nodes are attached with the Zigbee for remote controlling in case of changing the preset values and handling any issues. The coordinator is implemented using the ARM9 controller and the Sensor Nodes are implemented using the ARM7 microcontroller. RTLinux is used at the coordinator for real time operations and the Sensor nodes are programmed using the Embedded C. The experimental results obtained demonstrate the usefulness of the proposed system in terms of the low power consumption, low cost, targeted towards automation and remote control applications.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128356342","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165166
O. Pandithurai, M. Poongodi, S. P. Kumar, C. Krishnan
Hospital information system various functionalities are integrated into unified solutions this unified solutions is delivered as a service, so the unified solution should be apt for multiple hospitals with their work environment. Single tenant cloud infrastructure to host services, this systems house the data for single hospital only. In this paper we are going to proposed there are different multi-tenant, not only technologically, but also in functionality, security, and in their appropriateness based on geography, hospital information system with www through cloud. The integration controller and Hospital information system will communicate through SOA. The clouds provide a functionality to deploy the service as well as store the data. The cloud computing objective is to make data always available to users and it offers feature extendibility of new application server as well as new database.
{"title":"A method to support multi-tenant as a service","authors":"O. Pandithurai, M. Poongodi, S. P. Kumar, C. Krishnan","doi":"10.1109/ICOAC.2011.6165166","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165166","url":null,"abstract":"Hospital information system various functionalities are integrated into unified solutions this unified solutions is delivered as a service, so the unified solution should be apt for multiple hospitals with their work environment. Single tenant cloud infrastructure to host services, this systems house the data for single hospital only. In this paper we are going to proposed there are different multi-tenant, not only technologically, but also in functionality, security, and in their appropriateness based on geography, hospital information system with www through cloud. The integration controller and Hospital information system will communicate through SOA. The clouds provide a functionality to deploy the service as well as store the data. The cloud computing objective is to make data always available to users and it offers feature extendibility of new application server as well as new database.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128669793","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165171
D. Mala, M. Praba
Nowadays, software complexity increases as the number of components in a component based system (CBS) increases. As the complexity level increases, the testing and verification of components also increases. This in turn rose up the testing time and cost which thus made industries to skip off some of the components due to the hard timeline and resource limitations especially during maintenance. This leads to hazardous effects if some of these missed components are critical in term of their core functionality and dependability with other components. Hence, a regression testing which is usually performed during maintenance phase should be developed meticulously to identify and test these critical components rigorously before releasing the software on to the customer side. This paper proposed a novel regression testing method based on the criticality measure calculated by means of dependability metrics and internal complexity metrics. Also, this paper compares the performance of the proposed approach with existing approaches and concluded that the proposed framework outperforms them.
{"title":"Critical components identification and verification for effective software test prioritization","authors":"D. Mala, M. Praba","doi":"10.1109/ICOAC.2011.6165171","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165171","url":null,"abstract":"Nowadays, software complexity increases as the number of components in a component based system (CBS) increases. As the complexity level increases, the testing and verification of components also increases. This in turn rose up the testing time and cost which thus made industries to skip off some of the components due to the hard timeline and resource limitations especially during maintenance. This leads to hazardous effects if some of these missed components are critical in term of their core functionality and dependability with other components. Hence, a regression testing which is usually performed during maintenance phase should be developed meticulously to identify and test these critical components rigorously before releasing the software on to the customer side. This paper proposed a novel regression testing method based on the criticality measure calculated by means of dependability metrics and internal complexity metrics. Also, this paper compares the performance of the proposed approach with existing approaches and concluded that the proposed framework outperforms them.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130255544","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 : 2011-12-01DOI: 10.1109/ICOAC.2011.6165165
S. A. Padmanabhan, S. Chandramathi
Video compression is a combination of spatial image compression and temporal motion compensation, which is mainly done for reducing the volume of data required to represent digital video images. Numerous video compression algorithms were proposed to reduce the data quantity and produced acceptable quality as possible as they can. In this research work, initially wavelet decomposition is applied to the I-frame and the resulting coefficients are quantized by means of a Listless SPECK (LSK) algorithm. Here, different wavelets namely, Daubechies, Coiflets, Biorthogonal, and Reverse Biorthogonal are utilized in the compression algorithm LSK. When different wavelets are used, the compression ratio is effectively changed according to the type of the wavelet. A new block motion estimation algorithm is employed to measure the motion between the blocks in the video. The performance analysis is done for evaluating the performance of proposed system with different wavelets. Moreover, the performance measures such as Compression Ratio (CR) and Peak Signal to Noise Ratio (PSNR) are calculated.
{"title":"A proficient video encoding system through a novel motion estimation algorithm","authors":"S. A. Padmanabhan, S. Chandramathi","doi":"10.1109/ICOAC.2011.6165165","DOIUrl":"https://doi.org/10.1109/ICOAC.2011.6165165","url":null,"abstract":"Video compression is a combination of spatial image compression and temporal motion compensation, which is mainly done for reducing the volume of data required to represent digital video images. Numerous video compression algorithms were proposed to reduce the data quantity and produced acceptable quality as possible as they can. In this research work, initially wavelet decomposition is applied to the I-frame and the resulting coefficients are quantized by means of a Listless SPECK (LSK) algorithm. Here, different wavelets namely, Daubechies, Coiflets, Biorthogonal, and Reverse Biorthogonal are utilized in the compression algorithm LSK. When different wavelets are used, the compression ratio is effectively changed according to the type of the wavelet. A new block motion estimation algorithm is employed to measure the motion between the blocks in the video. The performance analysis is done for evaluating the performance of proposed system with different wavelets. Moreover, the performance measures such as Compression Ratio (CR) and Peak Signal to Noise Ratio (PSNR) are calculated.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127868673","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
扫码关注我们
求助内容：
应助结果提醒方式：