• Title/Summary/Keyword: Template Tracking

Search Result 107, Processing Time 0.027 seconds

Object Tracking Using CAMshift and Motion Template (컬러 정보와 모션 템플리트를 애용한 객체 추적)

  • Lee, Jin-Hyeong;Kim, Heon-Gi;Kim, Jae-Min;Jo, Seong-Won;Gang, Ji-Un;Jeong, Seon-Tae;Jang, Yong-Seok
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.04a
    • /
    • pp.353-356
    • /
    • 2007
  • 본 논문은 비정형 객체를 추적함에 있어서 다른 객체와 겹쳐진 후 계속 추적할 수 있는 방법을 제시한다. 기본적으로 색 정보 기반의 CAMshift 알고리즘을 바탕으로 각 프레임마다 color template를 업데이트하여 현재의 객체와 template를 비교하고, 업데이트 된 color template를 바탕으로 색 분포를 사용하여 CAMshift 결과를 비교하여 추적하는 물체를 보다 정확하게 판별할 수 있도록 한다.

  • PDF

Object Tracking Using Template Based on Adaptive 3-Frame Difference (적응적 3 프레임 차분 방법 기반 템플릿을 이용한 객체 추적)

  • Kim, Hun-Ki;Lee, Jin-Hyung;Cho, Seong-Won;Chung, Sun-Tae;Kim, Jae-Min
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.3
    • /
    • pp.349-354
    • /
    • 2007
  • To generate the template of a detected object and to track the overlapped object and the object covered by other objects correctly are important research problems in visual surveillance. The frame difference is not capable of generating the template of slowly moving object. To get around the drawback of the conventional frame difference, we propose a new algorithm for generating a template using adaptive 3-frame difference.

Real-Time Two Hands Tracking System

  • Liu, Nianjun;Lovell, Brian C.
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1491-1494
    • /
    • 2002
  • The paper introduces a novel system of two hands real-time tracking based on the unrestricted hand skin segmentation by multi color systems. After corer-based segmentation and pre-processing operation, a label set of regions is created to locate the two hands automatically. By the normalization, template matching is used to find out the left or right hand. An improved fast self-adaptive tracking algorithm is applied and Canny filter is used for hand detection.

  • PDF

Robust object tracking using projected motion and histogram intersection (투영된 모션과 히스토그램 인터섹션을 이용한 강건한 물체추적)

  • Lee, Bong-Seok;Moon, Young-Shik
    • The KIPS Transactions:PartB
    • /
    • v.9B no.1
    • /
    • pp.99-104
    • /
    • 2002
  • Existing methods of object tracking use template matching, re-detection of object boundaries or motion information. The template matching method requires very long computation time. The re-detection of object boundaries may produce false edges. The method using motion information shows poor tracking performance in moving camera. In this paper, a robust object tracking algorithm is proposed, using projected motion and histogram intersection. The initial object image is constructed by selecting the regions of interest after image segmentation. From the selected object, the approximate displacement of the object is computed by using 1-dimensional intensity projection in horizontal and vortical direction. Based on the estimated displacement, various template masks are constructed for possible orientations and scales of the object. The best template is selected by using the modified histogram intersection method. The robustness of the proposed tracking algorithm has been verified by experimental results.

Template-Matching-based High-Speed Face Tracking Method using Depth Information (깊이 정보를 이용한 템플릿 매칭 기반의 고속 얼굴 추적 방법)

  • Kim, Wooyoul;Seo, Youngho;Kim, Dongwook
    • Journal of Broadcast Engineering
    • /
    • v.18 no.3
    • /
    • pp.349-361
    • /
    • 2013
  • This paper proposes a fast face tracking method with only depth information. It is basically a template matching method, but it uses a early termination scheme and a sparse search scheme to reduce the execution time to solve the problem of a template matching method, large execution time. Also a refinement process with the neighboring pixels is incorporated to alleviate the tracking error. The depth change of the face being tracked is compensated by predicting the depth of the face and resizing the template. Also the search area is adjusted on the basis of the resized template. With home-made test sequences, the parameters to be used in face tracking are determined empirically. Then the proposed algorithm and the extracted parameters are applied to the other home-made test sequences and a MPEG multi-view test sequence. The experimental results showed that the average tracking error and the execution time for the home-made sequences by Kinect ($640{\times}480$) were about 3% and 2.45ms, while the MPEG test sequence ($1024{\times}768$) showed about 1% of tracking error and 7.46ms of execution time.

