EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Digital media pattern design compression and optimization method based on K-means clustering and LLE dimensionality reduction

Binmei Liu, Shiwan Zhou iD, Jing Sun, Xiaojuan Liu, Wenting Lu

PLOS One · 16.06.2026 · 21 (6) · e0350623

DOI: 10.1371/journal.pone.0350623 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS One, online erschienen am 16.06.2026. Verfasst von Binmei Liu und 4 weiteren Autor:innen. Beteiligte Einrichtung: The Academy of VR and Art, Jiangxi University of Software Professional Technology, Nanchang, China. Hauptthemen laut MEDLINE: Data Compression, Compression Algorithms, Image Processing, Computer-Assisted, Pattern Recognition, Automated. Die Arbeit nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The rapid development of digital media demands higher quality in pattern design. Simultaneously, significant redundant information hinders the transmission and sharing of these patterns, creating an urgent need for image compression. However, traditional image compression methods struggle to balance efficiency and quality. To address this, a new image compression model for digital media patterns is proposed, based on K-means clustering and Locally Linear Embedding methods. This model creates an efficient compression solution by integrating dynamic clustering parameter selection based on color histograms, multi-dimensional image segmentation of color and texture, and a local linear embedding dimensionality reduction algorithm using dynamic neighborhood selection. The model achieves a compression ratio of 84% and a Peak Signal-to-Noise Ratio of 41dB, with no significant quality difference before and after compression, validating the effectiveness of the improvements made to the basic methods. In practical application experiments, the model’s multi-scale structural similarity reaches 0.71. When processing a large number of patterns, the fastest response time is 189ms, with a minimum memory usage of 16.1M. The shortest processing time on a single-core processor is 0.34s. These experimental results demonstrate that the model balances compression efficiency and quality, offering superior compression performance, good robustness, and the ability to handle various complex tasks and adapt to different application scenarios, meeting the high standards of the digital media industry for image compression.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Data CompressionCompression AlgorithmsImage Processing, Computer-AssistedPattern Recognition, AutomatedClustering AlgorithmsAlgorithmsDigital MediaDimensionality ReductionCluster AnalysisSignal-To-Noise Ratio

Autor:innen und Institutionen

  • The Academy of VR and Art, Jiangxi University of Software Professional Technology, Nanchang, China.
  • College of Creative Arts, Universiti Teknologi MARA, Selangor, Malaysia.
  • College of Humanities, Gandong University, Fuzhou, China.
  • Postdoctoral Research Station Pioneer Software Inc, Jiangxi University of Software Professional Technology, Nanchang, China.

ORCID-Profile: Shiwan Zhou

Zitieren

APA

Liu, B., Zhou, S., Sun, J., Liu, X., & Lu, W. (2026). Digital media pattern design compression and optimization method based on K-means clustering and LLE dimensionality reduction. PLOS One, 21(6), e0350623. https://doi.org/10.1371/journal.pone.0350623

Vancouver

Liu B, Zhou S, Sun J, Liu X, Lu W. Digital media pattern design compression and optimization method based on K-means clustering and LLE dimensionality reduction. PLOS One. 2026;21(6):e0350623. doi:10.1371/journal.pone.0350623

BibTeX
@article{Liu2026,
  author = {Liu, Binmei and Zhou, Shiwan and Sun, Jing and Liu, Xiaojuan and Lu, Wenting},
  title = {Digital media pattern design compression and optimization method based on K-means clustering and LLE dimensionality reduction},
  journal = {PLOS One},
  year = {2026},
  volume = {21},
  number = {6},
  pages = {e0350623},
  doi = {10.1371/journal.pone.0350623}
}
Kostenlos starten →