240 research outputs found

    Fractional fourier transforms of hypercomplex signals

    Get PDF
    An overview is given to a new approach for obtaining generalized Fourier transforms in the context of hypercomplex analysis (or Clifford analysis). These transforms are applicable to higher-dimensional signals with several components and are different from the classical Fourier transform in that they mix the components of the signal. Subsequently, attention is focused on the special case of the so-called Clifford-Fourier transform where recently a lot of progress has been made. A fractional version of this transform is introduced and a series expansion for its integral kernel is obtained. For the case of dimension 2, also an explicit expression for the kernel is given

    Intelligent OFDM telecommunication system. Part 2. Examples of complex and quaternion many-parameter transforms

    Get PDF
    In this paper, we propose unified mathematical forms of many-parametric complex and quaternion Fourier transforms for novel Intelligent OFDM-telecommunication systems (OFDM-TCS). Each many-parametric transform (MPT) depends on many free angle parameters. When parameters are changed in some way, the type and form of transform are changed as well. For example, MPT may be the Fourier transform for one set of parameters, wavelet transform for other parameters and other transforms for other values of parameters. The new Intelligent-OFDM-TCS uses inverse MPT for modulation at the transmitter and direct MPT for demodulation at the receiver. © 2019 IOP Publishing Ltd. All rights reserved

    Recognition of 3-D Objects from Multiple 2-D Views by a Self-Organizing Neural Architecture

    Full text link
    The recognition of 3-D objects from sequences of their 2-D views is modeled by a neural architecture, called VIEWNET that uses View Information Encoded With NETworks. VIEWNET illustrates how several types of noise and varialbility in image data can be progressively removed while incornplcte image features are restored and invariant features are discovered using an appropriately designed cascade of processing stages. VIEWNET first processes 2-D views of 3-D objects using the CORT-X 2 filter, which discounts the illuminant, regularizes and completes figural boundaries, and removes noise from the images. Boundary regularization and cornpletion are achieved by the same mechanisms that suppress image noise. A log-polar transform is taken with respect to the centroid of the resulting figure and then re-centered to achieve 2-D scale and rotation invariance. The invariant images are coarse coded to further reduce noise, reduce foreshortening effects, and increase generalization. These compressed codes are input into a supervised learning system based on the fuzzy ARTMAP algorithm. Recognition categories of 2-D views are learned before evidence from sequences of 2-D view categories is accumulated to improve object recognition. Recognition is studied with noisy and clean images using slow and fast learning. VIEWNET is demonstrated on an MIT Lincoln Laboratory database of 2-D views of jet aircraft with and without additive noise. A recognition rate of 90% is achieved with one 2-D view category and of 98.5% correct with three 2-D view categories.National Science Foundation (IRI 90-24877); Office of Naval Research (N00014-91-J-1309, N00014-91-J-4100, N00014-92-J-0499); Air Force Office of Scientific Research (F9620-92-J-0499, 90-0083

    Convolution products for hypercomplex Fourier transforms

    Full text link
    Hypercomplex Fourier transforms are increasingly used in signal processing for the analysis of higher-dimensional signals such as color images. A main stumbling block for further applications, in particular concerning filter design in the Fourier domain, is the lack of a proper convolution theorem. The present paper develops and studies two conceptually new ways to define convolution products for such transforms. As a by-product, convolution theorems are obtained that will enable the development and fast implementation of new filters for quaternionic signals and systems, as well as for their higher dimensional counterparts.Comment: 18 pages, two columns, accepted in J. Math. Imaging Visio

    Color Image Analysis by Quaternion-Type Moments

    No full text
    International audienceIn this paper, by using the quaternion algebra, the conventional complex-type moments (CTMs) for gray-scale images are generalized to color images as quaternion-type moments (QTMs) in a holistic manner. We first provide a general formula of QTMs from which we derive a set of quaternion-valued QTM invariants (QTMIs) to image rotation, scale and translation transformations by eliminating the influence of transformation parameters. An efficient computation algorithm is also proposed so as to reduce computational complexity. The performance of the proposed QTMs and QTMIs are evaluated considering several application frameworks ranging from color image reconstruction, face recognition to image registration. We show they achieve better performance than CTMs and CTM invariants (CTMIs). We also discuss the choice of the unit pure quaternion influence with the help of experiments. appears to be an optimal choice
    corecore