• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.1
• /
• pp.9-16
• /
• 2010

Moving object detection is to detect foreground object different from background scene in a new incoming image frame and is an essential ingredient process in some image processing applications such as intelligent visual surveillance, HCI, object-based video compression and etc. Most of previous object detection algorithms are still computationally heavy so that it is difficult to develop real-time multi-channel moving object detection in a workstation or even one-channel real-time moving object detection in an embedded system using them. Foreground mask correction necessary for a more precise object detection is usually accomplished using morphological operations like opening and closing. Morphological operations are not computationally cheap and moreover, they are difficult to be rendered to run simultaneously with the subsequent connected component labeling routine since they need quite different type of processing from what the connected component labeling does. In this paper, we first devise a fast and precise foreground mask correction algorithm, "Neighbor Foreground Pixel Propagation (NFPP)" which utilizes neighbor pixel checking employed in the connected component labeling. Next, we propose a novel moving object detection method based on the devised foreground mask correction algorithm, NFPP where the connected component labeling routine can be executed simultaneously with the foreground mask correction. Through experiments, it is verified that the proposed moving object detection method shows more precise object detection and more than 4 times faster processing speed for a image frame and videos in the given the experiments than the previous moving object detection method using morphological operations.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.740-745
• /
• 2003

Motion tracking and object segmentation are the most fundamental and critical problems in vision tasks suck as motion analysis. An active contour model, snake, was developed as a useful segmenting and tracking tool for rigid or non-rigid objects. Snake is designed no the basis of snake energies. Segmenting and tracking can be executed successfully by energy minimization. In this research, two new paradigms for segmentation and tracking are suggested. First, because the conventional method uses only intensity information, it is difficult to separate an object from its complex background. Therefore, a new energy and design schemes should be proposed for the better segmentation of objects. Second, conventional snake can be applied in situations where the change between images is small. If a fast moving object exists in successive images, conventional snake will not operate well because the moving object may have large differences in its position or shape, between successive images. Snakes's nodes may also fall into the local minima in their motion to the new positions of the target object in the succeeding image. For robust tracking, the condensation algorithm was adopted to control the parameters of the proposed snake model called "adaptive color snake model(SCSM)". The effectiveness of the ACSM is verified by appropriate simulations and experiments.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.95-104
• /
• 2022

A TPR-tree is a well-known indexing structure that is developed to answer queries about the current or future time locations of moving objects. For the purpose of space efficiency, the TPR-tree employs the notion of VBR (velocity bounding rectangle)so that a regionalrectangle presents varying positions of a group of moving objects. Since the rectangle computed from a VBR always encloses the possible maximum range of an indexed object group, a search process only has to follow VBR-based rectangles overlapped with a given query range, while searching toward candidate leaf nodes. Although the TPR-tree index shows up its space efficiency, it easily suffers from the problem of dead space that results from fast and constant expansions of VBR-based rectangles. Against this, the TPR-tree index is enforced to update leaf nodes for reducing dead spaces within them. Such an update-prone feature of the TPR-tree becomes more problematic when the tree is saved in flash storage. This is because flash storage has very expensive update costs. To solve this problem, we propose a new Bloom filter based caching scheme that is useful for reducing updates in a flash TPR-tree. Since the proposed scheme can efficiently control the frequency of updates on a leaf node, it can offer good performance for indexing moving objects in modern flash storage.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.1
• /
• pp.35-41
• /
• 2015

When a video surveillance system tracks a specific object, it is very important to get quickly the information of the object through fast image processing. Usually one camera surveillance system for tracking the object made results in various problems such like occlusion, image noise during the tracking process. It makes difficulties on image based moving object tracking. Therefore, to overcome the difficulties the multi video surveillance system which installed several camera within interested area and looking the same object from multi angles of view could be considered as a solution. If multi cameras are used for tracking object, it is capable of making a decision having high accuracy in more wide space. This paper proposes a method of recognizing and tracking a specific object like a car using the homography in which multi cameras are installed at the crossroad.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.91-102
• /
• 2004

