发布求助
文献互助 智能选刊 最新文献

Conference on Electronic Information Engineering and Data Processing最新文献

筛选
英文 中文
Research on binocular stereo matching algorithm based on dynamic tilt window 基于动态倾斜窗的双目立体匹配算法研究
Conference on Electronic Information Engineering and Data Processing Pub Date : 2023-05-26 DOI: 10.1117/12.2682455
Chengjun Yu, Yi Li
{"title":"Research on binocular stereo matching algorithm based on dynamic tilt window","authors":"Chengjun Yu, Yi Li","doi":"10.1117/12.2682455","DOIUrl":"https://doi.org/10.1117/12.2682455","url":null,"abstract":"Aiming at the low precision of the traditional binocular stereo matching algorithm in calculating the matching cost of the strong texture area, a binocular stereo matching algorithm based on a dynamic tilted window is proposed. First, the absolute value of brightness or color difference is replaced by random initialization of pixels, and then the traditional Census cross-domain transformation is replaced by a dynamically tilted disparity plane. For the traditional algorithm, the matching accuracy is improved, making the window more adaptable to the actual environment. In the cost calculation step, a gray histogram is added as an indicator for judging the texture difference, which improves the matching cost in the strong texture area; on this basis, iterates from space propagation, plane propagation to view propagation. In the parallax optimization step, left-right consistency detection and parallax filling are used to further optimize the reduction of the false matching rate. The experimental data is compared with the standard images on the Middlebury dataset. The results show that the average error matching rate of the disparity map generated by the stereo matching algorithm of the dynamic tilted window of this method reaches 4.03%. Compared with the Census algorithm, the matching error rate is respectively reduced. 21.1%, effectively improving the matching accuracy; compared with other algorithms, the false matching rate for high texture areas increased by 1.2% and 3.71%.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124393423","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
A blockchain-based intelligent transportation devices and data management method 一种基于区块链的智能交通设备及数据管理方法
Conference on Electronic Information Engineering and Data Processing Pub Date : 2023-05-26 DOI: 10.1117/12.2682393
Jun Li, Guangjun Gong
{"title":"A blockchain-based intelligent transportation devices and data management method","authors":"Jun Li, Guangjun Gong","doi":"10.1117/12.2682393","DOIUrl":"https://doi.org/10.1117/12.2682393","url":null,"abstract":"The existing intelligent transportation system for device management and control may have some challenges, such as simplistic traffic device management, difficult traffic data storage and management, and difficult to guarantee traffic data security. These challenges all bring adverse effects to the smooth development of the work of the traffic department. To address the above problems, this paper designs a blockchain-based intelligent transportation device and data management method. The information of the devices connected to the system is anchored to the blockchain through the blockchain deposition technology, and the whole life cycle of the devices is managed. The data collection and distributed storage of the traffic devices are realized based on the smart contract technology. Combined with the tamper-evident and traceable characteristics of blockchain, this method provides scientific management of device and device data with high security and scalability, and provides ideas and methods for building a security management architecture for transportation device control system.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114843613","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
Underwater image enhancement based on residual network and image formation model 基于残差网络和图像形成模型的水下图像增强
Conference on Electronic Information Engineering and Data Processing Pub Date : 2023-05-26 DOI: 10.1117/12.2682384
Xiaohu Feng, Anjun Song
{"title":"Underwater image enhancement based on residual network and image formation model","authors":"Xiaohu Feng, Anjun Song","doi":"10.1117/12.2682384","DOIUrl":"https://doi.org/10.1117/12.2682384","url":null,"abstract":"Our paper presents a new deep learning-based algorithm for improving the visual quality of images captured by underwater robots. The algorithm is designed to address the common issues of color distortion, low contrast, and lack of detail that often plague underwater images. By leveraging an image formation model, the proposed method is able to eliminate the effects of underwater environmental factors and enhance the color, detail, and overall visual appeal of the images. The performance of the proposed method is evaluated using objective metrics such as PSNR and SSIM, and the results demonstrate its effectiveness in improving the visual quality of underwater images. In addition, the proposed method is found to be computationally efficient, making it well-suited for use in real-time application. The proposed method has the potential to significantly improve the visual quality of underwater images and open up new opportunities for underwater exploration and conservation.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115044560","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
A text sentiment multi-classification method based on dual graph convolutional network 一种基于对偶图卷积网络的文本情感多分类方法
Conference on Electronic Information Engineering and Data Processing Pub Date : 2023-05-26 DOI: 10.1117/12.2682317
Ling Gan, Zuojie Chen
{"title":"A text sentiment multi-classification method based on dual graph convolutional network","authors":"Ling Gan, Zuojie Chen","doi":"10.1117/12.2682317","DOIUrl":"https://doi.org/10.1117/12.2682317","url":null,"abstract":"At present, text sentiment multi-classification model has problems of insufficient semantic feature fusion and ignore the syntactic structure of sentences. Therefore, this paper proposes a dual graph convolutional network model, which extract semantic and syntactic information of text by semantic graph convolutional network and syntactic graph convolutional network. Also, this paper proposes a label graph embedding method to fuse richer semantic features. Finally, experiments on two public datasets show that our method achieves better results.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124758806","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
VRDF: a network slicing algorithm based on VRF and VDF VRDF:一种基于VRF和VDF的网络切片算法
Conference on Electronic Information Engineering and Data Processing Pub Date : 2023-05-26 DOI: 10.1117/12.2682357
Jian Wang, Jinhong Cai
{"title":"VRDF: a network slicing algorithm based on VRF and VDF","authors":"Jian Wang, Jinhong Cai","doi":"10.1117/12.2682357","DOIUrl":"https://doi.org/10.1117/12.2682357","url":null,"abstract":"Blockchain technology solves the trust problem in the Internet, but there are limitations in the scalability of blockchain systems compared to traditional centralized servers, which restricts its development in practical applications. The sharding technology is a solution in the field of traditional database, which can solve the problem of limited database performance. Applying the sharding technology to blockchain system can make the blockchain system process transactions in parallel and thus improve its scalability. Therefore, studying the slicing algorithm can greatly improve the scalability of blockchain systems and promote the development and application of blockchain technology. In this paper, a random, fair, secure and stable network slicing method based on Verifiable Delay Function (VDF) and Verifiable Random Function (VRF) is proposed. Experiments show that compared with several typical blockchain system slicing algorithms, the slicing algorithm proposed in this paper has different degrees of improvement in security, throughput and storage.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129988547","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
Research and optimization of RFID tag anti-collision algorithm RFID标签防碰撞算法的研究与优化
Conference on Electronic Information Engineering and Data Processing Pub Date : 2023-05-26 DOI: 10.1117/12.2682439
Miao Bai, Zhiying Yang
{"title":"Research and optimization of RFID tag anti-collision algorithm","authors":"Miao Bai, Zhiying Yang","doi":"10.1117/12.2682439","DOIUrl":"https://doi.org/10.1117/12.2682439","url":null,"abstract":"In order to reduce the total identification time of readers and improve the system throughput in Radio Frequency Identification (RFID) systems, a new algorithm is proposed. Based on the Frame-Slotted ALOHA (FSA) algorithm, Tags are grouped according to the number of time slots during the reader's recognition process. For tags in collision time slots after a frame ends, the Collision Tree (CT) algorithm is used for group recognition, solving the starvation problem of the FSA algorithm and significantly reducing the total identification time of the reader. Simulation experiments have demonstrated that the algorithm proposed by the author significantly reduces the processing time when compared to the CT algorithm. and achieves a throughput rate that is higher than the traditional CT algorithm When the number of tags exceeds 260, reaching a maximum of 52% when the number of tags is around 400.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"12700 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130167611","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
Using a region-restrictive erasing method for one-stage weakly-supervised semantic segmentation 基于区域约束的一阶段弱监督语义分割方法
Conference on Electronic Information Engineering and Data Processing Pub Date : 2023-05-26 DOI: 10.1117/12.2682352
Yi Li
{"title":"Using a region-restrictive erasing method for one-stage weakly-supervised semantic segmentation","authors":"Yi Li","doi":"10.1117/12.2682352","DOIUrl":"https://doi.org/10.1117/12.2682352","url":null,"abstract":"Image segmentation is a classical and basic problem in the domain of computer vision. Due to the fact that fully supervision segmentation methods require dense time-consuming and expensive manual-annotations, lots of WSSS (Weakly-Supervised Semantic Segmentation) methods have been proposed to take advantage of the simplicity and availability of weak supervision annotations. In this work, we build an integrated framework to jointly train the classification task and the segmentation task guided by a self-supervised thinking with only image-level supervision and a compound refinement strategy. Then, we introduce a restrictive adversarial erasing approach to push our model to find more segmentation cues. We evaluate the proposed method on PASCAL VOC 2012 benchmark, and the experiments show that our method can achieve competitive performance compared with the earlier methods.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122377010","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
Tracking the prevalence of compromised passwords using long-term honeypot data 使用长期蜜罐数据跟踪密码泄露的流行程度
Conference on Electronic Information Engineering and Data Processing Pub Date : 2023-05-26 DOI: 10.1117/12.2682267
Jianzhou You, Bozhong Liu, Yang Wang, Laiyoumei Jiang
{"title":"Tracking the prevalence of compromised passwords using long-term honeypot data","authors":"Jianzhou You, Bozhong Liu, Yang Wang, Laiyoumei Jiang","doi":"10.1117/12.2682267","DOIUrl":"https://doi.org/10.1117/12.2682267","url":null,"abstract":"Passwords are critical issues in the world of cyber security. Unfortunately, despite best efforts, passwords continue to be compromised and leaked onto the Internet, leading to an alarming number of compromised passwords in circulation. In this study, we compare honeypot-captured data from 2021 and 2023 to measure the prevalence of compromised passwords in real-world cyberattacks. Specially, we designed and deployed an online SSH honeypot on the cloud server to capture the latest cyber intelligence in the wild. Our findings show that over 90% of brute force attacks involve the use of compromised passwords, indicating a high level of password vulnerability. Additionally, we observe that the effectiveness of strong-password policies in mitigating such attacks appears limited. This study highlights the need for better password security strategies to counter the high prevalence of compromised passwords in cyberattacks.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130617101","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
Design and implementation of 4K ultra HD video recording and playback system based on HI3531D 基于HI3531D的4K超高清视频录制与播放系统的设计与实现
Conference on Electronic Information Engineering and Data Processing Pub Date : 2023-05-26 DOI: 10.1117/12.2682429
Fanchang Zeng
{"title":"Design and implementation of 4K ultra HD video recording and playback system based on HI3531D","authors":"Fanchang Zeng","doi":"10.1117/12.2682429","DOIUrl":"https://doi.org/10.1117/12.2682429","url":null,"abstract":"In order to meet the requirements for 4K ultra high-definition video recording, storage and playback, as well as the need for long-term capture and recording of screen information of the operating terminal in important control scenarios such as shipborne, on-board and airborne, it is convenient for post event technical analysis, service quality assessment, drill rehearsal and operation accident liability determination. The domestic video codec processor Hisilicon HI3531D is studied. A video recording and playback system supporting 4K video capture and H.264/H.265 codec is designed and implemented. The compression algorithm of H.264/H.265 coding standard is used to realize the compression, storage and functions of video data. Single channel codec 3840x2160@30fps resolution can reach 17.6Mbps, the codec system delay can reach 110ms in JARI Works OS, and the dual redundant Ethernet switching time can reach 23.5ms.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131295538","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
A new network segmentation method integrating branch cutting and node splitting 一种结合分支切割和节点分割的网络分割新方法
Conference on Electronic Information Engineering and Data Processing Pub Date : 2023-05-26 DOI: 10.1117/12.2682288
Gulong Chen, Zheng Li, Jierui Yang, Yu Zhang, Zhaofeng Zhang
{"title":"A new network segmentation method integrating branch cutting and node splitting","authors":"Gulong Chen, Zheng Li, Jierui Yang, Yu Zhang, Zhaofeng Zhang","doi":"10.1117/12.2682288","DOIUrl":"https://doi.org/10.1117/12.2682288","url":null,"abstract":"With the continuous expansion of distribution network scale, the real-time performance of distribution network segmentation algorithm is increasingly difficult to meet the requirements of practical engineering. The result of network segmentation is actually to divide a whole into various smaller modules and calculate and solve these small modules respectively. Based on this, this paper adopts a new network segmentation method integrating branch cutting and node splitting. In this way, nodes and branches are operated accordingly. The boundary variables generated by this way include both the voltage on the split node and the current on the cut branch. Using a new model of distribution network - hierarchical topology model, the global optimization problem is transformed into a multi-stage segmentation problem. At the same time, the negative fast division of distribution network is realized by searching for split nodes and cutting branches. The simulation results of an example show that the algorithm is correct, effective and fast.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125520192","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学术官方微信