{"title":"Efficient and Robust TWSVM Classifier Based on L1-Norm Distance Metric for Pattern Classification","authors":"He Yan, Qiaolin Ye, Tian'an Zhang, Dong-Jun Yu","doi":"10.1109/ACPR.2017.23","DOIUrl":"https://doi.org/10.1109/ACPR.2017.23","url":null,"abstract":"Twin support vector machine (TWSVM) is a classical distance metric learning method for classification problems. The formulation of TWSVM criterion is based on L2-norm distance, which makes TWSVM prone to being influenced by the presence of outliers. In this paper, to develop a robust distance metric learning method, we propose a new objective for TWSVM classifier using L1-norm distance metric, termed as L1-TWSVM. The optimization strategy is to maximize the ratio of the inter-class distance dispersion to the intra-class distance dispersion by using L1-norm distance rather than L2-norm distance. Besides, we design a simple and valid iterative algorithm to solve L1-norm optimal problems, which is easy to actualize and its convergence to an optimum is theoretically ensured. The efficiency and robustness of L1-TWSVM have been validated by experiments on UCI datasets and artificial datasets. The promising experimental results indicate that our proposals outperform relevant state-of-the-art methods in all kinds of experimental settings.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124332520","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":"Robust Lane Detection and Tracking with Propagated Spatio-temporal Constraints","authors":"Tingting Li, Kunqian Li, Wenbing Tao","doi":"10.1109/ACPR.2017.92","DOIUrl":"https://doi.org/10.1109/ACPR.2017.92","url":null,"abstract":"Road traffic plays an important role in our modern life. Lane detection and tracking system is developed for improving active security in intelligent vehicle. We present an effective method to achieve lane detection based on Bayesian probability framework, which utilizes prior knowledge of lane to decrease error lane detections. Besides, propagated spatio-temporal constraints between frames are applied to a simple and robust tracking strategy. Our tracking strategy can deal with some challenging scenarios, such as worn lane markings and shadows of trees, and reduce the amount of calculation greatly. Experimental results show that the proposed algorithm is robust against noise, shadows and illumination variations in captured road image sequences.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124469455","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":"Plagiarism Detection in Programming Assignments Using Deep Features","authors":"Jitendra Yasaswi, Suresh Purini, C. V. Jawahar","doi":"10.1109/ACPR.2017.146","DOIUrl":"https://doi.org/10.1109/ACPR.2017.146","url":null,"abstract":"This paper proposes a method for detecting plagiarism in source-codes using deep features. The embeddings for programs are obtained using a character-level Recurrent Neural Network (char-rnn), which is pre-trained on Linux Kernel source-code. Many popular plagiarism detection tools are based on n-gram techniques at syntactic level. However, these approaches to plagiarism detection fail to capture long term dependencies (non-contiguous interaction) present in the source-code. Contrarily, the proposed deep features capture non-contiguous interaction within n-grams. These are generic in nature and there is no need to fine-tune the char-rnn model again to program submissions from each individual problem-set. Our experiments show the effectiveness of deep features in the task of classifying assignment program submissions as copy, partial-copy and non-copy. Comparing our proposed features with handcrafted features (source-code metrics and textual features), we report f1-score improvement of 9.5% for binary classification and 5% for three-way classification tasks respectively.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125433671","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":"Rapid Object Detection in VHR Optical Remote Sensing Images Based on Rotation-Invariant Discrete Hashing","authors":"Hui Xu, Yazhou Liu, Quansen Sun","doi":"10.1109/ACPR.2017.40","DOIUrl":"https://doi.org/10.1109/ACPR.2017.40","url":null,"abstract":"Object detection is one of the most fundamental but challenging problems faced for large-scale remote sensing image(RSI) analysis. Recently, learning based hashing techniques have attracted broad research interests because of their significant efficiency for high-dimensional data in both storage and speed. This paper proposes a novel object detection model which utilizes hashing methods to substantially improve the detection speed. In particular, firstly a selective search method is used to generate a number of high-quality object proposals that may contain objects. Then we propose rotation-invariant discrete hashing(RIDISH), which sloves the problem of object rotation variations in RSI, to quickly eliminate most non-object proposals in Hamming space. And finally the object detection task can be achieved by classifying the rest(very limited amount of) proposals with more discriminating classification model. Experimental evaluations on a publicly available very high resolution (VHR) remote sensing dataset point out that the presented object detection model is much faster, while keeping more superior performance than those typically used in VHR remote sensing images.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130067365","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}
Kazuma Sasaki, Yuya Nagahama, Zheng Ze, S. Iizuka, E. Simo-Serra, Yoshihiko Mochizuki, H. Ishikawa
{"title":"Adaptive Energy Selection for Content-Aware Image Resizing","authors":"Kazuma Sasaki, Yuya Nagahama, Zheng Ze, S. Iizuka, E. Simo-Serra, Yoshihiko Mochizuki, H. Ishikawa","doi":"10.1109/ACPR.2017.105","DOIUrl":"https://doi.org/10.1109/ACPR.2017.105","url":null,"abstract":"Content-aware image resizing aims to reduce the size of an image without touching important objects and regions. In seam carving, this is done by assessing the importance of each pixel by an energy function and repeatedly removing a string of pixels avoiding pixels with high energy. However, there is no single energy function that is best for all images: the optimal energy function is itself a function of the image. In this paper, we present a method for predicting the quality of the results of resizing an image with different energy functions, so as to select the energy best suited for that particular image. We formulate the selection as a classification problem; i.e., we 'classify' the input into the class of images for which one of the energies works best. The standard approach would be to use a CNN for the classification. However, the existence of a fully connected layer forces us to resize the input to a fixed size, which obliterates useful information, especially lower-level features that more closely relate to the energies used for seam carving. Instead, we extract a feature from internal convolutional layers, which results in a fixed-length vector regardless of the input size, making it amenable to classification with a Support Vector Machine. This formulation of the algorithm selection as a classification problem can be used whenever there are multiple approaches for a specific image processing task. We validate our approach with a user study, where our method outperforms recent seam carving approaches.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131678039","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":"Subspace Clustering via Sparse Graph Regularization","authors":"Qiang Zhang, Z. Miao","doi":"10.1109/ACPR.2017.94","DOIUrl":"https://doi.org/10.1109/ACPR.2017.94","url":null,"abstract":"Subspace clustering aims to segment data drawn from a union of linear subspaces. Recently various self-representation based methods have been proposed and achieve much more successful performance. Smooth Representation clustering (SMR) is one of these methods, which does self-representation coding with a graph regularization term and enjoys the grouping effect. In this paper, we propose a new subspace clustering method via sparse graph regularization, modifying the traditional graph regularization term of SMR into a new sparse graph regularization term, which is more robust against noise and outlying data. We theoretically study the nice properties of the proposed method and provide an efficient algorithm to solve the new spare graph regularized subspace clustering problem. Experiments on several subspace clustering tasks show that our method gets significantly better performance than the state-of-the-art methods.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132977336","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 Approach for Recognition and Verification of On-Line Signatures Using PSO","authors":"S. Dutta, Rajkumar Saini, Pradeep Kumar, P. Roy","doi":"10.1109/ACPR.2017.115","DOIUrl":"https://doi.org/10.1109/ACPR.2017.115","url":null,"abstract":"Signature recognition and verification have been widely used for user authentication. A person is allowed to proceed further only when his/her signature matches with his/her model or template(s) stored in the database. In this paper, a robust approach for online signature recognition and verification has been proposed. Signatures have been segmented into uniform segments and features are collected from each segment to capture local dynamic properties. For signature recognition task, Random Forest is used as the classifier and particle swarm optimization(PSO) has been used to select the best feature-set and model parameter. The feature set and parameters selected from recognition task have been used in training binary random forest classifiers for user verification. Signature verification has been performed in two modes i.e. using global threshold and local threshold and corresponding results have been reported. In our experiment, we have used two public datasets (MCYT-100 and SVC-2004) and have achieved over 99% recognition rate and encouraging Equal Error Rate (EER) for verification on both the datasets.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130956063","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 Abnormal Event Detection Based on Compact Coefficient Low-Rank Dictionary Learning","authors":"Ang Li, Z. Miao, Yigang Cen","doi":"10.1109/ACPR.2017.53","DOIUrl":"https://doi.org/10.1109/ACPR.2017.53","url":null,"abstract":"In this paper, an approach to detect global abnormal events is presented, which is based on a compact coefficient low-rank dictionary learning (CCLRDL) algorithm. Similar with sparse representation, the aim of the approach is to achieve the reconstruction coefficients over the normal bases. First of all, the histogram of maximal optical flow projection (HMOFP) is extracted from a set of normal training frames to describe the movements of the crowd. Secondly, after a process of selecting the training samples, the inexact augmented Lagrange multiplier (ALM) algorithm is utilized to obtain a low-rank dictionary. And then, by using the ALM algorithm the reconstruction coefficients of testing samples are acquired. Finally, reconstruction cost (RC) is introduced to detect whether a frame is normal or not. The experiment results on the well-known UMN dataset and the comparisons to the most popular methods show our algorithm is promising.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125307142","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}
T. Kamitani, Hiroki Yoshimura, Masashi Nishiyama, Y. Iwai
{"title":"Identifying People Using Temporal and Spatial Changes in Local Movements Measured from Body Sway","authors":"T. Kamitani, Hiroki Yoshimura, Masashi Nishiyama, Y. Iwai","doi":"10.1109/ACPR.2017.82","DOIUrl":"https://doi.org/10.1109/ACPR.2017.82","url":null,"abstract":"We propose a novel method of identifying people using temporal and spatial changes in local movements measured from a video sequence of body sway. Existing methods identify people using a gait feature mainly representing the large swinging of the limbs. The use of the gait feature introduces a problem in that the identification performance decreases when people stop walking. To extract an informative feature from people who have stopped walking, our method measures small swings of the body, which is called body sway. We extract the feature from local movements of body sway by participially dividing the body into regions. Experimental results for a dataset of body sway of 118 participants show that the local movement feature obtained using our method outperforms the gait feature obtained using an existing method.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121056556","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}