Papers
Topics
Authors
Recent
Search
2000 character limit reached

Interpretable attributed scattering center extracted via deep unfolding

Published 15 May 2024 in eess.SP | (2405.09073v1)

Abstract: Most existing sparse representation-based approaches for attributed scattering center (ASC) extraction adopt traditional iterative optimization algorithms, which suffer from lengthy computation times and limited precision. This paper presents a solution by introducing an interpretable network that can effectively and rapidly extract ASC via deep unfolding. Initially, we create a dictionary containing reliable prior knowledge and apply it to the iterative shrinkage-thresholding algorithm (ISTA). Then, we unfold ISTA into a neural network, employing it to autonomously and precisely optimize the hyperparameters. The interpretability of physics is retained by applying a dictionary with physical meaning. The experiments are conducted on multiple test sets with diverse data distributions and demonstrate the superior performance and generalizability of our method.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (15)
  1. J. Wen and Z. Wang, “A new method for parameter estimation of attributed scattering centers based on amplitude-phase separation,” Journal of Radars, vol. 8, no. 5, pp. 606–615, 2019.
  2. “Sparse representation based algorithm for estimation of attributed scattering center parameter on sar imagery,” Journal of Electronics & Information Technology, vol. 36, no. 4, pp. 931–937, 2014.
  3. “Physics inspired hybrid attention for sar target recognition,” ISPRS Journal of Photogrammetry and Remote Sensing, vol. 207, pp. 164–174, 2024.
  4. “Physically explainable intelligent perception and application of sar target characteristics based on time-frequency analysis,” Journal of Radars, vol. 12, pp. 1–14, 2023.
  5. “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Transactions on information theory, vol. 53, no. 12, pp. 4655–4666, 2007.
  6. “Message-passing algorithms for compressed sensing,” Proceedings of the National Academy of Sciences, vol. 106, no. 45, pp. 18914–18919, 2009.
  7. T. Blumensath and M. E. Davies, “Iterative thresholding for sparse approximations,” Journal of Fourier analysis and Applications, vol. 14, pp. 629–654, 2008.
  8. “Physics-inspired compressive sensing: Beyond deep unrolling,” IEEE Signal Processing Magazine, vol. 40, no. 1, pp. 58–72, 2023.
  9. Sandia National Laboratory, “The Air Force Moving and Stationary Target Recognition Database,” https://www.sdms.afrl.af.mil/index.php?collection=mstar, Accessed May 2023.
  10. “A parametric model for synthetic aperture radar measurements,” IEEE transactions on antennas and propagation, vol. 47, no. 7, pp. 1179–1188, 1999.
  11. “Electromagnetic scattering characteristic extraction and imaging recognition algorithm: A review,” Journal of Radars, vol. 11, no. 6, pp. 921–942, 2022.
  12. J. Zhang and B. Ghanem, “Ista-net: Interpretable optimization-inspired deep network for image compressive sensing,” in Proceedings of the IEEE conference on computer vision and pattern recognition, 2018, pp. 1828–1837.
  13. “Amp-net: Denoising-based deep unfolding for compressive image sensing,” IEEE Transactions on Image Processing, vol. 30, pp. 1487–1500, 2020.
  14. I. Loshchilov and F. Hutter, “Decoupled weight decay regularization,” arXiv preprint arXiv:1711.05101, 2019.
  15. L. N. Smith and N. Topin, “Super-convergence: Very fast training of neural networks using large learning rates,” vol. 11006, pp. 369–386, 2019.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.