• Title/Summary/Keyword: 움직임 추정 정보

Search Result 311, Processing Time 0.043 seconds

Implementation of the Estimation Application of Instability Index Using Kinect (키넥트를 이용한 산만도 추정 어플리케이션 구현)

  • Kim, Hyeon-Woo;Jeong, Do-Un
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.872-875
    • /
    • 2016
  • 본 연구에서는 무구속적으로 사용자의 활동상태를 모니터링하고 이를 기반으로 산만도를 추정하기 위한 연구를 수행하였다. 사용자의 활동상태 모니터링을 위해서는 키넥트 센서를 활용하여 머리에서의 관절정보와 어깨관절정보를 검출하고, 각 검출지점의 시간당 좌표변화를 인덱스화하여 움직임 변화정도를 측정하였다. 이러한 움직임정보로부터 산만도의 추정을 위하여 움직임의 빈도와 움직임의 강도를 분석하고 이로부터 산만도를 추정하기위한 인덱스를 개발하였다. 실제 사용자의 활동상태로부터 추출된 움직임정보 및 산만도 추정인덱스의 모니터링을 위하여 PC기반의 모니터링 및 스마트폰기반의 어플리케이션을 구현하였다. 구현된 시스템의 성능평가를 위하여 키넥트를 이용한 산만도 추정 어플리케이션과 동시에 비디오 계측을 통해 움직임의 정도에 따른 산만도 추정식의 결과를 비교분석한 결과 개발된 산만도 추정시스템과 비디오분석결과의 상관관계가 높음을 실험으로 확인하였다.

  • PDF

Transcoding from Distributed Video Coding to H.264/AVC Based on Motion Vectors of Side Information (보조정보의 움직임 벡터를 이용한 분산 비디오 코딩에서 H.264/AVC로의 트랜스코딩)

  • Min, Kyung-Yeon;Yoo, Sung-Eun;Sim, Dong-Gyu;Jeon, Byeung-Woo
    • Journal of Broadcast Engineering
    • /
    • v.16 no.1
    • /
    • pp.108-122
    • /
    • 2011
  • In this paper, a transcoding method with low computational complexity and high coding efficiency is proposed to transcode distributed video coding (DVC) bitstreams to H.264/AVC ones. For the proposed high-performance transcoding with low complexity, not only Wyner-Ziv frames but also key frames can be transcoded with motion vectors estimated in generation of side information. As a motion vector is estimated from a key frame to a prior key frame for side information generation, the motion vector can be used to encode the intra key frame as a predicted frame. Motion estimation is performed with two predicted motion vectors. One is the motion vector from side information generation and the other is median of motion vectors of neighboring blocks. The proposed method selects the best motion vector between two motion vectors based on rate-distortion optimization. Coding efficiency can be improved with a small size of search range, because a motion vector estimated in side information generation is used as an initial motion vector for transcoding. In the experimental results, complexity of transcoder is reduced about 12% and bitrate performance increases about 28.7%.

Improved Prediction Structure and Motion Estimation Method for Multi-view Video Coding (다시점 비디오 부호화를 위한 개선된 예측 구조와 움직임 추정 기법)

  • Yoon, Hyo Sun;Kim, Mi Young
    • Journal of KIISE
    • /
    • v.41 no.11
    • /
    • pp.900-910
    • /
    • 2014
  • Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. The computational complexity of multi view video coding increases in proportion to the number of cameras. To reduce computational complexity and maintain the image quality, improved prediction structure and motion estimation method is proposed in this paper. The proposed prediction structure exploits an average distance between the current picture and its reference pictures. The proposed prediction structure divides every GOP into several groups to decide the maximum index of hierarchical B layer and the number of pictures of each B layer. And the proposed motion estimation method uses a hierarchical search strategy. This strategy method consists of modified diamond search pattern, progressive diamond search pattern and modified raster search pattern. Experiment results show that the complexity reduction of the proposed prediction structure and motion estimation method over JMVC (Joint Multiview Video Coding) reference model using hierarchical B pictures of Fraunhofer-HHI and TZ search method can be up to 40~70% while maintaining similar video quality and bit rates.

Efficient face tracking using perspective motion model in feature space (원근 움직임 모델을 이용한 특징 공간 상에서의 효율적인 얼굴 영역 추적)

  • 최송하;이성환
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.521-523
    • /
    • 1999
  • 본 논문에서는 입력 영상 열에서 얼굴 영역을 추출하고, 영역 내 특징점들의 움직임 벡터를 원근 움직임 모델에 정합하여 얼굴 영역을 추적하는 새로운 방법을 제안한다. 제안된 방법은 계층적 형판정합을 이용하여 얼굴 영역을 추출하고, 해당 영역에서 DoG 반응의 국부최대치를 찾아 특징점을 구한다. 그리고 최소제곱추정기법을 이용하여 각 특징점에서 얻어진 움직임 벡터를 원근 모델에 정합한다. 제안된 방법은 선별된 특징점에서 움직임 벡터를 계산함으로써 연산량을 줄일 수 있었고, 원근 움직임 모델을 이용함으로써 잡영에 강한 특성을 보인다.

  • PDF

