Browse

Extended mean-distance-ordered search using multiple l1and l2 inequalities for fast vector quantization

DC Field Value Language
dc.contributor.authorChoi, Sunyoung-
dc.contributor.authorChae, Soo-Ik-
dc.date.accessioned2009-12-17T01:41:51Z-
dc.date.available2009-12-17T01:41:51Z-
dc.date.issued2000-04-
dc.identifier.citationIEEE Trans. Circuits Syst. II, vol. 47, pp. 349-352en
dc.identifier.issn1057-7130-
dc.identifier.urihttps://hdl.handle.net/10371/21069-
dc.description.abstractMean-distance-ordered search (MOS) algorithms [1], [2]
were proposed as a fast and efficient method for vector quantization (VQ)
encoding. However, the efficiency of MOS algorithms is limited because
they use only one inequality in reducing the search region. Therefore,
we propose an extended MOS algorithm using multiple anchor vectors
which exploits multiple and inequalities to reduce the search region
further.We also describe a greedy algorithm for selecting an anchor vector
set that reduces the computational cost of the extended MOS algorithm.
For eight test images, the number of operations required in the extended
MOS algorithm was 66.2% of that in the previous MOS algorithm on the
average when the codebook size is 256, while producing the same encoding
quality to that of the full-search VQ.
en
dc.language.isoen-
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectAnchor vectoren
dc.subjectmean-distance-ordered searchen
dc.subjectnormen
dc.subjecttriangularen
dc.subjectinequalityen
dc.subjectvector meanen
dc.subjectvector quantizationen
dc.titleExtended mean-distance-ordered search using multiple l1and l2 inequalities for fast vector quantizationen
dc.typeArticleen
dc.contributor.AlternativeAuthor최선영-
dc.contributor.AlternativeAuthor채수익-
dc.identifier.doi10.1109/82.839670-
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Electrical and Computer Engineering (전기·정보공학부)Journal Papers (저널논문_전기·정보공학부)
Files in This Item:
  • mendeley

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

Browse