An ACO algorithm for image compression

Clicks: 334
ID: 78741
2006
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Star

Ranked #2 of 2 articles by views in clei electronic journal

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
This paper is an application of Ant Colony Metaheuristic (ACO) to the problem of image fractal compression using IFS. An ACO hybrid algorithm is proposed for image fractal compression and the results obtained are shown. According to the tests carried out, the proposed algorithm offers images with similar quality to that obtained with a deterministic method, in about 34% less time.
Reference Key
martinez2006anclei Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Martinez, Cristian;
Journal clei electronic journal
Year 2006
DOI
DOI not found
URL
http://clei.org/cleiej-beta/index.php/cleiej/article/view/307
Keywords
Computer applications to medicine. Medical informatics Science telecommunication electronics electronic computers. computer science print media

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.