# IEEE Journal of Selected Topics in Signal Processing

## Volume 12 Issue 5 • Oct. 2018

Purchase of this issue is not available.

## Filter Results

Displaying Results 1 - 25 of 32
• ### [Front cover]

Publication Year: 2018, Page(s): C1
| PDF (645 KB)
• ### IEEE Journal of Selected Topics in Signal Processing publication information

Publication Year: 2018, Page(s): C2
| PDF (52 KB)
• ### [Blank page]

Publication Year: 2018, Page(s): B817
| PDF (4 KB)
• ### [Blank page]

Publication Year: 2018, Page(s): B818
| PDF (4 KB)

Publication Year: 2018, Page(s):819 - 820
| PDF (248 KB)
• ### Introduction to the Issue on Information-Theoretic Methods in Data Acquisition, Analysis, and Processing

Publication Year: 2018, Page(s):821 - 824
| PDF (433 KB) | HTML
• ### A Modulo-Based Architecture for Analog-to-Digital Conversion

Publication Year: 2018, Page(s):825 - 840
| | PDF (1571 KB) | HTML

Systems that capture and process analog signals must first acquire them through an analog-to-digital converter. While subsequent digital processing can remove statistical correlations present in the acquired data, the dynamic range of the converter is typically scaled to match that of the input analog signal. The present paper develops an approach for analog-to-digital conversion that aims at mini... View full abstract»

• ### Zero-Delay Rate Distortion via Filtering for Vector-Valued Gaussian Sources

Publication Year: 2018, Page(s):841 - 856
| | PDF (859 KB) | HTML

We deal with zero-delay source coding of a vector-valued Gauss-Markov source subject to a mean-squared error (MSE) fidelity criterion characterized by the operational zero-delay vector-valued Gaussian rate distortion function (RDF). We address this problem by considering the nonanticipative RDF (NRDF), which is a lower bound to the causal optimal performance theoretically attainable function (or s... View full abstract»

• ### Performance Analysis of Approximate Message Passing for Distributed Compressed Sensing

Publication Year: 2018, Page(s):857 - 870
Cited by:  Papers (1)
| | PDF (2988 KB) | HTML

Bayesian approximate message passing (BAMP) is an efficient method in compressed sensing that is nearly optimal in the minimum mean squared error (MMSE) sense. Multiple measurement vector (MMV)-BAMP performs joint recovery of multiple vectors with identical support and accounts for correlations in the signal of interest and in the noise. In this paper, we show how to reduce the complexity of vecto... View full abstract»

• ### Improved Target Acquisition Rates With Feedback Codes

Publication Year: 2018, Page(s):871 - 885
| | PDF (1226 KB) | HTML

This paper considers the problem of acquiring an unknown target location (among a finite number of locations) via a sequence of measurements, where each measurement consists of simultaneously probing a group of locations. The resulting observation consists of a sum of an indicator of the target's presence in the probed region, and a zero mean Gaussian noise term whose variance is a function of the... View full abstract»

• ### Maximum Entropy Low-Rank Matrix Recovery

Publication Year: 2018, Page(s):886 - 901
| | PDF (2591 KB) | HTML

We propose a novel, information-theoretic method, called MaxEnt, for efficient data acquisition for low-rank matrix recovery. This proposed method has important applications to a wide range of problems, including image processing and text document indexing. Fundamental to our design approach is the so-called maximum entropy principle, which states that the measurement masks that maximize the entro... View full abstract»

• ### Near-Optimal Noisy Group Testing via Separate Decoding of Items

Publication Year: 2018, Page(s):902 - 915
Cited by:  Papers (1)
| | PDF (544 KB) | HTML

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and more. In this paper, we revisit an efficient algorithm for noisy group testing in which each item is decoded separately (Malyutov and Mateev, 1980), and develop... View full abstract»

• ### On the Fundamental Limit of Multipath Matching Pursuit

Publication Year: 2018, Page(s):916 - 927
Cited by:  Papers (1)
| | PDF (520 KB) | HTML

Multipath matching pursuit (MMP) is a recent extension of the orthogonal matching pursuit algorithm that recovers sparse signals with a tree-searching strategy. In this paper, we present a new analysis for the MMP algorithm using the restricted isometry property. Our result shows that if the sampling matrix A ∈ Rm×nsatisfies the RIP of order K + L with isometry constant δK + L View full abstract»

• ### Universal Joint Image Clustering and Registration Using Multivariate Information Measures

Publication Year: 2018, Page(s):928 - 943
| | PDF (1552 KB) | HTML

We consider the problem of universal joint clustering and registration of images. Image clustering focuses on grouping similar images, while image registration refers to the task of aligning copies of an image that have been subject to rigid-body transformations, such as rotations and translations. We first study registering two images using maximum mutual information and prove its asymptotic opti... View full abstract»

• ### Community Detection With Side Information: Exact Recovery Under the Stochastic Block Model

Publication Year: 2018, Page(s):944 - 958
Cited by:  Papers (3)
| | PDF (694 KB) | HTML

The community detection problem involves making inferences about node labels in a graph, based on observing the graph edges. This paper studies the effect of additional, nongraphical side information on the phase transition of exact recovery in the binary stochastic block model withnnodes. When side information consists of noisy labels with error probability α, it is shown that phase transi... View full abstract»

• ### Hypergraph Spectral Clustering in the Weighted Stochastic Block Model

Publication Year: 2018, Page(s):959 - 974
| | PDF (668 KB) | HTML

Spectral clustering is a celebrated algorithm that partitions the objects based on pairwise similarity information. While this approach has been successfully applied to a variety of domains, it comes with limitations. The reason is that there are many other applications in which only multiway similarity measures are available. This motivates us to explore the multiway measurement setting. In this ... View full abstract»

• ### Lower Bounds on the Bayes Risk of the Bayesian BTL Model With Applications to Comparison Graphs

Publication Year: 2018, Page(s):975 - 988
| | PDF (605 KB) | HTML Media

We consider the problem of aggregating pairwise comparisons to obtain a consensus ranking order over a collection of objects. We use the popular Bradley-Terry-Luce (BTL) model, which allows us to probabilistically describe pairwise comparisons between objects. In particular, we employ the Bayesian BTL model, which allows for meaningful prior assumptions and to cope with situations where the number... View full abstract»

• ### Top-$K$Rank Aggregation From$M$-Wise Comparisons

Publication Year: 2018, Page(s):989 - 1004
| | PDF (747 KB) | HTML

Suppose one aims to identify only the top-K among a large collection of n items provided M-wise comparison data, where a set of M items in each data sample are ranked in order of individual preference. Natural questions that arise are as follows: 1) how one can reliably achieve the top-K rank aggregation task; and 2) how many M-wise samples one needs to achieve it. In this paper, we answer these t... View full abstract»

