An analysis of isometry transforms in frequency domain for fast fractal encoding
A new fast fractal encoding algorithm, which minimizes the iterations of isometry transforms for each domain block, is proposed. The effects of isometry transforms are analyzed in the Walsh-Hadamard transform (WHT) domain, and the search for the minimum Euclidean-distance isometry transform to a ran...
Gespeichert in:
| Veröffentlicht in: | IEEE signal processing letters 1999-05, Vol.6 (5), p.100-102 |
|---|---|
| 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 | 102 |
|---|---|
| container_issue | 5 |
| container_start_page | 100 |
| container_title | IEEE signal processing letters |
| container_volume | 6 |
| creator | Lee, Sang-Moon Ra, Sung-Woong |
| description | A new fast fractal encoding algorithm, which minimizes the iterations of isometry transforms for each domain block, is proposed. The effects of isometry transforms are analyzed in the Walsh-Hadamard transform (WHT) domain, and the search for the minimum Euclidean-distance isometry transform to a range block starts with the one having the minimum feature distance. The search is then terminated with the test reports that the remaining isometry transforms have larger distances than current minimum distance. The second and third low frequency coefficients of WHT are used as the features of the image blocks. The simulation results confirmed that our algorithm produces a completely identical fractal code, including minimum distance isometry transform, to that of the conventional full search in reduced time. |
| doi_str_mv | 10.1109/97.755426 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_755426</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>755426</ieee_id><sourcerecordid>27032713</sourcerecordid><originalsourceid>FETCH-LOGICAL-c340t-69b4ce9cf3b8544cccffaefe04a39bf382c9536508b6f49f7c53d79d6491ac5d3</originalsourceid><addsrcrecordid>eNqF0U1LxDAQBuAgCq6rB6-eclI8dM13MsdF_IIFPei5pGkilbZZk-6h_94uXTzqaYZ5H4aBQeiSkhWlBO5Ar7SUgqkjtKBSmoJxRY-nnmhSABBzis5y_iKEGGrkAr2te2x72465yTgG3OTY-SGNeEi2zyGmLuOmxyH5753v3Yjr2Nn9ICYcbB6mxLrBtngKY930n-foJNg2-4tDXaKPx4f3--di8_r0cr_eFI4LMhQKKuE8uMArI4VwzoVgffBEWA5V4IY5kFxJYioVBATtJK811EoAtU7WfIlu5r3bFKfT8lB2TXa-bW3v4y6XQAE4UUxM8vpPyYxgwCn7H2rCmaZ8grczdCnmnHwot6npbBpLSsr9G0rQ5fyGyV7NtvHe_7pD-AMBy4Ls</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27032713</pqid></control><display><type>article</type><title>An analysis of isometry transforms in frequency domain for fast fractal encoding</title><source>IEEE Electronic Library (IEL)</source><creator>Lee, Sang-Moon ; Ra, Sung-Woong</creator><creatorcontrib>Lee, Sang-Moon ; Ra, Sung-Woong</creatorcontrib><description>A new fast fractal encoding algorithm, which minimizes the iterations of isometry transforms for each domain block, is proposed. The effects of isometry transforms are analyzed in the Walsh-Hadamard transform (WHT) domain, and the search for the minimum Euclidean-distance isometry transform to a range block starts with the one having the minimum feature distance. The search is then terminated with the test reports that the remaining isometry transforms have larger distances than current minimum distance. The second and third low frequency coefficients of WHT are used as the features of the image blocks. The simulation results confirmed that our algorithm produces a completely identical fractal code, including minimum distance isometry transform, to that of the conventional full search in reduced time.</description><identifier>ISSN: 1070-9908</identifier><identifier>EISSN: 1558-2361</identifier><identifier>DOI: 10.1109/97.755426</identifier><identifier>CODEN: ISPLEM</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithms ; Approximation algorithms ; Blocking ; Encoding ; Euclidean distance ; Fractal analysis ; Fractals ; Frequency domain analysis ; Image coding ; Image converters ; Reflection ; Rotation measurement ; Searching ; Testing ; Transforms</subject><ispartof>IEEE signal processing letters, 1999-05, Vol.6 (5), p.100-102</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c340t-69b4ce9cf3b8544cccffaefe04a39bf382c9536508b6f49f7c53d79d6491ac5d3</citedby><cites>FETCH-LOGICAL-c340t-69b4ce9cf3b8544cccffaefe04a39bf382c9536508b6f49f7c53d79d6491ac5d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/755426$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/755426$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lee, Sang-Moon</creatorcontrib><creatorcontrib>Ra, Sung-Woong</creatorcontrib><title>An analysis of isometry transforms in frequency domain for fast fractal encoding</title><title>IEEE signal processing letters</title><addtitle>LSP</addtitle><description>A new fast fractal encoding algorithm, which minimizes the iterations of isometry transforms for each domain block, is proposed. The effects of isometry transforms are analyzed in the Walsh-Hadamard transform (WHT) domain, and the search for the minimum Euclidean-distance isometry transform to a range block starts with the one having the minimum feature distance. The search is then terminated with the test reports that the remaining isometry transforms have larger distances than current minimum distance. The second and third low frequency coefficients of WHT are used as the features of the image blocks. The simulation results confirmed that our algorithm produces a completely identical fractal code, including minimum distance isometry transform, to that of the conventional full search in reduced time.</description><subject>Algorithms</subject><subject>Approximation algorithms</subject><subject>Blocking</subject><subject>Encoding</subject><subject>Euclidean distance</subject><subject>Fractal analysis</subject><subject>Fractals</subject><subject>Frequency domain analysis</subject><subject>Image coding</subject><subject>Image converters</subject><subject>Reflection</subject><subject>Rotation measurement</subject><subject>Searching</subject><subject>Testing</subject><subject>Transforms</subject><issn>1070-9908</issn><issn>1558-2361</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqF0U1LxDAQBuAgCq6rB6-eclI8dM13MsdF_IIFPei5pGkilbZZk-6h_94uXTzqaYZ5H4aBQeiSkhWlBO5Ar7SUgqkjtKBSmoJxRY-nnmhSABBzis5y_iKEGGrkAr2te2x72465yTgG3OTY-SGNeEi2zyGmLuOmxyH5753v3Yjr2Nn9ICYcbB6mxLrBtngKY930n-foJNg2-4tDXaKPx4f3--di8_r0cr_eFI4LMhQKKuE8uMArI4VwzoVgffBEWA5V4IY5kFxJYioVBATtJK811EoAtU7WfIlu5r3bFKfT8lB2TXa-bW3v4y6XQAE4UUxM8vpPyYxgwCn7H2rCmaZ8grczdCnmnHwot6npbBpLSsr9G0rQ5fyGyV7NtvHe_7pD-AMBy4Ls</recordid><startdate>19990501</startdate><enddate>19990501</enddate><creator>Lee, Sang-Moon</creator><creator>Ra, Sung-Woong</creator><general>IEEE</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>19990501</creationdate><title>An analysis of isometry transforms in frequency domain for fast fractal encoding</title><author>Lee, Sang-Moon ; Ra, Sung-Woong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c340t-69b4ce9cf3b8544cccffaefe04a39bf382c9536508b6f49f7c53d79d6491ac5d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Algorithms</topic><topic>Approximation algorithms</topic><topic>Blocking</topic><topic>Encoding</topic><topic>Euclidean distance</topic><topic>Fractal analysis</topic><topic>Fractals</topic><topic>Frequency domain analysis</topic><topic>Image coding</topic><topic>Image converters</topic><topic>Reflection</topic><topic>Rotation measurement</topic><topic>Searching</topic><topic>Testing</topic><topic>Transforms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lee, Sang-Moon</creatorcontrib><creatorcontrib>Ra, Sung-Woong</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE signal processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lee, Sang-Moon</au><au>Ra, Sung-Woong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An analysis of isometry transforms in frequency domain for fast fractal encoding</atitle><jtitle>IEEE signal processing letters</jtitle><stitle>LSP</stitle><date>1999-05-01</date><risdate>1999</risdate><volume>6</volume><issue>5</issue><spage>100</spage><epage>102</epage><pages>100-102</pages><issn>1070-9908</issn><eissn>1558-2361</eissn><coden>ISPLEM</coden><abstract>A new fast fractal encoding algorithm, which minimizes the iterations of isometry transforms for each domain block, is proposed. The effects of isometry transforms are analyzed in the Walsh-Hadamard transform (WHT) domain, and the search for the minimum Euclidean-distance isometry transform to a range block starts with the one having the minimum feature distance. The search is then terminated with the test reports that the remaining isometry transforms have larger distances than current minimum distance. The second and third low frequency coefficients of WHT are used as the features of the image blocks. The simulation results confirmed that our algorithm produces a completely identical fractal code, including minimum distance isometry transform, to that of the conventional full search in reduced time.</abstract><pub>IEEE</pub><doi>10.1109/97.755426</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1070-9908 |
| ispartof | IEEE signal processing letters, 1999-05, Vol.6 (5), p.100-102 |
| issn | 1070-9908 1558-2361 |
| language | eng |
| recordid | cdi_ieee_primary_755426 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Approximation algorithms Blocking Encoding Euclidean distance Fractal analysis Fractals Frequency domain analysis Image coding Image converters Reflection Rotation measurement Searching Testing Transforms |
| title | An analysis of isometry transforms in frequency domain for fast fractal encoding |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T08%3A05%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20analysis%20of%20isometry%20transforms%20in%20frequency%20domain%20for%20fast%20fractal%20encoding&rft.jtitle=IEEE%20signal%20processing%20letters&rft.au=Lee,%20Sang-Moon&rft.date=1999-05-01&rft.volume=6&rft.issue=5&rft.spage=100&rft.epage=102&rft.pages=100-102&rft.issn=1070-9908&rft.eissn=1558-2361&rft.coden=ISPLEM&rft_id=info:doi/10.1109/97.755426&rft_dat=%3Cproquest_RIE%3E27032713%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=27032713&rft_id=info:pmid/&rft_ieee_id=755426&rfr_iscdi=true |