• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4438-4460
• /
• 2017

The Kernelized Correlation Filters (KCF) tracker has caused the extensive concern in recent years because of the high efficiency. Numerous improvements have been made successively. However, due to the abrupt motion between the consecutive image frames, these methods cannot track object well. To cope with the problem, we propose an extended KCF tracker based on swarm intelligence method. Unlike existing KCF-based trackers, we firstly introduce a swarm-based sampling method to KCF tracker and design a unified framework to track smooth or abrupt motion simultaneously. Secondly, we propose a global motion estimation method, where the exploration factor is constructed to search the whole state space so as to adapt abrupt motion. Finally, we give an adaptive threshold in light of confidence map, which ensures the accuracy of the motion estimation strategy. Extensive experimental results in both quantitative and qualitative measures demonstrate the effectiveness of our proposed method in tracking abrupt motion.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3599-3619
• /
• 2019

In human activity recognition system both static and motion information play crucial role for efficient and competitive results. Most of the existing methods are insufficient to extract video features and unable to investigate the level of contribution of both (Static and Motion) components. Our work highlights this problem and proposes Static-Motion fused features descriptor (SMFD), which intelligently leverages both static and motion features in the form of descriptor. First, static features are learned by two-stream 3D convolutional neural network. Second, trajectories are extracted by tracking key points and only those trajectories have been selected which are located in central region of the original video frame in order to to reduce irrelevant background trajectories as well computational complexity. Then, shape and motion descriptors are obtained along with key points by using SIFT flow. Next, cholesky transformation is introduced to fuse static and motion feature vectors to guarantee the equal contribution of all descriptors. Finally, Long Short-Term Memory (LSTM) network is utilized to discover long-term temporal dependencies and final prediction. To confirm the effectiveness of the proposed approach, extensive experiments have been conducted on three well-known datasets i.e. UCF101, HMDB51 and YouTube. Findings shows that the resulting recognition system is on par with state-of-the-art methods.

• 한국컴퓨터정보학회논문지
• /
• 제20권9호
• /
• pp.39-45
• /
• 2015

Along with the advance of digital technology, various methods are adopted for capturing the 3D animating data. Especially, in 3D animation production market, the motion capture system is widely used to make films, games, and animation contents. The technique quickly tracks the movements of the actor and translate the data to use as animating character's motion. Thus the animation characters are able to mimic the natural motion and gesture, even face expression. However, the conventional motion capture system needs tricky conditions, such as space, light, number of camera etc. Furthermore the data acquired from the motion capture system is frequently corrupted by noise, drift and surrounding environment. In this paper, we introduce the post production techniques to stabilizing the jitters of motion capture data from the low cost handy system based on Kinect.

• 방송공학회논문지
• /
• 제16권2호
• /
• pp.372-383
• /
• 2011

본 논문은 영상의 움직임 특성을 참조하여 움직임 벡터 수평-수직 성분중 하나를 최적의 예측 움직임 벡터 성분으로 선택하여 사용할 수 있는 개선된 교차 움직임벡터 부호화 방법을 제시한다. 제안방법은 부-복호화를 수행할 움직임 벡터 성분의 순서를 복호화기에 알리는 신호비트를 별도로 보낼 필요 없이, 시공간적 움직임필드의 특성을 참조하여 적절한 움직임벡터 성분 예측치를 적응적으로 사용할 수 있다. 기존 H.264/AVC 방법과 비교한 실험 결과, 평균적으로 전체 비트량을 약 1.99% (최대 8.71%) 감소시킬 수 있음을 보여준다.

• 한국정보통신학회논문지
• /
• 제18권11호
• /
• pp.2733-2737
• /
• 2014

실시간 영상을 이용하여 움직임 검출을 하는데 사용하는 배경 차영상 기법에 의한 움직임 및 변화 영역 검출 방법과 움직임 히스토리에 의한 움직임 검출법, 광류에 의한 움직임 검출법, 움직임 추적을 위한 추적하려는 물체의 히스토그램의 역투영을 이용하면서 물체의 중심점을 추적하는 MeanShift와 물체의 중심, 크기, 방향을 함께 추적하는 CamShift, Kalman 필터에 의한 움직임 추적 알고리즘 등이 있다. 본 논문에서는 물체의 색상과 모양 정보를 이용한 움직임 검출 알고리즘을 구현하고 검증하였다.

