SPS Feed

We present a method to compress geometry information of point clouds that explores redundancies across consecutive frames of a sequence. It uses octrees and works by progressively increasing the resolution of the octree. At each branch of the tree, we generate an approximation of the child nodes by a number of methods which are used as contexts to drive an arithmetic coder.

The inverse synthetic aperture radar (ISAR) imaging technique of a moving target with sparse sampling data has attracted wide attention due to its ability to reduce the data collection burden. However, traditional low-rank or 2D compressive sensing (CS)-based ISAR imaging methods can handle the random sampling or the separable sampling data only. 

We consider a decentralized detection network whose aim is to infer a public hypothesis of interest. However, the raw sensor observations also allow the fusion center to infer private hypotheses that we wish to protect. We consider the case where there are an uncountable number of private hypotheses belonging to an uncertainty set, and develop local privacy mappings at every sensor so that the sanitized sensor information minimizes the Bayes error of detecting the public hypothesis at the fusion center while achieving information privacy for all private hypotheses. 

Sparsity and low-rank models have been popular for reconstructing images and videos from limited or corrupted measurements. Dictionary or transform learning methods are useful in applications such as denoising, inpainting, and medical image reconstruction.

Three-dimensional (3-D) radar imaging can provide additional information along elevation dimension about the target with respect to the conventional 2-D radar imaging, but usually requires a huge amount of data collected over 3-D frequency-azimuth-elevation space, which motivates us to perform 3-D imaging by using sparsely sampled data. Traditional compressive sensing (CS) based 3-D imaging methods with sparse data convert the 3-D data into a long vector, and then complete the sensing and recovery steps.

This work presents a method that persuades acoustic reflections to be a favorable property for sound source localization. Whilst most real world spatial audio applications utilize prior knowledge of sound source position, estimating such positions in reverberant environments is still considered to be a difficult problem due to acoustic reflections.

Recurrent neural networks (RNNs) can predict fundamental frequency (F 0 ) for statistical parametric speech synthesis systems, given linguistic features as input. However, these models assume conditional independence between consecutive F 0 values, given the RNN state. In a previous study, we proposed autoregressive (AR) neural F 0 models to capture the causal dependency of successive F 0 values.

In this letter, we propose a new approach to tracking a target that maneuvers based on the multiple-constant-turns model. Usually, the interactive-multiple-model (IMM) algorithm based on the extended Kalman filter (IMM-EKF) is employed for this problem with successful tracking performance.