A Modified No Search Algorithm for Fractal Image Compression
Fractal image compression has some desirable properties like high quality at high compression ratio, fast decoding, and resolution independence. Therefore it can be used for many applications such as texture mapping and pattern recognition and image watermarking. But it suffers from long encoding ti...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Salarian, Mehdi Mohamadinia, Babak Rasekhi, Jalil |
| description | Fractal image compression has some desirable properties like high quality at
high compression ratio, fast decoding, and resolution independence. Therefore
it can be used for many applications such as texture mapping and pattern
recognition and image watermarking. But it suffers from long encoding time due
to its need to find the best match between sub blocks. This time is related to
the approach that is used. In this paper we present a fast encoding Algorithm
based on no search method. Our goal is that more blocks are covered in initial
step of quad tree algorithm. Experimental result has been compared with other
new fast fractal coding methods, showing it is better in term of bit rate in
same condition while the other parameters are fixed. |
| doi_str_mv | 10.48550/arxiv.1501.02894 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1501_02894</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1501_02894</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-8d1f8d8a0db5a36784e552e8a3e3e3aae14ce5e66fae0f8bbb4a45d86753a8243</originalsourceid><addsrcrecordid>eNotj7FOwzAURb0woMIHMOEfSLBjP-dV6hJFFCq1MNA9eomfW0sJrpwKwd8DBZ3hbkf3CHGnVWkRQD1Q_owfpQalS1Xh0l6LVSN3yccQ2cuXJN-Y8nCUzXhIOZ6Pkwwpy3Wm4Uyj3Ex0YNmm6ZR5nmN6vxFXgcaZb_93Ifbrx337XGxfnzZtsy3I1bZArwN6JOV7IONqtAxQMZLhH4hY24GBnQvEKmDf95YseHQ1GMLKmoW4_9Ne7nenHCfKX91vRnfJMN9ctEIc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Modified No Search Algorithm for Fractal Image Compression</title><source>arXiv.org</source><creator>Salarian, Mehdi ; Mohamadinia, Babak ; Rasekhi, Jalil</creator><creatorcontrib>Salarian, Mehdi ; Mohamadinia, Babak ; Rasekhi, Jalil</creatorcontrib><description>Fractal image compression has some desirable properties like high quality at
high compression ratio, fast decoding, and resolution independence. Therefore
it can be used for many applications such as texture mapping and pattern
recognition and image watermarking. But it suffers from long encoding time due
to its need to find the best match between sub blocks. This time is related to
the approach that is used. In this paper we present a fast encoding Algorithm
based on no search method. Our goal is that more blocks are covered in initial
step of quad tree algorithm. Experimental result has been compared with other
new fast fractal coding methods, showing it is better in term of bit rate in
same condition while the other parameters are fixed.</description><identifier>DOI: 10.48550/arxiv.1501.02894</identifier><language>eng</language><subject>Computer Science - Computer Vision and Pattern Recognition ; Computer Science - Multimedia</subject><creationdate>2015-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1501.02894$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1501.02894$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Salarian, Mehdi</creatorcontrib><creatorcontrib>Mohamadinia, Babak</creatorcontrib><creatorcontrib>Rasekhi, Jalil</creatorcontrib><title>A Modified No Search Algorithm for Fractal Image Compression</title><description>Fractal image compression has some desirable properties like high quality at
high compression ratio, fast decoding, and resolution independence. Therefore
it can be used for many applications such as texture mapping and pattern
recognition and image watermarking. But it suffers from long encoding time due
to its need to find the best match between sub blocks. This time is related to
the approach that is used. In this paper we present a fast encoding Algorithm
based on no search method. Our goal is that more blocks are covered in initial
step of quad tree algorithm. Experimental result has been compared with other
new fast fractal coding methods, showing it is better in term of bit rate in
same condition while the other parameters are fixed.</description><subject>Computer Science - Computer Vision and Pattern Recognition</subject><subject>Computer Science - Multimedia</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj7FOwzAURb0woMIHMOEfSLBjP-dV6hJFFCq1MNA9eomfW0sJrpwKwd8DBZ3hbkf3CHGnVWkRQD1Q_owfpQalS1Xh0l6LVSN3yccQ2cuXJN-Y8nCUzXhIOZ6Pkwwpy3Wm4Uyj3Ex0YNmm6ZR5nmN6vxFXgcaZb_93Ifbrx337XGxfnzZtsy3I1bZArwN6JOV7IONqtAxQMZLhH4hY24GBnQvEKmDf95YseHQ1GMLKmoW4_9Ne7nenHCfKX91vRnfJMN9ctEIc</recordid><startdate>20150113</startdate><enddate>20150113</enddate><creator>Salarian, Mehdi</creator><creator>Mohamadinia, Babak</creator><creator>Rasekhi, Jalil</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20150113</creationdate><title>A Modified No Search Algorithm for Fractal Image Compression</title><author>Salarian, Mehdi ; Mohamadinia, Babak ; Rasekhi, Jalil</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-8d1f8d8a0db5a36784e552e8a3e3e3aae14ce5e66fae0f8bbb4a45d86753a8243</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Computer Science - Computer Vision and Pattern Recognition</topic><topic>Computer Science - Multimedia</topic><toplevel>online_resources</toplevel><creatorcontrib>Salarian, Mehdi</creatorcontrib><creatorcontrib>Mohamadinia, Babak</creatorcontrib><creatorcontrib>Rasekhi, Jalil</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Salarian, Mehdi</au><au>Mohamadinia, Babak</au><au>Rasekhi, Jalil</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Modified No Search Algorithm for Fractal Image Compression</atitle><date>2015-01-13</date><risdate>2015</risdate><abstract>Fractal image compression has some desirable properties like high quality at
high compression ratio, fast decoding, and resolution independence. Therefore
it can be used for many applications such as texture mapping and pattern
recognition and image watermarking. But it suffers from long encoding time due
to its need to find the best match between sub blocks. This time is related to
the approach that is used. In this paper we present a fast encoding Algorithm
based on no search method. Our goal is that more blocks are covered in initial
step of quad tree algorithm. Experimental result has been compared with other
new fast fractal coding methods, showing it is better in term of bit rate in
same condition while the other parameters are fixed.</abstract><doi>10.48550/arxiv.1501.02894</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1501.02894 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1501_02894 |
| source | arXiv.org |
| subjects | Computer Science - Computer Vision and Pattern Recognition Computer Science - Multimedia |
| title | A Modified No Search Algorithm for Fractal Image Compression |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T18%3A37%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Modified%20No%20Search%20Algorithm%20for%20Fractal%20Image%20Compression&rft.au=Salarian,%20Mehdi&rft.date=2015-01-13&rft_id=info:doi/10.48550/arxiv.1501.02894&rft_dat=%3Carxiv_GOX%3E1501_02894%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |