Search results for "Algorithm"
showing 10 items of 4887 documents
Impulse noise removal on an embedded, low memory SIMD processor
2003
Vector median filters efficiently reduce noise while preserving image details. However, their high computational complexity for color images makes them impractical for real-time systems. We propose new computationally efficient filtering algorithms, called index mapping filters (IMF). These filtering algorithms are accelerated by implementing them on a massively data parallel processor array. In addition to greater computational efficiency, these algorithms result in robust noise reduction of corrupted color images. Analyses of mean square error, signal-to-noise-ratio, and visual comparison metrics indicate that IMF are competitive with the vector median filter (VMF) in their ability to cor…
Robust adaptive algorithm with low computational cost
2006
An adaptive algorithm, which is robust to impulsive noise, is proposed. The cost function underlying this algorithm contains a parameter that controls the immunity to impulsive noise and can be easily adapted. Moreover, weight updating involves a nonlinear function, which recently has been shown to have an efficient hardware implementation. The proposed adaptive algorithm has been successfully tested in terms of accuracy and convergence on a system-identification simulation.
On the modeling of nonlinear interactions in large complex systems
2010
Abstract This work deals with the modeling of large systems of interacting entities in the framework of the mathematical kinetic theory for active particles. The contents are specifically focused on the modeling of nonlinear interactions which is one of the most important issues in the mathematical approach to modeling and simulating complex systems, and which includes a learning–hiding dynamics. Applications are focused on the modeling of complex biological systems and on immune competition.
Quantification of melanin and hemoglobin in humain skin from multispectral image acquisition: use of a neuronal network combined to a non-negative ma…
2012
International audience; This article presents a multispectral imaging system which, coupled with a neural network-based algorithm, reconstructs reflectance cubes. The reflectance spectra are obtained using artificial neural-netwok reconstruction which generates reflectance cubes from acquired multispectral images. Then, a blind source separation algorithm based on Non-negative Matrix Factorization is used for the decomposition of human skin absorption spectra in its main pigments: melanin and hemoglobin. The analysis is performed on reflectance spectra. The implemented source separation algorithm is based on a multiplicative coefficient upload. The goal is to represent a given spectrum as t…
LCRT: A ToA Based Mobile Terminal Localization Algorithm in NLOS Environment
2009
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Article also available from publisher: http://dx.doi.org/10.1109/VETECS.2009.5073644 Non line-of-sight (NLOS) propagation in range measurement is a key problem for mobile terminal localization. This paper proposes a low computational residual test (LCRT) algorithm that can identify the number of line-of-sight (LOS) transmissions and reduce the computational com…
Discrete wavelet transform implementation in Fourier domain for multidimensional signal
2002
Wavelet transforms are often calculated by using the Mallat algorithm. In this algorithm, a signal is decomposed by a cascade of filtering and downsampling operations. Computing time can be important but the filtering operations can be speeded up by using fast Fourier transform (FFT)-based convolutions. Since it is necessary to work in the Fourier domain when large filters are used, we present some results of Fourier-based optimization of the sampling operations. Acceleration can be obtained by expressing the samplings in the Fourier domain. The general equations of the down- and upsampling of digital multidimensional signals are given. It is shown that for special cases such as the separab…
A Robust Wrap Reduction Algorithm for Fringe Projection Profilometry and Applications in Magnetic Resonance Imaging.
2017
In this paper, we present an effective algorithm to reduce the number of wraps in a 2D phase signal provided as input. The technique is based on an accurate estimate of the fundamental frequency of a 2D complex signal with the phase given by the input, and the removal of a dependent additive term from the phase map. Unlike existing methods based on the discrete Fourier transform (DFT), the frequency is computed by using noise-robust estimates that are not restricted to integer values. Then, to deal with the problem of a non-integer shift in the frequency domain, an equivalent operation is carried out on the original phase signal. This consists of the subtraction of a tilted plane whose slop…
Real-Time Vector Automata
2013
We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected k×k matrix. Only one entry of the vector can be tested for equality to 1 at any time. Classes of languages recognized by deterministic, nondeterministic, and "blind" versions of these machines are studied and compared with each other, and the associated classes for multicounter automata, automata with multiplication, and generalized finite automata.
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations
2009
We show that every finitely satisfiable two-variable first-order formula with two equivalence relations has a model of size at most triply exponential with respect to its length. Thus the finite satisfiability problem for two-variable logic over the class of structures with two equivalence relations is decidable in nondeterministic triply exponential time. We also show that replacing one of the equivalence relations in the considered class of structures by a relation which is only required to be transitive leads to undecidability. This sharpens the earlier result that two-variable logic is undecidable over the class of structures with two transitive relations.
Active Learning of Recursive Functions by Ultrametric Algorithms
2014
We study active learning of classes of recursive functions by asking value queries about the target function f, where f is from the target class. That is, the query is a natural number x, and the answer to the query is f(x). The complexity measure in this paper is the worst-case number of queries asked. We prove that for some classes of recursive functions ultrametric active learning algorithms can achieve the learning goal by asking significantly fewer queries than deterministic, probabilistic, and even nondeterministic active learning algorithms. This is the first ever example of a problem where ultrametric algorithms have advantages over nondeterministic algorithms.