Abstract-Signal processing on graphs finds applications in many areas. In recent years renewed interest on this topic was kindled by two groups of researchers. Narang and Ortega constructed two-channel filter banks on bipartitie graphs described by Laplacians. Sandryhaila and Moura developed the theory of linear systems, filtering, and frequency responses for the case of graphs with arbitrary adjacency matrices, and showed applications in signal compression, prediction, etc. Inspired by these contributions, this paper extends classical multirate signal processing ideas to graphs. The graphs are assumed to be general with a possibly non-symmetric and complex adjacency matrix. The paper revisits ideas such as noble identities, aliasing, and polyphase decompositions in graph multirate systems. Drawing such a parallel to classical systems allows one to design filter banks with polynomial filters, with lower complexity than arbitrary graph filters. It is shown that the extension of classical multirate theory to graphs is nontrivial, and requires certain mathematical restrictions on the graph. Thus, classical noble identities cannot be taken for granted. Similarly, one cannot claim that the so-called delay chain system is a perfect reconstruction system (as in classical filter banks). It will also be shown that M -partite extensions of the bipartite filter bank results will not work for M -channel filter banks, but a more restrictive condition called M -block cyclic property should be imposed. Such graphs are studied in detail. A detailed theory for M -channel filter banks is developed in a companion paper.

Abstract-This paper builds upon the basic theory of multirate systems for graph signals developed in the companion paper (Part I) and studies M -channel polynomial filter banks on graphs. The behavior of such graph filter banks differs from that of classical filter banks in many ways, the precise details depending on the eigenstructure of the adjacency matrix A. It is shown that graph filter banks represent (linear and) periodically shift-variant systems only when A satisfies the noble identity conditions developed in Part I. It is then shown that perfect reconstruction graph filter banks can always be developed when A satisfies the eigenvector structure satisfied by M -block cyclic graphs and has distinct eigenvalues (further restrictions on eigenvalues being unnecessary for this). If A is actually M -block cyclic then these PR filter banks indeed become practical, i.e., arbitrary filter polynomial orders are possible, and there are robustness advantages. In this case the PR condition is identical to PR in classical filter banks -any classical PR example can be converted to a graph PR filter bank on an M -block cyclic graph. It is shown that for M -block cyclic graphs with all eigenvalues on the unit circle, the frequency responses of filters have meaningful correspondence with classical filter banks. Polyphase representations are then developed for graph filter banks and utilized to develop alternate conditions for alias cancellation and perfect reconstruction, again for graphs with specific eigenstructures. It is then shown that the eigenvector condition on the graph can be relaxed by using similarity transforms.

Pulse-Doppler radar has been successfully applied to surveillance and tracking of both moving and stationary targets. For efficient processing of radar returns, delay-Doppler plane is discretized and FFT techniques are employed to compute matched filter output on this discrete grid. However, for targets whose delay-Doppler values do not coincide with the computation grid, the detection performance degrades considerably. Especially for detecting strong and closely spaced targets this causes miss detections and false alarms. This phenomena is known as the off-grid problem. Although compressive sensing based techniques provide sparse and high resolution results at sub-Nyquist sampling rates, straightforward application of these techniques is significantly more sensitive to the off-grid problem. Here a novel parameter perturbation based sparse reconstruction technique is proposed for robust delay-Doppler radar processing even under the off-grid case. Although the perturbation idea is general and can be implemented in association with other greedy techniques, presently it is used within an orthogonal matching pursuit (OMP) framework. In the proposed technique, the selected dictionary parameters are perturbed towards directions to decrease the orthogonal residual norm. The obtained results show that accurate and sparse reconstructions can be obtained for off-grid multi target cases. A new performance metric based on Kullback-Leibler Divergence (KLD) is proposed to better characterize the error between actual and reconstructed parameter spaces. Increased performance with lower reconstruction errors are obtained for all the tested performance criteria for the proposed technique compared to conventional OMP and ℓ1 minimization techniques. © 2013 Elsevier Inc

Abstract-Compressive Sensing theory details how a sparsely represented signal in a known basis can be reconstructed with an underdetermined linear measurement model. However, in reality there is a mismatch between the assumed and the actual bases due to factors such as discretization of the parameter space defining basis components, sampling jitter in A/D conversion, and model errors. Due to this mismatch, a signal may not be sparse in the assumed basis, which causes significant performance degradation in sparse reconstruction algorithms. To eliminate the mismatch problem, this paper presents a novel perturbed orthogonal matching pursuit (POMP) algorithm that performs controlled perturbation of selected support vectors to decrease the orthogonal residual at each iteration. Based on detailed mathematical analysis, conditions for successful reconstruction are derived. Simulations show that robust results with much smaller reconstruction errors in the case of perturbed bases can be obtained as compared to standard sparse reconstruction techniques.

No abstract

No abstract

No abstract

Abstract. Spatial sparsity of the target space in subsurface or through-the-wall imaging applications has been successfully used within the compressive-sensing framework to decrease the data acquisition load in practical systems, while also generating highresolution images. The developed techniques in this area mainly discretize the continuous target space into grid points and generate a dictionary of model data that is used in image-reconstructing optimization problems. However, for targets that do not coincide with the computation grid, imaging performance degrades considerably. This phenomenon is known as the off-grid problem. This paper presents a novel sparse ground-penetrating radar imaging method that is robust for off-grid targets. The proposed technique is an iterative orthogonal matching pursuit-based method that uses gradientbased steepest ascent-type iterations to locate the off-grid target. Simulations show that robust results with much smaller reconstruction errors are obtained for multiple off-grid targets compared to standard sparse reconstruction techniques.