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

A new fast vector quantiser (VQ) is proposed which reduces computational complexity by searching the intersection of search 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 [1995] while preserving the same encoding quality as the full-search VQ