1. IEEE Signal Processing Magazine
2. Signal Processing Digital Library*
3. Inside Signal Processing Newsletter
4. SPS Resource Center
5. Career advancement & recognition
6. Discounts on conferences and publications
7. Professional networking
8. Communities for students, young professionals, and women
9. Volunteer opportunities
10. Coming soon! PDH/CEU credits
Click here to learn more.
This paper considers the problem of outlier censoring from secondary data, where the number, amplitude and location of outliers is unknown. To this end, a novel sparse recovery technique based on joint block sparse learning via iterative minimization (BSLIM) and model order selection (MOS), called JBM, is proposed which exploits the inherent sparse nature of the outliers in homogeneous background. The cost function proposed here, unlike many similar works in this field, does not require a dictionary matrix.
In this paper, new results in random matrix theory are derived, which allow us to construct a shrinkage estimator of the global minimum variance (GMV) portfolio when the shrinkage target is a random object. More specifically, the shrinkage target is determined as the holding portfolio estimated from previous data. The theoretical findings are applied to develop theory for dynamic estimation of the GMV portfolio, where the new estimator of its weights is shrunk to the holding portfolio at each time of reconstruction.
In this paper, we show that the adaptive projected subgradient method (APSM) is bounded perturbation resilient. To illustrate a potential application of this result, we propose a set-theoretic framework for MIMO detection, and we devise algorithms based on a superiorized APSM. Various low-complexity MIMO detection algorithms achieve excellent performance on i.i.d. Gaussian channels, but they typically incur high performance loss if realistic channel models (e.g., correlated channels) are considered.
We consider the problem of monostatic radar sensing with orthogonal frequency-division multiplexing (OFDM) joint radar-communications (JRC) systems in the presence of phase noise (PN) caused by oscillator imperfections. We begin by providing a rigorous statistical characterization of PN in the radar receiver over multiple OFDM symbols for free-running oscillators (FROs) and phase-locked loops (PLLs).
This paper examines the problem of bipartite consensus for Takagi-Sugeno fuzzy multi-agent systems subject to uncertainties. The principal intention of this work is to develop a non-fragile controller through which the considered multi-agent system can achieve bipartite consensus. An undirected signed graph is considered to describe the cooperative and competitive interaction among neighboring agents.
This paper focuses on the constrained optimization problem where the objective function is composed of smooth (possibly nonconvex) and nonsmooth parts. The proposed algorithm integrates the successive convex approximation (SCA) technique with the gradient tracking mechanism that aims at achieving a linear convergence rate and employing the momentum term to regulate update directions in each time instant.
In this paper, we investigate the performance of a wide area network (WAN) with three hops over a mixed radio frequency (RF), reconfigurable intelligent surface (RIS) assisted RF and Free space optics (FSO) channel. Here RIS and decode-and-forward (DF) relays are used to improve the coverage and system performance. For general applicability, the RF and FSO links are modelled with Saleh-Valenzuela (S-V) and Gamma-Gamma distribution, respectively.
The smoothness of graph signals has found desirable real applications for processing irregular (graph-based) signals. When the latent sources of the mixtures provided to us as observations are smooth graph signals, it is more efficient to use graph signal smoothness terms along with the classic independence criteria in Blind Source Separation (BSS) approaches. In the case of underlying graphs being known, Graph Signal Processing (GSP) provides valuable tools; however, in many real applications, these graphs can not be well-defined a priori and need to be learned from data.
We introduce graph wedgelets - a tool for data compression on graphs based on the representation of signals by piecewise constant functions on adaptively generated binary graph partitionings. The adaptivity of the partitionings, a key ingredient to obtain sparse representations of a graph signal, is realized in terms of recursive wedge splits adapted to the signal. For this, we transfer adaptive partitioning and compression techniques known for 2D images to general graph structures and develop discrete variants of continuous wedgelets and binary space partitionings.
In many specific scenarios, accurateand practical cooperative learning is a commonly encountered challenge in multi-agent systems. Thus, the current investigation focuses on cooperative learning algorithms for multi-agent systems and underpins an alternate data-based neural network reinforcement learning framework. To achieve the data-based learning optimization, the proposed cooperative learning framework, which comprises two layers, introduces a virtual learning objective.
Light Fields (LFs) are easily degraded by noise and low light. Low light LF enhancement and denoising are more challenging than single image tasks because the epipolar information among views should be taken into consideration. In this work, we propose a multiple stream progressive restoration network to restore the whole LF in just one forward pass. To make full use of the multiple views supplementary information and preserve the epipolar information, we design three types of input composed of view stacking.
In the snapshot compressive imaging (SCI) field, how to explore priors for recovering the original high-dimensional data from its lower-dimensional measurements is a challenge. Recent plug-and-play efforts plugged by deep denoisers have achieved superior performance, and their convergences have been guaranteed under the assumption of bounded denoisers and the condition of diminishing noise levels. However, it is difficult to explicitly prove the bounded properties of existing deep denoisers due to complex network architectures.
Images captured in low-light environments suffer from serious degradation due to insufficient light, leading to the performance decline of industrial and civilian devices. To address the problems of noise, chromatic aberration, and detail distortion for enhancing low-light images using existing enhancement methods, this paper proposes an integrated learning approach (LightingNet) for low-light image enhancement.
Reconstruction of CT images from a limited set of projections through an object is important in several applications ranging from medical imaging to industrial settings. As the number of available projections decreases, traditional reconstruction techniques such as the FDK algorithm and model-based iterative reconstruction methods perform poorly.
Robustness and stability of image-reconstruction algorithms have recently come under scrutiny. Their importance to medical imaging cannot be overstated. We review the known results for the topical variational regularization strategies (
This letter proposes a generalised extended nested array with multiple subarrays (GENAMS) array via the maximum inter-element spacing (IES) constraint principle. Based on the IES set patterns of the two-sides extended nested array and the flexible extended nested array with multiple subarrays type-2, a generalised IES set pattern is derived.
3D face reconstruction from a single image still suffers from low accuracy and inability to recover textures in invisible regions. In this paper, we propose a method for generating a 3D portrait with complete texture. The coarse face-and-head model and texture parameters are obtained using 3D Morphable Model fitting. We design an image-geometric inverse renderer that acquires normal, albedo, and light to jointly reconstruct the facial details.
Iterative hard thresholding (IHT) and hard thresholding pursuit (HTP) are two kinds of classical hard thresholding-based algorithms widely used in compressed sensing. Restricted isometry constant (RIC) of sensing matrix which ensures the convergence of iterative algorithms plays a key role in guaranteeing successful recovery. In the analysis of sufficient condition to ensure recovery performance, the RIC
The correlation filter(CF)-based tracker is a classic and effective model in the field of visual tracking. For a long time, most CF-based trackers solved filters using only ridge regression equations with
Image registration is a basic task in computer vision, for its wide potential applications in image stitching, stereo vision, motion estimation, and etc. Most current methods achieve image registration by estimating a global homography matrix between candidate images with point-feature-based matching or direct prediction. However, as real-world 3D scenes have point-variant photograph distances (depth), a unified homography matrix is not sufficient to depict the specific pixel-wise relations between two images.