• Title/Summary/Keyword: MHT algorithm

Search Result 5, Processing Time 0.023 seconds

Performance Prediction of the MHT Algorithm for Tracking under Cluttered Environments (클러터 환경에서 표적 추적을 위한 다중 가설 추적 알고리듬의 성능 예측)

  • 정영헌
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.41 no.4
    • /
    • pp.13-20
    • /
    • 2004
  • In this paper, we developed a method for predicting the tracking performance of the multiple hypothesis tracking (MHT) algorithm. The MHT algerithm is known to be a measurement-oriented optimal Bayesian approach and is superior to any other tracking filters because it takes into account the events that the measurements can be originated from new targets and false alarms as well as interesting targets. In the MHT algorithm, a number of candidate hypotheses are generated and evaluated later as more data are received. The probability of each candidate hypotheses is approximately evaluated by using the hybrid conditional average approach (HYCA). We performed numerical experiments to show the validity of our performance prediction.

Performance Prediction of Multiple Hypothesis Tracking Algorithm (다중 가설 추적 알고리듬의 추적 성능예측)

  • 정영헌
    • Proceedings of the IEEK Conference
    • /
    • 2003.07c
    • /
    • pp.2787-2790
    • /
    • 2003
  • In this paper, we predict tracking performance of the multiple hypothesis tracking (MHT) algorithm. The MHT algorithm is known to be an optimal Bayesian approach and is superior to asly other tracking filters because it takes into account the events that the measurements can be originated from new targets and false alarms 3s well as interesting targets. In the MHT algorithm, a number of candidate hypotheses are generated and evaluated later as more data are received. The probability of each candidate hypotheses is approximately evaluated by using the hybrid conditional average approach (HYCA). We performed numerical experiments to show the validity of our performance prediction.

  • PDF

Lossless Frame Memory Compression with Low Complexity based on Block-Buffer Structure for Efficient High Resolution Video Processing (고해상도 영상의 효과적인 처리를 위한 블록 버퍼 기반의 저 복잡도 무손실 프레임 메모리 압축 방법)

  • Kim, Jongho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.11
    • /
    • pp.20-25
    • /
    • 2016
  • This study addresses a low complexity and lossless frame memory compression algorithm based on block-buffer structure for efficient high resolution video processing. Our study utilizes the block-based MHT (modified Hadamard transform) for spatial decorrelation and AGR (adaptive Golomb-Rice) coding as an entropy encoding stage to achieve lossless image compression with low complexity and efficient hardware implementation. The MHT contains only adders and 1-bit shift operators. As a result of AGR not requiring additional memory space and memory access operations, AGR is effective for low complexity development. Comprehensive experiments and computational complexity analysis demonstrate that the proposed algorithm accomplishes superior compression performance relative to existing methods, and can be applied to hardware devices without image quality degradation as well as negligible modification of the existing codec structure. Moreover, the proposed method does not require the memory access operation, and thus it can reduce costs for hardware implementation and can be useful for processing high resolution video over Full HD.

A Study on Seam Tracking for Robotic Arc Welding Using Snapshot Visual Data (비젼 데이타를 이용한 아크 용접로보트의 용접선 추적에 관한 연구)

  • Kim, Eun-Yeob;Kim, Kwang-Soo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.18 no.2
    • /
    • pp.83-97
    • /
    • 1992
  • A new approach, to seam tracking for robotic are welding is proposed. In this approach, the weld model is a snapshot image and the acquired image is analyzed and compared to the welding database which contains CAD data, weld positions, weld parameters, etc. This paper presents a fast and robust algorithm for the Hough Transform. This modified Hough Transform(MHT) algorithm uses the least-squares regression analysis method in order to approximate the edge lines more precisely, and leads to a significant reduction in both computation and storage. In comparison with the conventional seam tracking methods, this new approach has the advantages of low cost, continuous welding, and various type welding.

  • PDF

A New Predictive EC Algorithm for Reduction of Memory Size and Bandwidth Requirements in Wavelet Transform (웨이블릿 변환의 메모리 크기와 대역폭 감소를 위한 Prediction 기반의 Embedded Compression 알고리즘)

  • Choi, Woo-Soo;Son, Chang-Hoon;Kim, Ji-Won;Na, Seong-Yu;Kim, Young-Min
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.7
    • /
    • pp.917-923
    • /
    • 2011
  • In this paper, a new prediction based embedded compression (EC) codec algorithm for the JPEG2000 encoder system is proposed to reduce excessive memory requirements. The EC technique can reduce the 50 % memory requirement for intermediate low-frequency coefficients during multiple discrete wavelet transform (DWT) stages compared with direct implementation of the DWT engine of this paper. The LOCO-I predictor and MAP are widely used in many lossless picture compression codec. The proposed EC algorithm use these predictor which are very simple but surprisingly effective. The predictive EC scheme adopts a forward adaptive quantization and fixed length coding to encoding the prediction error. Simulation results show that our LOCO-I and MAP based EC codecs present only PSNR degradation of 0.48 and 0.26 dB in average, respectively. The proposed algorithm improves the average PSNR by 1.39 dB compared to the previous work in [9].