By Topic

# IEEE Signal Processing Letters

## Filter Results

Displaying Results 1 - 25 of 26
• ### Front Cover

Publication Year: 2012, Page(s): C1
| PDF (174 KB)
• ### IEEE Signal Processing Letters publication information

Publication Year: 2012, Page(s): C2
| PDF (131 KB)

Publication Year: 2012, Page(s):709 - 710
| PDF (159 KB)
• ### Object Tracking via 2DPCA and $ell_{1}$-Regularization

Publication Year: 2012, Page(s):711 - 714
Cited by:  Papers (18)
| | PDF (895 KB) | HTML

In this letter, we present a novel online object tracking algorithm by using 2DPCA and ℓ1 -regularization. Firstly, we introduce ℓ1-regularization into the 2DPCA reconstruction, and develop an iterative algorithm to represent an object by 2DPCA bases and a sparse error matrix. Secondly, we propose a novel likelihood function that considers both the reconstructio... View full abstract»

• ### A Message from the Vice President of Publications on New Developments in Signal Processing Society Publications

Publication Year: 2012, Page(s): 715
| PDF (83 KB) | HTML
• ### A Low Complexity NSAF Algorithm

Publication Year: 2012, Page(s):716 - 719
| | PDF (870 KB) | HTML

This letter proposes a novel normalized subband adaptive filter (NSAF) algorithm, which applies variable step sizes to subband filters to improve the convergence performance of the conventional NSAF and update only a subset of the subbands per iteration to reduce its computational complexity. The selection process for each subband is based on the amount of improvement it makes to the mean square d... View full abstract»

• ### Errata to “Frequency Domain Echo Canceller for DMT-Based Systems” [Dec 11 713-716]

Publication Year: 2012, Page(s): 720
| | PDF (92 KB) | HTML

In the above titled letter (ibid., vol. 18, no. 12, pp. 713-716, Dec. 2012), equation (6) was incorrect. The correct equation is presented here. View full abstract»

• ### Continuous Pose Normalization for Pose-Robust Face Recognition

Publication Year: 2012, Page(s):721 - 724
Cited by:  Papers (16)
| | PDF (853 KB) | HTML

Pose variation is a great challenge for robust face recognition. In this paper, we present a fully automatic pose normalization algorithm that can handle continuous pose variations and achieve high face recognition accuracy. First, an automatic method is proposed to find pose-dependent correspondences between 2-D facial feature points and 3-D face model. This method is based on a multi-view random... View full abstract»

• ### FASTSUBS: An Efficient and Exact Procedure for Finding the Most Likely Lexical Substitutes Based on an N-Gram Language Model

Publication Year: 2012, Page(s):725 - 728
Cited by:  Papers (1)
| | PDF (749 KB) | HTML

Lexical substitutes have found use in areas such as paraphrasing, text simplification, machine translation, word sense disambiguation, and part of speech induction. However the computational complexity of accurately identifying the most likely substitutes for a word has made large scale experiments difficult. In this letter we introduce a new search algorithm, FASTSUBS, that is guaranteed to find ... View full abstract»

• ### Signal Reconstruction in Multi-Windows Spline-Spaces Using the Dual System

Publication Year: 2012, Page(s):729 - 732
Cited by:  Papers (3)
| | PDF (692 KB) | HTML

The letter presents a non-massive parallel procedure to compute the biorthogonal dual system used for signal reconstruction in the case of spline-type spaces with multiple generators. The basis of this algorithm are the properties of the projection operator and the invertibility of the Gramian in the case of a Riesz basis. We use a parallel approach in both time and frequency for the computation o... View full abstract»

• ### Gaussian Mixture Model on Tensor Field for Visual Tracking

Publication Year: 2012, Page(s):733 - 736
Cited by:  Papers (2)
| | PDF (857 KB) | HTML

Visual tracking remains a challenging problem because of both intrinsic appearance variability of object and extrinsic disturbance. To deal with this problem, we present a novel approach for tracking based on the tensor features. We convert the image into tensor field to yield more discriminating features and encode the target appearance probabilistically with gaussian mixture model (GMM). The mod... View full abstract»

• ### A Fast Template Matching Method With Rotation Invariance by Combining the Circular Projection Transform Process and Bounded Partial Correlation

Publication Year: 2012, Page(s):737 - 740
Cited by:  Papers (5)
| | PDF (809 KB) | HTML

This letter proposes an algorithm for rotation invariance template matching by combining the circular projection transformation (CPT) and the bounded partial correlation (BPC). CPT is a method that involves rotation invariance for template matching, but calculating the CPT values from the spatial domain is time-consuming. We use the frequency domain approach to reduce the computation time of CPT a... View full abstract»

• ### Cognitive Relay Networks With Multiple Primary Transceivers Under Spectrum-Sharing

Publication Year: 2012, Page(s):741 - 744
Cited by:  Papers (77)
| | PDF (1065 KB) | HTML

