{"title":"Harnessing U-disparity in Point Clouds for Obstacle Detection","authors":"Yang Wei, Chen Gong, Shuo Chen","doi":"10.1109/ACPR.2017.106","DOIUrl":"https://doi.org/10.1109/ACPR.2017.106","url":null,"abstract":"Lidar is an indispensable equipment in autonomous vehicle for environment perception, in which obstacle detection plays an important role in collision avoiding and route planning. The main challenge of Lidar based obstacle detection is that processing the disordered and sparse point clouds would be difficult and time-consuming. Hence, this paper presents a novel usage of U-disparity to locate obstacles indiscriminately with point clouds, which makes obstacle detection effective and efficient. The proposed method firstly uses cross-calibration to align point cloud with reference image, so that a depth map is formed. Then, the U-disparity map is introduced to process Lidar based depth map. Due to the particularity of Lidar based U-disparity, we select local peaks in column in U-disparity to identify relevant disparities of obstacles. After applying filtering and clustering steps on these salient peak disparities, the corresponding obstacles can be precisely localized. Quantitative and qualitative experimental results on KITTI object detection benchmark and road detection benchmark reveal that the proposed method achieves very encouraging performances in various environments.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"95 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":"116668943","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":"Deep Neural Networks for Accurate Iris Recognition","authors":"Yuzheng Xu, Tzu-Chan Chuang, S. Lai","doi":"10.1109/ACPR.2017.152","DOIUrl":"https://doi.org/10.1109/ACPR.2017.152","url":null,"abstract":"Most prior iris recognition techniques based on the existing pipeline have already reached their limits. Therefore, this work explores the possibility of applying the deep learning technique to the field of iris recognition. We combine a novel segmentation network with a modified resnet-18 as the iris matching network. The segmentation network architecture consists of an iterative altered FCN (fully convolutional network) which contains a path of contracting layers to capture features and a symmetric upsampling path that gives precise pixel-to-pixel localization. The network not only generates visually implausible iris masks but also makes good use of data augmentation. We show that combining such networks outperforms the prior methods on several iris image datasets, including CASIA V3-interval and UBIRIS V2 datasets.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"42 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":"125192654","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":"Adversarial Learning Based Saliency Detection","authors":"Xuecai Hu, Xin Zhao, Kaiqi Huang, T. Tan","doi":"10.1109/ACPR.2017.103","DOIUrl":"https://doi.org/10.1109/ACPR.2017.103","url":null,"abstract":"Image saliency detection has recently witnessed rapid progress due to deep convolutional neural networks. However, the typical binary cross entropy loss used in the networks by saliency detection is a pixel-wise loss, resulting in the independent prediction of the salient probability of each pixel. It raises the problem of spatial discontinuity of the predicted saliency maps. Many researchers try to solve this problem by using super-pixel segmentation, but it is complicated and time-consuming. In this paper, we propose an Adversarial Saliency Detection Network (ASDN) to enhance the spatial continuity of the saliency maps with two sub-networks which are saliency detection network and discriminator network, respectively. The aim of the discriminator is to distinguish the saliency maps predicted by the saliency detection network from the ground truth. In this way, the discriminator helps the saliency detection network to enhance long-range spatial continuity of the predicted saliency map. Our ASDN achieves the state-of-the-art performance on standard salient object detection benchmarks.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"220 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":"115178900","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":"Compressed Sensing Natural Imaging via Hadamard-Diagonal Matrix","authors":"Ying Zhou, Quansen Sun, Yazhou Liu, Jixin Liu","doi":"10.1109/ACPR.2017.96","DOIUrl":"https://doi.org/10.1109/ACPR.2017.96","url":null,"abstract":"The measurement matrix is one of the keys of the compressed sensing. However, the existing measurement matrices face the two main problems of the difficult hardware implementation and the low sensing efficiency. In fact, those matrices always ignore the energy concentration characteristic of the natural images in the sparse domain, which greatly limits the sensing efficiency of the measurement matrices and thus the construction efficiency. In this paper, we propose a simple but efficient measurement matrix based on the Hadamard matrix with the consideration of maximizing the energy conservation in the sparse domain, named Hadamard-Diagonal Matrix (HDM). We keep the main sensing rows and columns in the Hadamard matrix with '1' and the others with '0' to keep more energy after the sampling of the natural images in the sparse domain, which increases the sensing efficiency. Meanwhile, the HDM is a binary and sparse matrix which benefits the hardware implementation. The experimental results show that the HDM performs better than some popular existing measurement matrices and is incoherent with different sparse basis.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"56 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":"116573213","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 Distortion Detection Using Convolutional Neural Network","authors":"Namhyuk Ahn, Byungkon Kang, Kyung-ah Sohn","doi":"10.1109/ACPR.2017.95","DOIUrl":"https://doi.org/10.1109/ACPR.2017.95","url":null,"abstract":"Image distortion classification and detection is an im-portant task in many applications. For example when com-pressing images, if we know the exact location of the distortion, then it is possible to re-compress images by adjusting the local compression level dynamically. In this paper, we address the problem of detecting the distortion region and classifying the distortion type of a given image. We show that our model significantly outperforms the state-of-the-art distortion classifier, and report accurate detection results for the first time. We expect that such results prove the use-fulness of our approach in many potential applications such as image compression or distortion restoration.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"1 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":"122861758","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}
Santhoshini Reddy, Chris Andrew Gadde, U. Pal, Alireza Alaei, Viswanath Pulabaigari
{"title":"Writer Identification in Indic Scripts: A Stroke Distribution Based Approach","authors":"Santhoshini Reddy, Chris Andrew Gadde, U. Pal, Alireza Alaei, Viswanath Pulabaigari","doi":"10.1109/ACPR.2017.158","DOIUrl":"https://doi.org/10.1109/ACPR.2017.158","url":null,"abstract":"This paper proposes to represent an offline handwritten document with a distribution of strokes over an alphabet of strokes for writer identification. A data driven approach for stroke alphabet creation is done as follows: strokes are extracted from the image, using a regression method, extracted strokes are represented as fixed length vectors in a vector space, strokes are clustered into stroke categories to create a stroke alphabet. The paper proposes a clustering method with a new clustering score whereby an optimal number of clusters (categories) are automatically identified. For a given document, based on the frequency of occurrence of elements in the stroke alphabet, a histogram is created that represents the writer's writing style. Support Vector Machine is used for the classification purpose. Offline handwritten documents written in two different Indic languages, viz., Telugu and Kannada, were considered for the experimentation. Results comparable to other methods in the literature are obtained from the proposed method.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"30 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":"122950383","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":"Collaborative Representation-based Classification Method Using Weighted Multi-scale LBP for Image Recognition","authors":"Xiaoning Song, Yao Chen","doi":"10.1109/ACPR.2017.161","DOIUrl":"https://doi.org/10.1109/ACPR.2017.161","url":null,"abstract":"In this paper, we propose a novel collaborative representation-based classification method using weighted multi-scale LBP for face recognition. First, to capture more useful local information from the dictionary, we constructed a weighted hierarchical multi-scale LBP as a dictionary optimization tool to dig out the multi-scale information of the original samples. Second, a query sample is represented as a linear combination of the most informative weighted multi-scale LBP features, in which the representation capability of each weighted multi-scale LBP feature is measured to determine the \"nearest neighbors\" for representing the test sample. The final goal of the proposed method is to find an optimal representation of these weighted multi-scale LBP features from the classes with major contributions. Experimental results conducted on the ORL, FERET, AR and GT face databases demonstrate the effectiveness of the proposed method","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"24 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":"117244301","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":"Self-Correction Method for Automatic Data Annotation","authors":"Ce Liu, Tonghua Su, Lijuan Yu","doi":"10.1109/ACPR.2017.135","DOIUrl":"https://doi.org/10.1109/ACPR.2017.135","url":null,"abstract":"Supervised learning from data, especially using deep neural networks, usually needs tons of labeled data. Considering there are plenty of handwritten samples in the Internet, how to make use of the large amount of dirty data or make them cleaner? This paper presents self-correction learning method to automatically label dirty data. The methods lend inspiration from self-training framework. It trains the classifier iteratively on the dirty data, and shifts the cluster centers, corrects or deletes samples according to the estimated confidence during the iterations. Empirical results demonstrate that the proposed method can effectively improve the quality of the data and reduce great human annotation efforts.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"40 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":"124737520","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":"Split and Merge for Accurate Plane Segmentation in RGB-D Images","authors":"Yigong Zhang, Tao Lu, Jian Yang, Hui Kong","doi":"10.1109/ACPR.2017.26","DOIUrl":"https://doi.org/10.1109/ACPR.2017.26","url":null,"abstract":"In this paper, we propose an accurate and efficient method to detect planar surfaces indoors based on an RGB-D camera. First, we segment the RGB image using a graph-based segmentation approach because of its efficiency and capability in preserving sharp region borders. The graph-based color segmentation methods usually result in over-segmentation or under-segmentation. Then to achieve better plane segmentation results, we propose a split-andmerge strategy. We first segment the planes in the split step by applying a random sampling and consensus (RANSAC) approach to each graph-derived point cloud based on a plane-fitting mean squared error (MSE). In the merge step, we can simultaneously merge some over-segmented regions obtained from the split step by a maximal clique clustering approach. Experiment demonstrates that our plane segmentation algorithm can detect planes indoors at a frame rate of 10Hz, and can achieve very promising performance.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"97 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":"130400516","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":"Person Re-identification by Saliency-Weighted Descriptor and Ranking Aggregation","authors":"Chao Guan, Minxian Li, Chunxia Zhao","doi":"10.1109/ACPR.2017.111","DOIUrl":"https://doi.org/10.1109/ACPR.2017.111","url":null,"abstract":"Person re-identification which identifies the same person appeared in non-overlapping camera views is an important and challenging task in computer vision. Although most feature representation methods have significantly improved the person re-identification performance, they do not distinguish between pedestrian object and the environment in images in the process of extracting feature. In this paper, we present a novel feature representation called saliency-weighted descriptor (SWD) which intensifies the discrimination of pedestrian feature. Furthermore, we propose a ranking aggregation algorithm to combine SWD and unweighted descriptor for the purpose of mitigating the impact of inaccurate salient region. The experimental results on public person re-identification datasets (VIPeR, QMUL GRID, CUHK01, and CUHK03) demonstrate the effectiveness of our approach.","PeriodicalId":426561,"journal":{"name":"2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"46 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":"116297674","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}