Segmentation Algorithm for Wafer ID using Active Multiple Templates Model

  • Ahn, In-Mo;Kang, Dong-Joong;Chung, Yoon-Tack
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.839-844
    • /
    • 2003
  • This paper presents a method to segment wafer ID marks on poor quality images under uncontrolled lighting conditions of the semiconductor process. The active multiple templates matching method is suggested to search ID areas on wafers and segment them into meaningful regions and it would have been impossible to recognize characters using general OCR algorithms. This active template model is designed by applying a snake model that is used for active contour tracking. Active multiple template model searches character areas and segments them into single characters optimally, tracking each character that can vary in a flexible manner according to string configurations. Applying active multiple templates, the optimization of the snake energy is done using Greedy algorithm, to maximize its efficiency by automatically controlling each template gap. These vary according to the configuration of character string. Experimental results using wafer images from real FA environment are presented.

  • PDF

Image Tracking Algorithm using Template Matching and PSNF-m

  • Bae, Jong-Sue;Song, Taek-Lyul
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.3
    • /
    • pp.413-423
    • /
    • 2008
  • The template matching method is used as a simple method to track objects or patterns that we want to search for in the input image data from image sensors. It recognizes a segment with the highest correlation as a target. The concept of this method is similar to that of SNF (Strongest Neighbor Filter) that regards the measurement with the highest signal intensity as target-originated among other measurements. The SNF assumes that the strongest neighbor (SN) measurement in the validation gate originates from the target of interest and the SNF utilizes the SN in the update step of a standard Kalman filter (SKF). The SNF is widely used along with the nearest neighbor filter (NNF), due to computational simplicity in spite of its inconsistency of handling the SN as if it is the true target. Probabilistic Strongest Neighbor Filter for m validated measurements (PSNF-m) accounts for the probability that the SN in the validation gate originates from the target while the SNF assumes at any time that the SN measurement is target-originated. It is known that the PSNF-m is superior to the SNF in performance at a cost of increased computational load. In this paper, we suggest an image tracking algorithm that combines the template matching and the PSNF-m to estimate the states of a tracked target. Computer simulation results are included to demonstrate the performance of the proposed algorithm in comparison with other algorithms.

A Study on High Speed Face Tracking using the GPGPU-based Depth Information (GPGPU 기반의 깊이 정보를 이용한 고속 얼굴 추적에 대한 연구)

  • Kim, Woo-Youl;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.5
    • /
    • pp.1119-1128
    • /
    • 2013
  • In this paper, we propose an algorithm to detect and track the human face with a GPU-based high speed. Basically the detection algorithm uses the existing Adaboost algorithm but the search area is dramatically reduced by detecting movement and skin color region. Differently from detection process, tracking algorithm uses only depth information. Basically it uses a template matching method such that it searches a matched block to the template. Also, In order to fast track the face, it was computed in parallel using GPU about the template matching. Experimental results show that the GPU speed when compared with the CPU has been increased to up to 49 times.

Drift Handling in Object Tracking by Sparse Representations (희소성 표현 기반 객체 추적에서의 표류 처리)

  • Yeo, JungYeon;Lee, Guee Sang
    • Smart Media Journal
    • /
    • v.5 no.1
    • /
    • pp.88-94
    • /
    • 2016
  • In this paper, we proposed a new object tracking algorithm based on sparse representation to handle the drifting problem. In APG-L1(accelerated proximal gradient) tracking, the sparse representation is applied to model the appearance of object using linear combination of target templates and trivial templates with proper coefficients. Also, the particle filter based on affine transformation matrix is applied to find the location of object and APG method is used to minimize the l1-norm of sparse representation. In this paper, we make use of the trivial template coefficients actively to block the drifting problem. We experiment the various videos with diverse challenges and the result shows better performance than others.

Template Based Object Detection & Tracking by Chamfer Matching in Real Time Video (Chamfer Matching을 이용한 실시간 템플릿 기반 개체 검출 및 추적)

  • Islam, Md. Zahidul;Setiawan, Nurul Arif;Kim, Hyung-Kwan;Lee, Chil-Woo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.92-94
    • /
    • 2008
  • In this paper we describe an approach for template based detection and tracking of objects by chamfer matching in real time video. Detecting and tracking of any objects is the key problem in computer vision. In our case we try for hand and head of human for detection and tracking by chamfer matching technique. Matching involves correlating the templates with the distance transformed scene and determining the locations where the mismatch is below a certain user defined threshold.