{"title":"Dynamic Search Space Particle Swarm Optimization Approach for Portfolio Optimization","authors":"C. Feng, Yijiang Dong, Yuehan Jiang, Maopeng Ran","doi":"10.1145/3232651.3232666","DOIUrl":"https://doi.org/10.1145/3232651.3232666","url":null,"abstract":"The multi-objective programming model of portfolio investment is based on the Markowitz portfolio theory with risk and return considered in the meantime. There have been many studies for portfolio optimization problem and over recent years heuristic techniques are widely used and proved to have good performance. The main purpose of the present study is the solving of portfolio optimization problem by using Particle Swarm Optimization (PSO). Thus in this paper, we propose an approach based on a dynamic search space particle swarm optimization algorithm (DSSPSO) for the portfolio selection problem. DSSPSO is proposed to improve the performance of PSO combining the classical particle swarm optimization algorithm philosophy and population entropy. To verify the effectiveness of the algorithm, we used the closing prices of thirty sample stocks in Chinese stock market and carried out several sets of experiments. The results show that DSSPSO approach is suitable in portfolio optimization and is able to find securities portfolio with certain interests at low risk. Also we evaluate the effect of the value of risk aversion parameter on the results and found that the algorithm can effectively control risk. Furthermore, two groups of contrast experiments are carried out to substantiate the conclusion and suggest the application for future predictions.","PeriodicalId":365064,"journal":{"name":"Proceedings of the 1st International Conference on Control and Computer Vision","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116149323","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":"Smart Gloves: A novel 3-D Work Space Generation for Compound Two Hand Gestures","authors":"H. Bhardawaj, Mohit Dhaker, K. Sivani, H. Vardhan","doi":"10.1145/3232651.3232670","DOIUrl":"https://doi.org/10.1145/3232651.3232670","url":null,"abstract":"Speechlessness is a colossal barrier of communication between the ordinary people and the speech impaired. This paper presents a novel methodology with a working model which is used to convert the sign language to speech in order to help speech impaired people. It uses flex sensor and Inertial Measurement Unit in order to determine the position of finger as well as the position of hand in 3-Dimensional space. These sensors are embedded into the gloves, which when processed, outputs the accurate gesture which has been made by the user, thereby making it smart. The paper also presents a unique division of a matrix in 3-Dimensional space comprising of states. These states have to be estimated in a generalized manner in order to be used by anybody irrespective of their gender or height. The paper also highlights the use of both hands for compound two hand gestures with static and dynamic gesture recognition system. The smart gloves can further be used in a variety of applications such as motion sensing gaming, remote medical diagnosis, and robotics.","PeriodicalId":365064,"journal":{"name":"Proceedings of the 1st International Conference on Control and Computer Vision","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115755954","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 and Implementation of Image Encryption System Based on Plaintext Association","authors":"Biaobiao Wang, Hengjian Li","doi":"10.1145/3232651.3232663","DOIUrl":"https://doi.org/10.1145/3232651.3232663","url":null,"abstract":"The traditional chaotic mapping encryption algorithm has the disadvantage of being vulnerable and insecure. Therefore, in order to improve the anti-attack capability and security of encryption system, an improved image encryption Method-plaintext association scrambling image encryption algorithm is proposed. The encryption process consists of two diffusion algorithms and a scrambling algorithm, and the inverse of the encryption process is the decryption process. The simulation results show that the system can obtain better encryption effect, and the security is higher than the traditional encryption algorithm.","PeriodicalId":365064,"journal":{"name":"Proceedings of the 1st International Conference on Control and Computer Vision","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115905695","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":"Palmprint Template Protection Scheme with Matrix Transformation","authors":"Hengjian Li, Jian Qiu, Changzhi Yu","doi":"10.1145/3232651.3232662","DOIUrl":"https://doi.org/10.1145/3232651.3232662","url":null,"abstract":"In this paper, we proposed a palmprint template protection scheme based on matrix transformation. Firstly, the competition code features of original palmprint is extracted through the Gabor filters. Then, a general permutation matrix is generated randomly and two elementary permutation matrices are obtained by changing any two rows of it. Nextly, irreversible matrix is generated by XORing operation. Finally, cancelable palmprint templates are produced by multiplying the irreversible matrix and the original palmprint feature. Our experiments were carried out in a public database of Hong Kong Polytechnic University. The experimental results show that our cancelable palmprint scheme can not only ensure high safety but also meet the recognition accuracy requirements.","PeriodicalId":365064,"journal":{"name":"Proceedings of the 1st International Conference on Control and Computer Vision","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133027188","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":"Death Escape: A Case Study of Merging Ubiquitous Activities into a Hardcore Computer Game","authors":"Prawit Yasothorn, Tachasit Chueprasert, Witchaya Towongpaichayont","doi":"10.1145/3232651.3232655","DOIUrl":"https://doi.org/10.1145/3232651.3232655","url":null,"abstract":"Ubiquitous games can be designed in several settings. This paper presents a case study of designing and developing Death Escape, a role-playing survival ubiquitous game, which is intended to trans-form user's daily-life activities to in-game player's stats in the con-cept of 'avatar grows as the user grows'. This game is expected to blend the game mechanics with user's behaviours seamlessly. The game collects data from built-in inertia sensors in mobile phones (accelerometer and gyroscope) and GPS, utilises human medical data to transform the collected data into in-game meanings realis-tically, and presents those in-game values to motivate the user to maintain healthy behaviours. This paper describes those methods of data collections and transformations as well as additional find-ings during the process of design and development. This can set an example for those who are developing ubiquitous games which are blended with the user's lifestyle.","PeriodicalId":365064,"journal":{"name":"Proceedings of the 1st International Conference on Control and Computer Vision","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133623953","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":"Automatic Detection of Round Timber in Digital Images Using Random Decision Forests Algorithm","authors":"Y. V. Chiryshev, A. Kruglov, Anastasia Atamanova","doi":"10.1145/3232651.3232667","DOIUrl":"https://doi.org/10.1145/3232651.3232667","url":null,"abstract":"The problem of automatic detection and isolation of logs in a pile based on digital image processing is investigated within this paper. At present, the approaches to determination of the qualitative and quantitative characteristics of round timber by image processing. The paper gives a review of existing methods and presents a detection algorithm that develops the previously described approach based on the histogram of oriented gradients with random decision forest. The authors thoroughly consider the problem of detector adjustment by multiple training and empirical selection of such parameters as the number, maximum depth of trees and the characteristic size of log abuts in the images of the training sample. The parameters of the detector are selected based on the requirement of high recognition rate. Due to this adjustment the algorithm was significantly improved so it surpasses analogs or shows comparable results with respect to accuracy.","PeriodicalId":365064,"journal":{"name":"Proceedings of the 1st International Conference on Control and Computer Vision","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121608811","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":"Ultrasonic Ray-Tracing Based Endocardial Surface Reconstruction","authors":"Rao Fu, Yifan Fu, Cheng Wen, Riqing Chen, Chunxu Shen, Jian Wu","doi":"10.1145/3232651.3232654","DOIUrl":"https://doi.org/10.1145/3232651.3232654","url":null,"abstract":"Accurate and fast reconstruction of the endocardium is a fundamental step for performing a successful ablation operation. This paper proposes an ultrasonic ray-tracing based endocardial surface reconstruction algorithm, which utilizes a new proposed non-contact ultrasonic catheter. The proposed catheter is composed of an electromagnetic position sensor and three miniature transducers, and it can sample a point cloud from the targeted endocardium in real-time. The 3D Delaunay triangulation of the sampled point cloud is first calculated, and then each tetrahedron is marked internal or external via ultrasonic ray-tracing and the boundary of all internal tetrahedra is extracted as a coarse surface mesh. Finally, HC Laplacian is applied to smooth the coarse mesh for the benefit of avoiding shrinkages. The basic idea of the proposed surface reconstruction algorithm relies on the fact that tetrahedra intersecting with the ultrasonic rays provide a volumetric estimation of the measured heart. Simulations on a heart phantom are given to support the superiority of the proposed algorithm. Compared to the prior arts, the proposed algorithm could reconstruct a realistic endocardial surface while preserving the features of vena cava and atrium appendage without shrinkages.","PeriodicalId":365064,"journal":{"name":"Proceedings of the 1st International Conference on Control and Computer Vision","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130153146","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":"Convolutional Visual Feature Learning: A Compositional Subspace Representation Perspective","authors":"M. Teow","doi":"10.1145/3232651.3232672","DOIUrl":"https://doi.org/10.1145/3232651.3232672","url":null,"abstract":"The main contribution of this paper is to provide a new perspective to understand the end-to-end convolutional visual feature learning in a convolutional neural network (ConvNet) using empirical feature map analysis. The analysis is performed through a novel mathod called compositional subspace model using a minimal ConvNet. This method allows us to better understand how a ConvNet learn visual features in a hierarchical manner. A handwritten digit recognition using MNIST dataset is used to experiment the empirical feature map analysis. The experimental results conclude our proposal on using the compositional subspace model to visually understand the convolutional visual feature learning in a ConvNet.","PeriodicalId":365064,"journal":{"name":"Proceedings of the 1st International Conference on Control and Computer Vision","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132913504","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":"Object Tracking based on KCF and Sparse Prototypes","authors":"Xiaojia Xie, Feng Wu, Qiong Liu","doi":"10.1145/3232651.3232659","DOIUrl":"https://doi.org/10.1145/3232651.3232659","url":null,"abstract":"Recently, many correlation filter-based tracking methods have received lots of attention and achieved great success in visual object tracking. Among correlation filter-based methods, the most influential one is kernelized correlation filter (KCF) which has excellent performance both in efficiency and accuracy. However, due to the virtual nature of cyclic shifts samples, the training and detecting of KCF are imprecise. To alleviate the influence of virtual samples, we take the following two measures. 1) We extract image patches at positions of samples which have local maximum KCF responses and treat them as candidates. We further evaluate their true responses. 2) Instead of estimate the target position directly according to the KCF results, we use the sparse prototypes (SP) as the target model to evaluate the similarities between candidates and target. The results of KCF and SP are combined by adaptive weight to estimate the target position. In addition, KCF degrades due to its unreasonable update scheme. To do reliable update, we set different update modes and generate an adaptive update rate based on two tracking confidence indices. Experiments on a commonly used tracking benchmark show that the proposed method improves KCF about 8% on the average success rate and 10% on the precision, and achieves better performance than other state-of-the-art trackers.","PeriodicalId":365064,"journal":{"name":"Proceedings of the 1st International Conference on Control and Computer Vision","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126156620","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":"Estimation of Cauliflower Weight Based on Multiple Linear Regression Modelling","authors":"Xia-Xia Guo, Gui-hong Zhou, Hong Cheng","doi":"10.1145/3232651.3232656","DOIUrl":"https://doi.org/10.1145/3232651.3232656","url":null,"abstract":"In view of the problem that the traditional electronic scale can't predict the prenatal yield of the cauliflower, which having the characteristics of irregular shape and uneven density distribution. In this paper a method is proposed to predict the weight of the cauliflower based on multiple linear regression models. Using Kinect scanning equipment to obtain 3D model of cauliflower, the length, width, height, max_area and volume of the cauliflower 3D model were selected as features. The optimal parameters of the two regularized models, ridge regression and LASSO were selected by cross-validation. In this paper, the K-fold cross-validation (K = 5) was used to divide and select the test set and the train set for small sample. Ridge Regression and LASSO models, as well as optimized models, were evaluated using decision coefficients and relative errors. The experimental results were compared and analyzed. The results show that the optimized LASSO model has the best prediction accuracy for the weight of cauliflower.","PeriodicalId":365064,"journal":{"name":"Proceedings of the 1st International Conference on Control and Computer Vision","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129415715","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}