• Title/Summary/Keyword: Obstacle localization

Search Result 52, Processing Time 0.017 seconds

A Past Elimination Algorithm of Impossible Candidate Vectors Using Matching Scan Method in Motion Estimation of Full Search (전영역 탐색 방식의 움직임 예측에서 매칭 스캔 방법을 이용한 불가능한 후보 벡터의 고속 제거 알고리즘)

  • Kim Jone-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.8
    • /
    • pp.1080-1087
    • /
    • 2005
  • Significant computations for full search (FS) motion estimation have been a big obstacle in real-time video coding and recent MPEG-4 AVC (advanced video coding) standard requires much more computations than conventional MPEG-2 for motion estimation. To reduce an amount of computation of full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without any degradation of predicted images like the conventional FS. The computational reduction without any degradation in predicted image comes from fast elimination of impossible candidate motion vectors. We obtain faster elimination of inappropriate motion vectors using efficient matching units from localization of complex area in image data and dithering order based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination (PDE) algorithm, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

  • PDF

Performance Evaluation of RSSI-based Various Trilateration Localization (RSSI기반에서 다양한 삼변측량 위치인식 기법들의 성능평가)

  • Kim, Sun-Gwan;Kim, Tae-Hoon;Tak, Sung-Woo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.493-496
    • /
    • 2011
  • Currently in the development of community wireless technology is gaining interest in location-based services and as a result, the importance of the location information is a growing trend. To calculate the location information is being suggested several ways, among them Trilateration is representative. Trilateration is three beacon nodes, the distance between the location in which you want to calculate with information. Beacon from a node to know where to get information when the distance between the obstacle and the distance error caused by the surrounding environment, which leads to the exact location can not be obtained. Currently due to distance error, location information has a variety of algorithms to reduce the error. However, a systematic analysis of these algorithms is not progress. This paper analyzes the location-aware technologies, and the error the distance of the location information to reduce errors in the various aspects of the algorithm for the systematic and empirical comparison was evaluated through the analysis.

  • PDF