.png){kind=icon}
.png){kind=icon}
Return
A fast encoding algorithm for vector quantization using difference pyramid structure
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2007.910599.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposed a fast vector quantization encoding algorithm called difference pyramid search (DPS). According to the formation of the difference pyramid and partial distortion elimination, a rejection test inequality is derived to progressively reject a lot of nonclosest code words as early as possible. Experimental results show that the proposed DPS algorithm outperforms other pyramid-based fast search algorithms, including mean pyramid search, L2-norm pyramid search, and mean-variance pyramid search.
Keywords:
difference pyramid
mean pyramid
partial distortion elimination (PDE)
vector quantization (VQ)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
No organization information available