Search results for "algorithm"

Fingerprint Registration Using Specialized Genetic Algorithms

2005

One of the most common problem to realize a robust matching algorithm in an Automated Fingerprint Identification System (AFIS) is the images registration. In this paper a fingerprints registration method based on a specialized genetic algorithm (GA) is proposed. A global transformation between two fingerprint images is performed using genetic data evolutions based on specialized mutation rate and solution refining. An AFIS including the above method has been developed and tested on two different fingerprint databases: NIST 4 ink-on-paper and self optical scanned. The obtained experimental results show that the proposed approach is comparable with literature systems working on medium quality…

Real-Time Human Pose Estimation from Body-Scanned Point Clouds

2015

International audience; This paper presents a novel approach to estimate the human pose from a body-scanned point cloud. To do so, a predefined skeleton model is first initialized according to both the skeleton base point and its torso limb obtained by Principal Component Analysis (PCA). Then, the body parts are iteratively clustered and the skeleton limb fitting is performed, based on Expectation Maximization (EM). The human pose is given by the location of each skeletal node in the fitted skeleton model. Experimental results show the ability of the method to estimate the human pose from multiple point cloud video sequences representing the external surface of a scanned human body; being r…

Phase Fourier vector model for scale invariant three-dimensional image detection.

2009

A scale invariant 3D object detection method based on phase Fourier transform (PhFT) is addressed. Three-dimensionality is expressed in terms of range images. The PhFT of a range image gives information about the orientations of the surfaces in the 3D object. When the object is scaled, the PhFT becomes a distribution multiplied by a constant factor which is related to the scale factor. Then 3D scale invariant detection can be solved as illumination invariant detection process. Several correlation operations based on vector space representation are applied. Results show the tolerance of detection method to scale besides discrimination against false objects.

Performance evaluation of sum-of-cisoids Rice/Rayleigh fading channel simulators with respect to the bit error probability

2014

Sum-of-cisoids (SOC) processes provide an important framework for the modeling and simulation of multipath fading channels. In this paper, we analyze the performance of SOC Rice/Rayleigh narrowband fading channel simulators with respect to the bit error probability (BEP) of quadrature phase shift keying (QPSK) and differential phase shift keying (DPSK) systems with both coherent and noncoherent demodulation. For the BEP of coherent QPSK and DPSK, exact analytical expressions are derived, which provide insight into the influence of the number of propagation paths and the path gains on the system performance. It will be shown that at least 10 multipath components are required to guarantee tha…

Super-orthogonal space-time trellis codes with differential phase modulation for noncoherent mobile communication systems

2010

In this paper, we show how to design super-orthogonal space-time trellis codes (SOSTTCs) using the differential binary phase-shift keying (PSK) modulation for noncoherent communication systems, for which the knowledge of the channel state information (CSI) at the receiver is not necessary. Moreover, a new decoding algorithm with reduced decoding complexity is proposed. In all simulations, a geometric two-ring channel model is employed to evaluate the performance of the SOSTTCs. The simulation results show that the proposed decoding algorithm has the same decoding performance compared with the traditional decoding strategy, while the new algorithm reduces significantly the overall computing …

A Windowing strategy for Distributed Data Mining optimized through GPUs

2017

Abstract This paper introduces an optimized Windowing based strategy for inducing decision trees in Distributed Data Mining scenarios. Windowing consists in selecting a sample of the available training examples (the window) to induce a decision tree with an usual algorithm, e.g., J48; finding instances not covered by this tree (counter examples) in the remaining training examples, adding them to the window to induce a new tree; and repeating until a termination criterion is met. In this way, the number of training examples required to induce the tree is reduced considerably, while maintaining the expected accuracy levels; which is paid in terms of time performance. Our proposed enhancements…

A comparative study of best spectral bands selection systems for face recognition

2014

Multispectral images (MI) have shown promising capabilities to solve problems resulting from high illumination variation in face recognition. However, the use of MI, with the huge number of captured spectral bands for each subject, is impractical unless a system for best spectral bands selection (BSBS) is used. In this work, first we give an up to date overview of the existing BSBS techniques proposed for face recognition. We aim to highlight the imporatnce of this component of MI based systems. The reviewed techniques are then experimented using the multispectral face database IRIS - M3 to compare their performances. To the best of our knowledge this is the first study that reviews and com…

Using interactive evolutionary algorithms to help fit cochlear implants

2010

Efficiency analysis of burst transmissions with block ACK in contention-based 802.11e WLANs

2005

The channel utilization efficiency of the standard 802.11 networks is severely compromised when high data transmission rates are employed, since physical layer headers and control frames are transmitted at low rate, thus wasting more channel time, proportionally. The extensions defined in the emerging 802.11e for quality-of-service (QoS) provisioning include some new mechanisms developed in order to improve the efficiency. Those include data transmission bursting (referred to as TXOP operation) and acknowledgment aggregation (referred to as block ACK). These two features allow it to offer new data transmission services, in which the data delivery and acknowledgment unit is not a single fram…

Optimal and Greedy Heuristic Approaches for Scheduling and Mapping of Hardware Tasks to Reconfigurable Computing Devices

2020

Executing real-time tasks on dynamically reconfigurable FPGAs requires us to solve the challenges of scheduling and placement. In the past, many approaches have been presented to address these challenges. Still, most of them rely on idealized assumptions about the reconfigurability of FPGAs and the capabilities of commercial tool flows. In our work, we aim at solving these problems leveraging a practically useful 2D slot-based FPGA area model. We present optimal approaches for reconfigurable slot creation, hardware task assignment, and placement creation. We quantitatively compare optimal and heuristics algorithms through simulation experiments and show that the heuristics are rather close …