{"title":"A Note on the Sixth Power Mean Value of the Generalized Quadratic Gauss Sums","authors":"X. Ai, XiangKun Ji","doi":"10.1145/3387168.3387251","DOIUrl":"https://doi.org/10.1145/3387168.3387251","url":null,"abstract":"In In this paper, the sixth mean value of the generalized quadratic Gauss sums considered by Y.F. He and W.P. Zhang is further studied when module is an arbitrary square-full number. The precise calculation formula is obtained. This improves the existed research result by averting the restriction that the module being an odd square-full number.","PeriodicalId":346739,"journal":{"name":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124809204","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 Resource Crowd Funding Model Based on Cooperative Game in Fog Computing","authors":"Xuehong Chen, Y. Sun, Xiaolong He","doi":"10.1145/3387168.3387210","DOIUrl":"https://doi.org/10.1145/3387168.3387210","url":null,"abstract":"Compared with cloud computing, fog computing has a better performance on location-awareness, mobility support, and time delay. However, the resource quantity and resource types owned by the fog node are relatively limited, which cannot meet the demand of high-performance computing tasks. The scheme of resource sharing can resolve this problem. Therefore, in this paper, we proposed a new resource sharing scheme called resource crowd funding based on cooperative game, which can realize the resource sharing among different fog computing nodes. The resource utilization rate has increased and the fog nodes can acquire additional rewards through task cooperation in this new model, which can be shown in the simulations.","PeriodicalId":346739,"journal":{"name":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125130539","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":"Analysis on Risk of Stock Market Via Extreme Value Theory","authors":"Lijun Liu, Yongmei Ding, Yunfeng Peng","doi":"10.1145/3387168.3389113","DOIUrl":"https://doi.org/10.1145/3387168.3389113","url":null,"abstract":"Risk is the perpetual theme in the stock market. Chinese financial market risks have become complicated as Chinese economic globalization further deepens, which makes the measurement tools critical and significant. Extreme distribution usually has been chosen for assessing the stock prices, further the Block Maxima Model (BMM) and the Peak-Over-Threshold (POT) model have been established. In our paper, the Value at risk (VaR) and Expected Shortfall (ES) are calculated via the above two models through daily rate of return from Jun. 1 of 2006 to April 1 of 2018 for Shanghai Stock Exchange index. We compare the two assessing methods for improving the accuracy of risk measurement, which shown that the POT is more stable than the BMM to risk measurement.","PeriodicalId":346739,"journal":{"name":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130882107","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-Feature Fusion Aerial Image Segmentation in Complex Background","authors":"R. Yang, X. Qian, Bing Zhang","doi":"10.1145/3387168.3387237","DOIUrl":"https://doi.org/10.1145/3387168.3387237","url":null,"abstract":"The hybrid method of initial partitioning and region merging is widely used in aerial image segmentation. The existing initial partitioning methods are the watershed transform of the Edge Strength Map (ESM) of aerial images. Therefore, if watershed algorithm is used in images with discontinuous edges and lots of noise, it will be easy to produce \"improper segmentation\". In order to form high-quality initial partitions, we propose a new MRF (YMRF) image segmentation method from the perspective of fully exploiting the image spatial information. The key points of region merging are region similarity measurement, merging process and merging stopping moment, but the problem of region label selection is ignored after the region pair which will be merged is selected. So, we propose a kind of image scene to reflect the necessity of paying attention to this problem and develop a region merging label selection mechanism for the image scene. To solve the problem that merging stopping moment tends to form the result with high homogeneity in the domain, we propose a optimal merging state, which can weaken the homogeneity in the domain. Experimental results show that our algorithm is more effective than the existing methods, when they are used in our unique dataset.","PeriodicalId":346739,"journal":{"name":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128883711","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}
Klitos Christodoulou, Elias Iosif, S. Louca, Marinos Themistocleous
{"title":"Identity Discovery in Bitcoin Blockchain: Leveraging Transactions Metadata via Supervised Learning","authors":"Klitos Christodoulou, Elias Iosif, S. Louca, Marinos Themistocleous","doi":"10.1145/3387168.3387212","DOIUrl":"https://doi.org/10.1145/3387168.3387212","url":null,"abstract":"Blockchain-based systems such as the one proposed to support the Bitcoin protocol are primarily used to enable the execution of financial transactions in a decentralized manner. The characteristics of blockchains have inspired the development of new types of applications that are shifting from its original purpose. Besides supporting the recording of crypto-currency transactions blockchains are also being exploited as mediums of recording arbitrary chunks of data. One technique for embedding such data on the public Bitcoin blockchain is using the OP_RETURN opcode creating an unspendable transaction. In this paper, we leverage data retrieved from such transactions to reveal the identity of the transacting entity. In more detail, we cast the problem of identity discovery as a classification problem. An empirical evaluation using various supervised classification models (from Naive Bayes to deep learning) yield up to 99.98% classification accuracy. In addition, it is confirmed that our feature engineering methodology on using the leading characters of the OP_RETURN instruction holds a significant discrimination power when compared against the baseline.","PeriodicalId":346739,"journal":{"name":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121102811","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":"Tactics for Proving Separation Logic Assertion in Coq Proof Assistant","authors":"Siran Lei, Mengqi Cheng, Jianguo Jiang","doi":"10.1145/3387168.3387257","DOIUrl":"https://doi.org/10.1145/3387168.3387257","url":null,"abstract":"The verification of the correctness of large programs, particularly operating systems is an unmanageable but important endeavor. we are interested in verifying C programs with formal methods, the logic is separation logic, a Hoare-style program logic. In this paper, we present a simple extension of the syntax of separation logic assertion on existing verification system in Coq proof assistant to make assertions more versatile and flexible to describe the state of programs. Moreover, we develop several tactics for proving some related assertions to reduce manual proof as much as possible and improve the efficiency of verification.","PeriodicalId":346739,"journal":{"name":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132684134","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":"EACH: Efficient Deployment of Sensor Nodes and Arrangement of Cluster Heads in Hexagon-based WSNs","authors":"Chung-Shuo Fan","doi":"10.1145/3387168.3387217","DOIUrl":"https://doi.org/10.1145/3387168.3387217","url":null,"abstract":"A wireless sensor network (WSN) consists of sensor nodes (SNs) with sensing, computation and wireless communication capabilities. One of the major challenges in designing a well-connected WSN is the coverage of the sensing field, which are depends on various factors (e.g., the sensing model, network topology, and deployment strategy). There are, in general, two types of deployment methods in WSNs, which are random deployment and deterministic deployment. Random deployment of the sensor nodes can cause unbalanced traffic pattern in WSNs. That is, cluster heads (CHs) around the sink have larger load than those farther away from the sink. Hence, CHs close to the sink exhaust their energy earlier. To overcome this problem, we, for the first time, propose an Efficient deployment of sensor nodes and Arrangement of Cluster Heads in hexagon-based WSNs (called \"EACH\"). Simulation results validate our theoretical analysis and show that the EACH scheme achieves satisfactory coverage ratio, significantly balances the energy consumption among SNs, and extends network lifetime. The methodology can also be exploited to further analyze and compare deterministic deployment strategies.","PeriodicalId":346739,"journal":{"name":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133987550","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":"Parallelizing Image Processing for Higher Efficiency","authors":"Aaklit Taneja, M. Khare","doi":"10.1145/3387168.3387177","DOIUrl":"https://doi.org/10.1145/3387168.3387177","url":null,"abstract":"This paper focuses on using parallelization techniques for image processing, particularly focusing on Median Filtering. Parallelization is different from simple scheduling because unlike working on scheduling which works discretely, here we focus on simultaneous operations based on multi-threaded processors. For doing this we rely on the multiple cores and their ability to divide algorithms such as median filter into different processes which work simultaneously.","PeriodicalId":346739,"journal":{"name":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122947322","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":"Gait Energy Image Based on Static Region Alignment for Pedestrian Gait Recognition","authors":"Zhong Li, Jiulong Xiong, Xiangbin Ye","doi":"10.1145/3387168.3387201","DOIUrl":"https://doi.org/10.1145/3387168.3387201","url":null,"abstract":"The Gait Energy Image (GEI) spatially aligns, accumulates, and averages all the frames of a gait cycle, so there is a very high requirement for the registration of moving targets. Accurate registration of moving targets is important for the synthesis of Gait Energy Image (GEI). In this paper, we propose a new Gait Energy Image to improve the registration effect: Gait Energy Image based on static region alignment (SRA-GEI). Firstly, we select the minimum circumscribed rectangle containing the moving human body from the gait sequence. Secondly, we scale the minimum circumscribed rectangle to the specified height and calculate the gait cycle by analyzing the distance between the two feet. Finally, we propose a new registration method to generate Gait Energy Image by calculating and aligning the centroid of the static region of the gait image. This paper explores the performance of SRA-GEI with KNN based on the CASIA Dataset B. The experimental results have shown that the proposed method achieves better recognition rate compared with GEI which aligned by overall centroid.","PeriodicalId":346739,"journal":{"name":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123846961","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":"Extraction of ORB Features with an Improved Method","authors":"Bingshu Yang, Zhiqiang Wang, Xuejun Yu","doi":"10.1145/3387168.3387169","DOIUrl":"https://doi.org/10.1145/3387168.3387169","url":null,"abstract":"Improvement of the extraction means of the ORB (Oriented FAST and Rotated BRIEF) feature primarily includes optimization concerning excessive aggregation of ORB features and the improvement of the problem that the correct features could not be extracted when regional image illumination is too bright. First, the local self-adaptive threshold was calculated on the basis of the threshold and FAST features were extracted based on the local threshold as the candidate feature points. Then, image iteration was divided into disparate regions and the optimal feature points of the local region were selected as the extraction result. The experimental data showed that the aggregation level of the improved ORB feature lowered more obviously than that of the ORB feature, which adapted to local illumination and the threshold value with high stability; however, the time still met real-time demands.","PeriodicalId":346739,"journal":{"name":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128623187","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}