相关论文: Pattern Synthesizing of the Concentric Ring Arrays…

While the recent theory of compressed sensing provides an opportunity to overcome the Nyquist limit in recovering sparse signals, a solution approach usually takes a form of inverse problem of the unknown signal, which is crucially…

In this paper, we present and analyze a new set of low-rank recovery algorithms for linear inverse problems within the class of hard thresholding methods. We provide strategies on how to set up these algorithms via basic ingredients for…

The design of sub-arrayed phased arrays (PAs) with sub-array-only amplitude and phase controls that afford arbitrary-shaped power patterns matching reference ones is addressed. Such a synthesis problem is formulated in the power pattern…

Applications such as Magnetic Resonance Tomography acquire imaging data by point samples of their Fourier transform. This raises the question of balancing the efficiency of the sampling strategies with the approximation accuracy of an…

Nonnegative Matrix Factorization (NMF) models are widely used to recover linearly mixed nonnegative data. When the data is made of samplings of continuous signals, the factors in NMF can be constrained to be samples of nonnegative rational…

Performance analysis of $l_0$ norm constrained Recursive least Squares (RLS) algorithm is attempted in this paper. Though the performance pretty attractive compared to its various alternatives, no thorough study of theoretical analysis has…

We present a successive constraint approach that makes it possible to cheaply solve large-scale linear matrix inequalities for a large number of parameter values. The efficiency of our method is made possible by an offline/online…

This preliminary note presents a heuristic for determining rank constrained solutions to linear matrix equations (LME). The method proposed here is based on minimizing a non-convex quadratic functional, which will hence-forth be termed as…

We propose a combined model, which integrates the latent factor model and the logistic regression model, for the citation network. It is noticed that neither a latent factor model nor a logistic regression model alone is sufficient to…

This paper considers efficient sampling of simultaneously sparse and correlated (S$\&$C) signals. Such signals arise in various applications in array processing. We propose an implementable sampling architecture for the acquisition of…

We present a method for synthesizing recursive functions that provably satisfy a given specification in the form of a polymorphic refinement type. We observe that such specifications are particularly suitable for program synthesis for two…

We propose a new least squares finite element method to solve the Poisson equation. By using a piecewisely irrotational space to approximate the flux, we split the classical method into two sequential steps. The first step gives the…

We propose an efficient algorithm for solving group synchronization under high levels of corruption and noise, while we focus on rotation synchronization. We first describe our recent theoretically guaranteed message passing algorithm that…

Low-Rank Factorization (LRF) is a widely adopted technique for compressing deep neural networks (DNNs). However, it faces several challenges, including optimal rank selection, a vast design space, long fine-tuning times, and limited…

Nonnegative matrix factorization (NMF) is widely used for clustering with strong interpretability. Among general NMF problems, symmetric NMF is a special one that plays an important role in graph clustering where each element measures the…

In this paper the author proposes to use the Least Squares Lattice filter with forgetting factor to estimate time-varying parameters of the model for noise processes. We simulated an Auto-Regressive (AR) noise process in which we let the…

We propose a method to reconstruct and cluster incomplete high-dimensional data lying in a union of low-dimensional subspaces. Exploring the sparse representation model, we jointly estimate the missing data while imposing the intrinsic…

This paper presents an enhanced adaptive random Fourier features (ARFF) training algorithm for shallow neural networks, building upon the work introduced in "Adaptive Random Fourier Features with Metropolis Sampling", Kammonen et al.,…

In this manuscript a factor graph approach is employed to investigate the recursive filtering problem for a mixed linear/nonlinear state-space model, i.e. for a model whose state vector can be partitioned in a linear state variable…

We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense sublattices of dense sublattices (or their duals) with…