中国科学院机构知识库网格系统: 检索

中国科学院机构知识库网格

Chinese Academy of Sciences Institutional Repositories Grid

机构

采集方式

内容类型

发表日期

学科主题

筛选

浏览/检索结果: 共2条，第1-2条

帮助

条数/页：排序方式：
	Integrated intensity, orientation code and spatial information for robust tracking (EI CONFERENCE) 会议论文 OAI收割 2007 2nd IEEE Conference on Industrial Electronics and Applications, ICIEA 2007, May 23, 2007 - May 25, 2007, Harbin, China 作者: Wang Y.; Wang Y.; Wang Y.; Wang Y.; Wang Y. 收藏 \| 浏览/下载：33/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.
	High-accuracy real-time automatic thresholding for centroid tracker (EI CONFERENCE) 会议论文 OAI收割 ICO20: Optical Information Processing, August 21, 2005 - August 26, 2005, Changchun, China 作者: Wang Y.; Wang Y.; Wang Y.; Wang Y.; Zhang Y. 收藏 \| 浏览/下载：38/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