Search

The construction of highly incoherent frames, sequences of vectors placed on the unit hyper sphere of a finite dimensional Hilbert space with low correlation between them, has proven very difficult. Algorithms proposed in the past have focused on minimizing the absolute value off-diagonal entries of the Gram matrix of these structures. Recently, a method based on convex optimization that operates directly on the vectors of the frame has been shown to produce promising results. This paper gives a detailed analysis of the optimization problem at the heart of this approach and, based on these insights, proposes a new method that substantially outperforms the initial approach and all current methods in the literature for all types of frames, with low and high redundancy. We give extensive experimental results that show the effectiveness of the proposed method and its application to optimized compressed sensing. [ABSTRACT FROM PUBLISHER]

This paper considers the problem of passive detection with a multistatic radar system involving a noncooperative illuminator of opportunity (IO) and multiple receive platforms. An unknown source signal is transmitted by the IO, which illuminates a target of interest. These receive platforms are geographically dispersed, and collect independent target echoes due to the illumination by the same IO. We consider a generalized canonical correlation (GCC) detector for passive detection which requires the knowledge of the noise power. We derive closed-form expressions for the probabilities of false alarm and detection of this detector. For the case where the noise power is unknown, we propose a generalized likelihood ratio test (GLRT) detector to deal with the passive detection problem. Moreover, a closed-form expression for the probability of false alarm of this GLRT detector is given, which shows that the proposed GLRT detector exhibits a constant false alarm rate property with respect to the noise power. Numerical simulations demonstrate that the proposed GLRT detector generally outperforms the generalized coherence detector, a previous popular passive detector that neither requires the knowledge of the noise power. In addition, the GLRT also outperforms the GCC detector when the latter has an uncertainty in its knowledge of the noise power. [ABSTRACT FROM PUBLISHER]

Group Lasso is a mixed l1/l2-regularization method for a block-wise sparse model that has attracted a lot of interests in statistics, machine learning, and data mining. This paper establishes the possibility of stably recovering original signals from the noisy data using the adaptive group Lasso with a combination of sufficient block-sparsity and favorable block structure of the overcomplete dictionary. The corresponding theoretical results about the solution uniqueness, support recovery and representation error bound are derived based on the properties of block-coherence and subcoherence. Compared with the theoretical results on the parametrized quadratic program of conventional sparse representation, our stability results are more general. A comparison with block-based orthogonal greedy algorithm is also presented. Numerical experiments demonstrate the validity and correctness of theoretical derivation and also show that in case of noisy situation, the adaptive group Lasso has a better reconstruction performance than the quadratic program approach if the observed sparse signals have a natural block structure. [ABSTRACT FROM PUBLISHER]