1 / 1

Adaptive Clustering Algorithm for Data Compression

This algorithm iteratively clusters data, updates centroids, and generates codewords to achieve compression. It dynamically adjusts cluster sizes and codewords to minimize error. Implements a split-and-merge approach for efficient compression.

sharne
Télécharger la présentation

Adaptive Clustering Algorithm for Data Compression

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Reset • c_count、 sum • mse=0.0 Begin • Find data centroid • generate1’st codeword • level=1 t 1 >frame_num 0 Re-encode frame level level>codeword num 1 • Update cluster’s • sum • c_count • mse 1 • Split the largest • cluster into 2 clusters • level++ • generate two • codewords (left and • right shift by delta) • Check if any empty cluster? • level- - Compute new codewords t >frame_num 1 level < codeword_num? 0 no Re-encode frame yes • Split the largest • cluster into 2 clusters • level++ • generate two • codewords (left and • right shift by delta) yes Update cluster’s sum &c count • Check if any empty cluster? • level- - • Compute • mse • relative_error_cha nge • update last_mse= mse Compute new codewords While split=true or relative_error_change>ERROR yes • initialize • last_mse =0.0 no finish

More Related