CORC

浏览/检索结果: 共20条,第1-10条 帮助

限定条件    
已选(0)清除 条数/页:   排序方式:
Linear erasure block codes over either a field of rational numbers Q or an Algebraic structure Ψ q 会议论文
International Conference on Communication Technology Proceedings, ICCT, 2018-10-08
作者:  Savchenko, Y.
收藏  |  浏览/下载:16/0  |  提交时间:2019/12/30
Vulnerability based on Component Binary Code For Third-Party Component 会议论文
2018 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTING, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI), 2018-01-01
作者:  Xie, Wanggen[1];  Hu, Jinchang[2];  Kudjo, Patrick Kwaku[3];  Yu, Lei[4];  Zeng, Zhifeng[5]
收藏  |  浏览/下载:5/0  |  提交时间:2019/12/24
Discriminate Cross-modal Quantization for Efficient Retrieval 会议论文
Proceedings - International Conference on Pattern Recognition
作者:  Sun, P.;  Yan, C.;  Wang, S.;  Bai, X.
收藏  |  浏览/下载:4/0  |  提交时间:2019/12/30
Finite length design of precoded EWF codes 会议论文
83rd IEEE Vehicular Technology Conference, VTC Spring 2016, Nanjing, China, May 15, 2016 - May 18, 2016
作者:  Yuan, Lei;  Li, Huaan;  Wan, Yi
收藏  |  浏览/下载:3/0  |  提交时间:2017/01/18
Discrete Cross-Modal Hashing for Efficient Multimedia Retrieval 会议论文
18th IEEE International Symposium on Multimedia (IEEE ISM), San Jose, CA, 2016-01-01
作者:  Ma, Dekui;  Liang, Jian;  Kong, Xiangwei;  He, Ran;  Li, Ying
收藏  |  浏览/下载:3/0  |  提交时间:2019/12/09
Set Min-Sum Decoding Algorithm for Non-Binary LDPC Codes 会议论文
2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016-01-01
作者:  Song, Liyuan;  Huang, Qin;  Wang, Zulin
收藏  |  浏览/下载:3/0  |  提交时间:2019/12/30
Low Error-Floor Majority-Logic Decoding Based Algorithm for Non-Binary LDPC Codes 会议论文
2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2015-01-01
作者:  Song, Liyuan;  Zhang, Mu;  Huang, Qin;  Wang, Zulin
收藏  |  浏览/下载:5/0  |  提交时间:2020/01/06
4-level run-length limited optical storage on photo-chromic materials 会议论文
Proceedings of the SPIE - The International Society for Optical Engineering, Seventh International Symposium on Optical Storage, Zhanjiang, China, INSPEC
Heng Hu; Longfa Pan; Hua Hu; Duanyi Xu
收藏  |  浏览/下载:3/0
an efficient one-key carter-wegman message authentication code 会议论文
2006 International Conference on Computational Intelligence and Security, ICCIAS 2006, Guangzhou, China, October 3,
Xu Jin; Wang Dayin; Lin Dongdai; Wu Wenling
收藏  |  浏览/下载:12/0  |  提交时间:2011/06/29
High-accuracy real-time automatic thresholding for centroid tracker (EI CONFERENCE) 会议论文
ICO20: Optical Information Processing, August 21, 2005 - August 26, 2005, Changchun, China
Zhang Y.; Wang Y.
收藏  |  浏览/下载:26/0  |  提交时间:2013/03/25
Many of the video image trackers today use the centroid as the tracking point. In engineering  we can get several key pairs of peaks which can include the target and the background around it and use the method of Otsu to get intensity thresholds from them. According to the thresholds  it give a great help for us to get a glancing size  a target's centroid is computed from a binary image to reduce the processing time. Hence thresholding of gray level image to binary image is a decisive step in centroid tracking. How to choose the feat thresholds in clutter is still an intractability problem unsolved today. This paper introduces a high-accuracy real-time automatic thresholding method for centroid tracker. It works well for variety types of target tracking in clutter. The core of this method is to get the entire information contained in the histogram  we can gain the binary image and get the centroid from it. To track the target  so that we can compare the size of the object in the current frame with the former. If the change is little  such as the number of the peaks  the paper also suggests subjoining an eyeshot-window  we consider the object has been tracked well. Otherwise  their height  just like our eyes focus on a target  if the change is bigger than usual  position and other properties in the histogram. Combine with this histogram analysis  we will not miss it unless it is out of our eyeshot  we should analyze the inflection in the histogram to find out what happened to the object. In general  the impression will help us to extract the target in clutter and track it and we will wait its emergence since it has been covered. To obtain the impression  what we have to do is turning the analysis into codes for the tracker to determine a feat threshold. The paper will show the steps in detail. The paper also discusses the hardware architecture which can meet the speed requirement.  the paper offers a idea comes from the method of Snakes  


©版权所有 ©2017 CSpace - Powered by CSpace