A local wavelet transform implementation versus an optimal row-column algorithm for the 2D multilevel decomposition

A new method for the implementation of the binary-tree decomposition of the convolution-based wavelet transform, called the local wavelet transform (LWT) has been recently proposed in the literature. While it produces exactly the same results as the classical row-column implementation of the transfo...

Full description

Saved in:
Bibliographic Details
Main Authors: Andreopoulos, Y., Zervas, N.D., Lafruit, G., Schelkens, P., Stouraitis, T., Goutis, C.E., Cornelis, J.
Format: Conference Proceeding
Language:English
Subjects:
Arithmetic
Bandwidth
Filters
Image coding
Laboratories
MPEG 4 Standard
Production systems
Random access memory
Very large scale integration
Wavelet transforms
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 333 vol.3
container_issue
container_start_page 330
container_title
container_volume 3
creator Andreopoulos, Y.
Zervas, N.D.
Lafruit, G.
Schelkens, P.
Stouraitis, T.
Goutis, C.E.
Cornelis, J.
description A new method for the implementation of the binary-tree decomposition of the convolution-based wavelet transform, called the local wavelet transform (LWT) has been recently proposed in the literature. While it produces exactly the same results as the classical row-column implementation of the transform, it has many implementation benefits. This fact is shown experimentally for the first time for a general-purpose processor-based architecture, by comparing our C implementation of the LWT with an optimal C implementation of the lifting-scheme row-column algorithm. The comparisons are made for the forward multilevel binary-tree decomposition using the 9/7 filter pair, in the typical Intel Pentium processor family.
doi_str_mv 10.1109/ICIP.2001.958118
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_958118</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>958118</ieee_id><sourcerecordid>958118</sourcerecordid><originalsourceid>FETCH-LOGICAL-i104t-5c14cab26059df8082f96bf2f62a6bbd01db3db6a6d7d3b0a6c253ebffccd4753</originalsourceid><addsrcrecordid>eNotkE1LAzEYhAMiqLV38ZQ_sDXJbrK7x1K_Fgp60HPJxxsbSTZLkrb4712pcxkYmIdhELqjZEUp6R-GzfC-YoTQVc87SrsLdEPajtSiZZxeoWXO32RWw5s5ukZ5jX3U0uOTPIKHgkuSY7YxBezC5CHAWGRxccRHSPmQsRxxnIoLcyXFU6WjP4QRS_8Vkyv7gOcqLnvA7BGHgy_Ow8zFBnQMU8zuD3WLLq30GZb_vkCfz08fm9dq-_YybNbbylHSlIpr2mipmCC8N7YjHbO9UJZZwaRQyhBqVG2UkMK0plZECs14DcparU3T8nqB7s9cBwC7Kc2j08_ufEv9CxFkXFk</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A local wavelet transform implementation versus an optimal row-column algorithm for the 2D multilevel decomposition</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Andreopoulos, Y. ; Zervas, N.D. ; Lafruit, G. ; Schelkens, P. ; Stouraitis, T. ; Goutis, C.E. ; Cornelis, J.</creator><creatorcontrib>Andreopoulos, Y. ; Zervas, N.D. ; Lafruit, G. ; Schelkens, P. ; Stouraitis, T. ; Goutis, C.E. ; Cornelis, J.</creatorcontrib><description>A new method for the implementation of the binary-tree decomposition of the convolution-based wavelet transform, called the local wavelet transform (LWT) has been recently proposed in the literature. While it produces exactly the same results as the classical row-column implementation of the transform, it has many implementation benefits. This fact is shown experimentally for the first time for a general-purpose processor-based architecture, by comparing our C implementation of the LWT with an optimal C implementation of the lifting-scheme row-column algorithm. The comparisons are made for the forward multilevel binary-tree decomposition using the 9/7 filter pair, in the typical Intel Pentium processor family.</description><identifier>ISBN: 0780367251</identifier><identifier>ISBN: 9780780367258</identifier><identifier>DOI: 10.1109/ICIP.2001.958118</identifier><language>eng</language><publisher>IEEE</publisher><subject>Arithmetic ; Bandwidth ; Filters ; Image coding ; Laboratories ; MPEG 4 Standard ; Production systems ; Random access memory ; Very large scale integration ; Wavelet transforms</subject><ispartof>Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205), 2001, Vol.3, p.330-333 vol.3</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/958118$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/958118$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Andreopoulos, Y.</creatorcontrib><creatorcontrib>Zervas, N.D.</creatorcontrib><creatorcontrib>Lafruit, G.</creatorcontrib><creatorcontrib>Schelkens, P.</creatorcontrib><creatorcontrib>Stouraitis, T.</creatorcontrib><creatorcontrib>Goutis, C.E.</creatorcontrib><creatorcontrib>Cornelis, J.</creatorcontrib><title>A local wavelet transform implementation versus an optimal row-column algorithm for the 2D multilevel decomposition</title><title>Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)</title><addtitle>ICIP</addtitle><description>A new method for the implementation of the binary-tree decomposition of the convolution-based wavelet transform, called the local wavelet transform (LWT) has been recently proposed in the literature. While it produces exactly the same results as the classical row-column implementation of the transform, it has many implementation benefits. This fact is shown experimentally for the first time for a general-purpose processor-based architecture, by comparing our C implementation of the LWT with an optimal C implementation of the lifting-scheme row-column algorithm. The comparisons are made for the forward multilevel binary-tree decomposition using the 9/7 filter pair, in the typical Intel Pentium processor family.</description><subject>Arithmetic</subject><subject>Bandwidth</subject><subject>Filters</subject><subject>Image coding</subject><subject>Laboratories</subject><subject>MPEG 4 Standard</subject><subject>Production systems</subject><subject>Random access memory</subject><subject>Very large scale integration</subject><subject>Wavelet transforms</subject><isbn>0780367251</isbn><isbn>9780780367258</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2001</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotkE1LAzEYhAMiqLV38ZQ_sDXJbrK7x1K_Fgp60HPJxxsbSTZLkrb4712pcxkYmIdhELqjZEUp6R-GzfC-YoTQVc87SrsLdEPajtSiZZxeoWXO32RWw5s5ukZ5jX3U0uOTPIKHgkuSY7YxBezC5CHAWGRxccRHSPmQsRxxnIoLcyXFU6WjP4QRS_8Vkyv7gOcqLnvA7BGHgy_Ow8zFBnQMU8zuD3WLLq30GZb_vkCfz08fm9dq-_YybNbbylHSlIpr2mipmCC8N7YjHbO9UJZZwaRQyhBqVG2UkMK0plZECs14DcparU3T8nqB7s9cBwC7Kc2j08_ufEv9CxFkXFk</recordid><startdate>2001</startdate><enddate>2001</enddate><creator>Andreopoulos, Y.</creator><creator>Zervas, N.D.</creator><creator>Lafruit, G.</creator><creator>Schelkens, P.</creator><creator>Stouraitis, T.</creator><creator>Goutis, C.E.</creator><creator>Cornelis, J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2001</creationdate><title>A local wavelet transform implementation versus an optimal row-column algorithm for the 2D multilevel decomposition</title><author>Andreopoulos, Y. ; Zervas, N.D. ; Lafruit, G. ; Schelkens, P. ; Stouraitis, T. ; Goutis, C.E. ; Cornelis, J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i104t-5c14cab26059df8082f96bf2f62a6bbd01db3db6a6d7d3b0a6c253ebffccd4753</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Arithmetic</topic><topic>Bandwidth</topic><topic>Filters</topic><topic>Image coding</topic><topic>Laboratories</topic><topic>MPEG 4 Standard</topic><topic>Production systems</topic><topic>Random access memory</topic><topic>Very large scale integration</topic><topic>Wavelet transforms</topic><toplevel>online_resources</toplevel><creatorcontrib>Andreopoulos, Y.</creatorcontrib><creatorcontrib>Zervas, N.D.</creatorcontrib><creatorcontrib>Lafruit, G.</creatorcontrib><creatorcontrib>Schelkens, P.</creatorcontrib><creatorcontrib>Stouraitis, T.</creatorcontrib><creatorcontrib>Goutis, C.E.</creatorcontrib><creatorcontrib>Cornelis, J.</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 Xplore</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Andreopoulos, Y.</au><au>Zervas, N.D.</au><au>Lafruit, G.</au><au>Schelkens, P.</au><au>Stouraitis, T.</au><au>Goutis, C.E.</au><au>Cornelis, J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A local wavelet transform implementation versus an optimal row-column algorithm for the 2D multilevel decomposition</atitle><btitle>Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)</btitle><stitle>ICIP</stitle><date>2001</date><risdate>2001</risdate><volume>3</volume><spage>330</spage><epage>333 vol.3</epage><pages>330-333 vol.3</pages><isbn>0780367251</isbn><isbn>9780780367258</isbn><abstract>A new method for the implementation of the binary-tree decomposition of the convolution-based wavelet transform, called the local wavelet transform (LWT) has been recently proposed in the literature. While it produces exactly the same results as the classical row-column implementation of the transform, it has many implementation benefits. This fact is shown experimentally for the first time for a general-purpose processor-based architecture, by comparing our C implementation of the LWT with an optimal C implementation of the lifting-scheme row-column algorithm. The comparisons are made for the forward multilevel binary-tree decomposition using the 9/7 filter pair, in the typical Intel Pentium processor family.</abstract><pub>IEEE</pub><doi>10.1109/ICIP.2001.958118</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0780367251
ispartof Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205), 2001, Vol.3, p.330-333 vol.3
issn
language eng
recordid cdi_ieee_primary_958118
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Arithmetic
Bandwidth
Filters
Image coding
Laboratories
MPEG 4 Standard
Production systems
Random access memory
Very large scale integration
Wavelet transforms
title A local wavelet transform implementation versus an optimal row-column algorithm for the 2D multilevel decomposition
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T19%3A05%3A31IST&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=A%20local%20wavelet%20transform%20implementation%20versus%20an%20optimal%20row-column%20algorithm%20for%20the%202D%20multilevel%20decomposition&rft.btitle=Proceedings%202001%20International%20Conference%20on%20Image%20Processing%20(Cat.%20No.01CH37205)&rft.au=Andreopoulos,%20Y.&rft.date=2001&rft.volume=3&rft.spage=330&rft.epage=333%20vol.3&rft.pages=330-333%20vol.3&rft.isbn=0780367251&rft.isbn_list=9780780367258&rft_id=info:doi/10.1109/ICIP.2001.958118&rft_dat=%3Cieee_6IE%3E958118%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i104t-5c14cab26059df8082f96bf2f62a6bbd01db3db6a6d7d3b0a6c253ebffccd4753%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=958118&rfr_iscdi=true