Neural data fusion algorithms based on a linearly constrained least square method

Abstract

Two novel neural data fusion algorithms based on a linearly constrained least square (LCLS) method are proposed. While the LCLS method is used to minimize the energy of the linearly fused information, two neural-network algorithms are developed to overcome the ill-conditioned and singular problems of the sample covariance matrix arisen in the LCLS method. The proposed neural fusion algorithms are samples for implementation using both software and hardware. Compared with the existing fusion methods, the proposed neural data fusion method has an unbiased statistical property and does not require any a priori knowledge about the noise covariance. It is shown that the proposed neural fusion algorithms converge globally to the optimal fusion solution when the sample covariance matrix is singular, and converge globally with exponential rate when the sample covariance matrix is nonsingular. We apply the proposed neural fusion method to image and signal fusion, and it is shown that the quality of the solution can be greatly enhanced by the proposed technique.

DOI: 10.1109/72.991418
051015'03'05'07'09'11'13'15'17
Citations per Year

65 Citations

Semantic Scholar estimates that this publication has 65 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Xia2002NeuralDF, title={Neural data fusion algorithms based on a linearly constrained least square method}, author={Youshen Xia and Henry Leung and {\'E}loi Boss{\'e}}, journal={IEEE transactions on neural networks}, year={2002}, volume={13 2}, pages={320-9} }