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.
The Signal Processing (SP) research group at the Universität Hamburg in Germany is hiring a Postdoc (E13/E14) "Machine Learning for Speech and Audio Processing".
October 6-8, 2021
Location: Tampere, Finland
Wide-sense cyclostationary processes are an important class of non-stationary processes that have a periodic structure in their first- and second-order moments. This article extends the notion of cyclostationarity (in the wide sense) to processes where the mean and covariance functions might depart from strict periodicities and constant amplitudes.
In this paper, power allocation is examined for the coexistence of a radar and a communication system that employ multicarrier waveforms. We propose two designs for the considered spectrum sharing problem by maximizing the output signal-to-interference-plus-noise ratio (SINR) at the radar receiver while maintaining certain communication throughput and power constraints.
Hidden Markov models are widely used for target tracking, where the process and measurement noises are usually modeled as independent Gaussian distributions for mathematical simplicity. However, the independence and Gaussian assumptions do not always hold in practice. For example, in a typical target tracking application, a radar is utilized to track a non-cooperative target.
Time-frequency (TF) representations of time series are intrinsically subject to the boundary effects. As a result, the structures of signals that are highlighted by the representations are garbled when approaching the boundaries of the TF domain. In this paper, for the purpose of real-time TF information acquisition of nonstationary oscillatory time series, we propose a numerically efficient approach for the reduction of such boundary effects.
In this paper, we investigate the resource allocation problem for a full-duplex (FD) massive multiple-input-multiple-output (mMIMO) multi-carrier (MC) decode and forward (DF) relay system which serves multiple MC single-antenna half-duplex (HD) nodes. In addition to the prior studies focusing on maximizing the sum-rate and energy efficiency, we focus on minimizing the overall delivery time for a given set of communication tasks to the user terminals.
The problem of graph learning concerns the construction of an explicit topological structure revealing the relationship between nodes representing data entities, which plays an increasingly important role in the success of many graph-based representations and algorithms in the field of machine learning and graph signal processing.
JPEG lossy image compression is a still image compression algorithm model that is currently widely used in major network media. However, it is unsatisfactory in the quality of compressed images at low bit rates. The objective of this paper is to improve the quality of compressed images and suppress blocking artifacts by improving the JPEG image compression model at low bit rates.
We have recently seen great progress in image classification due to the success of deep convolutional neural networks and the availability of large-scale datasets. Most of the existing work focuses on single-label image classification. However, there are usually multiple tags associated with an image. The existing works on multi-label classification are mainly based on lab curated labels.
The mnemonic descent method (MDM) algorithm is the first end-to-end recurrent convolutional system for high-accuracy face alignment. However, the heavy computational complexity and high memory access demands make it difficult to satisfy the requirements of real-time applications. To address this problem, an improved MDM (I-MDM) algorithm is proposed for efficient hardware implementation based on several hardware-oriented optimizations.
Radial distortion has widely existed in the images captured by popular wide-angle cameras and fisheye cameras. Despite the long history of distortion rectification, accurately estimating the distortion parameters from a single distorted image is still challenging. The main reason is that these parameters are implicit to image features, influencing the networks to learn the distortion information fully.
The performance of ellipse fitting may significantly degrade in the presence of outliers, which can be caused by occlusion of the object, mirror reflection or other objects in the process of edge detection. In this paper, we propose an ellipse fitting method that is robust against the outliers, and thus maintaining stable performance when outliers can be present.
Gait recognition aims to recognize persons' identities by walking styles. Gait recognition has unique advantages due to its characteristics of non-contact and long-distance compared with face and fingerprint recognition. Cross-view gait recognition is a challenge task because view variance may produce large impact on gait silhouettes.
Monitoring all the internal flows in a datacenter is important to protect a victim against internal distributed denial-of-service (DDoS) attacks. Unused virtual machines (VMs) in a datacenter are used as monitors and flows are copied to the monitors from software defined networking (SDN) switches by adding some special rules. In such a system, a VM runs a machine learning method to detect DDoS behavior but it can only process a limited number/amount of flows.
User activities in cyberspace leave unique traces for user identification (UI). Individual users can be identified by their frequent activity items through statistical feature matching. However, such approaches face the data sparsity problem. In this paper, we propose to address this problem by multi-item-set fingerprinting that identifies users not only based on their frequent individual activity items, but also their frequent consecutive item sequences with different lengths.