IEEE Signal Processing Letters

Filter Results

Displaying Results 1 - 25 of 33
• [Front cover]

Publication Year: 2010, Page(s): C1
| PDF (193 KB)
• IEEE Signal Processing Letters publication information

Publication Year: 2010, Page(s): C2
| PDF (39 KB)

Publication Year: 2010, Page(s):115 - 116
| PDF (48 KB)
• Cooperative Differential Space–Time Spreading for the Asynchronous Relay Aided CDMA Uplink Using Interference Rejection Spreading Code

Publication Year: 2010, Page(s):117 - 120
Cited by:  Papers (7)  |  Patents (2)
| | PDF (206 KB) | HTML

This letter proposes a differential Space-Time Coding (STC) scheme designed for asynchronous cooperative networks, where neither channel estimation nor symbol-level synchronization is required at the cooperating nodes. More specifically, our system employs differential encoding during the broadcast phase and a Space-Time Spreading (STS)-based amplify-and-forward scheme during the cooperative phase... View full abstract»

• Phonetic Distance Based Confidence Measure

Publication Year: 2010, Page(s):121 - 124
Cited by:  Papers (3)
| | PDF (186 KB) | HTML

This letter presents a novel confidence measure for the purpose of improving user performance in Spoken Document Retrieval (SDR). The proposed confidence measure is based on the phonetic distance between subword models, employing an anti-model which is determined to be discriminative to a target model using offline training data. As an advancement from our previous work, the proposed method employ... View full abstract»

• A Frequency Domain Step-Size Control Method for LMS Algorithms

Publication Year: 2010, Page(s):125 - 128
Cited by:  Papers (16)  |  Patents (1)
| | PDF (213 KB) | HTML

Frequency-domain (FD) adaptive filters are able to reduce the numerical complexity by using the overlap-and-save implementation method compared to time-domain (TD) ones. Similar to the TD algorithms, the selection of step size trades off between the convergence rate and steady state performance. In this letter, we propose a bin-wise block-varying step-size control method for the FD least-mean-squa... View full abstract»

• Boosted Tracking in Video

Publication Year: 2010, Page(s):129 - 132
Cited by:  Papers (8)
| | PDF (276 KB) | HTML

We discuss how a probabilistic interpretation of the output provided by a cascade of boosted classifiers can be exploited for Bayesian tracking in video streams. In particular, real-time face and body detection can be achieved by relying on such a Bayesian framework. Results show that such integrated approach is appealing with respect both to robustness and computational efficiency. View full abstract»

Publication Year: 2010, Page(s):133 - 136
Cited by:  Papers (39)
| | PDF (179 KB) | HTML

We propose a novel signal to interference and noise (SINR) balancing technique for a downlink cognitive radio network (CRN) wherein multiple cognitive users (also referred to as secondary users (SUs)) coexist and share the licensed spectrum with the primary users (PUs) using the underlay approach. The proposed beamforming technique maximizes the worst SU SINR while ensuring that the interference l... View full abstract»

• New Square-Root Factorization of Inverse Toeplitz Matrices

Publication Year: 2010, Page(s):137 - 140
Cited by:  Papers (2)
| | PDF (124 KB) | HTML

Square-root (in particular, Cholesky) factorization of Toeplitz matrices and of their inverses is a classical area of research. The Schur algorithm yields directly the Cholesky factorization of a symmetric Toeplitz matrix, whereas the Levinson algorithm does the same for the inverse matrix. The objective of this letter is to use results from the theory of rational orthonormal functions to derive s... View full abstract»

• Detection of LSB Matching Steganography in Decompressed Images

Publication Year: 2010, Page(s):141 - 144
Cited by:  Papers (11)
| | PDF (411 KB) | HTML

Studies show that no detectors for LSB matching have yet proven universally reliable and it is hard to predict which types of image are suitable for a specific steganalyzer. For the kind of decompressed images, this paper presents an efficient steganalyzer that exploits the fact that the noise residuals in the DCT domain are rather concentrated on zero and very sensitive to LSB matching. Experimen... View full abstract»