We examine the impact of multiple primary transmitters and receivers (PU-TxRx) on the outage performance of cognitive decode-and-forward relay networks. In such a joint relaying/spectrum-sharing arrangement, we address fundamental questions concerning three key power constraints: 1) maximum transmit power at the secondary transmitter (SU-Tx), 2) peak interference power at the primary receivers (PU... View full abstract»

• ### Non-Local Euclidean Medians

Publication Year: 2012, Page(s):745 - 748
Cited by:  Papers (28)
| | PDF (1143 KB) | HTML

In this letter, we note that the denoising performance of Non-Local Means (NLM) can be improved at large noise levels by replacing the mean by the Euclidean median. We call this new denoising algorithm the Non-Local Euclidean Medians (NLEM). At the heart of NLEM is the observation that the median is more robust to outliers than the mean. In particular, we provide a simple geometric insight that ex... View full abstract»

• ### Fault Detection and Mitigation in Kirchhoff Networks

Publication Year: 2012, Page(s):749 - 752
Cited by:  Papers (2)
| | PDF (790 KB) | HTML

In this letter, we study the problem of fault detection and mitigation in networks where the measurements satisfy Kirchhoff's voltage law. First, we characterise the class of faults appearing as an additive fault vector (injected by a malicious adversary or due to equipment failures) that can be detected by taking into account the topology of the network. Second, we consider the problem of estimat... View full abstract»

• ### Generalized Chernoff Information for Mismatched Bayesian Detection and Its Application to Energy Detection

Publication Year: 2012, Page(s):753 - 756
Cited by:  Papers (3)
| | PDF (1001 KB) | HTML

In this letter, the performance of mismatched likelihood ratio detectors for binary Bayesian hypothesis testing problems is considered. Based on large deviation theory, a method for achieving the maximum Bayesian error exponent for a mismatched likelihood ratio detector is presented. It is shown that the maximum Bayesian error exponent is given by generalized Chernoff information, which is an exte... View full abstract»

• ### Multi-Way Compressed Sensing for Sparse Low-Rank Tensors

Publication Year: 2012, Page(s):757 - 760
Cited by:  Papers (39)
| | PDF (1087 KB) | HTML Media

For linear models, compressed sensing theory and methods enable recovery of sparse signals of interest from few measurements-in the order of the number of nonzero entries as opposed to the length of the signal of interest. Results of similar flavor have more recently emerged for bilinear models, but no results are available for multilinear models of tensor data. In this contribution, we consider c... View full abstract»

• ### Statistical Bit Allocation and Statistical Precoding for Correlated MIMO Channels With Decision Feedback

Publication Year: 2012, Page(s):761 - 764
Cited by:  Papers (3)
| | PDF (873 KB) | HTML

In this letter, we jointly consider statistical precoding and statistical bit allocation for correlated MIMO channels. Given the statistics of the channel, we derive statistical BER bounds for high and low SNR ranges. Based on the BER bounds, statistical precoder and statistical bit allocation are designed. The statistical precoder helps to expose the statistical difference among the subchannels, ... View full abstract»

• ### Boosting Object Retrieval With Group Queries

Publication Year: 2012, Page(s):765 - 768
Cited by:  Papers (4)
| | PDF (569 KB) | HTML Media

Given a query image of an object, object retrieval aims to return all images from a corpus that depict the same object. Inevitably, the accuracy of the result depends strongly on the quality of the query image. Several measures have been taken to improve retrieval result quality, including the addition of a bounding box to the query, the mining of highly ranked results for more views of the object... View full abstract»

• ### A Reciprocal-Orthogonal Parametric Transform and Its Fast Algorithm

Publication Year: 2012, Page(s):769 - 772
Cited by:  Papers (2)
| | PDF (1532 KB) | HTML

In this letter, a reciprocal-orthogonal parametric transform and an efficient algorithm for its simple construction and fast computation are proposed. The algorithm is developed by introducing a recursive approach to decompose the transform matrix into a product of sparse matrices using the Kronecker product. It is shown that the structure of the resulting algorithm is very similar to that of the ... View full abstract»

• ### On the Noise Reduction Performance of a Spherical Harmonic Domain Tradeoff Beamformer

Publication Year: 2012, Page(s):773 - 776
Cited by:  Papers (12)
| | PDF (1255 KB) | HTML

In this letter, we derive an expression for the expected incoherent noise reduction factor of a spherical harmonic domain (SHD) tradeoff beamformer. The tradeoff beamformer attempts to reduce noise while minimizing speech distortion, and includes the minimum variance distortionless response (MVDR) and multichannel Wiener filters as special cases. For the open spherical microphone array, we find a ... View full abstract»

• ### [Blank page]

Publication Year: 2012, Page(s):777 - 778
| PDF (6 KB)
• ### IEEE Signal Processing Letters information for authors

Publication Year: 2012, Page(s):779 - 780
| PDF (134 KB)
• ### IEEE Signal Processing Letters EDICS

Publication Year: 2012, Page(s): 781
| PDF (96 KB)
• ### IEEE Signal Processing Society Information

Publication Year: 2012, Page(s): C3
| PDF (33 KB)

## Aims & Scope

The IEEE Signal Processing Letters is a monthly, archival publication designed to provide rapid dissemination of original, cutting-edge ideas and timely, significant contributions in signal, image, speech, language and audio processing.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
James E. Fowler
Dept Electrical & Computer Engineering
Associate Director
Distributed Analytics and Security Institute
Mississippi State University
Mississippi State, MS 39762 USA
fowler@ece.msstate.edu