• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3C
• /
• pp.258-263
• /
• 2006

Each pixel in a matching block does not equally contribute to block matching and the matching error is greatly affected by image complexity. On the basis of the facts, this paper proposes a fast motion estimation algorithm using some sub-blocks selected by the image complexity. The proposed algorithm divides a matching block into 16 sub-blocks, computes the image complexity in every sub-block, executes partial block matching using some sub-blocks with large complexity, and detects a motion vector. The simulation results show that the proposed algorithm brings about negligible image degradation, but can reduce a large amount of computation in comparison with conventional algorithms.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.539-548
• /
• 2001

In this paper, we propose that fast tracking algorithm for moving object is separated from background, using partial boundary line information. After detecting boundary line from input image, we track moving object by using the algorithm which takes boundary line information as feature of moving object. we extract moving vector on the imput image which has environmental variation, using high-performance BMA, and we extract moving object on the basis of moving vector. Next, we extract boundary line on the moving object as an initial feature-vector generating step for the moving object. Among those boundary lines, we consider a part of the boundary line in every direction as feature vector. And then, as a step for the moving object, we extract moving vector from feature vector generated under the information of the boundary line of the moving object on the previous frame, and we perform tracking moving object from the current frame. As a result, we show that the proposed algorithm using feature vector generated by each directional boundary line is simple tracking operation cost compared with the previous active contour tracking algorithm that changes processing time by boundary line size of moving object. The simulation for proposed algorithm shows that BMA operation is reduced about 39% in real image and tracking error is less than 2 pixel when the size of feature vector is [$10{\times}5$] using the information of each direction boundary line. Also the proposed algorithm just needs 200 times of search operation bout processing cost is varies by the size of boundary line on the previous algorithm.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.1057-1062
• /
• 2007

얼굴표정 인식은 심리학 연구, 얼굴 애니메이션 합성, 로봇공학, HCI(Human Computer Interaction) 등 다양한 분야에서 중요성이 증가하고 있다. 얼굴표정은 사람의 감정 표현, 관심의 정도와 같은 사회적 상호작용에 있어서 중요한 정보를 제공한다. 얼굴표정 인식은 크게 정지영상을 이용한 방법과 동영상을 이용한 방법으로 나눌 수 있다. 정지영상을 이용할 경우에는 처리량이 적어 속도가 빠르다는 장점이 있지만 얼굴의 변화가 클 경우 매칭, 정합에 의한 인식이 어렵다는 단점이 있다. 동영상을 이용한 얼굴표정 인식 방법은 신경망, Optical Flow, HMM(Hidden Markov Models) 등의 방법을 이용하여 사용자의 표정 변화를 연속적으로 처리할 수 있어 실시간으로 컴퓨터와의 상호작용에 유용하다. 그러나 정지영상에 비해 처리량이 많고 학습이나 데이터베이스 구축을 위한 많은 데이터가 필요하다는 단점이 있다. 본 논문에서 제안하는 실시간 얼굴표정 인식 시스템은 얼굴영역 검출, 얼굴 특징 검출, 얼굴표정 분류, 아바타 제어의 네 가지 과정으로 구성된다. 웹캠을 통하여 입력된 얼굴영상에 대하여 정확한 얼굴영역을 검출하기 위하여 히스토그램 평활화와 참조 화이트(Reference White) 기법을 적용, HT 컬러모델과 PCA(Principle Component Analysis) 변환을 이용하여 얼굴영역을 검출한다. 검출된 얼굴영역에서 얼굴의 기하학적 정보를 이용하여 얼굴의 특징요소의 후보영역을 결정하고 각 특징점들에 대한 템플릿 매칭과 에지를 검출하여 얼굴표정 인식에 필요한 특징을 추출한다. 각각의 검출된 특징점들에 대하여 Optical Flow알고리즘을 적용한 움직임 정보로부터 특징 벡터를 획득한다. 이렇게 획득한 특징 벡터를 SVM(Support Vector Machine)을 이용하여 얼굴표정을 분류하였으며 추출된 얼굴의 특징에 의하여 인식된 얼굴표정을 아바타로 표현하였다.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.345-354
• /
• 2005

Since motion estimation and motion compensation methods remove the redundant data to employ the temporal redundancy in images, it plays an important role in digital video compression. Because of its high computational complexity, however, it is difficult to apply to high-resolution applications in real time environments. If we have a priori knowledge about the motion of an image block before the motion estimation, the location of a better starting point for the search of an exact motion vector can be determined to expedite the searching process. In this paper presents the motion detection algorithm that can run robustly about recusive motion. The motion detection compares and analyzes two frames each other, motion of whether happened judge. Through experiments, we show significant improvements in the reduction of the computational time in terms of the number of search steps without much quality degradation in the predicted image.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06a
• /
• pp.135-138
• /
• 1998

