{"title":"A novel feature reduction framework for digital mammogram image classification","authors":"Hajar M. Alharbi, G. Falzon, P. Kwan","doi":"10.1109/ACPR.2015.7486498","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486498","url":null,"abstract":"The visual similarity between normal breast tissues and abnormal lesions in digital mammogram images makes computer-aided diagnosis of breast cancer using automatically detected features a highly error-prone task. Our contribution in this paper is a novel feature reduction framework for selecting the most discriminative features that achieves both efficiency and classification accuracy. Our approach applies five individual feature-ranking methods including Fisher score, minimum redundancy-maximum relevance, relief-f, sequential forward feature selection, and genetic algorithm for sorting the extracted features and selecting the features with highest ranking to setup a classifier. Our method achieves an accuracy of 94.27% and a sensitivity of 98.36% with a specificity of 99.27% on a set of 1,100 mammogram patches taken from image retrieval in medical applications database using a neural network classifier, which competes with state-of-the-art classification accuracy 93.11%. Furthermore, we demonstrate that only 49 out of the 119 extracted features are sufficient to achieve the reported accuracy of normal vs. abnormal classification.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"2573 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128787869","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":"Noise-resistant local binary pattern based on random projection","authors":"Shasha Li, Yukai Tu, Weihong Deng, Jiwen Lu","doi":"10.1109/ACPR.2015.7486614","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486614","url":null,"abstract":"Local binary pattern (LBP) is sensitive to noise. LBP projects local patch to eight-dimension vector by operating subtractions between pixel and its neighborhood. Two adjacent pixel values are generally very close, thus little noise can change their relative magnitude, leading to coding err. Using another projecting approach, random projection, as an alternate, we propose local binary pattern based on random projection (RPLBP), which is much more robust to noise while remaining computationally simple. Experiments on the aligned FERET database show that RPLBP has outstanding robustness to variations in illumination, facing expressions and aging. It's worth mentioning that the proposed RPBLP demonstrates superior noise-resistant performance to LBP and NRLBP.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127761065","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}
Mohammad Azad, I. Chikalov, Shahid Hussain, M. Moshkov
{"title":"Multi-pruning of decision trees for knowledge representation and classification","authors":"Mohammad Azad, I. Chikalov, Shahid Hussain, M. Moshkov","doi":"10.1109/ACPR.2015.7486574","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486574","url":null,"abstract":"We consider two important questions related to decision trees: first how to construct a decision tree with reasonable number of nodes and reasonable number of misclassification, and second how to improve the prediction accuracy of decision trees when they are used as classifiers. We have created a dynamic programming based approach for bi-criteria optimization of decision trees relative to the number of nodes and the number of misclassification. This approach allows us to construct the set of all Pareto optimal points and to derive, for each such point, decision trees with parameters corresponding to that point. Experiments on datasets from UCI ML Repository show that, very often, we can find a suitable Pareto optimal point and derive a decision tree with small number of nodes at the expense of small increment in number of misclassification. Based on the created approach we have proposed a multi-pruning procedure which constructs decision trees that, as classifiers, often outperform decision trees constructed by CART.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128039202","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":"Discriminant statistical analysis of local facial geometrical regions","authors":"Misae Nakatsu, R. Kimura, X. Han, Yenwei Chen","doi":"10.1109/ACPR.2015.7486524","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486524","url":null,"abstract":"The residences of Japanese Archipelago mainly include the three human populations; the Ainu, the Mainland Japanese and the Ryukyuan, which can be inferred by genome-wide single-nucleotide polymorphism (SNP) data and characterized by generic base sequences. In the other hand, the genetic association of human facial morphological variation recently becomes a more and more active research field, which aims to quantitatively analyze the possible relation measure between the gene base and a kind offacial morphological variations. This study attempts to explore the discriminated phenotype features of the common facial morphological variations between the Mainland Japanese and the Ryukyuan; the difference of phenotype features between these two populations is prospected to infer different gene base sequences. In order to explore the facial phenotype features, we propose a framework of local statistical analysis for adjacent geometrical regions of 3D facial images. Therein, we firstly select the surface points with higher distinguishable values based fisher linear discriminate analysis as discriminated coordinate vectors, and further cluster them into local geometrical groups for morphological analysis. The extracted local phenotype features are applied for identification of two populations, and achieve the comparable or better performances than the global phenotype feature, which manifests the possibility for association analysis between local morphological phenotype and the genes.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129763516","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}
Farhood Negin, S. Coşar, F. Brémond, Michal Koperski
{"title":"Generating unsupervised models for online long-term daily living activity recognition","authors":"Farhood Negin, S. Coşar, F. Brémond, Michal Koperski","doi":"10.1109/ACPR.2015.7486491","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486491","url":null,"abstract":"This paper presents an unsupervised approach for learning long-term human activities without requiring any user interaction (e.g., clipping long-term videos into short-term actions, labeling huge amount of short-term actions as in supervised approaches). First, important regions in the scene are learned via clustering trajectory points and the global movement of people is presented as a sequence of primitive events. Then, using local action descriptors with bag-of-words (BoW) approach, we represent the body motion of people inside each region. Incorporating global motion information with action descriptors, a comprehensive representation of human activities is obtained by creating models that contains both global and body motion of people. Learning of zones and the construction of primitive events is automatically performed. Once models are learned, the approach provides an online recognition framework. We have tested the performance of our approach on recognizing activities of daily living and showed its efficiency over existing approaches.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122704359","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":"Locality-constrained group sparse coding regularized NMR for robust face recognition","authors":"Hengmin Zhang, W. Luo, Jian Yang, Lei Luo","doi":"10.1109/ACPR.2015.7486601","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486601","url":null,"abstract":"Recently, nuclear norm based matrix regression (NMR) for classification has been proposed to characterize the whole structure of the error image. However, NMR ignores both the label information and the group structure of training samples. This paper presents a novel yet effective coding scheme called locality-constrained group sparse coding regularized NMR (LGNMR) which not only overcomes these limitations but also utilizes the similarities between test samples and training samples. We adopt the inexact augmented lagrange multiplier (IALM) method to solve the proposed model efficiently. Experiments on both Extended Yale B database and AR database have shown that the proposed method outperforms the state-of-the-art regression based classification methods.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128378333","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":"Human action recognition in the fractional Fourier domain","authors":"Jia-xin Cai, G. F. Sun","doi":"10.1109/ACPR.2015.7486585","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486585","url":null,"abstract":"Most studies about silhouettes based human action recognition focus on the time domain representation. However, the contour of human body usually shows as a time-varying signal, for which neither the time domain based methods nor the Fourier transform can catch enough information to achieve sufficient classification performance. A fractional Fourier shape descriptor is proposed for silhouette based human pose representation and action recognition. The fractional Fourier shape representation of human silhouette is more robust and discriminative than that in the time or frequency domain. A criteria called diffusion score is proposed to determine the best fractional order. After the fractional shape features are built, we propose a two-stage random forest based framework to classify human poses in the action sequence and vote the action label. Experimental results on benchmark dataset show that our method is effective.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131622542","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 a segmentation and recognition-free approach for content-based document image retrieval of handwritten queries","authors":"Houssem Chatbri, K. Kameyama, P. Kwan","doi":"10.1109/ACPR.2015.7486483","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486483","url":null,"abstract":"We introduce a method for content-based document image retrieval (CBDIR) of handwritten queries that is both segmentation and recognition-free. We first demonstrate that our method is underpinned by a theoretical model that exploits the Bayes' rule. Next, we present an algorithmic implementation that takes into account real world retrieval challenges caused by handwriting fluctuations and style variations. Our algorithm operates as follows: First, a number of connected components of the query are matched against the connected components of the document image using shape features. A similarity threshold is used to select the connected components of the document image that are most similar to the query components. Then, the selected components are used to detect candidate occurrences of the query in the document image by using size-adaptive bounding boxes. Finally, a score is calculated for each candidate occurrence and used for ranking. We conduct a comparative evaluation of our method on a dataset of 200 printed document images, by executing 40 printed and 200 handwritten queries of mathematical expressions. Experimental results demonstrate competitive performances expressed by P-Recall = 100%, A-Recall = 99.95% for printed queries, and P-Recall = 73.5%, A-Recall = 57.92% for handwritten queries, outperforming a state-of-the-art CBDIR algorithm.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131141383","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}
Yingcheng Su, Yujiu Yang, Zhenhua Guo, Weiguo Yang
{"title":"Face recognition with occlusion","authors":"Yingcheng Su, Yujiu Yang, Zhenhua Guo, Weiguo Yang","doi":"10.1109/ACPR.2015.7486587","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486587","url":null,"abstract":"Facial occlusion, such as sunglasses, scarf, mask etc., is one critical factor that affects the performance of face recognition. Unfortunately, faces with occlusion are quite common in the real world, especially in uncooperative scenario. In recent years, regression analysis becomes a hotspot of dealing with face recognition under different illuminations and facial occlusions. The basic idea of regression analysis is to recover clean images from degraded images or occluded images by using the clean training samples. Then the reconstructed images are used for face recognition. However noise would be introduced in the recovery procedure. So whether reconstructed image help face recognition is still worth studying. Note that the residual image which is a difference between the raw and reconstructed image containing most of the occluded information. We can use it for occlusion detection. In this paper we make two contributions: i) we present a new occlusion detection method by combining the information of both raw image and residual image; ii) we empirically show that using the non-occluded part for face recognition has a better result than using reconstructed image.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"21 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123270360","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":"Global and local consistent multi-view subspace clustering","authors":"Yanbo Fan, R. He, Bao-Gang Hu","doi":"10.1109/ACPR.2015.7486566","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486566","url":null,"abstract":"Multi-view clustering aims to cluster data with multiple sources of information. Comparing with single view clustering, it is challenging to make use of the extra information embedded in multiple views. This paper presents a multi-view subspace clustering method (MSC-GL) by simultaneously combining both the global low-rank constraint and local cross topology preserving constraints. The global constraint maximizes the correlation between representational matrices while encouraging each of them to be low rank. The local constraints enable representational matrices under different views to share local structure information. An efficiently iterative algorithm is developed to minimize the proposed joint learning problem, and extensive experiments on five multi-view benchmarks demonstrate that the proposed model outperforms the state-of-the-art multiview clustering methods.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114356857","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}