Further investigation on adaptive search

Clicks: 329
ID: 78743
2014
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
Steady

Ranked #3 of 8 articles by views in the journal of engineering

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
Adaptive search is one of the fastest fractal compression algorithms and has gained great success in many industrial applications. By substituting the luminance offset by the range block mean, the authors create a completely new version for both the encoding and decoding algorithms. In this paper, theoretically, they prove that the proposed decoding algorithm converges at least as fast as the existing decoding algorithms using the luminance offset. In addition, they prove that the attractor of the decoding algorithm can be represented by a linear combination of range-averaged images. These theorems are very important contributions to the theory and applications of fractal image compression. As a result, the decoding image can be represented as the sum of the DC and AC component images, which is similar with discrete cosine transform or wavelet transform. To further speed up this algorithm and reduce the complexity of range and domain blocks matching, they propose two improvements in this paper, that is, employing the post-quantisation and geometric neighbouring local search to replace the currently used pre-quantisation and the global search, respectively. The corresponding experimental results show the proposed encoding and decoding algorithms can provide a better performance compared with the existing algorithms.
Reference Key
pi2014furtherthe Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Pi, Ming Hong;Ma, Jun;Ma, Jun;Basu, Anup;Mandal, Mrinal;
Journal the journal of engineering
Year 2014
DOI
DOI not found
URL
http://digital-library.theiet.org/content/journals/10.1049/joe.2014.0037
Keywords
Engineering (General). Civil engineering (General) Electrical engineering. Electronics. Nuclear engineering 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.