Sorry, you need to enable JavaScript to visit this website.

erformance of object classification using 3D automotive radar relies on accurate data association and multitarget tracking, which are greatly affected by data bias and proximity of objects to each other. A regularized fuzzy c-means (RFCM) algorithm is proposed herein to resolve the data association uncertainty problem that has shown to outperform the conventional FCM algorithm. The proposed method exploits results from the companion tracker to increase performance robustness. Simulation results using simulated and field data have proven the efficacy of the proposed method.

Accelerating the solution of the Lasso problem becomes crucial when scaling to very high dimensional data.

In this paper, we propose a way to combine two existing acceleration techniques: safe screening tests, which simplify the problem by eliminating useless dictionary atoms; and the use of structured dictionaries which are faster to operate with. A structured approximation of the true dictionary is used at the initial stage of the optimization, and we show how to define screening tests which are still safe despite the approximation error.

This paper proposes a new vacating room after encryption reversible data hiding scheme. Hidden data is embedded into the encrypted host image by bit-flipping a preselected bitplane of a randomly formed pixel group. The major novelty of the paper is the use of multiple predictors in an adaptive procedure for detecting between original and modified pixels. Four predictors are used on a context of four neighbors, namely the average of the four pixels, a weighted average based on local gradients, the median and the midpoint. Experimental results are provided.

Interior point methods have been known for decades to be useful for the resolution of small to medium size constrained optimization problems. These approaches have the benefit of ensuring feasibility of the iterates through a logarithmic barrier. We propose to incorporate a proximal forward-backward step in the resolution of the barrier subproblem to account for non-necessarily differentiable terms arising in the objective function.

We consider the problem of joint source and channel coding of structured data such as natural language over a noisy channel. The typical approach inspired by information theory to this problem involves performing source coding to first compress the text and then channel coding to add robustness while transmitting across the channel; this approach is optimal with arbitrarily large block lengths for discrete memoryless channels.

Texture segmentation still constitutes an on-going challenge, especially when processing large-size images.
Recently, procedures integrating a scale-free (or fractal)wavelet-leader model allowed the problem to be reformulated in a convex optimization framework by including a TV penalization. In this case, the TV penalty plays

In this paper, we present a kernelized dictionary learning framework for carrying out regression to model signals having a complex non-linear nature. A joint optimization is carried out where the regression weights are learnt together with the dictionary and coefficients. Relevant formulation and dictionary building steps are provided. To demonstrate the effectiveness of the proposed technique, elaborate experimental results using different real-life datasets are presented.