Low Complexity MLP-Based Radar Detector: Influence of the Training Algorithm and the MLP Size
- Cite this paper as:
- Vicen-Bueno R., Jarabo-Amores M.P., Mata-Moya D., Rosa-Zurera M., Gil-Pita R. (2007) Low Complexity MLP-Based Radar Detector: Influence of the Training Algorithm and the MLP Size. In: Sandoval F., Prieto A., Cabestany J., Graña M. (eds) Computational and Ambient Intelligence. IWANN 2007. Lecture Notes in Computer Science, vol 4507. Springer, Berlin, Heidelberg
MultiLayer Perceptrons (MLPs) trained in a supervised way to minimize the Mean Square Error are able to approximate the Neyman-Pearson detector. The known target detection in a Weibull-distributed clutter and white Gaussian noise is considered. Because the difficulty to obtain analytical expressions for the optimum detector under this environment, a suboptimum detector like the Target Sequence Known A Priori (TSKAP) detector is taken as reference. The results show a MLP-based detector dependency with the training algorithm for low MLP sizes, being the Levenberg-Marquardt algorithm better than the Back-Propagation one. On the other hand, this dependency does not exist for high MLP sizes. Also, this detector is sensitive to the MLP size, but for sizes greater than 20 hidden neurons, very low improvement is achieved. So, the MLP-based detector is better than the TSKAP one, even for very low complexity (6 inputs, 5 hidden neurons and 1 output) MLPs.
Unable to display preview. Download preview PDF.