IEEE OJSP Article

You are here

Top Reasons to Join SPS Today!

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.

IEEE OJSP Article

In the era of big data, profitable opportunities are becoming available for many applications. As the amount of data keeps increasing, machine learning becomes an attractive tool to analyze the information acquired. However, harnessing meaningful data remains a challenge. The machine learning tools employed in many applications apply all training data without taking into consideration how relevant are some of them. In this paper, we propose a data selection strategy for the training step of Neural Networks to obtain the most significant data information and improve algorithm performance during training. 

Quadrature spatial modulation (QSM) isa recently proposed multiple-input multiple-output (MIMO) wireless transmission paradigm that has garnered considerable research interest owing to its relatively high spectral efficiency. QSM essentially enhances the spatial multiplexing gain while maintaining all the inherent advantages of spatial modulation (SM).

Identification of decompressed JPEG images, especially those compressed with high JPEG quality factors, is a challenging issue in image forensics. Furthermore, the applicability of the existing JPEG forensic detectors in forgery localization is limited by their inability to cope with spatial misalignment in the 8×8 JPEG grid.

This work exploits Riemannian manifolds to build a sequential-clustering framework able to address a wide variety of clustering tasks in dynamic multilayer (brain) networks via the information extracted from their nodal time-series. The discussion follows a bottom-up path, starting from feature extraction from time-series and reaching up to Riemannian manifolds (feature spaces) to address clustering tasks such as state clustering, community detection (a.k.a. network-topology identification), and subnetwork-sequence tracking. 

We present a structured overview of adaptation algorithms for neural network-based speech recognition, considering both hybrid hidden Markov model / neural network systems and end-to-end neural network systems, with a focus on speaker adaptation, domain adaptation, and accent adaptation. 

Constant-modulus sequence set with low peak side-lobe level is a necessity for enhancing the performance of modern active sensing systems like Multiple Input Multiple Output (MIMO) RADARs. In this paper, we consider the problem of designing a constant-modulus sequence set by minimizing the peak side-lobe level, which can be cast as a non-convex minimax problem, and propose a Majorization-Minimization technique based iterative monotonic algorithm named as the PSL minimizer.

This work examines a distributed learning problem where the agents of a network form their beliefs about certain hypotheses of interest. Each agent collects streaming (private) data and updates continually its belief by means of a diffusion strategy, which blends the agent’s data with the beliefs of its neighbors. We focus on weakly-connected graphs, where the network is partitioned into sending and receiving sub-networks, and we allow for heterogeneous models across the agents.

Principal component analysis is one of the most commonly used methods for dimensionality reduction in signal processing. However, the most commonly used PCA formulation is based on the L2 -norm, which can be highly influenced by outlier data. In recent years, there has been growing interest in the development of more robust PCA methods. 

This paper formulates a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. The smoothness condition softens the transition in the tasks among adjacent nodes and allows incorporating information about the graph structure into the solution of the inference problem.

In this paper, we analyze the two-node joint clock synchronization and ranging problem. We focus on the case of nodes that employ time-to-digital converters to determine the range between them precisely. This specific design choice leads to a sawtooth model for the captured signal, which has not been studied before from an estimation theoretic standpoint.

Pages

SPS Social Media

IEEE SPS Educational Resources

IEEE SPS Resource Center

IEEE SPS YouTube Channel