{"title":"Integration of Co-expression Networks for Gene Clustering","authors":"M. Bhattacharyya, S. Bandyopadhyay","doi":"10.1109/ICAPR.2009.55","DOIUrl":"https://doi.org/10.1109/ICAPR.2009.55","url":null,"abstract":"Simultaneous overexpression or underexpression of multiplegenes, used in various forms as probes in the highthroughput microarray experiments, facilitates the identification of their underlying functional proximity. This kind of functional associativity (or conversely the separability) between the genes can be represented roficiently using coexpression networks. The extensive repository of diversified microarray data encounters a recent problem of multiexperimental data integration for the aforesaid purpose. This paper highlights a novel integration method of gene coexpression networks, based on the search for their consensus network, derived from diverse microarray experimental data for the purpose of clustering. The proposed methodology avoids the bias arising from missing value estimation. The method has been applied on microarray datasets arising from different category of experiments to integrate them. The consensus network, thus produced, reflects robustness based on biological validation.","PeriodicalId":443926,"journal":{"name":"2009 Seventh International Conference on Advances in Pattern Recognition","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116652504","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":"Large Lump Detection Using a Particle Filter of Hybrid State Variable","authors":"Zhijie Wang, Hong Zhang","doi":"10.1109/ICAPR.2009.52","DOIUrl":"https://doi.org/10.1109/ICAPR.2009.52","url":null,"abstract":"This paper presents a particle filter based solution to the problem of detecting large frozen lumps in an image sequence, taken of the feed to a crusher, which is used for size reduction of oilsand ore. In this application, the objects of interest, i.e., large frozen lumps, are characterized by a high level of image noise, irregular shapes, and uneven and variable surface texture. In addition, more than one large lump can be present in the scene. Our proposed solution integrates evidence of the presence of large lumps over time, by adapting an existing Bayesian framework for joint object detection and tracking. To implement the particle filter, we formulate an application-specific observation model that is required by the Bayesian tracker. Our experimental results show that the proposed solution is capable of detecting multiple large lumps reliably, and that it has the potential of preventing the oilsand crusher from being jammed and leading to improved productivity.","PeriodicalId":443926,"journal":{"name":"2009 Seventh International Conference on Advances in Pattern Recognition","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116851254","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":"Empirical Evaluation of Character Classification Schemes","authors":"N. V. Neeba, C. V. Jawahar","doi":"10.1109/ICAPR.2009.41","DOIUrl":"https://doi.org/10.1109/ICAPR.2009.41","url":null,"abstract":"In this paper, we empirically study the performance of a set of pattern classification schemes for character classification problems. We argue that with a rich feature space, this class of problems can be solved with reasonable success using a set of statistical feature extraction schemes. Experimental validation is done on a data set (of more than 500000 characters) collected and annotated from books printed primarily in Malayalam. Scope of this study include (a) applicability of a spectrum of classifiers and features (b) scalability of classifiers (c) sensitivity of features to degradation (d) generalization across fonts and (e) applicability across scripts.","PeriodicalId":443926,"journal":{"name":"2009 Seventh International Conference on Advances in Pattern Recognition","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116999621","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":"Rough Set Based Ensemble Prediction for Topic Specific Web Crawling","authors":"S. Saha, C. A. Murthy, S. Pal","doi":"10.1109/ICAPR.2009.17","DOIUrl":"https://doi.org/10.1109/ICAPR.2009.17","url":null,"abstract":"The rapid growth of the world wide web had made the problem of useful resource discovery an important one in recent years. Several techniques such as focused crawling and intelligent crawling have recently been proposed for topic specific resource discovery. All these crawlers use the hypertext features behavior in order to perform topic specific resource discovery. A focused crawler uses the relevance score of the crawled page to score the unvisited URLs extracted from it. The scored URLs are then added to the frontier. Then it picks up the best URL to crawl next.Focused crawlers rely on different types of features of the crawled pages to keep the crawling scope within the desired domain and they are obtained from URL, anchor text, link structure and text contents of the parent and ancestor pages.Different focused crawling algorithms use these different set of features to predict the relevance and quality of the unvisited Web pages. In this article a combined method based on Rough Set Theory has been proposed. It combines the available predictions using decision rules and can build much larger domain-specific collections with less noise. Our experiment in this regard has provided better Harvest rate and better Target recall for focused crawling.","PeriodicalId":443926,"journal":{"name":"2009 Seventh International Conference on Advances in Pattern Recognition","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129701449","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":"Shape Recognition Using a New Spatial Representation and a D.P. Matching Algorithm","authors":"Shiyuan Gu, S. Kundu","doi":"10.1109/ICAPR.2009.107","DOIUrl":"https://doi.org/10.1109/ICAPR.2009.107","url":null,"abstract":"We propose a new method for the recognition and retrieval of shapes whose contours are simple closed curves. First, we give a new shape representation by a sequence of 2D-vectors of angles, which is independent of rotation and scaling. Each 2D-vector captures the local shape information around a point in the contour. Next, we apply a dynamic programming method to match the points of two contours and identify the outlier (unmatched) points in each contour with respect to the other. Then, we define the similarity of a pair of contours by the number of unmatched points and the matching cost for the matched points. Finally, the recognition and retrieval are done using the nearest-neighbor method. Our experiments on MPEG-7 database show that the performance of the new algorithm is very similar to that of the best-known algorithms in the literature in spite of its significantly less computational complexity and simplicity.","PeriodicalId":443926,"journal":{"name":"2009 Seventh International Conference on Advances in Pattern Recognition","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129816044","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":"Relative Orientations of Geometric Centroids for Off-line Signature Verification","authors":"H. Prakash, D. S. Guru","doi":"10.1109/ICAPR.2009.28","DOIUrl":"https://doi.org/10.1109/ICAPR.2009.28","url":null,"abstract":"In this paper, we propose a new approach for symbolic representation of off-line signatures useful for verification. The proposed approach is based on relative orientations of geometric centroids of split portions of signatures. Centroid orientation features of off-line signatures are used to form an interval valued symbolic feature vector for representing signatures. A method of off-line signature verification based on the symbolic representation is presented. We investigate the feasibility of the proposed representation scheme for signature verification on a MCYT_signature database. Unlike other signature verification methods, the proposed method is simple and efficient. Several experiments are conducted to demonstrate the efficacy of the proposed scheme.","PeriodicalId":443926,"journal":{"name":"2009 Seventh International Conference on Advances in Pattern Recognition","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128555536","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":"Optimal Control Approach to Robust Control of Nonlinear Systems Using Neural Network Based HJB solution","authors":"D. Adhyaru, I. Kar, M. Gopal","doi":"10.1504/IJAAC.2009.025238","DOIUrl":"https://doi.org/10.1504/IJAAC.2009.025238","url":null,"abstract":"In this paper, a Hamilton-Jacobi-Bellman (HJB) equation based optimal control algorithm for robust controller design, is proposed for a nonlinear system. Utilizing the Lyapunov direct method, controller is shown to be optimal with respect to a cost functional that includes maximum bound on system uncertainty. Controller is continuous and requires the knowledge of the upper bound of system uncertainty. In the proposed algorithm, Neural Network (NN) is used to find approximate solution of HJB equation. Proposed algorithm has been applied on a nonlinear uncertain system.","PeriodicalId":443926,"journal":{"name":"2009 Seventh International Conference on Advances in Pattern Recognition","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130765216","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":"Bangla Speech Recognition System Using LPC and ANN","authors":"Anupama Paul, Dipankar Das, M. Kamal","doi":"10.1109/ICAPR.2009.80","DOIUrl":"https://doi.org/10.1109/ICAPR.2009.80","url":null,"abstract":"This paper presents the Bangla speech recognition system. Bangla speech recognition system is divided mainly into two major parts. The first part is speech signal processing and the second part is speech pattern recognition technique. The speech processing stage consists of speech starting and end point detection, windowing, filtering, calculating the Linear Predictive Coding(LPC) and Cepstral Coefficients and finally constructing the codebook by vector quantization. The second part consists of pattern recognition system using Artificial Neural Network(ANN). Speech signals are recorded using an audio wave recorder in the normal room environment. The recorded speech signal is passed through the speech starting and end-point detection algorithm to detect the presence of the speech signal and remove the silence and pauses portions of the signals. The resulting signal is then filtered for the removal of unwanted background noise from the speech signals. The filtered signal is then windowed ensuring half frame overlap. After windowing, the speech signal is then subjected to calculate the LPC coefficient and Cepstral coefficient. The feature extractor uses a standard LPC Cepstrum coder, which converts the incoming speech signal into LPC Cepstrum feature space. The Self Organizing Map(SOM) Neural Network makes each variable length LPC trajectory of an isolated word into a fixed length LPC trajectory and thereby making the fixed length feature vector, to be fed into to the recognizer. The structures of the neural network is designed with Multi Layer Perceptron approach and tested with 3, 4, 5 hidden layers using the Transfer functions of Tanh Sigmoid for the Bangla speech recognition system. Comparison among different structures of Neural Networks conducted here for a better understanding of the problem and its possible solutions.","PeriodicalId":443926,"journal":{"name":"2009 Seventh International Conference on Advances in Pattern Recognition","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133176597","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":"Sparse Intensity Histogram: Distinctive and Robust to the Space-distortion","authors":"Hyeokjune Jeon, Jaekyong Jeong, Joonwoon Bang, Chijung Hwang","doi":"10.1109/ICAPR.2009.16","DOIUrl":"https://doi.org/10.1109/ICAPR.2009.16","url":null,"abstract":"In this article, we propose an image descriptor which efficiently calculates the distance between images, saves to the disk compactly, and seeks a similar image related to a query robustly. The advantage of the proposed descriptor, sparse intensity histogram (SIH), is that it takes a robust approach to space distortion to the local descriptor, and that the speed of comparing are similar to the global descriptor because the SIH does not consider the spatial information, correspondence problem, to find the similar pairs of extracted descriptors between one and the other image. The experimental result shows that the proposed SIH has much better performance than the edge histogram descriptor in its accuracy.","PeriodicalId":443926,"journal":{"name":"2009 Seventh International Conference on Advances in Pattern Recognition","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132281951","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":"Multimodal Medical Image Fusion Using Redundant Discrete Wavelet Transform","authors":"Richa Singh, Mayank Vatsa, A. Noore","doi":"10.1109/ICAPR.2009.97","DOIUrl":"https://doi.org/10.1109/ICAPR.2009.97","url":null,"abstract":"Medical image fusion has revolutionized medical analysis by improving the precision and performance of computer assisted diagnosis. In this research, a fusion algorithm is proposed to combine pairs of multispectral magnetic resonance imaging such as T1, T2 and Proton Density brain images. The proposed algorithm utilizes different features of Redundant Discrete Wavelet Transform, mutual information based non-linear registration and entropy information to improve performance. Experiments on the BrainWeb database show that the proposed fusion algorithm preserves both edge and component information, and provides improved performance compared to existing Discrete Wavelet Transform based fusion algorithms.","PeriodicalId":443926,"journal":{"name":"2009 Seventh International Conference on Advances in Pattern Recognition","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133858203","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}