CORC

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

限定条件                
已选(0)清除 条数/页:   排序方式:
有限大频率选择表面及其在雷达罩上的应用研究 学位论文
博士: 中国科学院大学, 2015
作者:  张建
收藏  |  浏览/下载:133/0  |  提交时间:2015/11/30
Fast geometric correction of space time delayed and integration CCD camera dynamic imaging based on ray tracing point matching 期刊论文
Guangxue Xuebao/Acta Optica Sinica, 2015, 卷号: 35, 期号: 5
作者:  Yang, F.;  H. Qu;  G. Jin and L. Zheng
收藏  |  浏览/下载:8/0  |  提交时间:2016/08/24
Integrated intensity, orientation code and spatial information for robust tracking (EI CONFERENCE) 会议论文
2007 2nd IEEE Conference on Industrial Electronics and Applications, ICIEA 2007, May 23, 2007 - May 25, 2007, Harbin, China
Zhang X.; Sun H.; Wang Y.
收藏  |  浏览/下载:19/0  |  提交时间:2013/03/25
real-time tracking is an important topic in computer vision. Conventional single cue algorithms typically fail outside limited tracking conditions. Integration of multimodal visual cues with complementary failure modes allows tracking to continue despite losing individual cues. In this paper  we combine intensity  orientation codes and special information to form a new intensity-orientation codes-special (IOS) feature to represent the target. The intensity feature is not affected by the shape variance of object and has good stability. Orientation codes matching is robust for searching object in cluttered environments even in the cases of illumination fluctuations resulting from shadowing or highlighting  etc The spatial locations of the pixels are used which allow us to take into account the spatial information which is lost in traditional histogram. Histograms of intensity  orientation codes and spatial information are employed for represent the target Mean shift algorithm is a nonparametric density estimation method. The fast and optimal mode matching can be achieved by this method. In order to reduce the compute time  we use the mean shift procedure to reach the target localization. Experiment results show that the new method can successfully cope with clutter  partial occlusions  illumination change  and target variations such as scale and rotation. The computational complexity is very low. If the size of the target is 3628 pixels  it only needs 12ms to complete the method. 2007 IEEE.  


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