1991
DOI: 10.1016/0923-5965(91)90032-w
|View full text |Cite
|
Sign up to set email alerts
|

A comparison of vector quantization techniques in transform and subband coding of imagery

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1993
1993
2021
2021

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(2 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…The simulation results show that Out_in clustering algorithm based on density converges quickly. Clustering algorithm is widely used in vector quantization image compression [12][13][14][15][16], Out_in clustering algorithm based on density is same. Q. E. D. Theorem 1 gives a meaningful result about mathematical expectation.…”
Section: Introductionmentioning
confidence: 99%
“…The simulation results show that Out_in clustering algorithm based on density converges quickly. Clustering algorithm is widely used in vector quantization image compression [12][13][14][15][16], Out_in clustering algorithm based on density is same. Q. E. D. Theorem 1 gives a meaningful result about mathematical expectation.…”
Section: Introductionmentioning
confidence: 99%
“…For the monochrome "Lena" image, our PSNR value of 33.86 dB is below that of the adaptive DCT-based scheme of [ll] (34.6 dB), but above those of the adaptive subband coding scheme of [12] (32.5 dB) and the pyramid VQbased DCT scheme of [13] (32.2 dB). Similarly, for the monochrome "Girl" image, we find that the entropyconstrained TCQ system performs better than the lattice VQ-based DCT scheme of [14] (38.8 dB) and the pyramid VQ-based DCT schemes of [15][16] (35.72 dB and 35.92 dB, respectively).…”
Section: Resultsmentioning
confidence: 87%