• 한국정보통신학회논문지
• /
• 제8권1호
• /
• pp.74-79
• /
• 2004

본 연구에서는 동작 검출 기법을 소형 화상 카메라에 적용하여 감시 영상을 검출하는 감시시스템을 구현하였다. 기존에 사용되던 차 영상의 화소 값을 이용한 동작 검출 기법은 배경 영상을 저장할 메모리가 필요하고 화소 단위의 데이터 처리로 인하여 수행 시간의 증가와 노이즈에 민감한 단점을 감수해야만 한다. 이러한 단점을 해결하고 노이즈에 강인한 성질을 갖게 하기 위해서 블록 단위로 모션 정보를 추출하여 비교하는 기법을 제안하였다. 블록별로 모션 정보를 얻는 경우 기준 영상의 블럭 단위의 특징 값과 현재 영상의 블럭 특징 값만을 비교하기 때문에 프레임 메모리가 필요 없고 단지 기준 영상의 블럭 특징 값만을 저장하면 된다. 또한 블럭 단위로 특징 값을 구하는 과정에서 화소 값을 이용한 동작 검출 보다 노이즈에 대한 영향을 감소시키고 카메라의 흔들림 등에 덜 민감한 효과를 얻을 수 있다.

• 제어로봇시스템학회논문지
• /
• 제21권1호
• /
• pp.21-27
• /
• 2015

A conventional fire detection has been developed based on images captured from a fixed camera. However, It is difficult to apply current algorithms to a flying Quad-rotor to detect fire. To solve this problem, we propose that the fire detection algorithm can be modified for Quad-rotor using Ego-motion compensation. The proposed fire detection algorithm consists of color detection, motion detection, and fire determination using a randomness test. Color detection and randomness test are adapted similarly from an existing algorithm. However, Ego-motion compensation is adapted on motion detection for compensating the degree of Quad-rotor's motion using Planar Projective Transformation based on Optical Flow, RANSAC Algorithm, and Homography. By adapting Ego-motion compensation on the motion detection step, it has been proven that the proposed algorithm has been able to detect fires 83% of the time in hovering mode.

• 전자공학회논문지B
• /
• 제31B권8호
• /
• pp.87-98
• /
• 1994

Object-oriented analysis-synthesis coding subdivides each image of a sequence into moving objects and compensates the motion of each object. Thus it can reconstruct real motion better than conventional motion-compensated coding techniques at very-low-bit-rates. It uses a mapping parameter technique for estimating motion information of each object. Since a mapping parameter technique uses gradient operators it is sensitive to redundant details and noise. To accurately determine mapping parameters, we propose a new analysis method using integral projections for estimation of gradient values. Also to reconstruct correctly the local motion the proposed algorithm divides an image into segmented objects each of which having uniform motion information while the conventional one assumes a large object having the same motion information. Computer simulation results with several test sequences show that the proposed image analysis method in object-oriented analysis-synthesis coding shows better performance than the conventional one.

• 한국통신학회논문지
• /
• 제25권10B호
• /
• pp.1813-1820
• /
• 2000

In this paper we proposed an efficient multiresolution motion estimation(MRME) algorithm using half-pixel accuracy motion estimation (HPAME) and characteristics of motion vectors in the baseband. Conventional MRME method needs exact motion vectors in the baseband because those are used as initial motion vectors in higher frequency subbands. Therefore the proposed method uses HPAME to estimate the motion vectors exactly in the baseband. Based on the characteristics of these motion vectors the motion vectors in the higher frequency subbands are selectively estimatied. That is motion vectors in the higher frequency subbands are estimated only for the blocks which have the half-pixel accuracy motion vectors in the baseband. In the proposed method by using HPAME in the baseband and selective motion estimation in the higher frequency subbands we can obtain reconstructed image with the similar quality with the conventional method though we reduce the computational complexity and the bit rate considerably.

• 한국멀티미디어학회논문지
• /
• 제21권8호
• /
• pp.813-820
• /
• 2018

This paper proposes new frame rate up-conversion algorithms. Adaptive motion estimation based on block complexity information are used to obtain more accurate motion vectors. Because the information on block complexity is extracted from the motion estimation prediction size from the original frame, additional computational complexity is not imparted. In experimental results, the proposed algorithms provide robust frame interpolation performance for whole test sequences. Also, the computational complexity of the proposed algorithm is reduced to a benchmark algorithm.