Fast Splitting -Rooting Method of Image Enhancement: Tensor Representation
In the tensor representation, a two-dimensional (2-D) image is represented uniquely by a set of one-dimensional (1-D) signals, so-called splitting-signals, that carry the spectral information of the image at frequency-points of specific sets that cover the whole domain of frequencies. The image enha...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on image processing 2006-11, Vol.15 (11), p.3375 |
---|---|
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 | 11 |
container_start_page | 3375 |
container_title | IEEE transactions on image processing |
container_volume | 15 |
creator | Arslan, F.T Grigoryan, A.M |
description | In the tensor representation, a two-dimensional (2-D) image is represented uniquely by a set of one-dimensional (1-D) signals, so-called splitting-signals, that carry the spectral information of the image at frequency-points of specific sets that cover the whole domain of frequencies. The image enhancement is thus reduced to processing splitting-signals and such process requires a modification of only a few spectral components of the image, for each signal. For instance, the alpha-rooting method of image enhancement can be fulfilled through processing separately a maximum of 3N/2 splitting-signals of an image (NtimesN), where N is a power of two. In this paper, we propose a fast implementation of the alpha-rooting method by using one splitting-signal of the tensor representation with respect to the discrete Fourier transform (DFT). The implementation is described in the frequency and spatial domains. As a result, the proposed algorithms for image enhancement use two 1-D N-point DFTs instead of two 2-D NtimesN-point DFTs in the traditional method of alpha-rooting |
doi_str_mv | 10.1109/TIP.2006.881927 |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_889409176</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2455707721</sourcerecordid><originalsourceid>FETCH-LOGICAL-p596-8f2194edd062628839a3fab2cdb06be97a1dc4b4bbffa3c61883a839702d62cb3</originalsourceid><addsrcrecordid>eNpdjj1PwzAYhC0EEqUws1osTAmvHdcfbKhqoagIVLJXduK0qRI7xM7_xwImpnt0enQ6hG4J5ISAeig3HzkF4LmURFFxhmZEMZIBMHqeGBYiE4SpS3QVwgmAsAXhM_S61iHiz6FrY2zdAWc773_gzcajr7Fv8KbXB4tX7qhdZXvr4iMurQt-xDs7jDakRsfWu2t00egu2Ju_nKNyvSqXL9n2_XmzfNpmw0LxTDY0_bJ1DZxyKmWhdNFoQ6vaADdWCU3qihlmTNPoouIkKTpZAmjNaWWKObr_nR1G_zXZEPd9GyrbddpZP4W9lIqBIoIn8-6fefLT6NK3vVQAQkkii2-rcFwN</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>890079818</pqid></control><display><type>article</type><title>Fast Splitting -Rooting Method of Image Enhancement: Tensor Representation</title><source>IEEE Electronic Library (IEL)</source><creator>Arslan, F.T ; Grigoryan, A.M</creator><creatorcontrib>Arslan, F.T ; Grigoryan, A.M</creatorcontrib><description>In the tensor representation, a two-dimensional (2-D) image is represented uniquely by a set of one-dimensional (1-D) signals, so-called splitting-signals, that carry the spectral information of the image at frequency-points of specific sets that cover the whole domain of frequencies. The image enhancement is thus reduced to processing splitting-signals and such process requires a modification of only a few spectral components of the image, for each signal. For instance, the alpha-rooting method of image enhancement can be fulfilled through processing separately a maximum of 3N/2 splitting-signals of an image (NtimesN), where N is a power of two. In this paper, we propose a fast implementation of the alpha-rooting method by using one splitting-signal of the tensor representation with respect to the discrete Fourier transform (DFT). The implementation is described in the frequency and spatial domains. As a result, the proposed algorithms for image enhancement use two 1-D N-point DFTs instead of two 2-D NtimesN-point DFTs in the traditional method of alpha-rooting</description><identifier>ISSN: 1057-7149</identifier><identifier>EISSN: 1941-0042</identifier><identifier>DOI: 10.1109/TIP.2006.881927</identifier><language>eng</language><publisher>New York: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</publisher><subject>Fourier transforms ; Image enhancement ; Mathematical analysis ; Method of images ; Representations ; Spectra ; Tensors</subject><ispartof>IEEE transactions on image processing, 2006-11, Vol.15 (11), p.3375</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Arslan, F.T</creatorcontrib><creatorcontrib>Grigoryan, A.M</creatorcontrib><title>Fast Splitting -Rooting Method of Image Enhancement: Tensor Representation</title><title>IEEE transactions on image processing</title><description>In the tensor representation, a two-dimensional (2-D) image is represented uniquely by a set of one-dimensional (1-D) signals, so-called splitting-signals, that carry the spectral information of the image at frequency-points of specific sets that cover the whole domain of frequencies. The image enhancement is thus reduced to processing splitting-signals and such process requires a modification of only a few spectral components of the image, for each signal. For instance, the alpha-rooting method of image enhancement can be fulfilled through processing separately a maximum of 3N/2 splitting-signals of an image (NtimesN), where N is a power of two. In this paper, we propose a fast implementation of the alpha-rooting method by using one splitting-signal of the tensor representation with respect to the discrete Fourier transform (DFT). The implementation is described in the frequency and spatial domains. As a result, the proposed algorithms for image enhancement use two 1-D N-point DFTs instead of two 2-D NtimesN-point DFTs in the traditional method of alpha-rooting</description><subject>Fourier transforms</subject><subject>Image enhancement</subject><subject>Mathematical analysis</subject><subject>Method of images</subject><subject>Representations</subject><subject>Spectra</subject><subject>Tensors</subject><issn>1057-7149</issn><issn>1941-0042</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNpdjj1PwzAYhC0EEqUws1osTAmvHdcfbKhqoagIVLJXduK0qRI7xM7_xwImpnt0enQ6hG4J5ISAeig3HzkF4LmURFFxhmZEMZIBMHqeGBYiE4SpS3QVwgmAsAXhM_S61iHiz6FrY2zdAWc773_gzcajr7Fv8KbXB4tX7qhdZXvr4iMurQt-xDs7jDakRsfWu2t00egu2Ju_nKNyvSqXL9n2_XmzfNpmw0LxTDY0_bJ1DZxyKmWhdNFoQ6vaADdWCU3qihlmTNPoouIkKTpZAmjNaWWKObr_nR1G_zXZEPd9GyrbddpZP4W9lIqBIoIn8-6fefLT6NK3vVQAQkkii2-rcFwN</recordid><startdate>20061101</startdate><enddate>20061101</enddate><creator>Arslan, F.T</creator><creator>Grigoryan, A.M</creator><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><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>20061101</creationdate><title>Fast Splitting -Rooting Method of Image Enhancement: Tensor Representation</title><author>Arslan, F.T ; Grigoryan, A.M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p596-8f2194edd062628839a3fab2cdb06be97a1dc4b4bbffa3c61883a839702d62cb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Fourier transforms</topic><topic>Image enhancement</topic><topic>Mathematical analysis</topic><topic>Method of images</topic><topic>Representations</topic><topic>Spectra</topic><topic>Tensors</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Arslan, F.T</creatorcontrib><creatorcontrib>Grigoryan, A.M</creatorcontrib><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 transactions on image processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Arslan, F.T</au><au>Grigoryan, A.M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fast Splitting -Rooting Method of Image Enhancement: Tensor Representation</atitle><jtitle>IEEE transactions on image processing</jtitle><date>2006-11-01</date><risdate>2006</risdate><volume>15</volume><issue>11</issue><spage>3375</spage><pages>3375-</pages><issn>1057-7149</issn><eissn>1941-0042</eissn><abstract>In the tensor representation, a two-dimensional (2-D) image is represented uniquely by a set of one-dimensional (1-D) signals, so-called splitting-signals, that carry the spectral information of the image at frequency-points of specific sets that cover the whole domain of frequencies. The image enhancement is thus reduced to processing splitting-signals and such process requires a modification of only a few spectral components of the image, for each signal. For instance, the alpha-rooting method of image enhancement can be fulfilled through processing separately a maximum of 3N/2 splitting-signals of an image (NtimesN), where N is a power of two. In this paper, we propose a fast implementation of the alpha-rooting method by using one splitting-signal of the tensor representation with respect to the discrete Fourier transform (DFT). The implementation is described in the frequency and spatial domains. As a result, the proposed algorithms for image enhancement use two 1-D N-point DFTs instead of two 2-D NtimesN-point DFTs in the traditional method of alpha-rooting</abstract><cop>New York</cop><pub>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</pub><doi>10.1109/TIP.2006.881927</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1057-7149 |
ispartof | IEEE transactions on image processing, 2006-11, Vol.15 (11), p.3375 |
issn | 1057-7149 1941-0042 |
language | eng |
recordid | cdi_proquest_miscellaneous_889409176 |
source | IEEE Electronic Library (IEL) |
subjects | Fourier transforms Image enhancement Mathematical analysis Method of images Representations Spectra Tensors |
title | Fast Splitting -Rooting Method of Image Enhancement: Tensor Representation |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T05%3A40%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fast%20Splitting%20-Rooting%20Method%20of%20Image%20Enhancement:%20Tensor%20Representation&rft.jtitle=IEEE%20transactions%20on%20image%20processing&rft.au=Arslan,%20F.T&rft.date=2006-11-01&rft.volume=15&rft.issue=11&rft.spage=3375&rft.pages=3375-&rft.issn=1057-7149&rft.eissn=1941-0042&rft_id=info:doi/10.1109/TIP.2006.881927&rft_dat=%3Cproquest%3E2455707721%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=890079818&rft_id=info:pmid/&rfr_iscdi=true |