Abstract
This paper studies the problem applying Radial Basis Function Network(RBFN) which is trained by the Recursive Least Square Algorithm(RLSA) to the recognition of one dimensional images of radar targets. The equivalence between the RBFN and the estimate of Parzen window probabilistic density is proved. It is pointed out that the I/O functions in RBFN hidden units can be generalized to general Parzen window probabilistic kernel function or potential function, too. This paper discusses the effects of the shape parameter α in the RBFN and the forgotten factor λ in RLSA on the results of the recognition of three kinds of kernel function such as Gaussian, triangle, double-exponential, at the same time, also discusses the relationship between λ and the training time in the RBFN.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
