An algorithm for mean pyramids vector quantization using Hadamard transform and tree structure
Compressing an image is a significant technique for the sake of saving a little more bandwidth or storage space. However, one of the main problems in vector quantization (VQ) is the high computational complexity of searching for the appropriate codeword in its codebook. To overcome this problem a fa...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1932 |
|---|---|
| container_issue | |
| container_start_page | 1929 |
| container_title | |
| container_volume | |
| creator | Swilem, A. Girgis, M.R. Zanaty, E.A. Ramadan, R. |
| description | Compressing an image is a significant technique for the sake of saving a little more bandwidth or storage space. However, one of the main problems in vector quantization (VQ) is the high computational complexity of searching for the appropriate codeword in its codebook. To overcome this problem a fast search algorithm based on Tree-Hadamard Transform of the mean pyramid levels of the codewords is proposed. The algorithm uses tree structure of the highest level for all codewords to speed up the searching process. The proposed algorithm is more efficient than using only Hadamard transformed mean pyramids especially in high dimension cases. |
| doi_str_mv | 10.1109/ICIP.2009.5413523 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5413523</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5413523</ieee_id><sourcerecordid>5413523</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-a610479305594c145d33051a66d38ea4b3037daeb233adb219a9d817b478bc083</originalsourceid><addsrcrecordid>eNpVUMtKAzEUjS-w1n6AuMkPTM3NYyZZlqK2UNCFbi13JmmNdDI1yQj16x2xG1fnxb0cDiE3wKYAzNwt58vnKWfMTJUEobg4IRNTaZBcSlUqxU7JiAsNhVbSnP3LRHlORqA4L6TW7JJcpfTBGGcgYETeZoHibttFn99buukibR0Guj9EbL1N9Ms1eTA_ewzZf2P2XaB98mFLF2ixxWhpjhjScNlSDL_KOZpy7JvcR3dNLja4S25yxDF5fbh_mS-K1dPjcj5bFR4qlQssgcnKCKaUkQ1IZcXAAcvSCu1Q1oKJyqKruRBoaw4GjdVQ1bLSdcO0GJPbv7_eObfeRz80O6yPU4kfnqBZIw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An algorithm for mean pyramids vector quantization using Hadamard transform and tree structure</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Swilem, A. ; Girgis, M.R. ; Zanaty, E.A. ; Ramadan, R.</creator><creatorcontrib>Swilem, A. ; Girgis, M.R. ; Zanaty, E.A. ; Ramadan, R.</creatorcontrib><description>Compressing an image is a significant technique for the sake of saving a little more bandwidth or storage space. However, one of the main problems in vector quantization (VQ) is the high computational complexity of searching for the appropriate codeword in its codebook. To overcome this problem a fast search algorithm based on Tree-Hadamard Transform of the mean pyramid levels of the codewords is proposed. The algorithm uses tree structure of the highest level for all codewords to speed up the searching process. The proposed algorithm is more efficient than using only Hadamard transformed mean pyramids especially in high dimension cases.</description><identifier>ISSN: 1522-4880</identifier><identifier>ISBN: 9781424456536</identifier><identifier>ISBN: 1424456533</identifier><identifier>EISSN: 2381-8549</identifier><identifier>EISBN: 9781424456550</identifier><identifier>EISBN: 9781424456543</identifier><identifier>EISBN: 142445655X</identifier><identifier>EISBN: 1424456541</identifier><identifier>DOI: 10.1109/ICIP.2009.5413523</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Computational complexity ; Computer science ; Data compression ; Data structures ; Encoding ; Hadamard mean pyramid ; Hadamard transform ; Image coding ; Image storage ; mean pyramid ; Tree data structures ; Vector quantization</subject><ispartof>2009 16th IEEE International Conference on Image Processing (ICIP), 2009, p.1929-1932</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5413523$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5413523$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Swilem, A.</creatorcontrib><creatorcontrib>Girgis, M.R.</creatorcontrib><creatorcontrib>Zanaty, E.A.</creatorcontrib><creatorcontrib>Ramadan, R.</creatorcontrib><title>An algorithm for mean pyramids vector quantization using Hadamard transform and tree structure</title><title>2009 16th IEEE International Conference on Image Processing (ICIP)</title><addtitle>ICIP</addtitle><description>Compressing an image is a significant technique for the sake of saving a little more bandwidth or storage space. However, one of the main problems in vector quantization (VQ) is the high computational complexity of searching for the appropriate codeword in its codebook. To overcome this problem a fast search algorithm based on Tree-Hadamard Transform of the mean pyramid levels of the codewords is proposed. The algorithm uses tree structure of the highest level for all codewords to speed up the searching process. The proposed algorithm is more efficient than using only Hadamard transformed mean pyramids especially in high dimension cases.</description><subject>Bandwidth</subject><subject>Computational complexity</subject><subject>Computer science</subject><subject>Data compression</subject><subject>Data structures</subject><subject>Encoding</subject><subject>Hadamard mean pyramid</subject><subject>Hadamard transform</subject><subject>Image coding</subject><subject>Image storage</subject><subject>mean pyramid</subject><subject>Tree data structures</subject><subject>Vector quantization</subject><issn>1522-4880</issn><issn>2381-8549</issn><isbn>9781424456536</isbn><isbn>1424456533</isbn><isbn>9781424456550</isbn><isbn>9781424456543</isbn><isbn>142445655X</isbn><isbn>1424456541</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVUMtKAzEUjS-w1n6AuMkPTM3NYyZZlqK2UNCFbi13JmmNdDI1yQj16x2xG1fnxb0cDiE3wKYAzNwt58vnKWfMTJUEobg4IRNTaZBcSlUqxU7JiAsNhVbSnP3LRHlORqA4L6TW7JJcpfTBGGcgYETeZoHibttFn99buukibR0Guj9EbL1N9Ms1eTA_ewzZf2P2XaB98mFLF2ixxWhpjhjScNlSDL_KOZpy7JvcR3dNLja4S25yxDF5fbh_mS-K1dPjcj5bFR4qlQssgcnKCKaUkQ1IZcXAAcvSCu1Q1oKJyqKruRBoaw4GjdVQ1bLSdcO0GJPbv7_eObfeRz80O6yPU4kfnqBZIw</recordid><startdate>200911</startdate><enddate>200911</enddate><creator>Swilem, A.</creator><creator>Girgis, M.R.</creator><creator>Zanaty, E.A.</creator><creator>Ramadan, R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200911</creationdate><title>An algorithm for mean pyramids vector quantization using Hadamard transform and tree structure</title><author>Swilem, A. ; Girgis, M.R. ; Zanaty, E.A. ; Ramadan, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-a610479305594c145d33051a66d38ea4b3037daeb233adb219a9d817b478bc083</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Bandwidth</topic><topic>Computational complexity</topic><topic>Computer science</topic><topic>Data compression</topic><topic>Data structures</topic><topic>Encoding</topic><topic>Hadamard mean pyramid</topic><topic>Hadamard transform</topic><topic>Image coding</topic><topic>Image storage</topic><topic>mean pyramid</topic><topic>Tree data structures</topic><topic>Vector quantization</topic><toplevel>online_resources</toplevel><creatorcontrib>Swilem, A.</creatorcontrib><creatorcontrib>Girgis, M.R.</creatorcontrib><creatorcontrib>Zanaty, E.A.</creatorcontrib><creatorcontrib>Ramadan, R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Swilem, A.</au><au>Girgis, M.R.</au><au>Zanaty, E.A.</au><au>Ramadan, R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An algorithm for mean pyramids vector quantization using Hadamard transform and tree structure</atitle><btitle>2009 16th IEEE International Conference on Image Processing (ICIP)</btitle><stitle>ICIP</stitle><date>2009-11</date><risdate>2009</risdate><spage>1929</spage><epage>1932</epage><pages>1929-1932</pages><issn>1522-4880</issn><eissn>2381-8549</eissn><isbn>9781424456536</isbn><isbn>1424456533</isbn><eisbn>9781424456550</eisbn><eisbn>9781424456543</eisbn><eisbn>142445655X</eisbn><eisbn>1424456541</eisbn><abstract>Compressing an image is a significant technique for the sake of saving a little more bandwidth or storage space. However, one of the main problems in vector quantization (VQ) is the high computational complexity of searching for the appropriate codeword in its codebook. To overcome this problem a fast search algorithm based on Tree-Hadamard Transform of the mean pyramid levels of the codewords is proposed. The algorithm uses tree structure of the highest level for all codewords to speed up the searching process. The proposed algorithm is more efficient than using only Hadamard transformed mean pyramids especially in high dimension cases.</abstract><pub>IEEE</pub><doi>10.1109/ICIP.2009.5413523</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1522-4880 |
| ispartof | 2009 16th IEEE International Conference on Image Processing (ICIP), 2009, p.1929-1932 |
| issn | 1522-4880 2381-8549 |
| language | eng |
| recordid | cdi_ieee_primary_5413523 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Bandwidth Computational complexity Computer science Data compression Data structures Encoding Hadamard mean pyramid Hadamard transform Image coding Image storage mean pyramid Tree data structures Vector quantization |
| title | An algorithm for mean pyramids vector quantization using Hadamard transform and tree structure |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T04%3A41%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20algorithm%20for%20mean%20pyramids%20vector%20quantization%20using%20Hadamard%20transform%20and%20tree%20structure&rft.btitle=2009%2016th%20IEEE%20International%20Conference%20on%20Image%20Processing%20(ICIP)&rft.au=Swilem,%20A.&rft.date=2009-11&rft.spage=1929&rft.epage=1932&rft.pages=1929-1932&rft.issn=1522-4880&rft.eissn=2381-8549&rft.isbn=9781424456536&rft.isbn_list=1424456533&rft_id=info:doi/10.1109/ICIP.2009.5413523&rft_dat=%3Cieee_6IE%3E5413523%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424456550&rft.eisbn_list=9781424456543&rft.eisbn_list=142445655X&rft.eisbn_list=1424456541&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5413523&rfr_iscdi=true |