The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We present a simple and computationally efficient algorithm, based on the accelerated Newton's method, to solve the root finding problem associated with the projection onto the ℓ1-ball problem. Considering an interpretation of the Michelot's algorithm as Newton method, our algorithm can be understood as an accelerated version of the Michelot's algorithm, that needs significantly less major iterations...
We propose a novel parallel essentially cyclic asynchronous algorithm for the minimization of the sum of a smooth (nonconvex) function and a convex (nonsmooth) regularizer. The framework hinges on Successive Convex Approximation (SCA) techniques and on a new global model that describes many asynchronous environments in a more faithful and exhaustive way with respect to state-of-the-art models. A key...
Generalized frequency division multiplexing (GFDM) is proposed as a candidate waveform to tackle new challenges posed on the physical layer for the fifth generation of wireless communication systems. In this paper, we propose a highly efficient algorithm for GFDM data detection on the basis of orthogonal approximate message passing (OAMP). We further combine with the conjugate gradient method and...
We present an EM algorithm for Maximum Likelihood estimation of the location, scale, and skew, and shape parameters of the z distribution, also known as the generalized logistic function (type IV). We use the Barndorff-Nielsen, Kent, and Sørensen representation of the z distribution as a Gaussian location-scale mixture to derive an EM algorithm for estimating the location, scale, skew, and shape parameters...
In this study, a complex-valued adaptive filter algorithm based on Lyapunov stability theory is presented to solve a system identification problem in the complex domain. The performance of the proposed complex-valued Lyapunov adaptive filter (CLAF) algorithm is improved for the complex-valued system identification problem by integrating the LST into the filter optimization cost. The performance of...
We present a reduced dimensionality, information rich (RDIR) visual representation for scene information that distills the most distinguishing elements in an image, enabling scene classification by humans and computers under reduced dimensionality conditions. The representation utilizes the Gist model [1] to convey scene information in low bandwidth conditions, exhibiting enhanced classification performance...
The paper proposes a new hybrid error concealment for the multi-view video (MVV). Firstly, the lost macroblocks (MBs) are classified into the static MBs and the motive MBs by the motion information. Then the static MBs are repaired by image inpainting, which is improved to apply to inter and inter-view frame. The motive MBs are fixed by outer boundary matching algorithm (OBMA), in which candidate...
We propose a probabilistic handshake mechanism for all-to-all broadcast coded slotted ALOHA. We consider a fully connected network where each user acts as both transmitter and receiver in a half-duplex mode. Users attempt to exchange messages with each other and to establish one-to-one handshakes, in the sense that each user decides whether its packet was successfully received by the other users:...
Particle methods are an established way to represent messages and perform message passing in factor graphs. Despite their common use, there are several cases for which messages are hard to compute, even in linear models. Building on results from Gaussian message passing, we demonstrate how backward particle-based messages can be computed and describe a practical application in the context of fiber-optical...
In this paper, we propose an algorithm to compute time-dependent Fourier transform (TDFT) with generalized triangular window. The algorithm recursively computes the TDFT at arbitrary frequency with integrated triangular windowing. A common way to compute TDFT with window is to firstly multiply the input data by the window function and then carry out the TDFT on the windowed data. In this paper, we...
This paper solves the time and power allocation problem for the simplest feedback scheme for the Gaussian wiretap channel, which is based on the transmission of random secret keys to be used in a one time pad manner. Specifically, the optimal transmission powers at Alice and Bob, as well as the time sharing factor between the feedback and feedforward channels, are given by the solution of a non-convex...
In this paper we propose a distributed and adaptive algorithm for collaborative processing of the complex signals. The proposed algorithm, which will be referred to as the incremental augmented affine projection algorithm (IncAAPA), not only utilizes the full second order statistical information in complex domain but also exploits the spatial diversity which is provided by the distribution of the...
In a cognitive radio ad hoc network, secondary users must cooperate in a decentralized way in order to determine the presence or absence of the primary user. In such a setting, malicious nodes deteriorate the cooperative spectrum sensing performance by reporting incorrect sensing information to the other nodes. We classify distributed cooperative spectrum sensing in cognitive radio ad hoc networks...
The present contribution deals with the statistical tool of Independent Component Analysis (ICA). The focus is on Fas-tICA, arguably the most popular algorithm in the domain of ICA. Despite its success, it is observed that FastICA occasionally yields outcomes that do not correspond to any solutions of ICA. These outcomes are called spurious solutions. In this work, we give a thorough and rigorous...
We consider the problem of selecting an optimal mask for an image manifold, i.e., choosing a subset of the dimensions of the image space that preserves the manifold structure present in the original data. Such masking implements a form of compressed sensing that reduces power consumption in emerging imaging sensor platforms. Our goal is for the manifold learned from masked images to resemble the manifold...
Recent derivations have shown that the full Bayes random finite set filter incorporates a linear combination of multi-Bernoulli distributions. The full filter is intractable as the number of terms in the linear combination grows exponentially with the number of targets; this is the problem of data association. A highly desirable approximation would be to find the multi-Bernoulli distribution that...
This contribution deals with the generalized symmetric FastICA algorithm in the domain of Independent Component Analysis (ICA). The generalized symmetric version of FastICA has the potential to achieve the optimal separation performance by allowing the usage of different nonlinearity functions in its parallel implementations of one-unit FastICA. In spite of this appealing property, a rigorous study...
Sequential Monte Carlo (SMC) methods are not only a popular tool in the analysis of state-space models, but offer a powerful alternative to Markov chain Monte Carlo (MCMC) in situations where static Bayesian inference must be performed via simulation. In this paper, we propose a recycling scheme of all past simulated particles in the SMC sampler in order to reduce the variance of the final estimator...
Subspace clustering is a useful tool for analyzing large complex data, but in many relevant applications missing data are common. Existing theoretical analysis of this problem shows that subspace clustering from incomplete data is possible, but that analysis requires the number of samples (i.e., partially observed vectors) to be super-polynomial in the dimension d. Such huge sample sizes are unnecessary...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.