• ### Nonparametric Composite Hypothesis Testing in an Asymptotic Regime

Publication Year: 2018, Page(s):1005 - 1014
| | PDF (685 KB) | HTML

We investigate the nonparametric, composite hypothesis testing problem for arbitrary unknown distributions in the asymptotic regime where both the sample size and the number of hypothesis grow exponentially large. Such asymptotic analysis is important in many practical problems, where the number of variations that can exist within a family of distributions can be countably infinite. We introduce t... View full abstract»

• ### Classification and Representation via Separable Subspaces: Performance Limits and Algorithms

Publication Year: 2018, Page(s):1015 - 1030
| | PDF (3199 KB) | HTML

We study the classification performance of Kronecker-structured (K-S) subpsace models in two asymptotic regimes and develop an algorithm for fast and compact K-S subspace learning for better classification and representation of multidimensional signals by exploiting the structure in the signal. First, we study the classification performance in terms of diversity order and pairwise geometry of the ... View full abstract»

• ### Bayesian Nonparametric Causal Inference: Information Rates and Learning Algorithms

Publication Year: 2018, Page(s):1031 - 1046
| | PDF (1374 KB) | HTML

We investigate the problem of estimating the causal effect of a treatment on individual subjects from observational data; this is a central problem in various application domains, including healthcare, social sciences, and online advertising. Within the Neyman-Rubin potential outcomes model, we use the Kullback-Leibler (KL) divergence between the estimated and true distributions as a measure of ac... View full abstract»

• ### Identifiability of Kronecker-Structured Dictionaries for Tensor Data

Publication Year: 2018, Page(s):1047 - 1062
| | PDF (495 KB) | HTML

This paper derives sufficient conditions for local recovery of coordinate dictionaries comprising a Kronecker-structured dictionary that is used for representing Kth-order tensor data. Tensor observations are assumed to be generated from a Kronecker-structured dictionary multiplied by sparse coefficient tensors that follow the separable sparsity model. This paper provides sufficient conditions on ... View full abstract»

• ### Compression-Based Regularization With an Application to Multitask Learning

Publication Year: 2018, Page(s):1063 - 1076
| | PDF (660 KB) | HTML

This paper investigates, from information theoretic grounds, a learning problem based on the principle that any regularity in a given dataset can be exploited to extract compact features from data, i.e., using fewer bits than needed to fully describe the data itself, in order to build meaningful representations of a relevant content (multiple labels). We begin studying a multitask learning (MTL) p... View full abstract»

• ### Optimal Detection and Error Exponents for Hidden Semi-Markov Models

Publication Year: 2018, Page(s):1077 - 1092
| | PDF (2343 KB) | HTML

We study detection of random signals corrupted by noise that over time switch their values (states) between a finite set of possible values, where the switchings occur at unknown points in time. We model such signals as hidden semi-Markov signals, which generalize classical Markov chains by introducing explicit (possibly nongeometric) distribution for the time spent in each state. Assuming two pos... View full abstract»

• ### Achieving Pareto-Optimal MI-Based Privacy-Utility Tradeoffs Under Full Data

Publication Year: 2018, Page(s):1093 - 1105
| | PDF (659 KB) | HTML

We study a fine-grained model in which a perturbed version of some data (D) is to be disclosed, with the aims of permitting the receiver to accurately infer some useful aspects (X = f(D)) of it, while preventing her from inferring other private aspects (Y = g(D)). Correlation between the bases for these inferences necessitates compromise between these goals. Determining exactly how the disclosure ... View full abstract»

## Aims & Scope

The Journal of Selected Topics in Signal Processing (J-STSP) solicits special issues on topics that cover the entire scope of the IEEE Signal Processing Society including the theory and application of filtering, coding, transmitting, estimating, detecting, analyzing, recognizing, synthesizing, recording, and reproducing signals by digital or analog devices or techniques.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief

Lina Karam
School of Electrical, Computer, and Energy Engineering
Arizona State University
Tempe, AZ 85287-5706 USAkaram@asu.edu