{"title":"Efficient reconstruction of subsurface elliptical-cylindrical targets using evolutionary programming","authors":"M. Hajebi, A. Hoorfar","doi":"10.1109/RADAR.2016.7485203","DOIUrl":"https://doi.org/10.1109/RADAR.2016.7485203","url":null,"abstract":"Evolutionary Programming (EP) optimization technique is proposed for efficient profile reconstruction and imaging of buried dielectric targets of elliptical-cylindrical shape. In particular, the efficiency of EP-based optimization in finding the location, shape, relative permittivity, and tilt-angle of the two dimensional (2-D) buried dielectric elliptical-cylindrical targets is investigated and statistically compared with Particle Swarm Optimization (PSO) method. Numerical results indicate that Evolutionary Programming method, as its first reported implementation in subsurface imaging, has a significantly better overall performance than PSO and can be used as a simple, yet efficient and robust global optimization technique for the inverse profiling of buried objects.","PeriodicalId":185932,"journal":{"name":"2016 IEEE Radar Conference (RadarConf)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122105225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On detection of nonstationarity in radar signal processing","authors":"Zhenghan Zhu, S. Kay, Fuat Çogun, R. Raghavan","doi":"10.1109/RADAR.2016.7485083","DOIUrl":"https://doi.org/10.1109/RADAR.2016.7485083","url":null,"abstract":"Space-time adaptive processing (STAP) has become a leading technique in airborne radar signal processing. The optimality of the STAP assumes the stationarity of the covariance matrices. In practice, however, the covariance matrices may be nonstationary. If such nonstationarity is not detected and not well treated, the STAP system's performance decreases substantially. In this paper, we present two detectors for detecting the covariance matrix nonstationarity. We form the first detector based on generalized likelihood ratio test, which inherits the property of asymptotically optimal detection performance. A second detector employs Rao test and requires significantly less computation than the first detector, which can be the favorable choice when computation load is of concern to the signal processing system.","PeriodicalId":185932,"journal":{"name":"2016 IEEE Radar Conference (RadarConf)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123912596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yicheng Jiang, Xiaohui Zhao, Yun Zhang, B. Hu, Yuan Zhuang
{"title":"Pose estimation based on exploration of geometrical information in SAR images","authors":"Yicheng Jiang, Xiaohui Zhao, Yun Zhang, B. Hu, Yuan Zhuang","doi":"10.1109/RADAR.2016.7485084","DOIUrl":"https://doi.org/10.1109/RADAR.2016.7485084","url":null,"abstract":"Pose normalization is beneficial for improving the accuracy of Synthetic Aperture Radar (SAR) Automatic Target Recognition (ATR). In fact, pose normalization can be achieved by rotating the given images according to the estimated pose of the target of interest. However, the partial defect targets in SAR images caused by the shadow effect affects the accuracy of pose estimation. This paper proposes a pose estimation method based on the exploration of the geometrical information of the target of interest in SAR images. The proposed method is evaluated with the moving and stationary target acquisition and recognition (MSTAR) public release dataset. Experimental results verify the effectiveness of the proposed method.","PeriodicalId":185932,"journal":{"name":"2016 IEEE Radar Conference (RadarConf)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125223881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Metcalf, K. J. Sangston, M. Rangaswamy, S. Blunt, B. Himed
{"title":"A new method of generating multivariate Weibull distributed data","authors":"J. Metcalf, K. J. Sangston, M. Rangaswamy, S. Blunt, B. Himed","doi":"10.1109/RADAR.2016.7485287","DOIUrl":"https://doi.org/10.1109/RADAR.2016.7485287","url":null,"abstract":"In order to fully test detector frameworks, it is important to have representative simulated clutter data readily available. While measured clutter data has often been fit to the Weibull distribution, generation of simulated complex multivariate Weibull data with prescribed covariance structure has been a challenging problem. As the multivariate Weibull distribution is admissible as a spherically invariant random vector for a specific range of shape parameter values, it can be decomposed as the product of a modulating random variable and a complex Gaussian random vector. Here we use this representation to compare the traditional method of generating multivariate Weibull data using the Rejection Method to a new approximation of the modulating random variable that lends itself to efficient computer generation.","PeriodicalId":185932,"journal":{"name":"2016 IEEE Radar Conference (RadarConf)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125266565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yongchao Zhang, Wenchao Li, Yulin Huang, Yin Zhang, Jianyu Yang
{"title":"Two-channel iterative adaptive approach for scanning radar angular superresolution","authors":"Yongchao Zhang, Wenchao Li, Yulin Huang, Yin Zhang, Jianyu Yang","doi":"10.1109/RADAR.2016.7485095","DOIUrl":"https://doi.org/10.1109/RADAR.2016.7485095","url":null,"abstract":"This paper deals with the problem of estimating the directions of arrival (DOAs) in airborne forward-looking radar imaging, by joint processing the sum and difference channel data. It is known that the monopulse system uses two channels, the sum and the difference, to estimate the target DOA. However, it fails to work when multiple targets are located within the beamwidth. Aiming at this problem, the iterative adaptive approach (IAA) estimator previously derived by the authors is extended to a two-channel monopulse system. Compared with the traditional DOA estimator, two-channel IAA algorithm can cope with the case of multiple targets and provide higher estimation accuracy. Simulation validates the superior performance of two-channel IAA algorithm.","PeriodicalId":185932,"journal":{"name":"2016 IEEE Radar Conference (RadarConf)","volume":"4 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125313526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Large area land cover mapping based on pyramid transformation with high-resolution PolSAR image","authors":"B. Zou, Jiamei Sun, Yijia Jin, Yan Cheng","doi":"10.1109/RADAR.2016.7485187","DOIUrl":"https://doi.org/10.1109/RADAR.2016.7485187","url":null,"abstract":"High-resolution PolSAR images are wildly used in land cover mapping. However, there are two problems when working with large areas, i.e., long processing time and large computer memory. Considering that properties of homogeneous area, such as forest, farm land, bare land, etc., are almost the same under different resolutions, which means that these areas can be processed in relatively low-resolution without decreasing mapping accuracy, this paper proposes a new land cover mapping method, to shorten processing time and reduce the demand of memory when high resolution images are used. In this method, relatively low-resolution images, used for homogeneous areas mapping, are obtained via pyramid transformation from the original image, due to the fact that pyramid transformation has good performance in retaining main information in the transformed images. The traditional pyramid transformation is adapted to PolSAR images. To verify the proposed method, iterated Freeman-Wishart classification is used based on pyramid transformation in this paper. Mapping accuracy and processing time of classification based on pyramid transformation and without pyramid transformation are compared. Experimental results show that processing time of classification based on pyramid transformation is reduced dramatically and the classification accuracy is improved.","PeriodicalId":185932,"journal":{"name":"2016 IEEE Radar Conference (RadarConf)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125422716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sparsity-based frequency-hopping spectrum estimation with missing samples","authors":"Shengheng Liu, Yimin D. Zhang, T. Shan","doi":"10.1109/RADAR.2016.7485265","DOIUrl":"https://doi.org/10.1109/RADAR.2016.7485265","url":null,"abstract":"In this paper, we address the problem of spectrum estimation of frequency-hopping (FH) signals in the presence of random missing samples. The signals are analyzed within the bilinear time-frequency representation framework, where a time-frequency kernel is designed based on inherent FH signal structures. The designed kernel permits effective suppression of cross-terms and artifacts due to missing samples while preserving the FH signal auto-terms. The kernelled results are represented in the instantaneous autocorrelation function domain, which are then processed using sparse reconstruction methods for high-resolution estimation of the FH signal time-frequency spectrum. The proposed method achieves accurate FH signal spectrum estimation even when a large proportion of data samples is missing. Simulation results verify the effectiveness of the proposed method and its superiority over existing techniques.","PeriodicalId":185932,"journal":{"name":"2016 IEEE Radar Conference (RadarConf)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129936658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Radar detection of Swerling 3 target in G0-distributed clutter via track-before-detect","authors":"H. Jiang, Wei Yi, L. Kong, Xiaobo Yang, Binbin He","doi":"10.1109/RADAR.2016.7485253","DOIUrl":"https://doi.org/10.1109/RADAR.2016.7485253","url":null,"abstract":"In this paper, radar detection of Swerling target of type 3 in GO-distributed clutter via dynamic programming based track-before-detect (DP-TBD) is considered. Conventional DP-TBD suffers from significant performance loss due to the high frequency of target-like outliers. To enhance the detection performance of DP-TBD, the log-likelihood ratio (LLR) of the measurements is derived and used in the integration process of DP-TBD taking the place of amplitude that used in the conventional DP-TBD strategy. Various simulations are used to examine the detection performances of different DP-TBD strategies. Simulation results show that significant performance improvement can be achieved, especially for vary heavy-tailed clutter.","PeriodicalId":185932,"journal":{"name":"2016 IEEE Radar Conference (RadarConf)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129318035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Direction of arrival by non-coherent arrays","authors":"Wei Jiang, A. Haimovich, Yonina C. Eldar","doi":"10.1109/RADAR.2016.7485274","DOIUrl":"https://doi.org/10.1109/RADAR.2016.7485274","url":null,"abstract":"In previous work we have shown that non-coherent direction of arrival (DOA) estimation by an array of sensors may be implemented from magnitude-only measurements. Here we show that magnitude-only measurements collected by a sensor array may be modeled by a non-central chi-square distribution with mean and variance independent of the phase errors. We also develop a closed-form expression for the Cramer-Rao bound (CRB) of non-coherent DOA estimation for the difference in spatial frequency between two sources. Finally, we obtain closed-form expressions for the maximum likelihood estimates (MLEs) of various unknown parameters. These theoretical expressions are used to analyze the performance of non-coherent DOA estimation.","PeriodicalId":185932,"journal":{"name":"2016 IEEE Radar Conference (RadarConf)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129370067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jan Torgrimsson, L. Ulander, P. Dammert, H. Hellsten
{"title":"Factorized geometrical autofocus: On the geometry search","authors":"Jan Torgrimsson, L. Ulander, P. Dammert, H. Hellsten","doi":"10.1109/RADAR.2016.7485117","DOIUrl":"https://doi.org/10.1109/RADAR.2016.7485117","url":null,"abstract":"This paper deals with local geometry optimization within the scope of Factorized Geometrical Autofocus (FGA). The FGA algorithm is a Fast Factorized Back-Projection (FFBP) formulation with six free geometry parameters. These are tuned until a sharp image is obtained, i.e. with respect to an object function. To optimize the geometry (from a focus perspective) for a small image area, we propose an efficient routine based on correlation, sensitivity analysis and Broyden-Fletcher-Goldfarb-Shanno (BFGS) minimization. The new routine is evaluated using simulated Ultra-WideBand (UWB) data. By applying the FGA algorithm step-by-step, an erroneous geometry is compensated. This gives a focused image. In regard to run time, the new routine is approximately 100 times faster than a brute-force approach, i.e. for this FGA problem. For a general problem, the run time reduction will be far greater. To be more specific: with x parameters and N values to assess for each parameter; it is anticipated that the computational effort will decrease exponentially by a factor close to Nx.","PeriodicalId":185932,"journal":{"name":"2016 IEEE Radar Conference (RadarConf)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131133803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}