부산대학교 도서관

This paper proposes a Modified Multiple Triangular Inequality Elimination (MMTIE) to further reduce the search number of candidate codevectors. The MMTIE adopts the same original search space as the MTIE scheme with the initial best-matched codevector selected by the Initial Index Code Assignment (IICA), and integrates the intersection rule of the Candidate Codevectors Group (CCG) scheme to further reduce the search space and find the best-matched candidate by table look-up operation in the coding stage. Since the IICA approach selects an initial best-matched codevector by exploiting the correlations of the neighboring blocks and the predefined CCG space is obtained from the off-line stage, the MMTIE algorithm achieves better coding efficiency than the original MTIE at a cost of extra memory. In addition, the proposed algorithm provides the same coding quality as the full search method. Experimental results demonstrate the effectiveness of the proposed scheme in comparison with our previous MTIE coding scheme.