International Conference on Pattern Recognition Applications and Methods最新文献

筛选
英文 中文
Pluggable Drone Imaging Analysis Framework for Mob Detection during Open-air Events 可插拔无人机成像分析框架,用于露天活动期间的暴徒检测
International Conference on Pattern Recognition Applications and Methods Pub Date : 2019-11-18 DOI: 10.5220/0007260400640072
Jerico Moeyersons, Brecht Verhoeve, Pieter-Jan Maenhaut, B. Volckaert, F. Turck
{"title":"Pluggable Drone Imaging Analysis Framework for Mob Detection during Open-air Events","authors":"Jerico Moeyersons, Brecht Verhoeve, Pieter-Jan Maenhaut, B. Volckaert, F. Turck","doi":"10.5220/0007260400640072","DOIUrl":"https://doi.org/10.5220/0007260400640072","url":null,"abstract":"Drones and thermal cameras are often combined within applications such as search and rescue, and fire fighting. Due to vendor specific hardware and software, applications for these drones are hard to develop and maintain. As a result, a pluggable drone imaging analysis architecture is proposed that facilitates the development of custom image processing applications. This architecture is prototyped as a microservice-based plugin framework and allows users to build image processing applications by connecting media streams using microservices that connect inputs (e.g. regular or thermal camera image streams) to image analysis services. The prototype framework is evaluated in terms of modifiability, interoperability and performance. This evaluation has been carried out on the use case of detecting large crowds of people (mobs) during open-air events. The framework achieves modifiability and performance by being able to work in soft real-time and it achieves the interoperability by having an average successful exchange ratio of 99.998%. A new dataset containing thermal images of such mobs is presented, on which a YOLOv3 neural network is trained. The trained model is able to detect mobs on new thermal images in real-time achieving frame rates of 55 frames per second when deployed","PeriodicalId":410036,"journal":{"name":"International Conference on Pattern Recognition Applications and Methods","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125927745","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}
引用次数: 1
Measuring the Data Efficiency of Deep Learning Methods 测量深度学习方法的数据效率
International Conference on Pattern Recognition Applications and Methods Pub Date : 2019-07-03 DOI: 10.5220/0007456306910698
Hlynur Davíð Hlynsson, Alberto N. Escalante, Laurenz Wiskott
{"title":"Measuring the Data Efficiency of Deep Learning Methods","authors":"Hlynur Davíð Hlynsson, Alberto N. Escalante, Laurenz Wiskott","doi":"10.5220/0007456306910698","DOIUrl":"https://doi.org/10.5220/0007456306910698","url":null,"abstract":"In this paper, we propose a new experimental protocol and use it to benchmark the data efficiency --- performance as a function of training set size --- of two deep learning algorithms, convolutional neural networks (CNNs) and hierarchical information-preserving graph-based slow feature analysis (HiGSFA), for tasks in classification and transfer learning scenarios. The algorithms are trained on different-sized subsets of the MNIST and Omniglot data sets. HiGSFA outperforms standard CNN networks when the models are trained on 50 and 200 samples per class for MNIST classification. In other cases, the CNNs perform better. The results suggest that there are cases where greedy, locally optimal bottom-up learning is equally or more powerful than global gradient-based learning.","PeriodicalId":410036,"journal":{"name":"International Conference on Pattern Recognition Applications and Methods","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117273242","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}
引用次数: 9
Simultaneous Object Detection and Semantic Segmentation 同时目标检测和语义分割
International Conference on Pattern Recognition Applications and Methods Pub Date : 2019-05-06 DOI: 10.5220/0009142905550561
Niels Ole Salscheider
{"title":"Simultaneous Object Detection and Semantic Segmentation","authors":"Niels Ole Salscheider","doi":"10.5220/0009142905550561","DOIUrl":"https://doi.org/10.5220/0009142905550561","url":null,"abstract":"Both object detection in and semantic segmentation of camera images are important tasks for automated vehicles. Object detection is necessary so that the planning and behavior modules can reason about other road users. Semantic segmentation provides for example free space information and information about static and dynamic parts of the environment. There has been a lot of research to solve both tasks using Convolutional Neural Networks. These approaches give good results but are computationally demanding. In practice, a compromise has to be found between detection performance, detection quality and the number of tasks. Otherwise it is not possible to meet the real-time requirements of automated vehicles. In this work, we propose a neural network architecture to solve both tasks simultaneously. This architecture was designed to run with around 10 Hz on 1 MP images on current hardware. Our approach achieves a mean IoU of 61.2% for the semantic segmentation task on the challenging Cityscapes benchmark. It also achieves an average precision of 69.3% for cars and 67.7% on the moderate difficulty level of the KITTI benchmark.","PeriodicalId":410036,"journal":{"name":"International Conference on Pattern Recognition Applications and Methods","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131023560","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}
引用次数: 17
Efficient Keypoint Reduction for Document Image Matching 有效的关键点减少文档图像匹配
International Conference on Pattern Recognition Applications and Methods Pub Date : 2019-04-25 DOI: 10.5220/0007412006640670
T. Konidaris, V. Märgner, H. Mohammed, H. Stiehl
{"title":"Efficient Keypoint Reduction for Document Image Matching","authors":"T. Konidaris, V. Märgner, H. Mohammed, H. Stiehl","doi":"10.5220/0007412006640670","DOIUrl":"https://doi.org/10.5220/0007412006640670","url":null,"abstract":"In this paper we propose a method for eliminating SIFT keypoints in document images. The proposed method is applied as a first step towards word spotting. One key issue when using SIFT keypoints in document images is that a large number of keypoints can be found in non-textual regions. It would be ideal if we could eliminate as much as irrelevant keypoints as possible in order to speed-up processing. This is accomplished by altering the original matching process of SIFT descriptors using an iterative process that enables the detection of keypoints that belong to multiple correct instances throughout the document image, which is an issue that the original SIFT algorithm cannot tackle in a satisfactory way. The proposed method manages a reduction over 99% of the extracted keypoints with satisfactory performance.","PeriodicalId":410036,"journal":{"name":"International Conference on Pattern Recognition Applications and Methods","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117182554","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}
引用次数: 1
JumpReLU: A Retrofit Defense Strategy for Adversarial Attacks JumpReLU:对抗性攻击的改进防御策略
International Conference on Pattern Recognition Applications and Methods Pub Date : 2019-04-07 DOI: 10.5220/0009316401030114
N. Benjamin Erichson, Z. Yao, Michael W. Mahoney
{"title":"JumpReLU: A Retrofit Defense Strategy for Adversarial Attacks","authors":"N. Benjamin Erichson, Z. Yao, Michael W. Mahoney","doi":"10.5220/0009316401030114","DOIUrl":"https://doi.org/10.5220/0009316401030114","url":null,"abstract":"It has been demonstrated that very simple attacks can fool highly-sophisticated neural network architectures. In particular, so-called adversarial examples, constructed from perturbations of input data that are small or imperceptible to humans but lead to different predictions, may lead to an enormous risk in certain critical applications. In light of this, there has been a great deal of work on developing adversarial training strategies to improve model robustness. These training strategies are very expensive, in both human and computational time. To complement these approaches, we propose a very simple and inexpensive strategy which can be used to ``retrofit'' a previously-trained network to improve its resilience to adversarial attacks. More concretely, we propose a new activation function---the JumpReLU---which, when used in place of a ReLU in an already-trained model, leads to a trade-off between predictive accuracy and robustness. This trade-off is controlled by the jump size, a hyper-parameter which can be tuned during the validation stage. Our empirical results demonstrate that this increases model robustness, protecting against adversarial attacks with substantially increased levels of perturbations. This is accomplished simply by retrofitting existing networks with our JumpReLU activation function, without the need for retraining the model. Additionally, we demonstrate that adversarially trained (robust) models can greatly benefit from retrofitting.","PeriodicalId":410036,"journal":{"name":"International Conference on Pattern Recognition Applications and Methods","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126967449","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}
引用次数: 8
Deep Neural Networks with Intersection over Union Loss for Binary Image Segmentation 基于交/并损失的深度神经网络二值图像分割
International Conference on Pattern Recognition Applications and Methods Pub Date : 2019-03-15 DOI: 10.5220/0007347504380445
F. V. Beers, Arvid Lindström, Emmanuel Okafor, M. Wiering
{"title":"Deep Neural Networks with Intersection over Union Loss for Binary Image Segmentation","authors":"F. V. Beers, Arvid Lindström, Emmanuel Okafor, M. Wiering","doi":"10.5220/0007347504380445","DOIUrl":"https://doi.org/10.5220/0007347504380445","url":null,"abstract":"In semantic segmentation tasks the Jaccard Index, or Intersection over Union (IoU), is often used as a measure of success. While this measure is more representative than per-pixel accuracy, state-of-the-art deep neural networks are still trained on accuracy by using Binary Cross Entropy loss. In this research, an alternative is used where deep neural networks are trained for a segmentation task of human faces by optimizing directly an approximation of IoU. When using this approximation, IoU becomes differentiable and can be used as a loss function. The comparison between IoU loss and Binary Cross Entropy loss is made by testing two deep neural network models on multiple datasets and data splits. The results show that training directly on IoU significantly increases performance for both models compared to training on conventional Binary Cross Entropy loss.","PeriodicalId":410036,"journal":{"name":"International Conference on Pattern Recognition Applications and Methods","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114360649","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}
引用次数: 54
Deep Learning-based Method for Classifying and Localizing Potato Blemishes 基于深度学习的马铃薯瑕疵分类与定位方法
International Conference on Pattern Recognition Applications and Methods Pub Date : 2019-02-19 DOI: 10.5220/0007350101070117
S. Marino, P. Beauseroy, A. Smolarz
{"title":"Deep Learning-based Method for Classifying and Localizing Potato Blemishes","authors":"S. Marino, P. Beauseroy, A. Smolarz","doi":"10.5220/0007350101070117","DOIUrl":"https://doi.org/10.5220/0007350101070117","url":null,"abstract":"In this paper we address the problem of potato blemish classification and localization. A large database with multiple varieties was created containing 6 classes, i.e., healthy, damaged, greening, black dot, common scab and black scurf. A Convolutional Neural Network was trained to classify face potato images and was also used as a filter to select faces where more analysis was required. Then, a combination of autoencoder and SVMs was applied on the selected images to detect damaged and greening defects in a patch-wise manner. The localization results were used to classify the potato according to the severity of the blemish. A final global evaluation of the potato was done where four face images per potato were considered to characterize the entire tuber. Experimental results show a face-wise average precision of 95% and average recall of 93%. For damaged and greening patch-wise localization, we achieve a False Positive Rate of 4.2% and 5.5% and a False Negative Rate of 14.2% and 28.1% respectively. Concerning the final potato-wise classification, we achieved in a test dataset an average precision of 92% and average recall of 91%.","PeriodicalId":410036,"journal":{"name":"International Conference on Pattern Recognition Applications and Methods","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124879304","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}
引用次数: 4
Vertical and Horizontal Distances to Approximate Edit Distance for Rooted Labeled Caterpillars 垂直和水平距离,以近似编辑距离扎根标记毛虫
International Conference on Pattern Recognition Applications and Methods Pub Date : 2019-02-19 DOI: 10.5220/0007387205900597
Kohei Muraka, Takuya Yoshino, K. Hirata
{"title":"Vertical and Horizontal Distances to Approximate Edit Distance for Rooted Labeled Caterpillars","authors":"Kohei Muraka, Takuya Yoshino, K. Hirata","doi":"10.5220/0007387205900597","DOIUrl":"https://doi.org/10.5220/0007387205900597","url":null,"abstract":"A rooted labeled caterpillar (caterpillar, for short) is a rooted labeled tree transformed to a rooted path (called a backbone) after removing all the leaves in it and we can compute the edit distance between caterpillars in quartic time. In this paper, we introduce two vertical distances and two horizontal distances for caterpillars. The former are based on a string edit distance between the string representations of the backbones and the latter on a multiset edit distance between the multisets of labels occurring in all the leaves. Then, we show that these distances give both lower bound and upper bound of the edit distance and we can compute the vertical distances in quadratic time and the horizontal distances in linear time under the unit cost function.","PeriodicalId":410036,"journal":{"name":"International Conference on Pattern Recognition Applications and Methods","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123681432","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}
引用次数: 8
Deep Multi-biometric Fusion for Audio-Visual User Re-Identification and Verification 基于深度多生物特征融合的视听用户再识别与验证
International Conference on Pattern Recognition Applications and Methods Pub Date : 2019-02-19 DOI: 10.1007/978-3-030-40014-9_7
M. Marras, Pedro A. Marín-Reyes, J. Lorenzo-Navarro, M. C. Santana, G. Fenu
{"title":"Deep Multi-biometric Fusion for Audio-Visual User Re-Identification and Verification","authors":"M. Marras, Pedro A. Marín-Reyes, J. Lorenzo-Navarro, M. C. Santana, G. Fenu","doi":"10.1007/978-3-030-40014-9_7","DOIUrl":"https://doi.org/10.1007/978-3-030-40014-9_7","url":null,"abstract":"","PeriodicalId":410036,"journal":{"name":"International Conference on Pattern Recognition Applications and Methods","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116052181","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}
引用次数: 7
Improving the Dictionary Construction in Sparse Representation using PCANet for Face Recognition 基于PCANet改进稀疏表示的字典构造用于人脸识别
International Conference on Pattern Recognition Applications and Methods Pub Date : 2019-02-19 DOI: 10.5220/0007368105170523
Peiyu Kang, Yonggang Lu, Diqi Pan, Wenjie Guo
{"title":"Improving the Dictionary Construction in Sparse Representation using PCANet for Face Recognition","authors":"Peiyu Kang, Yonggang Lu, Diqi Pan, Wenjie Guo","doi":"10.5220/0007368105170523","DOIUrl":"https://doi.org/10.5220/0007368105170523","url":null,"abstract":"Recently, sparse representation has attracted increasing interest in computer vision. Sparse representation based methods, such as sparse representation classification (SRC), have produced promising results in face recognition, while the dictionary used for sparse representation plays a key role in it. How to improve the dictionary construction in sparse representation is still an open question. Principal component analysis network (PCANet), as a newly proposed deep learning method, has the advantage of simple network architecture and competitive performance for feature learning. In this paper, we have studied how to use the PCANet to improve the dictionary construction in sparse representation, and proposed a new method for face recognition. The PCANet is used to learn new features from face images, and the learned features are used as dictionary atoms to code the query face images, and then the reconstruction errors after sparse coding are used to classify the face images. It is shown that the proposed method can achieve better performance than the other five state-of-art methods for face recognition.","PeriodicalId":410036,"journal":{"name":"International Conference on Pattern Recognition Applications and Methods","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122259453","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书