{"title":"An Anti-occlusion Correlation Filtering Tracking Algorithm for UAV","authors":"Zun Xu, Yan Ding, Jiayuan Shan, Xiaoxiao Xie","doi":"10.1109/PIC.2018.8706132","DOIUrl":"https://doi.org/10.1109/PIC.2018.8706132","url":null,"abstract":"In the scenario of Unmanned Aerial Vehicle (UAV), the angle and the height at which the UAV observes the object cause partial occlusion, deformation, and size changing of object image. Based on the Discriminative Correlation Filter (DCF) algorithm, this paper proposes a new tracking algorithm DCF-GA (Discriminative Correlation Filter with Generation of Adversarial example) to achieve anti-occlusion in the scenario of UAV. Firstly, we design a mask selection strategy to generate the adversarial example with occlusion, which can enhance the antiocclusion performance of our algorithm. The response losses of DCF reveal the impacts of adversaries so that they are used to select an appropriate mask. And then, we provide an optimization scheme of object feature selection based on the singular values extracted from histogram of oriented gradient (HOG) feature and convolutional neural network (CNN) feature respectively. Moreover, to overcome the scale changes of the object image, a multidimensional templates set is proposed and the best one is determined by the maximum of their DCF responses. Finally, we add the background patches around the region of interest (ROI) into the sample set to suppress the background clutter. The tracking algorithm we proposed in this paper is compared with some other algorithms in both the UAV video sequence and the OTB dataset. The experimental results show that our DCF-GA algorithm is effective when the object is partially occluded and when the size of object image changes.","PeriodicalId":236106,"journal":{"name":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124863997","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}
Lantao You, Yuejuan Han, Xi Wang, Chen Zhou, Rui Gu, Chen Lu
{"title":"Structure Connectivity and Substructure Connectivity of Alternating Group Graphs","authors":"Lantao You, Yuejuan Han, Xi Wang, Chen Zhou, Rui Gu, Chen Lu","doi":"10.1109/PIC.2018.8706296","DOIUrl":"https://doi.org/10.1109/PIC.2018.8706296","url":null,"abstract":"The alternating group graph, denoted by AGn, is one of the popular interconnection networks. In this paper, we consider two network connectivities, H-structure-connectivity and H-substructure-connectivity, which are new measures for a network’s reliability and fault-tolerability. We say that a set F of connected subgraphs of G is a subgraph-cut of G if G−V (F) is a disconnected or trivial graph. Let H be a connected subgraph of G. Then F is an H-structure-cut, if F is a subgraph-cut, and every element in F is isomorphic to H. And F is an H-substructure-cut if F is a subgraph-cut, such that every element in F is isomorphic to a connected subgraph of H. The H-structure-connectivity(resp. H-substructure-connectivity) of G, denoted by κ(G;H)(resp. κs(G;H)), is the minimum cardinality of all H-structure-cuts(resp. H-substructure-cuts) of G. In this paper, we will establish both κ(AGn;H) and κ(AGn;H) for the alternating group graph AGn and H ∈{K1,K1,1,K1,2}.","PeriodicalId":236106,"journal":{"name":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125919780","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":"Research of Dynamic Load Identification for Rock Roadheader","authors":"Hongjie Shi, Xiangmin Dong, N. Zhang, Ning Ding","doi":"10.1109/PIC.2018.8706319","DOIUrl":"https://doi.org/10.1109/PIC.2018.8706319","url":null,"abstract":"As a part of automatic control system of the rock roadheader, the identification of dynamic load is of great significance to improve the intelligent level and increase lifetime of roadheaders. In order to solve the problem of rock roadheaders such as dynamic load real-time identification, a kind of dynamic load identification device of rock roadheader based on RBF neural network is proposed according to characteristics of mining roadway, and designs of hardware and software of the identification device are introduced in details. The device realizes feature extraction and recognition of dynamic load and achieves effective distinction of rocks with different hardness.","PeriodicalId":236106,"journal":{"name":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122589488","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":"A Prediction Based Server Cluster Capacity Planning Strategy","authors":"Xiaofu Huang, Jian Cao, Yudong Tan","doi":"10.1109/PIC.2018.8706273","DOIUrl":"https://doi.org/10.1109/PIC.2018.8706273","url":null,"abstract":"Cloud computing is an Internet-based service which provides shared virtual resource and data to accomplish certain computation. In order for the servers to have sufficient resources when the request arrives, as well as save server resources as much as possible, we propose a prediction-based server capacity planning and dynamic scheduling algorithm. There are mainly three steps in our capacity planning algorithm. The first step characterizes the given data on several indices and then present an effective model in order to predict the oncoming demands in the near future. The second step generates the workload of servers combined with the predicted demands and then make capacity planning based on this workload. Thus it's obvious that the effectiveness of capacity planning depends on the accuracy of prediction to a great extent. Finally, a demand prediction based strategy on workload allocation is brought out. A dynamic resource allocation strategy is given to ensure the quality of service at any moment in future meanwhile taking energy consumption into consideration. The results of the experiment show that the required server number decreases by 33% after the prediction-based capacity planning applying on server scheduling.","PeriodicalId":236106,"journal":{"name":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129585536","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":"A Fast Visualization Method of Radiation Field Based on Target’s Geometric Feature","authors":"Junling Qin, D. Ren, Weiqing Li","doi":"10.1109/PIC.2018.8706136","DOIUrl":"https://doi.org/10.1109/PIC.2018.8706136","url":null,"abstract":"In the simulation of complex model’s radiation field, we usually use finite element mesh for visualization. However, finite element cannot represent target’s geometric feature accurately. In addition, huge number of patches will seriously affect rendering speed in real-time simulation. In this paper, we propose a method to map finite element mesh to geometric model surfaces, replacing the drawing of a dense finite element mesh with a geometric model drawing. The method mainly consists of four parts. First, the mapping between feature points and the texture is established by the non-parametric surface mapping skill. Second, based on the correspondence relation between feature points and the texture, the mapping between points on the geometric model surfaces to the finite element mesh is completed. Third, within the texture, bilinear interpolation is applied to get radiation field values of all the texture pixels. Finally, the texture, which represents radiation values of the target, is stored in form of PNG picture. This paper defines a texture for each part of the geometric model to represent radiation values. The drawing of geometric model is much faster than that of finite element mesh because the patches are reduced greatly. The simulation results show that this method can realize accurate and quick visualization of the target’s radiation field.","PeriodicalId":236106,"journal":{"name":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129303580","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":"A 3-Layer Structural Analysis Framework for Chinese Text Understanding","authors":"Siyuan Shen, Hao Lian, Jia Liu, Tieke He","doi":"10.1109/PIC.2018.8706323","DOIUrl":"https://doi.org/10.1109/PIC.2018.8706323","url":null,"abstract":"How to make the machine better understand human language has always been a hot topic. It greatly influences the efficiency and accuracy of knowledge extraction, intelligent question answering and other nature language processing applications. For this reason, researchers put forward multilingual analysis and language modeling methods, for example, the distributed feature representation fitting for the neural network models and so on. This paper argues that language analysis and modeling should start with the characteristics of the language itself. In seeing this, we have thoroughly studied a series of basic NLP analysis techniques and present our own three-layer language processing and analysis model. This model takes into account the characteristics of language at all levels, and tries to preserve most of the attributes of the sentence. Such design deals with the analysis and representation of language from a brand new perspective, which may inspire many other applications in the field of NLP.","PeriodicalId":236106,"journal":{"name":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"97 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129739328","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":"(Strong) Rainbow Connection Number of Line, Middle and Total Graph of Sunlet Graph","authors":"Yan Zhao, Shasha Li, Sujuan Liu","doi":"10.1109/PIC.2018.8706299","DOIUrl":"https://doi.org/10.1109/PIC.2018.8706299","url":null,"abstract":"A path is called a rainbow path if no two edges of it are colored the same. An edge-colored graph is rainbow connected if every two distinct vertices are connected by a rainbow path. The rainbow connection number of a connected graph G, denoted by rc(G), is the smallest number of colors needed to make G rainbow connected. A rainbow u – v geodesic in a graph G is a rainbow u – v path of length d(u,v), where d(u,v) is the distance between u and v in G. A graph G is strongly rainbow connected if there exists a rainbow u - v geodesic for every pair of distinct vertices u and v in G. The strong rainbow connection number of G, denoted by src(G), is the smallest number of colors needed to make G strongly rainbow connected.The line, middle and total graphs are not only important graph classes, but also have extensive application in interconnect network design. In this paper, we determine exact values of rc(G) and src(G) where G are line and middle graphs of sunlet graph. In fact, all values of rc(G) and src(G) for these graphs determined before are incorrect.","PeriodicalId":236106,"journal":{"name":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129176300","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":"Face Image Quality Quantitative Assessment for Forensic Identification of Human Images","authors":"Jinhua Zeng, Huaping Zhu, Shaopei Shi, Xiulian Qiu","doi":"10.1109/pic.2018.8706327","DOIUrl":"https://doi.org/10.1109/pic.2018.8706327","url":null,"abstract":"With the development of the face recognition technology, the face recognition techniques are more and more applied in the scenario of the forensic science. Forensic identification of human images is a forensic activity for verifying whether the questioned and the known face images are the same ones. The one to one face verification technique can be well applied in the above application. Researching on the effect of face image quality on the performance of face verification systems in the application of the forensic identification of human images leads to the problem of face image quality assessment. Firstly, we discuss and analyze factors that affect the assessment of face image quality in forensic identification of human images. The factors consist of the age, expression, imaging angle, image quality and others, which will influence the performance of the face verification system. Then we propose a quantitative analysis method for the assessment of face image quality, which is relied on the verification performance of face verification systems. The effect of face images under specific conditions is studied. The face image quality under the specific factor condition is quantitatively scored according to the similarity quantification value between face images calculated by the face verification system. For the implement of the face verification system, the deep learning based face recognition method is used for objective evaluation of the face image quality. The results in the paper have shown the important significance of our proposed method for the objective evaluation of face image quality, and for the reasonable selection of face images in videos in the practical cases of the forensic identification of human images.","PeriodicalId":236106,"journal":{"name":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125610055","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":"Research Progress of Security Protection for Dispatching Automation System","authors":"Yunshan Tang, Nibin Zou, Yangyang Shi, X. Wang","doi":"10.1109/PIC.2018.8706298","DOIUrl":"https://doi.org/10.1109/PIC.2018.8706298","url":null,"abstract":"Dispatching Automation System (DAS) has been widely used in many critical areas such as power dispatch, transport dispatch, and water dispatch. It provides a reliable guarantee for the development of social economy, which in turn puts forward higher quality requirements for DAS. Thus, security protection, which provides a basis for safe and stable operation, plays a crucial role in DAS. Although a number of studies focus on improving the protective ability of security on DAS, there is no comprehensive research on these techniques. To fill this gap, we conduct a preliminary research on DAS protection. In this paper, we present the DAS security risk taxonomy and reviews the corresponding protective works. Moreover, we also point out the future directions in DAS protection.","PeriodicalId":236106,"journal":{"name":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121948768","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":"A Traffic Flow Prediction Approach: LSTM with Detrending","authors":"Zheng Zhao, Yaying Zhang","doi":"10.1109/PIC.2018.8706313","DOIUrl":"https://doi.org/10.1109/PIC.2018.8706313","url":null,"abstract":"Traffic flow prediction plays a key role in many Intelligent Transportation System research and applications. It aims to forecast the forthcoming traffic conditions with the help of historical data. Urban traffic always has its morning and afternoon peak hours. We also observed that the urban traffic flow can always be divided into main trend data and its residual part. The main trend data presents a similar trend on different days. The residual data is time-variant part which reflects the short-term fluctuation of traffic condition over each day. Enlighted by detrending, Principal Component Analysis (PCA) method is applied to extract the main trend data in this paper. The residual data is obtained by subtracting the main trend data from the overall traffic flow data. Then Long Short-Term Memory (LSTM) model is proposed to predict the residual data. With main trend data and predicted residual data, the urban traffic flow can be predicted by the joint PCA and LSTM approach. Finally, the empirical study demonstrates the propose method outperforms similar traffic prediction models.","PeriodicalId":236106,"journal":{"name":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121979952","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}