5 accepted papers
In many graph signal processing applications, finding the topology of a graph is part of the overall data processing problem rather than a priori knowledge. Most of the approaches to graph topology learning are based on the assumption of graph Laplacian sparsity, with various additional constraints,…
Investment returns naturally reside on irregular domains, however, standard multivariate portfolio optimization methods are agnostic to data structure. To this end, we investigate ways for domain knowledge to be conveniently incorporated into the analysis, by means of graphs. Next, to relax the assu…
Complex least mean square (CLMS) based adaptive computation of discrete orthogonal transforms has been extensively investigated in the literature. However, all of these results provide only a means for the calculation of either forward orthogonal transforms or their inverse orthogonal transforms, se…
This work sheds a new light on the spectral whitening effects of the sliding discrete Fourier transform (DFT) and uses it as a basis for a novel technique for circularity-preserving spectral estimation. This makes it possible to utilise full available spectral information, unlike the existing method…
Real world complex-valued signals typically exhibit rotation-dependent distributions (noncircularity), and significant performance gains in learning algorithms can be obtained by accounting for information beyond the standard second-order noncircularity (impropriety). To this end, we introduce a new…