Motion Compensated Temporal Filter using Nonlinear Optical Flow Estimation for Ultrasound Image (초음파 영상에서 비선형 광학 흐름 추정 방법을 이용한 움직임 보상 시간 필터)

  • Lim, Soo-Chul;Han, Tae-Hee;Kim, Baek-Sop
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.754-756
    • /
    • 2005
  • 본 논문은 연속 초음파 영상에서 움직임 보상 시간 필터를 적용하여 영상의 품질을 향상시키는 방법을 제안한다. 비선형 광학 흐름 추정 방법을 이용하여 화소 단위의 움직임을 추정하고, 이를 바탕으로 시간적 재귀 필터링을 적용한다 화소 단위 움직임 벡터의 양이 작을 경우 필터링을 크게 하고, 움직임 벡터의 양이 클 경우 필터링을 작게 적용한다. 그 결과 프로브에 의한 전역적 움직임과 측정 대상물에 의한 국부적 움직임으로 발생되는 블러 현상을 극소화하고 잡음을 감소시켜 영상의 품질을 향상시켰다.

  • PDF

An Adaptive Search Range Decision Algorithm for Fast Motion Estimation using Local Statistics of Neighboring Blocks (고속 움직임 추정을 위한 인접 블록 국부 통계 기반의 적응 탐색 영역 결정 방식)

  • 김지희;김철우;김후종;홍민철
    • Journal of Broadcast Engineering
    • /
    • v.7 no.4
    • /
    • pp.310-316
    • /
    • 2002
  • In this paper, we propose an adaptive search range decision algorithm for fast motion estimation of video coding. Block matching algorithm for motion vector estimation that improves coding efficiency by reduction of temporal redundancy has trade-off problem between the motion vector accuracy and the complexity. The proposed algorithm playing as a pre-processing of fast motion estimation adaptively determines the motion search range by the local statistics of neighboring motion vectors. resulting in dramatic reduction of the computational cost without the loss of coding efficiency. Experimental results show the capability of the proposed algorithm.

Fast Motion Estimation using Adaptive Search Region Prediction (적응적 탐색 영역 예측을 이용한 고속 움직임 추정)

  • Ryu, Kwon-Yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.7
    • /
    • pp.1187-1192
    • /
    • 2008
  • This paper proposes a fast motion estimation using an adaptive search region and a new three step search. The proposed method improved in the quality of motion compensation image as $0.43dB{\sim}2.19dB$, according as it predict motion of current block from motion vector of neigher blocks, and adaptively set up search region using predicted motion information. We show that the proposed method applied a new three step search pattern is able to fast motion estimation, according as it reduce computational complexity per blocks as $1.3%{\sim}1.9%$ than conventional method.

An Adaptive Block Matching Algorithm Based on Temporal Correlations (시간적 상관성을 이용한 적응적 블록 정합 알고리즘)

  • Yoon, Hyo-Sun;Lee, Guee-Sang
    • The KIPS Transactions:PartB
    • /
    • v.9B no.2
    • /
    • pp.199-204
    • /
    • 2002
  • 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 information 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, we present an adaptive motion estimation approach bated on temporal correlations of consecutive image frames that defines the search pattern and determines the location of the initial search point adaptively. Through experiments, compared with DS(Diamond Search) algorithm, the proposed algorithm is about 0.1∼0.5(dB) better than DS in terms of PSNR(Peak Signal to Noise Ratio) and improves as high as 50% compared with DS in terms of average number of search point per motion vector estimation.

A Hierarchical Block Matching Algorithm Based on Camera Panning Compensation (카메라 패닝 보상에 기반한 계층적 블록 정합 알고리즘)

  • Gwak, No-Yun;Hwang, Byeong-Won
    • 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.

  • PDF

Hierarchical Feature Based Block Motion Estimation for Ultrasound Image Sequences (초음파 영상을 위한 계층적 특징점 기반 블록 움직임 추출)

  • Kim, Baek-Sop;Shin, Seong-Chul
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.4
    • /
    • pp.402-410
    • /
    • 2006
  • This paper presents a method for feature based block motion estimation that uses multi -resolution image sequences to obtain the panoramic images in the continuous ultrasound image sequences. In the conventional block motion estimation method, the centers of motion estimation blocks are set at the predetermined and equally spaced locations. This requires the large blocks to include at least one feature, which inevitably requires long estimation time. In this paper, we propose an adaptive method which locates the center of the motion estimation blocks at the feature points. This make it possible to reduce the block size while keeping the motion estimation accuracy The Harris-Stephen corner detector is used to get the feature points. The comer points tend to group together, which cause the error in the global motion estimation. In order to distribute the feature points as evenly as Possible, the image is firstly divided into regular subregions, and a strongest corner point is selected as a feature in each subregion. The ultrasound Images contain speckle patterns and noise. In order to reduce the noise artifact and reduce the computational time, the proposed method use the multi-resolution image sequences. The first algorithm estimates the motion in the smoothed low resolution image, and the estimated motion is prolongated to the next higher resolution image. By this way the size of search region can be reduced in the higher resolution image. Experiments were performed on three types of ultrasound image sequences. These were shown that the proposed method reduces both the computational time (from 77ms to 44ms) and the displaced frame difference (from 66.02 to 58.08).