• DocumentCode
    3421398
  • Title

    A fast range alignment algorithm for ISAR imaging

  • Author

    Wang, Zhijiao ; Bai, Xia ; Tao, Ran

  • Author_Institution
    Dept. of Electron. Eng., Beijing Inst. of Technol., Beijing, China
  • fYear
    2010
  • fDate
    24-28 Oct. 2010
  • Firstpage
    2214
  • Lastpage
    2217
  • Abstract
    The envelope correlation algorithm and the minimum entropy algorithm are widely used in range alignment of inverse synthetic aperture radar (KAR) imaging. However, these types of algorithms have heavy computation burden mainly caused by the searching operation. Aiming at reducing the burden, a fast range alignment algorithm is presented in this paper. Firstly the mean location of each range profile is calculated. Then we fit the trajectory of them with linear regression model. Based on the straight line trajectory of range shift, range alignment can be accomplished. The proposed algorithm avoids the searching operation which is usually used in traditional algorithms. The computational complexity analysis shows that the computation burden of the novel algorithm is proportional to the data volume. Finally, the comparison between the proposed algorithm and the envelope correlation algorithm with real data demonstrates the validity and efficiency of the fast algorithm.
  • Keywords
    correlation methods; entropy; radar imaging; synthetic aperture radar; ISAR imaging; computational complexity analysis; entropy algorithm; envelope correlation algorithm; fast range alignment algorithm; inverse synthetic aperture radar imaging; linear regression model; range profile; straight line trajectory; Algorithm design and analysis; Azimuth; Correlation; Imaging; Radar imaging; Signal processing algorithms; Trajectory; ISAR; mean location of range profile; range alignment; straight line fitting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing (ICSP), 2010 IEEE 10th International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-5897-4
  • Type

    conf

  • DOI
    10.1109/ICOSP.2010.5656844
  • Filename
    5656844