Incremental-search fast vector quantiser using triangular inequalities for multiple anchors

作     者：Choi, SY Chae, SI 

作者机构：Seoul Natl Univ Sch Elect Engn Kwanak Gu Seoul 151742 South Korea 

出 版 物：《ELECTRONICS LETTERS》 (Electron. Lett.)

年 卷 期：1998年第34卷第12期

页      面：1192-1193页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 

主　　题：multiply operations data compression vector quantisation search regions multiple anchors incremental-search fast vector quantiser image coding triangular inequalities encoding quality computational complexity greedy algorithm 

摘      要：A new fast vector quantiser (VQ) is proposed which reduces computational complexity by searching the intersection of starch regions defined by triangular inequalities for multiple anchors. A greedy algorithm which selects an anchor set is also proposed. The proposed VQ reduces the number of multiply operations by 24.4% compared to Li s VQ [4] while preserving the same encoding quality as the full-search VQ.