Publications
Detailed Information
Inceremental-search fast vector quantizer using triangular inequalities for multiple anchors
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Sunyoung | - |
dc.contributor.author | Chae, Soo-Ik | - |
dc.date.accessioned | 2009-11-25T22:10:29Z | - |
dc.date.available | 2009-11-25T22:10:29Z | - |
dc.date.issued | 1998 | - |
dc.identifier.citation | Electronics Letters- IEE, 1998, 34, pp. 1192-1193 | en |
dc.identifier.issn | 0013-5194 | - |
dc.identifier.uri | https://hdl.handle.net/10371/15470 | - |
dc.description.abstract | A 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.iso | en | en |
dc.publisher | Institution of Engineering and Technology | en |
dc.title | Inceremental-search fast vector quantizer using triangular inequalities for multiple anchors | en |
dc.type | Article | en |
dc.contributor.AlternativeAuthor | 최선영 | - |
dc.contributor.AlternativeAuthor | 채수익 | - |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.