{"title":"Feature matching using sequential evaluation on sample consensus","authors":"Chao-xia Shi, Yanqing Wang, Li He","doi":"10.1109/SPAC.2017.8304294","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304294","url":null,"abstract":"Consensus evaluation is one of the key issues in vision based feature matching. To improve both efficiency and accuracy of local feature matching, we proposed a Sequential Evaluation on Sample Consensus (SESAC). The addressed approach first sorts the matching pairs in terms of the similarity of the corresponding features, then it sequentially selects the samples, and uses the least squares method to fit the model, by which to reject the outlier points and update the optimal solution. The experimental results demonstrate that compared with the classic PROSAC and RANSAC algorithm, SESAC algorithm can achieve similar accuracy, whereas reduce the running time greatly.","PeriodicalId":161647,"journal":{"name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116892536","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":"Cooperative motion control method for humanoid robot based on SOCP","authors":"Zhong Qiu-bo","doi":"10.1109/SPAC.2017.8304321","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304321","url":null,"abstract":"According to the characteristics of cooperative motion control of humanoid robot, a cooperative motion model of two humanoid robot in ball handling was deduced and a control method based on second order cone principle was introduced to maintain the stability in movement for multi-robot. By deducing constraints of stability in cooperative movement, an equation of SOCP was constructed, and the stability control problem was converted for solving equations of second order cone. Finally, the effectiveness of the proposed method is verified by simulation and experiment.","PeriodicalId":161647,"journal":{"name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117254608","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":"Forecast customer flow using long short-term memory networks","authors":"Zongming Yin, Junzhang Zhu, Xiaofeng Zhang","doi":"10.1109/SPAC.2017.8304251","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304251","url":null,"abstract":"Customer flow forecast is of practical importance in business intelligence domain. This paper particularly investigates an interesting issue, i.e., how to forecast off-line customer flow for over two thousand shops by considering both online customer behaviors and off-line periodic customer behaviors. Apparently, it is difficult to directly model these underlying dependent variables via traditional regression models. To this end, the proposed approach first introduces various extra information to incorporate more underlying factors. Then, the hierarchical linear model is performed to screen out insignificant factors. On the basis of this reduced feature space, the second-order flow factor is incorporated to model the variance term. The combined new feature set is then used for the learning of a number of Long Short Term Memory (LSTM) models. The rigorous experiments have been performed and the promising results demonstrate the superiority of the proposed approach which indicates the wide applicability of the proposed forecast model.","PeriodicalId":161647,"journal":{"name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127482770","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":"Broad learning system: Structural extensions on single-layer and multi-layer neural networks","authors":"Zhulin Liu, C. L. P. Chen","doi":"10.1109/SPAC.2017.8304264","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304264","url":null,"abstract":"Broad Learning System proposed recently [1] demonstrates efficient and effective learning capability. Moreover, fast incremental learning algorithms are developed in broad expansions without an entire retraining of the whole model. Compared with the systems in deep structure, the inspired system provides competitive results in classification. In this paper, the broad learning algorithms and incremental learning algorithms are applied to commonly used neural networks, such as radial basis function neural networks (RBF) and hierarchical extremal learning machine (H-ELM). For RBF, the resulting models, called BLS-RBF, are established by regarding the radial basis function as the mapping in the enhancement nodes, and additional enhancement nodes are added if the network needs expansion widely. For H-ELM, the established model, is developed for the incremental extension of multilayer structure. The developed BLS models and algorithms are very effective and efficient in classification. Finally, experimental results are presented.","PeriodicalId":161647,"journal":{"name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126077725","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":"Distributed randomized singular value decomposition using count sketch","authors":"Hongwe Chen, Jie Zhao, Qixing Luo, Yajun Hou","doi":"10.1109/SPAC.2017.8304273","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304273","url":null,"abstract":"Compared with other recommendation algorithms, Matrix decomposition is frequently used in the current recommendation system. It can not only lead to better results, but also can fully take the influence of various factors into account, which explains its good scalability. Matrix decomposition includ-es SVD(Singular Value Decomposition), non-negative matrix decomposition, Latent Factor Model and some other traditional matrix decomposition techniques is designed to approximate a high-dimensional matrix with low-dimensional. As a perfect technique in recommendation system, SVD is traditionally expert at dense matrix decomposition. However, real rating matrix are sparse, and have high time complexity of SVD, if the matrix size increases rapidly, the efficiency must become unacceptable. The combination of random algorithm and matrix decomposition turns traditional matrix decomposition into random matrix decomposition technique under distributed system environment. The random singular value decomposition technique illustrated in the following content can be at the expense of little accuracy under the premise of greatly improving the efficiency of the calculation.","PeriodicalId":161647,"journal":{"name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122564638","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":"Gender classification of full body images based on the convolutional neural network","authors":"Zhenxia Yu, Chengxuan Shen, Lin Chen","doi":"10.1109/SPAC.2017.8304366","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304366","url":null,"abstract":"Gender classification is one of the most interesting and challenging problems in computer vision and has been widely studied based on facial images. However, the images of human we taken from the real-world surveillance are mostly full body and relatively blurry, which is much more difficult to classify due to different poses and backgrounds in unconstrained scenarios. In this paper, we propose a new network structure based on a convolutional neural network (CNN), which is less complicated and has a small number of layers. Moreover, it can achieve a high accuracy with even trained with limited data. We evaluate our method on the dataset collected from real-world video surveillance and compare various learning algorithms including Alex Net and Google Net. The experimental results showed that the proposed model achieved better results than the tested state-of-the-art network structures.","PeriodicalId":161647,"journal":{"name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129754572","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":"Reflective type blood oxygen saturation detection system based on MAX30100","authors":"Jiaxi Wan, Yuhua Zou, Ye Li, Jun Wang","doi":"10.1109/SPAC.2017.8304350","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304350","url":null,"abstract":"Oxygen is the key material to human's life, and oxygen saturation is one of the important indexes reflecting organic oxygen delivery status. Determining oxygen saturation in human blood by transmittance oxymetry is well developed as a monitoring technique, which is applied widely in clinical diagnosis or house health care. However, reflectance detecting is necessary in many circumstances, such as cerebral oxygen saturation, muscle oxygen saturation, or fetal oxygen saturation monitoring. So the reflective type oxygen saturation detection system gradually has become main flow of development. Based on the principle of oxygen saturation measurement, this paper introduces a blood oxygen saturation detection system design scheme based on the integrated chip MAX30100, which can simplify the circuit design, reduce system footprint, reduce the designing time and system power consumption. Through introduces the system hardware and software structure, signal processing methods and other aspects of the study to achieve the fingertip pulse signal acquisition and noise reduction processing. Through practical test, the system prototype machine realizes the function of pulse oxygen saturation detection.","PeriodicalId":161647,"journal":{"name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130561602","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}
Fei Long, Weihua Ou, Kesheng Zhang, Yi Tan, Yunhao Xue, Gai Li
{"title":"Discriminative multiview nonnegative matrix factorization with large margin for image classification","authors":"Fei Long, Weihua Ou, Kesheng Zhang, Yi Tan, Yunhao Xue, Gai Li","doi":"10.1109/SPAC.2017.8304247","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304247","url":null,"abstract":"Image classification has attracted lots of attentions in recent years. To improve classification accuracy, multiple features are usually extracted to represent the context of images, which imposes a challenge for the combination of those features. To address this problem, we present a discriminative nonnegative multi-view learning approach for image classification based on the observation that those features are often nonnegative. For discrimination, we utilize class label as an auxiliary information to learn discriminative common representations through a set of nonnegative basis vectors with large margin. Meanwhile, view consistency constraint is imposed on the low-dimensional representations and correntropy-induced metric (CIM) is adopted for the measurement of reconstruction errors. We utilized half-quadratic optimization technique to solve the optimization problem and obtain an effective multiplicative update rule. Experimental results demonstrate the learned common latent representations by the proposed method are more efficient than other methods.","PeriodicalId":161647,"journal":{"name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127046099","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":"Emotional contagion and personality driven multi-robot task allocation algorithm","authors":"Baofu Fang, Zaijun Wang, Yong Li, Wang Hao","doi":"10.1109/SPAC.2017.8304330","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304330","url":null,"abstract":"Many scholars in the fields of psychology and computer science have already carried out in-depth research on emotions and established some related models. But how to deal with the cooperation among emotional robots in task allocation is a new research issue. In this paper, we research the emotion and personality of robot, the influencing mechanism of emotions among robots, and propose an algorithm of multi-robot task allocation based on emotional contagion which turns robots' emotions into a positive state. According to different emotion values and personalities, we select the robot with a higher value of leadership as the team leader, and then choose other team members based on emotional contagion, thus forming a team that meets the mission requirements. Finally, experiments analyze factors affecting emotional contagion model and verify the effectiveness of the proposed algorithm.","PeriodicalId":161647,"journal":{"name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116300762","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":"Multi-angle SAR image fusion algorithm based on visibility classification of non-layover region targets","authors":"Shibing Zhu, Da Ran","doi":"10.1109/SPAC.2017.8304355","DOIUrl":"https://doi.org/10.1109/SPAC.2017.8304355","url":null,"abstract":"In order to reduce the layover region in traditional single-angle synthetic aperture radar (SA-SAR) image of mountainous area, a multi-angle synthetic aperture radar (MA-SAR) image fusion algorithm based on visibility classification of non-layover region targets is proposed. By defining a practical index named multi-angle visibility of non-layover region targets which used for automatic pixel classification, the proposed algorithm calculates the visibility index of every pixel of SA-SAR images obtained from different observation angles and fuses those pixels with the same visibility index to form the fused image. The fused image can effectively eliminate all adverse effects on target detection and classification which caused by the phenomenon of layover, and realize a precision MA-SAR imaging of mountainous area. The simulation results have verified the effectiveness of the proposed algorithm.","PeriodicalId":161647,"journal":{"name":"2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122283703","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}