본 논문에서는 비디오 장면 전환 효과 중 디졸브(dissolve)와 카메라 동작에 의한 팬(pan), 줌(zoom)에 의한 점진적인 장면 전환 구간을 검출하는 알고리즘을 제안한다. 디졸브 검출의 처리 속도 향상을 위하여 MPEG 표준에 따라 압축된 영상을 최소한의 복원과정을 거쳐서 얻은 DC 영상을 사용하였다. 디졸브 특성의 효과적 추출을 위하여 공간적 영역 분할을 하였고, 각 영역별 평균값을 제곱하여 이에 대한 프레임별 평균을 전환구간의 특징 요소로 이용하였다. 추출된 요소들을 이용하여 정확한 디졸브 구간의 검출을 위하여 비중첩 윈도우 비교 방식을 사용하였다. 또한 효과적인 카메라 동작 검출을 위해 배경화면을 대표할 수 있는 지역 매크로 블록의 움직임 벡터를 추출하였다. 이를 이용하여 카메라 동작에 의한 효과를 검출하였다.

• Journal of Advanced Navigation Technology
• /
• v.17 no.1
• /
• pp.98-106
• /
• 2013

In this paper, we propose a moving object detection and tracking method for multi-view camera environment. Based on the similarity and characteristics of motion vectors and coding block modes extracted from compressed bitstreams, validation of moving blocks, labeling of the validated blocks, and merging of neighboring blobs are performed. To continuously track objects for temporary stop, crossing, and overlapping events, a window based object updating algorithm is proposed for single- and multi-view environments. Object detection and tracking could be performed with an acceptable level of performance without decoding of video bitstreams for normal, temporary stop, crossing, and overlapping cases. The rates of detection and tracking are over 89% and 84% in multi-view environment, respectively. The rates for multi-view environment are improved by 6% and 7% compared to those of single-view environment.

• The Journal of the Korea Contents Association
• /
• v.16 no.6
• /
• pp.9-18
• /
• 2016

This paper proposes a multi-view Wyner-Ziv Video coding scheme based on spatio-temporal adaptive estimation. The proposed algorithm is designed to search for a better estimated block with joint bi-directional motion estimation by introducing weights between temporal and spatial directions, and by classifying effectively the region of interest blocks, which is based on the edge detection and the synthesis, and by selecting the reference estimation block from the effective motion vector analysis. The proposed algorithm exploits the information of a single frame viewpoint and adjacent frame viewpoints, simultaneously and then generates adaptively side information in a variety of closure, and reflection regions to have a better performance. Through several simulations with multi-view video sequences, it is shown that the proposed algorithm performs visual quality improvement as well as bit-rate reduction, compared to the conventional methods.

• Journal of Broadcast Engineering
• /
• v.20 no.3
• /
• pp.430-439
• /
• 2015

The demand of violence detection techniques using a video analysis to help prevent crimes is increasing recently. Many researchers have studied vision based behavior recognition but, violent behavior analysis techniques usually focus on violent scenes in television and movie content. Many methods previously published usually used both a color(e.g., skin and blood) and motion information for detecting violent scenes because violences usually involve blood scenes in movies. However, color information (e.g., blood scenes) may not be useful cues for violence detection in surveillance videos, because they are rarely taken in real world situations. In this paper, we propose a method of violent behavior detection in surveillance videos using motion vectors such as flow vector magnitudes and changes in direction except the color information. In order to evaluate the proposed algorithm, we test both USI dataset and various real world surveillance videos from YouTube.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.472-483
• /
• 2016

This paper proposes a blocking artifacts detection algorithm in frequency domain for MC-FRUC (Motion Compensated Frame Rate Up-Conversion). Conventional MC-FRUC algorithms occur blocking artifacts near interpolated block boundaries since motion compensation is performed from block-based motion vector. For efficiently decreasing blocking artifacts, this paper analyses frequency characteristics of the interpolated frame and reduces blocking artifacts on block boundaries. In experimental results the proposed method shows better subjective quality than some conventional FRUC method and also increases the PSNR(Peak Signal to Noise Ratio) value on average 0.45 dB compared with BDMC(Bi-Directional Motion Compensation).

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2271-2280
• /
• 1999

In this paper, a variable motion estimation scheme based on HBMA(Hierarchical Block Matching Algorithm) to improve the performance and to reduce heavy computational and transmission load, is presented. The proposed algorithm is composed of four steps. First, block activity for each block is defined using the edge information of differential image between two sequential images, and then average block activity of the present image is found by taking the mean of block activity. Secondly, camera pan compensation is carried out, according to the average activity of the image, in the hierarchical pyramid structure constructed by wavelet transform. Next, the LUT classifying each block into one among Moving, No Moving, Semi-Moving Block according to the block activity compensated camera pan is obtained. Finally, as varying the block size and adaptively selecting the initial search layer and the search range referring to LUT, the proposed variable HBMA can effectively carries out fast motion estimation in the hierarchical pyramid structure. The cost function needed above-mentioned each step is only the block activity defined by the edge information of the differential image in the sequential images.