• An Asymptotically Optimal Cooperative Relay Scheme for Two-Way Relaying Protocol

Publication Year: 2010, Page(s):145 - 148
Cited by:  Papers (9)
| | PDF (312 KB) | HTML

Some of the existing relay schemes for cooperative networks based on one-way relaying protocol are not applicable to the case of two-way relaying protocol. In this letter, a cooperative relay scheme for distributed amplify-and-forward relays working under the two-way relaying protocol is designed in a closed-form, which is asymptotically optimal in the high levels of signal-to-noise ratio (SNR). A... View full abstract»

• Compressed Sensing With Quantized Measurements

Publication Year: 2010, Page(s):149 - 152
Cited by:  Papers (100)  |  Patents (1)
| | PDF (233 KB) | HTML

We consider the problem of estimating a sparse signal from a set of quantized, Gaussian noise corrupted measurements, where each measurement corresponds to an interval of values. We give two methods for (approximately) solving this problem, each based on minimizing a differentiable convex function plus an l 1 regularization term. Using a first order method developed by Hale et al... View full abstract»

• Blind Source Separation by Entropy Rate Minimization

Publication Year: 2010, Page(s):153 - 156
Cited by:  Papers (1)
| | PDF (245 KB) | HTML

An algorithm for the blind separation of mutually independent and/or temporally correlated sources is presented in this letter. The algorithm is closely related to the maximum likelihood approach based on entropy rate minimization but uses a simpler contrast function that can be accurately and efficiently estimated using nearest-neighbor distances. The advantages of the new algorithm are highlight... View full abstract»

• Posterior CramÉr–Rao Lower Bounds for Target Tracking in Sensor Networks With Quantized Range-Only Measurements

Publication Year: 2010, Page(s):157 - 160
Cited by:  Papers (15)
| | PDF (230 KB) | HTML

We consider the problem of target tracking in a wireless sensor network (WSN) that consists of randomly distributed range-only sensors. Quantized measurements are usually adopted in such a network to attack the problem of limited power supply and communication bandwidth. Assuming that local sensor noises are mutually independent, we derive the posterior Cramer-Rao lower bound (CRLB) on the mean sq... View full abstract»

• Multiuser Subcarrier and Power Allocation Algorithm for OFDM/Offset-QAM

Publication Year: 2010, Page(s):161 - 164
Cited by:  Papers (5)
| | PDF (300 KB) | HTML

In this letter, the multiuser bit and power allocation problem for an orthogonal frequency division multiplexing (OFDM)/offset-quadrature amplitude modulation (OQAM) system is investigated. The signal-to-interference-plus-noise ratio (SINR) and required power expressions for the formulation of the problem in an OFDM/OQAM system are developed. Next, a suboptimal algorithm based on this formulation ... View full abstract»

• An Efficient Proportionate Affine Projection Algorithm for Echo Cancellation

Publication Year: 2010, Page(s):165 - 168
Cited by:  Papers (59)
| | PDF (279 KB) | HTML

Proportionate-type normalized least-mean-square algorithms were developed in the context of echo cancellation. In order to further increase the convergence rate and tracking, the ??proportionate?? idea was applied to the affine projection algorithm (APA) in a straightforward manner. The objective of this letter is twofold. First, a general framework for the derivation of proportionate-type APAs is... View full abstract»

• Stepsize Sequence Design for Distributed Average Consensus

Publication Year: 2010, Page(s):169 - 172
Cited by:  Papers (5)
| | PDF (443 KB) | HTML

Starting from local observations, iterative consensus algorithms attempt to drive a sensor network to a common estimate in a decentralized, incremental manner. When additive noise perturbs the sensor exchanges, a decreasing stepsize guarantees convergence under certain conditions, although the design of such stepsize sequence for fastest convergence is an unsettled issue. We present a greedy appro... View full abstract»

• Addition Aware Quantization for Low Complexity and High Precision Constant Multiplication

Publication Year: 2010, Page(s):173 - 176
Cited by:  Papers (8)  |  Patents (1)
| | PDF (213 KB) | HTML

