<!DOCTYPE article PUBLIC '-//NLM//DTD Journal Publishing DTD v2.1 20050630//EN' 'http://uploads.ingentaconnect.com/docs/dtd/ingenta-journalpublishing.dtd'>
<article article-type="research-article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="aggregator">72010604</journal-id>
      <journal-title>Electronic Imaging</journal-title>
      <issn pub-type="ppub">2470-1173</issn><issn pub-type="epub"></issn>
      <publisher>
        <publisher-name>Society for Imaging Science and Technology</publisher-name>
        <publisher-loc>7003 Kilworth Lane, Springfield, VA 22151 USA</publisher-loc>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.2352/ISSN.2470-1173.2016.15.IPAS-192</article-id>
      <article-id pub-id-type="sici">2470-1173(20160214)2016:15L.1;1-</article-id>
      <article-id pub-id-type="publisher-id">ei_24701173_v2016n15_input/s13.xml</article-id>
      <article-id pub-id-type="other">/ist/ei/2016/00002016/00000015/art00018</article-id>
      <article-categories>
        <subj-group>
          <subject>Articles</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>2-D Left-Side Quaternion Discrete Fourier Transform: Fast Algorithm</article-title>
      </title-group>
      <contrib-group>
        <contrib>
          <name>
            <surname>Grigoryan</surname>
            <given-names>Artyom M</given-names>
          </name>
        </contrib>
        <contrib>
          <name>
            <surname>Agaian</surname>
            <given-names>Sos S</given-names>
          </name>
        </contrib>
      </contrib-group>
      <pub-date>
        <day>14</day>
        <month>02</month>
        <year>2016</year>
      </pub-date>
      <volume>2016</volume>
      <issue>15</issue>
      <fpage>1</fpage>
      <lpage>8</lpage>
      <permissions>
        <copyright-year>2016</copyright-year>
      </permissions>
      <abstract>
        <p>
          <italic>Two-dimension discrete Fourier transform (2-D DFT) is a fundamental tool in grays-scale image processing. In color imaging, this transform is used to process separately color channels and such processing does not consider interactions between the color channels. The concept of the
 quaternion discrete Fourier transform (QDFT) became a very popular topic in color imaging. The color image from one of the color model, for instance the RGB model, can be transformed into the quaternion algebra and be represented as one quaternion image which allows to process simultaneously
 of all color components of the image. In this work, we describe the algorithm for the 2-D left-side QDFT which is based on the concept of the tensor representation when the color or quaternion image is described by a set of 1-D quaternion signals and the 1-D left-side QDFTs over these signals
 determine values of the 2-D left-side QDFT at corresponding subset of frequency-points. The efficiency of the tensor algorithm for calculating the fast left-side 2-D QDFT is described and compared with the existent methods.</italic>
        </p>
      </abstract>
    </article-meta>
  </front>
</article>
