Overlapping block discrete cosine transform coding and its fast algorithm

The discrete cosine transform (DCT) method is well known for a highly efficient coding for still images. A problem in this method is that the block distortion is observed in low‐rate coding. The overlapping block transform (OBT) has recently been proposed, aiming at the reduction of the block distor...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronics & communications in Japan. Part 1, Communications Communications, 1992, Vol.75 (4), p.59-73
Hauptverfasser: Sawami, Hideo, Morikawa, Yoshitaka, Hamada, Hiroshi
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 73
container_issue 4
container_start_page 59
container_title Electronics & communications in Japan. Part 1, Communications
container_volume 75
creator Sawami, Hideo
Morikawa, Yoshitaka
Hamada, Hiroshi
description The discrete cosine transform (DCT) method is well known for a highly efficient coding for still images. A problem in this method is that the block distortion is observed in low‐rate coding. The overlapping block transform (OBT) has recently been proposed, aiming at the reduction of the block distortion. OBT is derived as a frequency analyzer/synthesizer with the origin of the spatial coordinate at the mid‐point between the sampling points and the main processing operation results in a DCT of unordinary type. This increases the computational complexity compared to the ordinary DCT. From such a viewpoint, this paper first derives the overlapping block DCT (OBDCT) with the same main processing as that of the ordinary DCT, by placing the origin of the spatial coordinate at the sampling point. OBDCT has the same coding efficiency as that of the traditional OBT, and OBDCT with the transform length 8 has the same coding efficiency as that of DCT with the transform length 16. A fast OBDCT algorithm is derived by integrating and simplifying the proposed OBDCT and the transform processing. Finally, it is shown that the fast OBDCT with the forementioned transform length can be executed by 55 percent of multiplications of the fast OBT and 67 percent of the fast DCT.
doi_str_mv 10.1002/ecja.4410750406
format Article
fullrecord <record><control><sourceid>wiley_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1002_ecja_4410750406</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ECJA4410750406</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2646-e6022bd257a89d1436a14222348ce5b5d5bda0e4ebac21d2055993020b96a6ad3</originalsourceid><addsrcrecordid>eNqFkEFPwjAYhhujiYieve4PDL5-azsWT0AAUSIHNXprurbDwthIu6j8eyEzGk-e3uTN-7yHh5BrCj0KgH2r16rHGIWUAwNxQjqUI8SCITslnUHKRSwE0nNyEcIaADLBaYfMl-_Wl2q3c9UqystabyLjgva2sZGug6ts1HhVhaL220NhjjNVmcg1ISpUaCJVrmrvmrftJTkrVBns1Xd2yfN08jS-jRfL2Xw8XMQaBROxFYCYG-SpGmSGskQoyhAxYQNtec4Nz40Cy2yuNFKDwHmWJYCQZ0IJZZIu6be_2tcheFvInXdb5feSgjyakEcT8tfEgbhpiQ9X2v1_czkZ3w3_0HFLu9DYzx9a-Y0UaZJy-fIwk1McjbJHdi9fky-jJ3JT</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Overlapping block discrete cosine transform coding and its fast algorithm</title><source>EBSCOhost Business Source Complete</source><creator>Sawami, Hideo ; Morikawa, Yoshitaka ; Hamada, Hiroshi</creator><creatorcontrib>Sawami, Hideo ; Morikawa, Yoshitaka ; Hamada, Hiroshi</creatorcontrib><description>The discrete cosine transform (DCT) method is well known for a highly efficient coding for still images. A problem in this method is that the block distortion is observed in low‐rate coding. The overlapping block transform (OBT) has recently been proposed, aiming at the reduction of the block distortion. OBT is derived as a frequency analyzer/synthesizer with the origin of the spatial coordinate at the mid‐point between the sampling points and the main processing operation results in a DCT of unordinary type. This increases the computational complexity compared to the ordinary DCT. From such a viewpoint, this paper first derives the overlapping block DCT (OBDCT) with the same main processing as that of the ordinary DCT, by placing the origin of the spatial coordinate at the sampling point. OBDCT has the same coding efficiency as that of the traditional OBT, and OBDCT with the transform length 8 has the same coding efficiency as that of DCT with the transform length 16. A fast OBDCT algorithm is derived by integrating and simplifying the proposed OBDCT and the transform processing. Finally, it is shown that the fast OBDCT with the forementioned transform length can be executed by 55 percent of multiplications of the fast OBT and 67 percent of the fast DCT.</description><identifier>ISSN: 8756-6621</identifier><identifier>EISSN: 1520-6424</identifier><identifier>DOI: 10.1002/ecja.4410750406</identifier><language>eng</language><publisher>New York: Wiley Subscription Services, Inc., A Wiley Company</publisher><subject>discrete cosine transform ; fast algorithm ; Frequency analysis/synthesis ; image data compression ; lapped orthogonal transform ; overlapping block transform ; subband/transform coding ; transform coding</subject><ispartof>Electronics &amp; communications in Japan. Part 1, Communications, 1992, Vol.75 (4), p.59-73</ispartof><rights>Copyright © 1992 Wiley Periodicals, Inc., A Wiley Company</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c2646-e6022bd257a89d1436a14222348ce5b5d5bda0e4ebac21d2055993020b96a6ad3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4023,27922,27923,27924</link.rule.ids></links><search><creatorcontrib>Sawami, Hideo</creatorcontrib><creatorcontrib>Morikawa, Yoshitaka</creatorcontrib><creatorcontrib>Hamada, Hiroshi</creatorcontrib><title>Overlapping block discrete cosine transform coding and its fast algorithm</title><title>Electronics &amp; communications in Japan. Part 1, Communications</title><addtitle>Electron. Comm. Jpn. Pt. I</addtitle><description>The discrete cosine transform (DCT) method is well known for a highly efficient coding for still images. A problem in this method is that the block distortion is observed in low‐rate coding. The overlapping block transform (OBT) has recently been proposed, aiming at the reduction of the block distortion. OBT is derived as a frequency analyzer/synthesizer with the origin of the spatial coordinate at the mid‐point between the sampling points and the main processing operation results in a DCT of unordinary type. This increases the computational complexity compared to the ordinary DCT. From such a viewpoint, this paper first derives the overlapping block DCT (OBDCT) with the same main processing as that of the ordinary DCT, by placing the origin of the spatial coordinate at the sampling point. OBDCT has the same coding efficiency as that of the traditional OBT, and OBDCT with the transform length 8 has the same coding efficiency as that of DCT with the transform length 16. A fast OBDCT algorithm is derived by integrating and simplifying the proposed OBDCT and the transform processing. Finally, it is shown that the fast OBDCT with the forementioned transform length can be executed by 55 percent of multiplications of the fast OBT and 67 percent of the fast DCT.</description><subject>discrete cosine transform</subject><subject>fast algorithm</subject><subject>Frequency analysis/synthesis</subject><subject>image data compression</subject><subject>lapped orthogonal transform</subject><subject>overlapping block transform</subject><subject>subband/transform coding</subject><subject>transform coding</subject><issn>8756-6621</issn><issn>1520-6424</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNqFkEFPwjAYhhujiYieve4PDL5-azsWT0AAUSIHNXprurbDwthIu6j8eyEzGk-e3uTN-7yHh5BrCj0KgH2r16rHGIWUAwNxQjqUI8SCITslnUHKRSwE0nNyEcIaADLBaYfMl-_Wl2q3c9UqystabyLjgva2sZGug6ts1HhVhaL220NhjjNVmcg1ISpUaCJVrmrvmrftJTkrVBns1Xd2yfN08jS-jRfL2Xw8XMQaBROxFYCYG-SpGmSGskQoyhAxYQNtec4Nz40Cy2yuNFKDwHmWJYCQZ0IJZZIu6be_2tcheFvInXdb5feSgjyakEcT8tfEgbhpiQ9X2v1_czkZ3w3_0HFLu9DYzx9a-Y0UaZJy-fIwk1McjbJHdi9fky-jJ3JT</recordid><startdate>1992</startdate><enddate>1992</enddate><creator>Sawami, Hideo</creator><creator>Morikawa, Yoshitaka</creator><creator>Hamada, Hiroshi</creator><general>Wiley Subscription Services, Inc., A Wiley Company</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>1992</creationdate><title>Overlapping block discrete cosine transform coding and its fast algorithm</title><author>Sawami, Hideo ; Morikawa, Yoshitaka ; Hamada, Hiroshi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2646-e6022bd257a89d1436a14222348ce5b5d5bda0e4ebac21d2055993020b96a6ad3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>discrete cosine transform</topic><topic>fast algorithm</topic><topic>Frequency analysis/synthesis</topic><topic>image data compression</topic><topic>lapped orthogonal transform</topic><topic>overlapping block transform</topic><topic>subband/transform coding</topic><topic>transform coding</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sawami, Hideo</creatorcontrib><creatorcontrib>Morikawa, Yoshitaka</creatorcontrib><creatorcontrib>Hamada, Hiroshi</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><jtitle>Electronics &amp; communications in Japan. Part 1, Communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sawami, Hideo</au><au>Morikawa, Yoshitaka</au><au>Hamada, Hiroshi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Overlapping block discrete cosine transform coding and its fast algorithm</atitle><jtitle>Electronics &amp; communications in Japan. Part 1, Communications</jtitle><addtitle>Electron. Comm. Jpn. Pt. I</addtitle><date>1992</date><risdate>1992</risdate><volume>75</volume><issue>4</issue><spage>59</spage><epage>73</epage><pages>59-73</pages><issn>8756-6621</issn><eissn>1520-6424</eissn><abstract>The discrete cosine transform (DCT) method is well known for a highly efficient coding for still images. A problem in this method is that the block distortion is observed in low‐rate coding. The overlapping block transform (OBT) has recently been proposed, aiming at the reduction of the block distortion. OBT is derived as a frequency analyzer/synthesizer with the origin of the spatial coordinate at the mid‐point between the sampling points and the main processing operation results in a DCT of unordinary type. This increases the computational complexity compared to the ordinary DCT. From such a viewpoint, this paper first derives the overlapping block DCT (OBDCT) with the same main processing as that of the ordinary DCT, by placing the origin of the spatial coordinate at the sampling point. OBDCT has the same coding efficiency as that of the traditional OBT, and OBDCT with the transform length 8 has the same coding efficiency as that of DCT with the transform length 16. A fast OBDCT algorithm is derived by integrating and simplifying the proposed OBDCT and the transform processing. Finally, it is shown that the fast OBDCT with the forementioned transform length can be executed by 55 percent of multiplications of the fast OBT and 67 percent of the fast DCT.</abstract><cop>New York</cop><pub>Wiley Subscription Services, Inc., A Wiley Company</pub><doi>10.1002/ecja.4410750406</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 8756-6621
ispartof Electronics & communications in Japan. Part 1, Communications, 1992, Vol.75 (4), p.59-73
issn 8756-6621
1520-6424
language eng
recordid cdi_crossref_primary_10_1002_ecja_4410750406
source EBSCOhost Business Source Complete
subjects discrete cosine transform
fast algorithm
Frequency analysis/synthesis
image data compression
lapped orthogonal transform
overlapping block transform
subband/transform coding
transform coding
title Overlapping block discrete cosine transform coding and its fast algorithm
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T06%3A46%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wiley_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Overlapping%20block%20discrete%20cosine%20transform%20coding%20and%20its%20fast%20algorithm&rft.jtitle=Electronics%20&%20communications%20in%20Japan.%20Part%201,%20Communications&rft.au=Sawami,%20Hideo&rft.date=1992&rft.volume=75&rft.issue=4&rft.spage=59&rft.epage=73&rft.pages=59-73&rft.issn=8756-6621&rft.eissn=1520-6424&rft_id=info:doi/10.1002/ecja.4410750406&rft_dat=%3Cwiley_cross%3EECJA4410750406%3C/wiley_cross%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