• Title/Summary/Keyword: NTSS

Search Result 25, Processing Time 0.017 seconds

Fast Block-Matching Motion Estimation Using Constrained Diamond Search Algorithm (구속조건을 적용한 다이아몬드 탐색 알고리즘에 의한 고속블록정합움직임추정)

  • 홍성용
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.4
    • /
    • pp.13-20
    • /
    • 2003
  • Based on the studies on the motion vector distributions estimated on the image sequences, we proposed constrained diamond search (DS) algorithm for fast block-matching motion estimation. By considering the fact that motion vectors are searched within the 2 pixels distance in vertically and horizontally on average, we confirmed that DS algorithm achieves close performance on error ratio and requires less computation compared with new three-step search (NTSS) algorithm. Also, by applying displaced frame difference (DFD) to DS algorithm, we reduced the computational loads needed to estimate the motion vectors within the stable block that do not have motions. And we reduced the possibilities falling into the local minima in the course of estimation of motion vectors by applying DFD to DS algorithm. So, we knew that proposed constrained DS algorithm achieved enhanced results as aspects of error ratio and the number of search points to be necessary compared with conventional DS algorithm, four step search (FSS) algorithm, and block-based gradient-descent search algorithm

  • PDF

The Study of Comparison of DCT-based H.263 Quantizer for Computative Quantity Reduction (계산량 감축을 위한 DCT-Based H.263 양자화기의 비교 연구)

  • Shin, Kyung-Cheol
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.3
    • /
    • pp.195-200
    • /
    • 2008
  • To compress the moving picture data effectively, it is needed to reduce spatial and temporal redundancy of input image data. While motion estimation! compensation methods is effectively able to reduce temporal redundancy but it is increased computation complexity because of the prediction between frames. So, the study of algorithm for computation reduction and real time processing is needed. This paper is presenting quantizer effectively able to quantize DCT coefficient considering the human visual sensitivity. As quantizer that proposed DCT-based H.263 could make transmit more frame than TMN5 at a same transfer speed, and it could decrease the frame drop effect. And the luminance signal appeared the difference of $-0.3{\sim}+0.65dB$ in the average PSNR for the estimation of objective image quality and the chrominance signal appeared the improvement in about 1.73dB in comparision with TMN5. The proposed method reduces $30{\sim}31%$ compared with NTSS and $20{\sim}21%$ compared to 4SS in comparition of calculation quantity.

  • PDF

HDS Method for Fast Searching of Motion Vector (움직임 벡터의 빠른 추정을 위한 HDS기법)

  • 김미영
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.338-343
    • /
    • 2004
  • In Block Matching Algorithm (BMA), a search pattern has a very important affect on the search time and the output quality. In this paper, we propose the HDS( Half Diamond Search) pattern based on the cross center-biased distribution property of a motion vector. At lust, the 4 points in the above, below, left, and right around the search center is calculated to decide the point of the MBD (Minimum Block Distortion). And an above point of the MBD is checked to calculate the SAD. If the SAD is less than the previous MBD, this process is repeated. Otherwise, the left and right points of MBD are calculated to decide the points that have the MBD between two points. These processes are repeated to the predicted direction for motion estimation. Experiments show that the speedup improvement of the proposed algorithm can be up to 23% while maintaining similar image quality.

Genetic Analysis of Seed Size in Watermelon (수박 종자크기에 대한 유전분석)

  • Kim, Yong-Jae;Yang, Tae-Jin;Park, Young-Hoon;Lee, Yong-Jik;Kang, Sun-Cheol;Kim, Yong-Kwon;Cho, Jeoung-Lai
    • Korean Journal of Breeding Science
    • /
    • v.41 no.4
    • /
    • pp.412-419
    • /
    • 2009
  • In order to study the inheritance of watermelon seed size, we used six watermelon lines of different seed sizes as parental lines. Six lines include three accessions, 'PI525088' with giant seed (GS), 'Charleston Gray' with big seed (BS), and 'NT' with normal medium size seed (NS), and three near isogenic lines, 'NTss' with small seed (SS), 'NTms' with micro seed (MS) and 'NTts' with tomato seed size (TS) bred by crosses between accession 'NT' of normal seed size and accession 'TDR' of the smallest seed size,. We inspected $F_1$, $F_2$, $BC_1F_1$ (P1), $BC_1F_1$ (P2) populations from the crosses between the adjacent seed size materials like $GS{\times}BS$, $BS{\times}NS$, $NS{\times}SS$, and $MS{\times}TS$, and two crosses between parental lines showing relatively big difference in seed size such as $GS{\times}TS$ and $NS{\times}TS$. Partial single dominant inheritance patterns were observed between $GS{\times}BS$, $NS{\times}SS$, and $MS{\times}TS$ and inheritance patterns based on two genes or more than two genes were speculated between $BS{\times}NS$. A very wide segregation range was observed from the population of $GS{\times}TS$ indicating many quantitative genes involved in the seed sizes. Overall, we speculated that more than six genes are involved in between the biggest and smallest seed size watermelon and three major genes between the normal seed size and the smallest seed size watermelon.

Motion Vector Estimation using T-shape Diamond Search Algorithm (TDS 기법을 이용한 움직임 벡터 추정)

  • Kim, Ki-Young;Jung, Mi-Gyoung
    • The KIPS Transactions:PartB
    • /
    • v.11B no.3
    • /
    • pp.309-316
    • /
    • 2004
  • In this paper, we proposed the TDS(T-shape Diamond Search) based on the directions of above, below, left and right points to estimate the motion vector fast and more correctly in this method, we exploit the facts that most motion vectors are enclosed in a circular region with a radius of 2 fixels around search center(0,0). At first, the 4 points in the above, below, left and right around the search center is calculated to decide the point of the MBD(Minimum Block Distortion). And then w. above point of the MBD is checked to calculate the SAD. If the SAD of the above point is less than the previous MBD, this process is repeated. Otherwise, the right and left points of MBD are calculated to decide The points that have the MBD between right point and left point. Above processes are repeated to the predicted direction for motion estimation. Especially, if the motions of image are concentrated in the crossing directions, the points of other directions are omitted. As a result, we can estimate motion vectors fast. Experiments show that the speedup improvement of the proposed algorithm over Diamond Search algorithm(DS) and HEXgon Based Search(HEXBS) can be up to 38∼50% while maintaining similar image Quality.