In this paper, a fast information extraction algorithm for object-based MPEG-4 application from MPEG-1,2 is proposed. For object-based MPEG-4 conversion, we need to extract such information as object-image, shape-image, macro-block motion vector, and header information from MPEG-1,2 bit-stream. If we use the extracted information, fast conversion for object-based MPEG-4 is possible. The proposed object extraction algerian has two important steps, namely the motion vector extraction from MPEG-1,2 bit-stream and the watershed algerian The algorithm extracts objects using user's assistance in the intra frame and tracks then in the following inter frames. If we have an unsatisfactory result for a fast moving object the user can intervene to connect the segmentation. The proposed algorithm consist of two steps, which are intra frame object extracting processing and inter frame tracking processing. Object extracting process is the step in which user extracts a semantic object directly by using the block classification and watersheds. Object tracking process is the step of the following the object in the subsequent frames. It is based on the boundary fitting method using motion vector, object-mask and modified watersheds. Experimental results show that the proposed method can achieve a fast conversion from the MPEG-1,2 bit-stream to the object-based MPEG-4 input.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1987.04a
• /
• pp.60-66
• /
• 1987

In this paper a fast matching method using subtemplate and search and down technique to reduce very heavy computational load of the conventional matching method, is presented The proposed method is spplied to an automatic target tracker in order to track one moving object in comparatively simple backgoriund. Experimental results show that istperformanced is not so degraded in spite of high computational reduction as that of the conventional matching method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.1
• /
• pp.63-71
• /
• 1988

In this paper, a fast matching method using hierarchical neighborhood search and subtemplate to reduce very heavy computational load of the conventional matching method, is presented. Some parameters of the proposed method are chosen so that an automatic target tracker to which it is applied can track one moving object well in comparatively simple background. Experimental results show that its performance is not so degraded in spite of high computational reduction over that of the matching method using 3-step search.

• Journal of Korea Multimedia Society
• /
• v.16 no.5
• /
• pp.619-628
• /
• 2013

In this paper, we describe a strongly improved tracking method using combination of CAMshift and Kalman filter algorithm. CAMshift algorithm doesn't consider the object's moving direction and velocity information when it set the search windows for tracking. However if Kalman filter is combined with CAMshift for setting the search window, it can accurately predict the object's location with the object's present location and velocity information. By using this prediction before CAMshift algorithm, we can track fast moving objects successfully. Also in this research, we show better tracking results than conventional approaches which make use of single color information by using both color information of HSV and YCrCb simultaneously. This modified approach obtains more robust color segmentation than others using single color information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12A
• /
• pp.2109-2119
• /
• 2001

In this paper, a fast information extraction algorithm for object-based MPEG-4 application from MPEG-2 bit-steam is proposed. For object-based MPEG-4 conversion, we need to extract such information as object-image, shape-image, macro-block motion vector, and header information from MPEG-2 bit-stream. If we use the extracted information, fast conversion for object-based MPEG-4 is possible. The proposed object extraction algorithm has two important steps, namely the motion vectors extraction from MPEG-2 bit-stream and the watershed algorithm. The algorithm extracts objects using user\`s assistance in the intra frame and tracks then in the following inter frames. If we have an unsatisfactory result for a fast moving object, the user can intervene to correct the segmentation. The proposed algorithm consist of two steps, which are intra frame object extracts processing and inter frame tracking processing. Object extracting process is the step in which user extracts a semantic object directly by using the block classification and watersheds. Object tacking process is the step of the following the object in the subsequent frames. It is based on the boundary fitting method using motion vector, object-mask, and modified watersheds. Experimental results show that the proposed method can achieve a fast conversion from the MPEG-2 bit-stream to the object-based MPEG-4 input.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2721-2726
• /
• 2014

In a MOG algorithm using the GMM to subtract background, the model parameter computation and the object classification to be performed at every pixel require a huge computation and are the chief obstacles to its uses. This paper proposes a fast MOG algorithm that partly adopts the simple model parameter computation and the object classification skip on the basis of the object prediction. The former is applied to the pixels that gives little effect on the model parameter and the latter is applied to the pixels whose object prediction is firmly trusted. In comparative experiment between the conventional and proposed algorithms using videos, the proposed algorithm carries out the simple model parameter computation and the object classification skip over 77.75% and 92.97%, respectively, nevertheless it retains more than 99.98% and 99.36% in terms of image and moving object-unit average classification accuracies, respectively.