Search results for "Methodologie"
showing 10 items of 2141 documents
Polynomial method to study the entanglement of pure N-qubit states
2009
We present a mapping which associates pure N-qubit states with a polynomial. The roots of the polynomial characterize the state completely. Using the properties of the polynomial we construct a way to determine the separability and the number of unentangled qubits of pure N-qubit states.
An exact and efficient approach for computing a cell in an arrangement of quadrics
2006
AbstractWe present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and provide the correct mathematical results in all, even degenerate, cases. By projection, the spatial problem is reduced to the one of computing planar arrangements of algebraic curves. We succeed in locating all event points in these arrangements, including tangential intersections and singular points. By introducing an additional curve, which we call the Jacobi curve, we are able to find non-singular tangential intersections. We show that the coordinates of the singular points in our special projected plana…
A Decomposition Theorem for the Fuzzy Henstock Integral
2012
We study the fuzzy Henstock and the fuzzy McShane integrals for fuzzy-number valued functions. The main purpose of this paper is to establish the following decomposition theorem: a fuzzy-number valued function is fuzzy Henstock integrable if and only if it can be represented as a sum of a fuzzy McShane integrable fuzzy-number valued function and of a fuzzy Henstock integrable fuzzy number valued function generated by a Henstock integrable function.
Linearization of holomorphic mappings on fully nuclear spaces with a basis
1994
In [13] Mazet proved the following result.If U is an open subset of a locally convex space E then there exists a complete locally convex space (U) and a holomorphic mapping δU: U→(U) such that for any complete locally convex space F and any f ɛ ℋ (U;F), the space of holomorphic mappings from U to F, there exists a unique linear mapping Tf: (U)→F such that the following diagram commutes;The space (U) is unique up to a linear topological isomorphism. Previously, similar but less general constructions, have been considered by Ryan [16] and Schottenloher [17].
Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes
2005
The static frequency assignment problem on cellular networks can be abstracted as a multicoloring problem on a weighted graph, where each vertex of the graph is a base station in the network, and the weight associated with each vertex represents the number of calls to be served at the vertex. The edges of the graph model interference constraints for frequencies assigned to neighboring stations. In this paper, we first propose an algorithm to multicolor any weighted planar graph with at most $\frac{11}{4}W$ colors, where W denotes the weighted clique number. Next, we present a polynomial time approximation algorithm which garantees at most 2W colors for multicoloring a power square mesh. Fur…
Data Compression Using Wavelet and Local Cosine Transforms
2015
The chapter describes an algorithm that compresses two-dimensional data arrays, which are piece-wise smooth in one direction and have oscillating events in the other direction. Seismic, hyper-spectral and fingerprints data, for example, have such a mixed structure. The transform part of the compression process is an algorithm that combines wavelet and local cosine transform (LCT). The quantization and the entropy coding parts of the compression are taken from the SPIHT codec. To efficiently apply the SPIHT codec to a mixed coefficients array, reordering of the LCT coefficients takes place. On the data arrays, which have the mixed structure, this algorithm outperforms other algorithms that a…
NIR and Visible Image Fusion for Improving Face Recognition at Long Distance
2014
Face recognition performance achieves high accuracy in close proximity. However, great challenges still exist in recognizing human face at long distance. In fact, the rapidly increasing need for long range surveillance requires a passage from close-up distances to long distances which affects strongly the human face image quality and causes degradation in recognition accuracy. To address this problem, we propose in this paper, a multispectral pixel level fusion approach to improve the performance of automatic face recognition at long distance. The main objective of the proposed approach is to formulate a method to enhance the face image quality as well as the face recognition rate. First, v…
Fractional wavelet transform
1997
The wavelet transform, which has had a growing importance in signal and image processing, has been generalized by association with both the wavelet transform and the fractional Fourier transform. Possible implementations of the new transformation are in image compression, image transmission, transient signal processing, etc. Computer simulations demonstrate the abilities of the novel transform. Optical implementation of this transform is briefly discussed.
Pattern recognition using sequential matched filtering of wavelet coefficients
1997
Abstract A bank of wavelets is used for pattern recognition by means of sequential filtering. Each element of the bank is matched to a different wavelet coefficient of the target. A sequential process leads to a set of correlation outputs. Post-processing by means of a fast blending method provides the final output correlation. Both computer simulations and optical experiments are presented, showing the discrimination capability for this implementation.
Multiscale Edges Detection by Wavelet Transform for Model of Face Recognition
1996
Publisher Summary The linear auto-associator is a particular case of the linear-associator. The goal of this network is to associate a set of stimuli to itself, which could be used to store and retrieve face images and it also could be applied as a pre-processing device to simulate some psychological tasks—such as categorizing face according to their gender. A technique of learning based on the wavelet transform can improve recognition capability when the pattern images are with a great noise. One of the ways to store and recall face images uses the linear auto-associative memory. This connectionist model is in conjunction with a pixel-based coding of the faces. The image processing using t…