Multiplication by constants can be efficiently realized using shifts, additions, and subtractions. In this work we consider how to select a fixed-point value for a real valued, rational, or floating-point coefficient to obtain a low-complexity realization. It is shown that the process, denoted addition aware quantization, often can determine coefficients that has as low complexity as the rounded v... View full abstract»

• A Low-Complexity Sliding-Window Kalman FIR Smoother for Discrete-Time Models

Publication Year: 2010, Page(s):177 - 180
Cited by:  Papers (7)
| | PDF (249 KB) | HTML

The information filter is a form of the Kalman filter that, in many of its realizations, allows optimal, unbiased, recursive state estimation without an initial state estimate. We review a number of forms of the information filter. We then derive the coefficients for the sliding-window Kalman finite impulse response (FIR) smoother (also known as a receding or moving horizon Kalman FIR smoother) st... View full abstract»

• An Alternating $l_1$ Approach to the Compressed Sensing Problem

Publication Year: 2010, Page(s):181 - 184
Cited by:  Papers (9)
| | PDF (152 KB) | HTML

Compressed sensing is a new methodology for constructing sensors which allow sparse signals to be efficiently recovered using only a small number of observations. The recovery problem can often be stated as the one of finding the solution of an underdetermined system of linear equations with the smallest possible support. The most studied relaxation of this hard combinatorial problem is the l View full abstract»

• Uncorrelated Discriminant Nearest Feature Line Analysis for Face Recognition

Publication Year: 2010, Page(s):185 - 188
Cited by:  Papers (48)
| | PDF (276 KB) | HTML

We propose in this letter a new subspace learning method, called uncorrelated discriminant nearest feature line analysis (UDNFLA), for face recognition. Motivated by the fact that existing nearest feature line (NFL) can effectively characterize the geometrical information of face samples, and uncorrelated features are desirable for many pattern analysis applications, we propose using the NFL metri... View full abstract»

• A Low-Complexity Scheme to Reduce the PAPR of an OFDM Signal Using Sign-Selection Algorithms

Publication Year: 2010, Page(s):189 - 192
Cited by:  Papers (13)
| | PDF (416 KB) | HTML

This paper considers the use of the sign-selection technique to reduce the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) signal. In the sign-selection technique, a set of subcarrier signs is selected to significantly reduce the PAPR statistics for OFDM signals. However, the considerable computational complexity for an exhaustive search over all combinat... View full abstract»

• New Speaker Adaptation Method Using 2-D PCA

Publication Year: 2010, Page(s):193 - 196
Cited by:  Papers (11)
| | PDF (275 KB) | HTML

This letter describes a speaker adaptation method based on the two-dimensional PCA of training models. In the method, state and dimension of mean vectors are differentiated, and the covariance matrix is computed dimension-wisely. As a result, the speaker weight can contain different weighting for each dimension of mean vectors. In the isolated-word recognition experiments, the proposed method perf... View full abstract»

• Motion Vector Outlier Rejection Cascade for Global Motion Estimation

Publication Year: 2010, Page(s):197 - 200
Cited by:  Papers (15)
| | PDF (666 KB) | HTML

Global motion estimation (GME) from motion vector (MV) field in compressed domain greatly reduces the complexity of conventional pixel-based GME. However, outlier MVs, caused by noise or foreground objects, may reduce the accuracy of MV-based GME. In this paper, we propose a cascade-of-rejectors approach for removing MV outliers to achieve efficient and accurate GME. Experimental results show that... View full abstract»

• Performance Analysis of Relay Selection Techniques With Clustered Fixed-Gain Relays

Publication Year: 2010, Page(s):201 - 204
Cited by:  Papers (33)
| | PDF (128 KB) | HTML

In this letter, we study the performance of two promising relay selection techniques, namely selection cooperation (SC) and opportunistic relaying (OPR), under a clustered fixed-gain relay setting. Such relay configuration finds applicability in practical ad-hoc and sensor networks, although it considers independent identically distributed channels among the links of each hop. Assuming Rayleigh fa... View full abstract»

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