{"title":"Multi-staged deep learning with created coarse and appended fine categories","authors":"Reiko Hagawa, Yasunori Ishii, Sotaro Tsukizawa","doi":"10.1109/ACPR.2015.7486461","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486461","url":null,"abstract":"This paper proposes a new learning method for Deep Learning based on the concept of a Coarse-to-Fine approach. The Coarse-to-Fine classification improves Deep Learning performance, but it increases network size and presents the problem of close dependence on the accuracy of coarse classification. We tried to avoid this problem by adopting the concept of Curriculum Learning and succeeded in improving the accuracy of Deep Learning. This technique uses learning that employs a single closed image dataset several times in the same network except for the last layer. In this process, coarse labels are given to the images during the pre-training stages and fine labels are given to the same images at the fine-tuning stage. This coarse category pre-training method makes it possible to obtain those features that commonly exist in multiple fine categories. To demonstrate the advantage of this technique, several patterns of a dataset in the quantity of several tens of classes and a single dataset of 100 classes were produced using the ImageNet dataset and compared with the previous technique. The results showed a 5.7% improvement of TOP1 accuracy, with the best case confirmed in the 100-class dataset.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"214 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":"117347530","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":"Image set representation and classification with covariate-relation graph","authors":"Zhuqiang Chen, Bo Jiang, Jin Tang, B. Luo","doi":"10.1109/ACPR.2015.7486603","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486603","url":null,"abstract":"Recently, image set representation and classification is an important problem in computer vision and pattern recognition area. It has been widely used in many computer vision applications. In this paper, a new image set representation method, named covariate-relation graph (CRG), has been proposed. CRG aims to represent image set with a graph model. Compared with existing representation methods, CRG is more flexible and intuitive. Based on CRG representation, we further achieve image set classification tasks using Kernel Linear Discriminant Analysis (KLDA) and nearest neighbor classification. Experimental results on several datasets demonstrate the benefit of the proposed CRG representation.","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":"123970841","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":"High order graphlets for pattern classification","authors":"Anjan Dutta, H. Sahbi","doi":"10.1109/ACPR.2015.7486495","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486495","url":null,"abstract":"Graph-based methods are known to be successful for pattern description and comparison. Their general principle consists in using graphs to model local features as well as their structural relationships and achieving pattern comparison with graph matching. Among these methods, subgraph isomorphism is particularly effective but intractable for general and unconstrained graph structures. In this paper, we introduce an efficient and effective method for graph-based pattern comparison. The main contribution includes a new stochastic search procedure that allows us to efficiently extract, hash and measure the distribution of increasing order subgraphs (a.k.a graphlets) in large graph collections. We consider both low and high order graphlets in order to model local features as well as their complex interactions. These graphlets are partitioned into sets of isomorphic and non-isomorphic subgraphs using well designed hash functions with a low probability of collision; resulting into accurate graph descriptions. When combined with support vector machines, these high order graphlet-based descriptions have positive impact on the performance of pattern comparison and classification as corroborated through experiments on different standard databases.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"38 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":"128195491","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 parameter-less support vector machines","authors":"J. Nalepa, Krzysztof Siminski, M. Kawulok","doi":"10.1109/ACPR.2015.7486496","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486496","url":null,"abstract":"Support vector machines (SVMs) are a widely-used machine learning technique, but they suffer from a significant drawback of high time and memory training complexity, which should be endured especially in big data problems. SVMs incorporate kernel functions - it involves selecting the kernel and induces an additional computational effort. In this paper, we address these issues and propose an SVM framework that automatically determines the kernel and selects data to train SVMs. It embodies the neuro-fuzzy system for creating the kernel along with the memetic algorithm to select training samples. Extensive experiments indicate that our approach enables obtaining high classification scores.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"71 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":"132023977","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":"Estimation of browsing states in consumer decision processes from eye movements","authors":"E. Schaffer, H. Kawashima, T. Matsuyama","doi":"10.1109/ACPR.2015.7486543","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486543","url":null,"abstract":"Eye movements can be an important cue to reveal consumer decision processes. Findings from existing studies suggest that the consumer decision process consists of a few different browsing states such as screening and evaluation. To reveal the characteristics and temporal changes of browsing states in catalog browsing situations, this study proposes a hidden semi-Markov-based gaze model, where the states in consumer decision processes are explicitly modeled as hidden states. To achieve a better understanding of consumer decision processes, eye movements are first encoded to a sequence of gaze features using semantic structure of digital catalogs. The proposed gaze model is trained and evaluated using gaze data which was collected from eight participants in an experimentally controlled catalog browsing situation. We analyze the estimated browsing states and demonstrate that the states can contribute to improve the performance of viewer interest estimation.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"85 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":"126104369","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}
Yuta Shimamoto, Qian Chen, Haiyuan Wu, Xiang Ruan, Hikaru Matsumoto
{"title":"Efficient cepstrum analysis based UNLM PSF estimation in single blurred image","authors":"Yuta Shimamoto, Qian Chen, Haiyuan Wu, Xiang Ruan, Hikaru Matsumoto","doi":"10.1109/ACPR.2015.7486512","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486512","url":null,"abstract":"We propose a new Uniform Non-linear Motion (UNLM) Point Spread Function (PSF) estimation algorithm based on cepstrum analysis. Our work has two contributions. First, the algorithm does not need an exhaustive selection of candidate PSFs as conventional algorithm does, only one PSF and its symmetric shape are evaluated for final decision. Second, we give theoretical reasoning, which was not clearly interpreted so far, on how to extent conventional Uniform Linear Motion (ULM) PSF algorithm to UNLM PSF estimation. We show the effectiveness of the proposed algorithm by both simulation and real images. Quantitative accuracy improvement to related work is also presented in the experiments.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"8 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":"126665696","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":"Specific changes detection in visible-band VHR images using classification likelihood space","authors":"Feimo Li, Shuxiao Li, Cheng-Fei Zhu, Xiaosong Lan, Hongxing Chang","doi":"10.1109/ACPR.2015.7486530","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486530","url":null,"abstract":"Object-based post-classification change detection methods are effective for very high resolution images, but their effectiveness is limited by incomplete class hierarchy and complex image object comparison. In this paper, a novel Classification Likelihood Space (CLS) is proposed to synthesize the effective object-based image analysis and easy-to-implement post-classification comparison, serving as a well tradeoff between performance and complexity. The proposed algorithm is tested on a dataset which comprises 102 pairs of visible-band very high resolution real satellite images, and a great improvement is observed over traditional post-classification comparison.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"163 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":"121742067","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":"Very deep convolutional neural network based image classification using small training sample size","authors":"Shuying Liu, Weihong Deng","doi":"10.1109/ACPR.2015.7486599","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486599","url":null,"abstract":"Since Krizhevsky won the ImageNet Large Scale Visual Recognition Challenge (ILSVRC) 2012 competition with the brilliant deep convolutional neural networks (D-CNNs), researchers have designed lots of D-CNNs. However, almost all the existing very deep convolutional neural networks are trained on the giant ImageNet datasets. Small datasets like CIFAR-10 has rarely taken advantage of the power of depth since deep models are easy to overfit. In this paper, we proposed a modified VGG-16 network and used this model to fit CIFAR-10. By adding stronger regularizer and using Batch Normalization, we achieved 8.45% error rate on CIFAR-10 without severe overfitting. Our results show that the very deep CNN can be used to fit small datasets with simple and proper modifications and don't need to re-design specific small networks. We believe that if a model is strong enough to fit a large dataset, it can also fit a small one.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"26 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":"134471025","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 autoencoder based spatial pyramid facial feature learning","authors":"Xiao Ma, Jufu Feng","doi":"10.1109/ACPR.2015.7486607","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486607","url":null,"abstract":"The spatial pyramid feature learning methods, such as Spatial Pyramid Matching (SPM) and Sparse Coding based Spatial Pyramid Matching (ScSPM), have achieved significant performance in image categorization. While most of these methods are still based on manual-design features, such as SIFT, HOG and LBP, which limits the representation of data. In this paper, we propose a novel Sparse Autoencoder based Spatial Pyramid Matching (SaSPM) method, which exploits unsupervised sparse autoencoder network infeatures learning and then builds a spatial pyramid structure. There are three main contributions in SaSP-M: Firstly, SaSPM is a learning method directly learning features from original data. Secondly, SaSPM is a full feedforward method in feature extraction, which is more efficient for on-line systems comparing with ScSPM method. Thirdly, we design patch-shared and patch-specific SaSP-M models to learn different local features separatively on well-aligned face images. It is proven that SaSPM outperforms the original spatial pyramid features in varieties of challenging data sets.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"17 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":"133372306","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":"Fast interactive segmentation in stereo images based on multi-scale graph","authors":"Wei Ma, Xiaohui Qiu, Luwei Yang, Shuo Liu, Lijuan Duan","doi":"10.1109/ACPR.2015.7486505","DOIUrl":"https://doi.org/10.1109/ACPR.2015.7486505","url":null,"abstract":"It is hard for current interactive stereo image segmentation methods to deal with large scale images with fast feedback after each interaction. In this paper, we present an interactive stereo image segmentation method. Different from current methods, our method introduces a multi-scale graph structure for fast graph cut optimization. Besides, we use GPU parallel computing to handle single instruction multiple data tasks involved in the segmentation. Compared with state-of-the-art methods, our approach significantly accelerates segmentation speed. In the meanwhile, our method obtains segmentation accuracy comparable with state-of-the-art methods.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"72 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":"114431636","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}