{"title":"Wavelet-Threshold based ECG Compression with Smooth Retrieved Quality for Telecardiology","authors":"M. Manikandan, S. Dandapat","doi":"10.1109/ICISIP.2006.4286079","DOIUrl":"https://doi.org/10.1109/ICISIP.2006.4286079","url":null,"abstract":"A new novel wavelet-threshold based ECG signal compression method is proposed using linear phase biorthogonal 9/7 discrete wavelet transform, uniform scalar zero zone quantizer (USZZQ) and Huffman coding of the difference between two consecutive index of the significant coefficients. The compression performance of the proposed method is better compared to EZW, SPIHT, ASEC and other wavelet-threshold based coders. The proposed method is tested for the MIT-BIH arrhythmia record 119 and a compression ratio of 21.8:1 is achieved with PRD value of 3.7166% which is much lower as compared to the reported PRD value of 5.0% and 5.5% of SPIHT and ASEC, respectively. The proposed method requires less computation time since it does not need QRS detection, period normalization, amplitude normalization and mean removal. Hence, the proposed method can be used for the transmission of ECG signal over the band limited telephone networks.","PeriodicalId":187104,"journal":{"name":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121351067","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}
S. Geetha, S.S. Sivatha Sindhu, S. Gobi, A. Kannan
{"title":"Evolving GA Classifiler for Audio Steganalysis based on Audio Quality Metrics","authors":"S. Geetha, S.S. Sivatha Sindhu, S. Gobi, A. Kannan","doi":"10.1109/ICISIP.2006.4286072","DOIUrl":"https://doi.org/10.1109/ICISIP.2006.4286072","url":null,"abstract":"Differentiating anomalous audio document (Stego audio) from pure audio document (cover audio) is difficult and tedious. Steganalytic techniques strive to detect whether an audio contains a hidden message or not. This paper presents a genetic algorithm (GA) based approach to audio steganalysis, and the software implementation of the approach. The basic idea is that, the various audio quality metrics calculated on cover audio signals and on stego-audio signals vis-a-vis their denoised versions, are statistically different. GA is employed to derive a set of classification rules from audio data using these audio quality metrics, and fitness function is used to judge the quality of each rule. The generated rules are then used to detect or classify the audio documents in a real-time environment. Unlike most existing GA-based approaches, because of the simple representation of rules and the effective fitness function, the proposed method is easier to implement while providing the flexibility to generally detect any new steganography technique. The implementation of the GA based audio steganalyzer relies on the choice of these audio quality metrics and the construction of a two-class classifier, which will discriminate between the adulterated and the untouched audio samples. Experimental results show that the proposed technique provides promising detection rates.","PeriodicalId":187104,"journal":{"name":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129605157","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":"An Adaptive Fractional Pixel Search Algorithm","authors":"Liquan Shen, Zhaoyang Zhang, Zhi Liu, Wenjun Zhang","doi":"10.1109/ICISIP.2006.4286084","DOIUrl":"https://doi.org/10.1109/ICISIP.2006.4286084","url":null,"abstract":"In this paper, we propose an adaptive fractional pixel search algorithm for reduction computation its load. Based on that SAD (sum of absolute difference) error surface is unimodal within the range of plusmn1 pixel, a novel fractional pixel search bypass strategy is first proposed; Then, a strategy of fractional pixel search early termination based on all-zero block detection is proposed. Finally, an adaptive fractional pixel search algorithm adopting above strategies and improved CBFPS (center biased fractional pixel search) algorithm is proposed. Compared with the fractional pixel full search algorithm and JVT-F017 that adopts CBFPS, simulation results show that the proposed algorithm can reduce 76.60% and 68.22% fractional pixel search points respectively while it still maintains similar coding efficiency.","PeriodicalId":187104,"journal":{"name":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127565518","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":"Sensor-Based Fast Thermal Evaluation Model For Energy Efficient High-Performance Datacenters","authors":"Qinghui Tang, T. Mukherjee, S. Gupta, Phil Cayton","doi":"10.1109/ICISIP.2006.4286097","DOIUrl":"https://doi.org/10.1109/ICISIP.2006.4286097","url":null,"abstract":"In this work, we propose an abstract heat flow model which uses temperature information from onboard and ambient sensors, characterizes hot air recirculation based on these information, and accelerates the thermal evaluation process for high performance datacenters. This is critical to minimize energy costs, optimize computing resources, and maximize computation capability of the datacenters. Given a workload and thermal profile, obtained from various distributed sensors, we predict the resulting temperature distribution in a fast and accurate manner taking into account the recirculation characterization of a datacenter topology. Simulation results confirm our hypothesis that heat recirculation can be characterized as cross interference in our abstract heat flow model. Moreover, fast thermal evaluation based on cross interference can be used in online thermal management to predict temperature distribution in real-time.","PeriodicalId":187104,"journal":{"name":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131761601","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":"Updating Student Model using Bayesian Network and Item Response Theory","authors":"Yaser Nouh, P. Karthikeyani, Dr. R. Nadarajan","doi":"10.1109/ICISIP.2006.4286086","DOIUrl":"https://doi.org/10.1109/ICISIP.2006.4286086","url":null,"abstract":"Nowadays different approaches are coming forth to tutor students using computers. In this paper, a computer based intelligent tutoring system (ITS) is presented. It projects out a new approach dealing with diagnosis in student modeling which emphasizes on Bayesian Networks (for decision making) and Item Response Theory (for adaptive question selection). The advantage of such an approach through Bayesian Networks (Formal framework of Uncertainty) is that this structural model allows substantial simplification when specifying parameters (Conditional Probabilities) which measures student ability at different levels of granularity. In addition, the probabilistic student model is proved to be quicker, more accurate and more efficient. Since most of the tutoring systems are static HTML web pages of class textbooks, our intelligent system can help a student navigate through online course materials and recommended learning goals.","PeriodicalId":187104,"journal":{"name":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133420491","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":"Document Page Layout Analysis Using Harris Corner Points","authors":"F. Nourbakhsh, P. Pati, A. Ramakrishnan","doi":"10.1109/ICISIP.2006.4286083","DOIUrl":"https://doi.org/10.1109/ICISIP.2006.4286083","url":null,"abstract":"Extraction of text areas from the document images with complex content and layout is one of the challenging tasks. Few texture based techniques have already been proposed for extraction of such text blocks. Most of such techniques are greedy for computation time and hence are far from being realizable for real time implementation. In this work, we propose a modification to two of the existing texture based techniques to reduce the computation. This is accomplished with Harris corner detectors. The efficiency of these two textures based algorithms, one based on Gabor filters and other on log-polar wavelet signature, are compared. A combination of Gabor feature based texture classification performed on a smaller set of Harris corner detected points is observed to deliver the accuracy and efficiency.","PeriodicalId":187104,"journal":{"name":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127149172","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 Distributed Approach to Hyper-Spectral Image Analysis Using Support Vectors","authors":"S. Sindhumol, M. Wilscy","doi":"10.1109/ICISIP.2006.4286085","DOIUrl":"https://doi.org/10.1109/ICISIP.2006.4286085","url":null,"abstract":"This paper presents a detailed analysis of a new distributed algorithm designed for hyper-spectral image analysis. Hyper-spectral imaging is a valuable technique for detection and classification of materials and objects on the Earth's surface. The conventional approach to hyper-spectral image analysis is based on dimensionality reduction using Principal Component Analysis (PCA). But the results contain more details of the frequently occurred objects compared to the minor objects in the scene. To resolve this, a new algorithm for hyper-spectral image analysis based on Support Vector Clustering (SVC) and Spectral Angle Mapping (SAM) is proposed in this work. The method is found to generate good results, but the calculation of Support Vectors, Spectral Angles and Principal Components are very time-consuming processes and a bulk of data is to be processed to analyse the hyper-spectral images. So the algorithm is designed in a distributed manner and a distributed environment based on Java/RMI is developed to implement it. The algorithm is tested with two Hyper-spectral image datasets of 210 bands each, which are taken with HYper-spectral Digital Imagery Collection Experiment (HYDICE) air-borne sensors. A performance analysis of the distributed environment is also carried out.","PeriodicalId":187104,"journal":{"name":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129971681","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":"Security for Pervasive Health Monitoring Sensor Applications","authors":"K. Venkatasubramanian, S.K.S. Gupta","doi":"10.1109/ICISIP.2006.4286096","DOIUrl":"https://doi.org/10.1109/ICISIP.2006.4286096","url":null,"abstract":"Maintaining security of wearable networked health monitoring sensors (body sensor networks (BSN)) is very important for the acceptance and long term viability of the technology. Sensors in BSNs organize themselves into different topologies for efficiency purpose. Securing these topology formation process is of prime importance. In this paper we present two schemes which rely on the novel technique of using physiological values from the wearer's body for securing a cluster topology formation. Traditional schemes for cluster (one of the most commonly used topology) formation were not designed with security in mind and are susceptible to security flaws. The schemes proposed here not only solve the secure cluster formation problem but also do so efficiently by eliminating all key distribution overheads. We analyzed the security of the protocols and tested their accuracy on a prototype implementation developed using Mica2 motes.","PeriodicalId":187104,"journal":{"name":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131174128","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 natural number based linear time filtering approach to finding all occurrences of a DNA pattern","authors":"V. Le","doi":"10.1109/ICISIP.2006.4286078","DOIUrl":"https://doi.org/10.1109/ICISIP.2006.4286078","url":null,"abstract":"String matching and searching techniques have been extensively studied in different research works. They currently play an essential part in the field of computational biology. Most of those techniques, from classics to their improved versions could successfully accomplish the task in linear time. In this paper, I propose a new searching approach based on the delivery of distinct natural numbers over a transition matrix of four nucleotides to find all occurrences of a DNA pattern in a given string. My algorithm has only Theta(n - 1) time complexity for the worst case with n to be the length of a given string s for a DNA pattern p of length m to be searched on.","PeriodicalId":187104,"journal":{"name":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125410359","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 Minimal Protocol for Authenticated Key Distribution in Wireless Sensor Networks","authors":"K. Singh, V. Muthukkumarasamy","doi":"10.1109/ICISIP.2006.4286066","DOIUrl":"https://doi.org/10.1109/ICISIP.2006.4286066","url":null,"abstract":"Wireless sensor networks provide solutions to a range of monitoring problems. However, they introduce a new set of problems mainly due to small memories, weak processors, limited energy and small packet size. Thus only a very few conventional protocols can readily be used in sensor networks. This paper proposes efficient protocols to distribute keys in wireless sensor networks. This is achieved without the necessity of using traditional encryption. The proposed solution replicates the authentication server such that a group of malicious and colluding servers cannot compromise security or disrupt service. We show that the proposed multiple server authentication protocols will only have O(n) complexity, where n is the number of authentication servers. The protocols use information from the sensor nodes and the servers to generate a new key, and do not solely rely on the sensor nodes to generate good random numbers. The scheme works well even when the base stations are untrusted. The proposed protocols guarantee that the new key is fresh and that the communicating nodes use the same key.","PeriodicalId":187104,"journal":{"name":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127893974","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}