Browse

Inceremental-search fast vector quantizer using triangular inequalities for multiple anchors

DC Field Value Language
dc.contributor.authorChoi, Sunyoung-
dc.contributor.authorChae, Soo-Ik-
dc.date.accessioned2009-11-25T22:10:29Z-
dc.date.available2009-11-25T22:10:29Z-
dc.date.issued1998-
dc.identifier.citationElectronics Letters- IEE, 1998, 34, pp. 1192-1193en
dc.identifier.issn0013-5194-
dc.identifier.urihttps://hdl.handle.net/10371/15470-
dc.description.abstractA new fast vector quantiser (VQ) is proposed which reduces
computational complexity by searching the intersection of search
regions defmed 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.
en
dc.language.isoenen
dc.publisherInstitution of Engineering and Technologyen
dc.titleInceremental-search fast vector quantizer using triangular inequalities for multiple anchorsen
dc.typeArticleen
dc.contributor.AlternativeAuthor최선영-
dc.contributor.AlternativeAuthor채수익-
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Electrical and Computer Engineering (전기·정보공학부)Journal Papers (저널논문_전기·정보공학부)
Files in This Item:
There are no files associated with this item.
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse