IEEE SPL Article

Cross Z-complementary pairs (CZCPs) are a special kind of Z-complementary pairs having zero autocorrelation sums around the in-phase position and end-shift position, also having zero cross-correlation sums around the end-shift position. Recent results have shown that CZCPs are very efficient in designing pilot sequences for spatial modulation enabled multiple-input multiple-output (MIMO) systems. In this paper, we propose systematic constructions of binary and quadriphase CZCPs with new lengths of the form 2M, where even-length binary Z-complementary pairs of length M exists.

Congruent Procrustes analysis aims to find the best matching between two point sets through rotation, reflection and translation. We formulate the Procrustes problem for hyperbolic spaces, review the canonical definition of the center mass for a point set, and give a closed-form solution for the optimal isometry between noise-free point sets. Our algorithm is analogous to the Euclidean Procrustes analysis, with centering and rotation replaced by their hyperbolic counterparts. 

Point Clouds (PCs) have recently been adopted as the preferred data structure for representing 3D visual contents. Examples of Point Cloud (PC) applications range from 3D representations of small objects up to large scenes, both still or dynamic in time. PC adoption triggered the development of new coding, transmission, and display methodologies that culminated in new international standards for PC compression. 

Video inpainting aims to fill missing regions with plausible content in a video sequence. Deep learning-based video inpainting methods have made promising progress over the past few years. However, these methods tend to generate degraded completion content, such as missing textural details.

Previous works about linguistic steganography such as synonym substitution and sampling-based methods usually manipulate observed symbols explicitly to conceal secret information, which may give rise to security risks. In this letter, in order to preclude straightforward operation on observed symbols, we explored generation-based linguistic steganography in latent space by means of encoding secret messages in the selection of implicit attributes (semanteme) of natural language.

Traffic flow prediction is a challenging task while most existing works are faced with two main problems in extracting complicated intrinsic and extrinsic features. In terms of intrinsic features, current methods don't fully exploit different functions of short-term neighboring and long-term periodic temporal patterns.

Consider a robust multiple-input single-output downlink beamforming optimization problem in a frequency division duplexing system. The base station (BS) sends training signals to the users, and every user estimates the channel coefficients, quantizes the gain and the direction of the estimated channel and sends them back to the BS. 

In depth map super-resolution (SR), a high-resolution color image plays an important role as guidance for preventing blurry depth boundaries. However, excessive/deficient use of the color image features often causes performance degradation such as texture-copying/edge-smoothing in flat/boundary areas. To alleviate these problems, this letter presents a simple yet effective method for enhancing the performance of the SR without requiring significant modifications to the original SR network. To this end, we present a self-selective concatenation (SSC), which is a substitute for the conventional feature concatenation. In the upsampling layers of the SR network, the SSC extracts spatial and channel attention from both color and depth features such that color features can be selectively used for depth SR.

We consider the problem of detecting an unknown signal that lies in a union of subspaces (UoS) and that is observed in additive white Gaussian noise with unknown variance. The main contribution of this letter is the derivation of a detector that can accommodate a union made of nested subspaces. This detector includes the generalized likelihood ratio test (GLRT) as a special case when the subspace dimensions are all identical. It relies on the framework of multifamily likelihood ratio tests (MFLRT) and is shown by numerical examples to achieve better performance than existing detectors.

The study of label noise in sound event recognition has recently gained attention with the advent of larger and noisier datasets. This work addresses the problem of missing labels, one of the big weaknesses of large audio datasets, and one of the most conspicuous issues for AudioSet. We propose a simple and modelagnostic method based on a teacher-student framework with loss masking to first identify the most critical missing label candidates, and then ignore their contribution during the learning process.