The probability of a subspace swap in the SVD

Authors:
J.K. Thomas;L.L. Scharf;D.W. Tufts
Affiliations:
Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
1995

Citing 0
Cited 4

Robust adaptive signal processing methods for heterogeneous radar clutter scenarios

Signal Processing - Special section: New trends and findings in antenna array processing for radar
Improving the threshold performance of maximum likelihood estimation of direction of arrival

Signal Processing
Sinusoidal order estimation using angles between subspaces

EURASIP Journal on Advances in Signal Processing
Detection-estimation of very close emitters: performance breakdown, ambiguity, and general statistical analysis of maximum-likelihood estimation

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	35.69

Visualization

Abstract

We extend the work of Tufts, Kot, and Vaccaro (TKV) published in 1980, to improve the analytical characterization of threshold breakdown in SVD methods. Our results sharpen the TKV results by lower bounding the probability of a subspace swap in the SVD. Our key theoretical result is the characteristic function for a random variable whose probability of exceeding zero bounds the probability of a threshold breakdown