The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] rotation invariance(5hit)

1-5hit
  • An Algorithm for Single Snapshot 2D-DOA Estimation Based on a Three-Parallel Linear Array Model Open Access

    Shiwen LIN  Yawen ZHOU  Weiqin ZOU  Huaguo ZHANG  Lin GAO  Hongshu LIAO  Wanchun LI  

     
    PAPER-Digital Signal Processing

      Pubricized:
    2021/10/05
      Vol:
    E105-A No:4
      Page(s):
    673-681

    Estimating the spatial parameters of the signals by using the effective data of a single snapshot is essential in the field of reconnaissance and confrontation. Major drawback of existing algorithms is that its constructed covariance matrix has a great degree of rank loss. The performance of existing algorithms gets degraded with low signal-to-noise ratio. In this paper, a three-parallel linear array based algorithm is proposed to achieve two-dimensional direction of arrival estimates in a single snapshot scenario. The key points of the proposed algorithm are: 1) construct three pseudo matrices with full rank and no rank loss by using the single snapshot data from the received signal model; 2) by using the rotation relation between pseudo matrices, the matched 2D-DOA is obtained with an efficient parameter matching method. Main objective of this work is on improving the angle estimation accuracy and reducing the loss of degree of freedom in single snapshot 2D-DOA estimation.

  • Rethinking the Rotation Invariance of Local Convolutional Features for Content-Based Image Retrieval

    Longjiao ZHAO  Yu WANG  Jien KATO  

     
    PAPER-Image Processing and Video Processing

      Pubricized:
    2020/10/14
      Vol:
    E104-D No:1
      Page(s):
    174-182

    Recently, local features computed using convolutional neural networks (CNNs) show good performance to image retrieval. The local convolutional features obtained by the CNNs (LC features) are designed to be translation invariant, however, they are inherently sensitive to rotation perturbations. This leads to miss-judgements in retrieval tasks. In this work, our objective is to enhance the robustness of LC features against image rotation. To do this, we conduct a thorough experimental evaluation of three candidate anti-rotation strategies (in-model data augmentation, in-model feature augmentation, and post-model feature augmentation), over two kinds of rotation attack (dataset attack and query attack). In the training procedure, we implement a data augmentation protocol and network augmentation method. In the test procedure, we develop a local transformed convolutional (LTC) feature extraction method, and evaluate it over different network configurations. We end up a series of good practices with steady quantitative supports, which lead to the best strategy for computing LC features with high rotation invariance in image retrieval.

  • A New Shape Description Method Using Angular Radial Transform

    Jong-Min LEE  Whoi-Yul KIM  

     
    PAPER-Image Recognition, Computer Vision

      Vol:
    E95-D No:6
      Page(s):
    1628-1635

    Shape is one of the primary low-level image features in content-based image retrieval. In this paper we propose a new shape description method that consists of a rotationally invariant angular radial transform descriptor (IARTD). The IARTD is a feature vector that combines the magnitude and aligned phases of the angular radial transform (ART) coefficients. A phase correction scheme is employed to produce the aligned phase so that the IARTD is invariant to rotation. The distance between two IARTDs is defined by combining differences in the magnitudes and aligned phases. In an experiment using the MPEG-7 shape dataset, the proposed method outperforms existing methods; the average BEP of the proposed method is 57.69%, while the average BEPs of the invariant Zernike moments descriptor and the traditional ART are 41.64% and 36.51%, respectively.

  • Hypercomplex Polar Fourier Analysis for Image Representation

    Zhuo YANG  Sei-ichiro KAMATA  

     
    PAPER-Image Recognition, Computer Vision

      Vol:
    E94-D No:8
      Page(s):
    1663-1670

    Fourier transform is a significant tool in image processing and pattern recognition. By introducing a hypercomplex number, hypercomplex Fourier transform treats a signal as a vector field and generalizes the conventional Fourier transform. Inspired from that, hypercomplex polar Fourier analysis that extends conventional polar Fourier analysis is proposed in this paper. The proposed method can handle signals represented by hypercomplex numbers as color images. The hypercomplex polar Fourier analysis is reversible that means it can be used to reconstruct image. The hypercomplex polar Fourier descriptor has rotation invariance property that can be used for feature extraction. Due to the noncommutative property of quaternion multiplication, both left-side and right-side hypercomplex polar Fourier analysis are discussed and their relationships are also established in this paper. The experimental results on image reconstruction, rotation invariance, color plate test and image retrieval are given to illustrate the usefulness of the proposed method as an image analysis tool.

  • Multiuser Carrier Frequency Offset Estimation for OFDMA Uplink Based on Multi-Antenna

    Weile ZHANG  Junsong WANG  Qinye YIN  Ang FENG  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E93-B No:5
      Page(s):
    1276-1279

    In this letter, a novel method is proposed for carrier-frequency offset (CFO) estimation for multiple users in orthogonal frequency division multiple access (OFDMA) uplink with the generalized carrier assignment scheme (GCAS). The base station (BS) is equipped with multiple antennas, and each user's CFO can be estimated by the ESPRIT-like method that utilizes the rotation invariance of the space-domain snapshot matrix. The method is still effective even in fully loaded system with all subcarriers allocated to users. Simulation results illustrate the high performance of the proposed algorithm.