{"title":"SVM Models in the Diagnosis of Balance Impairments","authors":"R. Begg, D. Lai, S. Taylor, M. Palaniswami","doi":"10.1109/ICISIP.2005.1619444","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1619444","url":null,"abstract":"Trip-related falls is a major problem in the elderly population and research in the area has received much attention recently. The focus has been on devising ways of identifying individuals at risk of sustaining such falls. The main aim of this work is to explore the effectiveness of models based on support vector machines (SVMs) for the automated recognition of gait patterns that exhibit falling behaviour. Minimum foot clearance (MFC) during continuous walking on a treadmill was recorded on 10 healthy elderly and 10 elderly with balance problems and with a history of tripping fails. MFC histogram characteristic features were used as inputs to the SVM model to develop relationships between MFC distribution characteristics and healthy/balance-impaired category. The leave-one-out technique was first utilized for training the SVM model in order to discover the appropriate choice of kernel. Tests were conducted with various kernels (linear, Gaussian and polynomial) and with a change in the regularization parameter, C, in an effort to identify the optimum model for this gait data. Then using a two-fold cross-validation technique, the receiver operating characteristics (ROC) plots of sensitivity and specificity were further used to evaluate the diagnostic performance of the model. The maximum accuracy was found to be 95% using a Gaussian kernel and the maximum ROC area = 0.88, when the SVM models were used to diagnose gait patterns of healthy and balance-impaired individuals. These results suggest considerable potential for SVM-based gait classifier models in the detection of gait changes in older adults due to balance impairments and falling behavior. These preliminary results are also encouraging and could be useful not only in the diagnostic applications but also for evaluating improvements or otherwise in gait function in the clinical/rehabilitation contexts","PeriodicalId":261916,"journal":{"name":"2005 3rd International Conference on Intelligent Sensing and Information Processing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114227482","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}
E. Gopi, P. Vijayakumar, S. Pandiyan, P. Kannan, R. Perumal
{"title":"A Novel approach to transformed biometrics - using ANN","authors":"E. Gopi, P. Vijayakumar, S. Pandiyan, P. Kannan, R. Perumal","doi":"10.1109/ICISIP.2005.1619429","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1619429","url":null,"abstract":"Biometrics is the technique that utilizes the distinct genetic features collected from face, thumb, retina, eye etc. as an of authentication code. The number of valid biometrics is finite for a human. Any person who enrolls in multiple organizations, would have to use his/her different biometrics as mentioned above, so that there is fool proof authenticity, without any possibility of tampering of the biometric data of one organization by the other. But an innovative idea would be to use a technique that utilizes the same biometric in different organizations. The technique must be such that it is difficult to invert (i.e.) the original biometric must not be retrievable by any inverse transformations. This paper proposes a novel approach to transform a biometric feature using artificial neural network in 'spatial domain'. By this method, different distorted biometric images by using different transformations can be created from the originally collected biometric and hence the same biometric data can be used by different organizations. The results of the proposed approach are very promising and have been validated by the 'image transformation' principles.","PeriodicalId":261916,"journal":{"name":"2005 3rd International Conference on Intelligent Sensing and Information Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127822324","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 Efficient Coding Method for Teleconferencing and Medical Image Sequences","authors":"V. Arya, A. Mittal, R. C. Joshi","doi":"10.1109/ICISIP.2005.1619405","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1619405","url":null,"abstract":"In this paper, an efficient video coding, based on three-dimensional vector quantization system has been proposed. There are a few contributions of this paper, the proposed technique uses a pyramid code book based model instead of conventional single level code book. According to this model, if a specific motion cannot be matched accurately in higher level code book according to coarse partitioning of the frame, a more refined code book description is to be used. This technique also uses an adaptive vector quantization algorithm to train the code book for optimal performance with varying time. The performance of the proposed technique is further improved by using a potential based codebook post processing technique which enables the vector quantizer to possess higher correlation preservation property. The proposed post-processing technique leads to a much higher inter index correlation. The algorithm not only accelerates the vector quantization processing, but also results in better rate-distortion performance. The above discussed approach can be used both for teleconferencing videos and to compress images obtained from confocal laser scanning microscopy. The experimental results show that the proposed method gives a higher subjective and objective quality of the reconstructed frames at a better compression ratio. When applied to edge detection filter on reconstructed frames it produces more acceptable results than a standard codec. It was observed that the proposed method outperforms the teleconferencing compression standard H.261 and LBG based vector quantization compression techniques","PeriodicalId":261916,"journal":{"name":"2005 3rd International Conference on Intelligent Sensing and Information Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127864070","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":"Nonlinear Pull-In Study of Electrostatically Actuated MEMS Structures","authors":"R. Kalyanaraman, M. Packirisamy, R. Bhat","doi":"10.1109/ICISIP.2005.1619435","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1619435","url":null,"abstract":"The pull-in voltage of an electrostatically actuated micro electro mechanical system (MEMS) is determined using the phase portrait analysis of the system. The velocity equation for a simple mass-spring model is derived and the phase portraits are presented. A continuous cantilever system is modelled as a lumped mass-spring system and the method of estimation of its equivalent stiffness, equivalent mass and equivalent areas are explained. The equilibrium positions are obtained from the force balance plot for different voltages and their corresponding conservative energy values are determined. The phase portraits are given for different voltages with their respective energy values from which the pull-in voltage is obtained for this system. This pull-in voltage value is in very close agreement with the previously published results for the same geometric and material parameters","PeriodicalId":261916,"journal":{"name":"2005 3rd International Conference on Intelligent Sensing and Information Processing","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133663914","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":"Identifying Temporal Gene Networks Using Signal Processing Metrics on Time-Series Gene Expression Data","authors":"A. Agrawal, A. Mittal","doi":"10.1109/ICISIP.2005.1619417","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1619417","url":null,"abstract":"A gene network refers to the knowledge of the activators and inhibitors of all genes. The genes themselves are believed to function as regulators of other genes. Most work done so far either ignores time delay in gene regulation or assumes that it is constant. We here propose the use of signal processing metrics like correlation techniques to find the gene interactions. Also, a post-processing stage is developed to remove false interactions among genes due to common parents, and dynamic correlation thresholds are used for selecting suitable correlation coefficients for constructing the gene network. The proposed correlation based network learning algorithm (CBNL Algorithm) considers the multi time delay relationships among the genes, and therefore estimates the temporal gene network. The implementation of our method is done in MATLAB and experimental results on Saccharomyces cerevisiae expression data and comparison with other methods indicate the effectiveness of the method","PeriodicalId":261916,"journal":{"name":"2005 3rd International Conference on Intelligent Sensing and Information Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121545452","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":"Agent-Oriented Modelling of Real-Time Systems for Critical Events","authors":"R. Khosla, J. Kumar.","doi":"10.1109/ICISIP.2005.1619408","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1619408","url":null,"abstract":"In this paper we outline a task-centered agent-oriented approach to modelling (or software engineering) of intelligent real-time systems for critical events like environmental disasters (e.g., bush fires, earthquakes), alarm processing in critical and emergency situations in power systems, and in war situations involving detection and destruction of enemy planes by fighter pilots. We model the user (e.g., operator or fighter pilot) at two distinct levels. These include the problem solving or the task level and performance optimisation level. Alarm processing is used as an application to illustrate the modelling at the task and performance optimisation levels respectively","PeriodicalId":261916,"journal":{"name":"2005 3rd International Conference on Intelligent Sensing and Information Processing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117300354","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":"EEG Artifact Reduction in VEP Using 2-Stage PCA and N4 Analysis of Alcoholics","authors":"P. Sharmilakanna, Ramaswamy Palaniappan","doi":"10.1109/ICISIP.2005.1619404","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1619404","url":null,"abstract":"In this paper, repeated applications of principal component analysis (PCA) are proposed to reduce background electroencephalogram (EEC) artifact from multi-channel and multi-trial visual evoked potential (VEP) signals. This allows single trial analysis of VEP signals. PCA has been used for noise reduction but the method of repeated applications of PCA is novel. In the study here, PCA was applied in 2 stages. In the first stage, PCA was applied to multi-channel VEP signals from one trial. The output VEP signals from the first stage were used in the second stage, where PCA was applied to multi-trial VEP signals from a single channel. Simulation study using emulated VEP signals contaminated with EEG artifact shows significant improvement in signal to noise ratio using the method. It was then applied to study the electrophysiological differences between alcoholic and non-alcoholic subjects using N4 parameter. Hypothesis testing using t-test showed that alcoholics had significantly weaker and slower N4 responses as compared to non-alcoholics","PeriodicalId":261916,"journal":{"name":"2005 3rd International Conference on Intelligent Sensing and Information Processing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121698615","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}
Eakta Jain, M. J. Healy, L. Saland, Derek Hamilton, Andrea Allan, Kevin Caldwell, T. Caudell
{"title":"Hypergraphs: Organizing complex natural neural networks","authors":"Eakta Jain, M. J. Healy, L. Saland, Derek Hamilton, Andrea Allan, Kevin Caldwell, T. Caudell","doi":"10.1109/ICISIP.2005.1619407","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1619407","url":null,"abstract":"Data from neuroscience research has shown that the brain can be studied as a neural network. In view of the brain's seemingly infinite complexity, we organize the entire network into a series of sub-networks, each of whose functionalities combine to become the knowledge representation capability of the entire network. Thus, we look at the brain in terms of modules and sub-modules, at varying levels of `granularity'. Since a network can be mathematically represented as a graph, this hierarchical structure is captured through the notion of `hypergraphs' and `hyper-matrices'. The proposed structure has been implemented on a graph specification software tool. Finally, a metaphoric visualization for the structure was proposed","PeriodicalId":261916,"journal":{"name":"2005 3rd International Conference on Intelligent Sensing and Information Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114611035","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":"Randomized Message Forwarding with Equalized Incoming/Outgoing Traffic Rate: A Mechanism for Ensuring Anonymous Communication","authors":"R. Kannan, Lydia Ray, S. Sitharama, Iyengar","doi":"10.1109/ICISIP.2005.1619433","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1619433","url":null,"abstract":"Anonymous communication in sensor networks is an important security tool. A major sensornet security issue is to anonymize sources and sinks in sensor networks despite the inability to hide wireless transmissions. However, none of the existing anonymous communication schemes provide complete protection against attacks posed by different types of adversaries. In this paper, we propose a novel and scalable anonymous communication scheme Randomized Message Forwarding with Equalized Incoming/Outgoing Traffic Rate (RMFETR) which resists all known eavesdrop attacks. A further modification of this scheme Destination First Randomized Message Forwarding with Equalized Incoming/Outgoing Traffic Rate (DFRMFETR) improves message delivery time significantly. We present security analysis and performance analysis of these two schemes. While both RMFETR and DFRMFETR have the same security benefits against eavesdrop attacks as the randomized Buses protocol, they are more flexible and easy to implement. The expected message delivery time under RMFETR is same as that under the randomized Buses, while DFRMFETR induces a smaller delivery time.","PeriodicalId":261916,"journal":{"name":"2005 3rd International Conference on Intelligent Sensing and Information Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129316359","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 Recursive Multistage Estimator for Bearings — Only Passive Target Tracking","authors":"S. K. Rao","doi":"10.1109/ICISIP.2005.1619437","DOIUrl":"https://doi.org/10.1109/ICISIP.2005.1619437","url":null,"abstract":"Maximum Likelihood Estimator (MLE) is a suitable algorithm for passive target tracking applications. Nardone, Lindgren and Gong [1] introduced this approach using batch processing [1]. In this paper, this batch processing is converted into sequential processing to use for real time applications like passive target tracking using bearings-only measurements. Adaptively, the variance of each measurement is computed and is used along with the measurement, making the estimate a generalized one. Instead of assuming some arbitrary values, Pseudo Linear Estimator (PLE) outputs are used for the initialization of MLE. The algorithm is tested in Monte Carlo simulation and its results are compared with that of Cramer-Rao Lower Bound (CRLB) estimator. The results of one scenario are presented. From the results, it is observed that this algorithm is also an effective method for the bearing-only passive target tracking.","PeriodicalId":261916,"journal":{"name":"2005 3rd International Conference on Intelligent Sensing and Information Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128755858","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}