Search results for "CoDi"
showing 10 items of 1391 documents
V1 non-linear properties emerge from local-to-global non-linear ICA
2006
It has been argued that the aim of non-linearities in different visual and auditory mechanisms may be to remove the relations between the coefficients of the signal after global linear ICA-like stages. Specifically, in Schwartz and Simoncelli (2001), it was shown that masking effects are reproduced by fitting the parameters of a particular non-linearity in order to remove the dependencies between the energy of wavelet coefficients. In this work, we present a different result that supports the same efficient encoding hypothesis. However, this result is more general because, instead of assuming any specific functional form for the non-linearity, we show that by using an unconstrained approach…
A new minimum spanning tree-based method for shape description and matching working in Discrete Cosine space
2009
In this article, a new minimum spanning tree-based method for shape description and matching is proposed. Its properties are checked through the problem of graphical symbols recognition. Recognition invariance in front shift and multi-oriented noisy objects was studied in the context of small and low resolution binary images. The approach seems to have many desirable properties, even if the construction of graphs induces an expensive algorithmic cost. In order to reduce time computing, an alternative solution based on image compression concepts is provided. The recognition is realized in a compact space, namely the Discrete Cosine space. The use of block discrete cosine transform is discuss…
Usage of moving nanoparticles for improved holographic recording
2013
Metal nanoparticles are used for different applications in holographic configurations. The metal nanoparticles are placed close to an object and encode it by a time varying random mask. A decoding mask is computed and used to obtain super-resolution digital hologram and eliminate the twin image and DC from a digital hologram. The method is also shown to be applicable for other optical methods.
Resource allocation for OFDMA systems with multi-cell joint transmission
2012
This paper considers the downlink resource allocation of a coordinated multi-cell cluster in OFDMA systems with universal frequency reuse. Multi-cell joint transmission is considered via zero-forcing precoding. Furthermore, joint optimization of the user selection and power allocation across multiple subchannels and multiple cells is studied. The objective is to maximize the weighted sum rate under per-base-station power constraints. Based on general duality theory, two iterative resource allocation algorithms are proposed and compared with the optimal solution, which requires an exhaustive search of all possible combinations of users over all subchannels. Simulation results show that the t…
Combined K-Best sphere decoder based on the channel matrix condition number
2008
It is known that sphere decoding (SD) methods can provide maximum-likelihood (ML) detection over Gaussian MIMO channels with lower complexity than the exhaustive search. Channel matrix condition number represents an important influence on the performance of usual detectors. Throughout this paper, two particular cases of a SD method called K-Best carry out a combined detection in order to reduce the computational complexity with predictable performance degradation. Algorithm selection is based on channel matrix condition number thresholding. K-Best is a suboptimal SD algorithm for finding the ML solution of a detection problem. It is based on a fixed complexity tree search, set by a paramete…
Partial joint processing with efficient backhauling using particle swarm optimization
2012
In cellular communication systems with frequency reuse factor of one, user terminals (UT) at the cell-edge are prone to intercell interference. Joint processing is one of the coordinated multipoint transmission techniques proposed to mitigate this interference. In the case of centralized joint processing, the channel state information fed back by the users need to be available at the central coordination node for precoding. The precoding weights (with the user data) need to be available at the corresponding base stations to serve the UTs. These increase the backhaul traffic. In this article, partial joint processing (PJP) is considered as a general framework that allows reducing the amount …
A hybrid genetic algorithm with local search: I. Discrete variables: optimisation of complementary mobile phases
2001
Abstract A hybrid genetic algorithm was developed for a combinatorial optimisation problem. The assayed hybridation modifies the reproduction pattern of the genetic algorithm through the application of a local search method, which enhances each individual in each generation. The method is applied to the optimisation of the mobile phase composition in liquid chromatography, using two or more mobile phases of complementary behaviour. Each of these phases concerns the optimal separation of certain compounds in the analysed mixture, while the others can remain overlapped. This optimisation approach may be useful in situations where full resolution with a single mobile phase is unfeasible. The o…
Energy-efficient resource allocation for OFDMA two-way relay networks with imperfect CSI
2015
Most of the existed works on the radio resource allocation (RRA) problem commonly assume the channel-state information (CSI) can be perfectly obtained by the transmission source. However, such assumption is not practical in the realistic wireless systems. In this work, we consider the practical implementation issues of resource allocation in orthogonal frequency division multiple access (OFDMA) two-way relay networks: the inaccuracy of channel-state information (CSI) available to the source. Instead, only the estimated channel status is known by the source. In this context, a joint optimization of subcarrier pairing and allocation, relay selection, and transmit power allocation is formulate…
Codimensions of algebras and growth functions
2008
Abstract Let A be an algebra over a field F of characteristic zero and let c n ( A ) , n = 1 , 2 , … , be its sequence of codimensions. We prove that if c n ( A ) is exponentially bounded, its exponential growth can be any real number >1. This is achieved by constructing, for any real number α > 1 , an F-algebra A α such that lim n → ∞ c n ( A α ) n exists and equals α. The methods are based on the representation theory of the symmetric group and on properties of infinite Sturmian and periodic words.
Multi-layer canard cycles and translated power functions
2008
Abstract The paper deals with two-dimensional slow-fast systems and more specifically with multi-layer canard cycles. These are canard cycles passing through n layers of fast orbits, with n ⩾ 2 . The canard cycles are subject to n generic breaking mechanisms and we study the limit cycles that can be perturbed from the generic canard cycles of codimension n . We prove that this study can be reduced to the investigation of the fixed points of iterated translated power functions.