2011
DOI: 10.1016/j.aeue.2010.08.004
|View full text |Cite
|
Sign up to set email alerts
|

A fast near-optimum block truncation coding method using a truncated K-means algorithm and inter-block correlation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0
1

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 14 publications
0
7
0
1
Order By: Relevance
“…El algoritmo de agrupamiento K-medias se basa en la obtención del cuadrado de la mínima distancia Euclideana [9,10,11,12], entre el grupo de datos y el centro del agrupamiento (centroide) ̅ ( ) ∶…”
Section: Método De Detección Del Umbralunclassified
“…El algoritmo de agrupamiento K-medias se basa en la obtención del cuadrado de la mínima distancia Euclideana [9,10,11,12], entre el grupo de datos y el centro del agrupamiento (centroide) ̅ ( ) ∶…”
Section: Método De Detección Del Umbralunclassified
“…Because of the limitations of the traditional BTC method, some improved BTC methods have been proposed to improve the image quality and the compression ratio [2]. Yang et al [3] proposed a near-optimum, accelerated BTC algorithm based on a truncated K-means algorithm that drastically reduced the computational complexity by utilizing the image inter-block correlation. An improved BTC scheme based on a set of pre-defined bit planes has also been proposed [4].…”
Section: Introductionmentioning
confidence: 99%
“…Image compression is widely used in many widespread applications, such as video conferencing, video telephony, multimedia systems, processing and record keeping systems for the transmission of television images of standard and high definition, biomedicine, and other procedures. Moreover, their development is based on investing in new image compression methods research [3].…”
Section: Introductionmentioning
confidence: 99%