Efficient Computation of the 8-point DCT via Summation by Parts
This paper introduces a new fast algorithm for the 8-point discrete cosine transform (DCT) based on the summation-by-parts formula. The proposed method converts the DCT matrix into an alternative transformation matrix that can be decomposed into sparse matrices of low multiplicative complexity. The...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2018-03 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Coelho, D F G Cintra, R J Dimitrov, V S |
| description | This paper introduces a new fast algorithm for the 8-point discrete cosine transform (DCT) based on the summation-by-parts formula. The proposed method converts the DCT matrix into an alternative transformation matrix that can be decomposed into sparse matrices of low multiplicative complexity. The method is capable of scaled and exact DCT computation and its associated fast algorithm achieves the theoretical minimal multiplicative complexity for the 8-point DCT. Depending on the nature of the input signal simplifications can be introduced and the overall complexity of the proposed algorithm can be further reduced. Several types of input signal are analyzed: arbitrary, null mean, accumulated, and null mean/accumulated signal. The proposed tool has potential application in harmonic detection, image enhancement, and feature extraction, where input signal DC level is discarded and/or the signal is required to be integrated. |
| doi_str_mv | 10.48550/arxiv.1801.05832 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1801_05832</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2071927666</sourcerecordid><originalsourceid>FETCH-LOGICAL-a526-fb3058cc037a26981be5481d3339b9d15429ea3769ceef626d278ec5b53b03f73</originalsourceid><addsrcrecordid>eNotj81KxDAYRYMgOIzzAK4MuG5Nvq_56UqkjqMwoGD3JW0TzGB_bNPBeXvr1NVd3MPlHkJuOIsTLQS7N8OPP8ZcMx4zoREuyAoQeaQTgCuyGccDYwykAiFwRR62zvnK2zbQrGv6KZjgu5Z2joZPS3XUd36unrKcHr2hH1PTLEB5ou9mCOM1uXTma7Sb_1yT_HmbZy_R_m33mj3uIyNARq7E-UtVMVQGZKp5aUWieY2IaZnWXCSQWoNKppW1ToKsQWlbiVJgydApXJPbZfZsV_SDb8xwKv4si7PlTNwtRD9035MdQ3HopqGdPxXAFE9BSSnxF5HFUvc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2071927666</pqid></control><display><type>article</type><title>Efficient Computation of the 8-point DCT via Summation by Parts</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Coelho, D F G ; Cintra, R J ; Dimitrov, V S</creator><creatorcontrib>Coelho, D F G ; Cintra, R J ; Dimitrov, V S</creatorcontrib><description>This paper introduces a new fast algorithm for the 8-point discrete cosine transform (DCT) based on the summation-by-parts formula. The proposed method converts the DCT matrix into an alternative transformation matrix that can be decomposed into sparse matrices of low multiplicative complexity. The method is capable of scaled and exact DCT computation and its associated fast algorithm achieves the theoretical minimal multiplicative complexity for the 8-point DCT. Depending on the nature of the input signal simplifications can be introduced and the overall complexity of the proposed algorithm can be further reduced. Several types of input signal are analyzed: arbitrary, null mean, accumulated, and null mean/accumulated signal. The proposed tool has potential application in harmonic detection, image enhancement, and feature extraction, where input signal DC level is discarded and/or the signal is required to be integrated.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1801.05832</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Complexity ; Computer Science - Data Structures and Algorithms ; Computer Science - Numerical Analysis ; Discrete cosine transform ; Feature extraction ; Image detection ; Image enhancement ; Mathematics - Numerical Analysis ; Sparse matrices ; Statistics - Computation ; Statistics - Methodology</subject><ispartof>arXiv.org, 2018-03</ispartof><rights>2018. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><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,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.1801.05832$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1007/s11265-017-1270-6$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Coelho, D F G</creatorcontrib><creatorcontrib>Cintra, R J</creatorcontrib><creatorcontrib>Dimitrov, V S</creatorcontrib><title>Efficient Computation of the 8-point DCT via Summation by Parts</title><title>arXiv.org</title><description>This paper introduces a new fast algorithm for the 8-point discrete cosine transform (DCT) based on the summation-by-parts formula. The proposed method converts the DCT matrix into an alternative transformation matrix that can be decomposed into sparse matrices of low multiplicative complexity. The method is capable of scaled and exact DCT computation and its associated fast algorithm achieves the theoretical minimal multiplicative complexity for the 8-point DCT. Depending on the nature of the input signal simplifications can be introduced and the overall complexity of the proposed algorithm can be further reduced. Several types of input signal are analyzed: arbitrary, null mean, accumulated, and null mean/accumulated signal. The proposed tool has potential application in harmonic detection, image enhancement, and feature extraction, where input signal DC level is discarded and/or the signal is required to be integrated.</description><subject>Algorithms</subject><subject>Complexity</subject><subject>Computer Science - Data Structures and Algorithms</subject><subject>Computer Science - Numerical Analysis</subject><subject>Discrete cosine transform</subject><subject>Feature extraction</subject><subject>Image detection</subject><subject>Image enhancement</subject><subject>Mathematics - Numerical Analysis</subject><subject>Sparse matrices</subject><subject>Statistics - Computation</subject><subject>Statistics - Methodology</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj81KxDAYRYMgOIzzAK4MuG5Nvq_56UqkjqMwoGD3JW0TzGB_bNPBeXvr1NVd3MPlHkJuOIsTLQS7N8OPP8ZcMx4zoREuyAoQeaQTgCuyGccDYwykAiFwRR62zvnK2zbQrGv6KZjgu5Z2joZPS3XUd36unrKcHr2hH1PTLEB5ou9mCOM1uXTma7Sb_1yT_HmbZy_R_m33mj3uIyNARq7E-UtVMVQGZKp5aUWieY2IaZnWXCSQWoNKppW1ToKsQWlbiVJgydApXJPbZfZsV_SDb8xwKv4si7PlTNwtRD9035MdQ3HopqGdPxXAFE9BSSnxF5HFUvc</recordid><startdate>20180328</startdate><enddate>20180328</enddate><creator>Coelho, D F G</creator><creator>Cintra, R J</creator><creator>Dimitrov, V S</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>AKZ</scope><scope>EPD</scope><scope>GOX</scope></search><sort><creationdate>20180328</creationdate><title>Efficient Computation of the 8-point DCT via Summation by Parts</title><author>Coelho, D F G ; Cintra, R J ; Dimitrov, V S</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a526-fb3058cc037a26981be5481d3339b9d15429ea3769ceef626d278ec5b53b03f73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Complexity</topic><topic>Computer Science - Data Structures and Algorithms</topic><topic>Computer Science - Numerical Analysis</topic><topic>Discrete cosine transform</topic><topic>Feature extraction</topic><topic>Image detection</topic><topic>Image enhancement</topic><topic>Mathematics - Numerical Analysis</topic><topic>Sparse matrices</topic><topic>Statistics - Computation</topic><topic>Statistics - Methodology</topic><toplevel>online_resources</toplevel><creatorcontrib>Coelho, D F G</creatorcontrib><creatorcontrib>Cintra, R J</creatorcontrib><creatorcontrib>Dimitrov, V S</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv Statistics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Coelho, D F G</au><au>Cintra, R J</au><au>Dimitrov, V S</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient Computation of the 8-point DCT via Summation by Parts</atitle><jtitle>arXiv.org</jtitle><date>2018-03-28</date><risdate>2018</risdate><eissn>2331-8422</eissn><abstract>This paper introduces a new fast algorithm for the 8-point discrete cosine transform (DCT) based on the summation-by-parts formula. The proposed method converts the DCT matrix into an alternative transformation matrix that can be decomposed into sparse matrices of low multiplicative complexity. The method is capable of scaled and exact DCT computation and its associated fast algorithm achieves the theoretical minimal multiplicative complexity for the 8-point DCT. Depending on the nature of the input signal simplifications can be introduced and the overall complexity of the proposed algorithm can be further reduced. Several types of input signal are analyzed: arbitrary, null mean, accumulated, and null mean/accumulated signal. The proposed tool has potential application in harmonic detection, image enhancement, and feature extraction, where input signal DC level is discarded and/or the signal is required to be integrated.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1801.05832</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2018-03 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1801_05832 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Complexity Computer Science - Data Structures and Algorithms Computer Science - Numerical Analysis Discrete cosine transform Feature extraction Image detection Image enhancement Mathematics - Numerical Analysis Sparse matrices Statistics - Computation Statistics - Methodology |
| title | Efficient Computation of the 8-point DCT via Summation by Parts |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T08%3A41%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20Computation%20of%20the%208-point%20DCT%20via%20Summation%20by%20Parts&rft.jtitle=arXiv.org&rft.au=Coelho,%20D%20F%20G&rft.date=2018-03-28&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1801.05832&rft_dat=%3Cproquest_arxiv%3E2071927666%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2071927666&rft_id=info:pmid/&rfr_iscdi=true |