Search results for "algorithm."

showing 10 items of 4617 documents

Extensions of the witness method to characterize under-, over- and well-constrained geometric constraint systems

2011

International audience; This paper describes new ways to tackle several important problems encountered in geometric constraint solving, in the context of CAD, and which are linked to the handling of under- and over-constrained systems. It presents a powerful decomposition algorithm of such systems. Our methods are based on the witness principle whose theoretical background is recalled in a first step. A method to generate a witness is then explained. We show that having a witness can be used to incrementally detect over-constrainedness and thus to compute a well-constrained boundary system. An algorithm is introduced to check if anchoring a given subset of the coordinates brings the number …

[ INFO.INFO-MO ] Computer Science [cs]/Modeling and SimulationBoundary (topology)Witness configuration020207 software engineeringContext (language use)CAD02 engineering and technologyW-decompositionComputer Graphics and Computer-Aided DesignWitness[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationIndustrial and Manufacturing EngineeringComputer Science ApplicationsConstraint (information theory)symbols.namesakeTransformation groupJacobian matrix and determinant0202 electrical engineering electronic engineering information engineeringsymbolsGeometric constraints solving020201 artificial intelligence & image processingFinite setAlgorithmAlgorithmsMathematics
researchProduct

Bords d'une surface médiane : Identifications et applications

2014

National audience; Un squelette d'une forme fermée est une structure mince, centrée dans cette forme, décrivant sa topologie et sa géométrie. Les squelettes permettent de développer des applications interactives en synthèse d'images~: l'utilisateur peut manipuler intuitivement des formes en modifiant leurs squelettes. Parmi toutes les formulations de squelettes, nous nous intéressons en particulier à la surface médiane. Ses éléments, nommés atomes, sont les sphères maximales intérieures à la forme décrite. Les positions des atomes sont organisées en courbes et surfaces, qui composent la structure squelettale. Cette structure peut être d'une grande aide pour manipuler une forme. Cependant, e…

[ INFO.INFO-MO ] Computer Science [cs]/Modeling and Simulation[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG][INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG][INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
researchProduct

WSN localization scheme based on Received Signal Strength Indicator (RSSI) for ZigBee Networks

2015

International audience; Wireless Sensor Networks (WSNs) have diverse application domains such as smart home, smart care, industrial, etc. We present a WSN system based on the ZigBee technology (IEEE 802.15.4) in Smart Home. In our paper we interest to ZigBee protocol is often used in medical Rehabilitation, which is a relatively new concept involving wireless transmission of data from the sensors attached to a patient to a distant monitoring station. There is no standardized topology managing the current networks, therefore, we will compare and evaluate the performance the mobility of nodes for star topologies in different scenarios to determine which is the most suitable in a typical hospi…

[ INFO.INFO-MO ] Computer Science [cs]/Modeling and Simulation[SPI] Engineering Sciences [physics][INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation[SPI.TRON] Engineering Sciences [physics]/Electronics[SPI.TRON]Engineering Sciences [physics]/Electronics[ SPI.TRON ] Engineering Sciences [physics]/Electronics[SPI]Engineering Sciences [physics][ INFO.INFO-IT ] Computer Science [cs]/Information Theory [cs.IT][INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT][ SPI ] Engineering Sciences [physics]ComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMS[INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT][INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
researchProduct

OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS

2010

The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n = 6 or 7 variables. This article describes a polytope (Bernstein polytope) with a number of faces, which allows to bound a sparse, multivariate polynomial expressed in the canonical basis by solving several linear programming problems. We compare the performance of a subdivision solver using domain reductions by linear programming with a solver using a c…

[ INFO.INFO-NA ] Computer Science [cs]/Numerical Analysis [cs.NA]Linear programmingPolytopeBernstein polynomials01 natural sciencesSimplex algorithmApplied mathematicssimplex algorithm0101 mathematicsMathematicsDiscrete mathematicsBasis (linear algebra)Applied Mathematics010102 general mathematicssubdivision solverlinear programmingalgebraic systemsQuadratic function[INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA]Solver1991 Mathematics Subject Classification: 14Q15 14Q20 65G40Bernstein polynomialComputer Science Applications010101 applied mathematicsModeling and SimulationStandard basisGeometry and TopologyComputer Vision and Pattern RecognitionSoftwareInternational Journal of Shape Modeling
researchProduct

An Impulse Response Model for the 60 Ghz Channel Based on Spectral Techniques of alpha-stable Processes

2007

International audience; In order to make realistic simulations of the radio propagation mechanism in ultra-wide band channels, an appropriate model is needed. In this paper we propose a new technique to model the impulse response of the 60 Ghz channel. This new approach is based on the spectral analysis of alpha-stable processes. Our new model presents many advantages: firstly, the channel is characterized only by a one deterministic function (spectral density) in the place of four parameters. Secondly, the estimations procedure deals directly with the measured transfer functions which avoids loosing information in data pretreatment. Finally, an estimation of the spectral measure permits to…

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingComputer science02 engineering and technology[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processingTransfer function[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing0203 mechanical engineering[MATH.MATH-ST]Mathematics [math]/Statistics [math.ST]0202 electrical engineering electronic engineering information engineeringSpectral analysisTransient response[ MATH.MATH-ST ] Mathematics [math]/Statistics [math.ST]Impulse response[STAT.AP]Statistics [stat]/Applications [stat.AP]business.industry[ STAT.AP ] Statistics [stat]/Applications [stat.AP]Spectral density020302 automobile design & engineering020206 networking & telecommunications[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH][ STAT.TH ] Statistics [stat]/Statistics Theory [stat.TH]Radio propagationTelecommunicationsbusiness[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingAlgorithmCommunication channel
researchProduct

Quadratic Objective Functions for Dichromatic Model Parameters Estimation

2017

International audience; In this paper, we present a novel method to estimate dichromatic model parameters from a single color image. Estimation of reflectance, shading and specularity has many applications such as shape recovery, specularity removal and facilitates classical image processing and computer vision tasks such as segmentation or classification. Our method is based on two successive and independent constrained quadratic programming steps to recover the parameters of the model. Compared to recent methods, our approach has the advantage to transform a complex inverse problem into two parralelizable optimization steps that are much easier to solve. We have compared our method with r…

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingLinear programmingColor imagebusiness.industry[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]020206 networking & telecommunicationsImage processing02 engineering and technologyInverse problem[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Quadratic equation[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Specularity[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingRobustness (computer science)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingComputer visionQuadratic programmingArtificial intelligencebusinessAlgorithmMathematics
researchProduct

Cluster matching in time resolved imaging for VLSI analysis

2014

International audience; If scaling has the benefit of enabling manufacturers to design tomorrow's integrated circuits, from the failure analyst point of view it also has the drawback of making devices more complex. The test sequence for modern VLSI can be quite long, with thousands of vector. Dynamic photon emission databases can contain millions of photons representing thousands of state changes in the region of interest. Finding a candidate location where to perform physical analysis is quite challenging, especially if the fault occurs on a single vector. In this paper, we suggest a new methodology to find single vector fault in dynamic photon emission database. The process is applied at …

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingMatching (graph theory)[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingComputer science[SPI.NANO] Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processing02 engineering and technologyIntegrated circuitFault (power engineering)computer.software_genre01 natural sciencesk-nearest neighbors algorithmlaw.invention[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processinglaw0103 physical sciences0202 electrical engineering electronic engineering information engineeringPoint (geometry)[SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/MicroelectronicsCluster analysisComputer Science::Databases[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing010302 applied physicsVery-large-scale integrationProcess (computing)Computer engineering[ SPI.NANO ] Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics020201 artificial intelligence & image processingData mining[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingcomputerProceedings of the 21th International Symposium on the Physical and Failure Analysis of Integrated Circuits (IPFA)
researchProduct

Kolmogorov Superposition Theorem and Its Application to Multivariate Function Decompositions and Image Representation

2008

International audience; In this paper, we present the problem of multivariate function decompositions into sums and compositions of monovariate functions. We recall that such a decomposition exists in the Kolmogorov's superposition theorem, and we present two of the most recent constructive algorithms of these monovariate functions. We first present the algorithm proposed by Sprecher, then the algorithm proposed by Igelnik, and we present several results of decomposition for gray level images. Our goal is to adapt and apply the superposition theorem to image processing, i.e. to decompose an image into simpler functions using Kolmogorov superpositions. We synthetise our observations, before …

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image Processing[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingImage processing[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processing02 engineering and technologySuperposition theorem01 natural sciences[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing[ INFO.INFO-TI ] Computer Science [cs]/Image ProcessingComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION0202 electrical engineering electronic engineering information engineeringApplied mathematics0101 mathematics[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processingMathematicsDiscrete mathematicsSignal processingArtificial neural network010102 general mathematicsApproximation algorithmSpline (mathematics)[INFO.INFO-TI] Computer Science [cs]/Image Processing [eess.IV]Kolmogorov structure function[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]020201 artificial intelligence & image processingHypercube[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing2008 IEEE International Conference on Signal Image Technology and Internet Based Systems
researchProduct

Noise estimation from digital step-model signal

2013

International audience; This paper addresses the noise estimation in the digital domain and proposes a noise estimator based on the step signal model. It is efficient for any distribution of noise because it does not rely only on the smallest amplitudes in the signal or image. The proposed approach uses polarized/directional derivatives and a nonlinear combination of these derivatives to estimate the noise distribution (e.g., Gaussian, Poisson, speckle, etc.). The moments of this measured distribution can be computed and are also calculated theoretically on the basis of noise distribution models. The 1D performances are detailed, and as our work is mostly dedicated to image processing, a 2D…

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image Processing[INFO.INFO-TS] Computer Science [cs]/Signal and Image Processingstep model02 engineering and technology[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processingCCD sensornoise distributionsymbols.namesake[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processingdigital signalsalt and pepper noiseStatistics0202 electrical engineering electronic engineering information engineeringMedian filterImage noisePoisson noiseValue noiseNoise estimationMathematics[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processingedge modelmultiplicative noiseNoise measurementNoise (signal processing)020206 networking & telecommunicationsComputer Graphics and Computer-Aided DesignNoise floorGaussian white noiseGradient noiseimpulse noiseGaussian noisenonlinear modelsymbols020201 artificial intelligence & image processingnoise estimatorAlgorithm[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingSoftware
researchProduct

Convergence and applications of vector rational approximations

1992

The Padé approximants and their generalizations are for many years the matter of intense researchs .Yet , many theoritical problems stay in suspense : problems of exitence and unicity , problems of convergence and acceleration of convergence .The purpose of the present work vas to give answers to such questions .In the first section we take an in terest in vector Padé approximants of matrix series .Conditions of existence and unicity ,results of convergence are given ,as also the link with the theory of Lanczos method for the resolution of linear Systems . We utilize also the vector Padé approximants to provide a simultaneous approximation of a function and its derivative .In the second sec…

[ MATH ] Mathematics [math]Biorthogonal polynomialsAcceleration of convergenceEpsilon algorithme vectorielApproximants de Padé vectorielsBiorthogonalitéPadé type approximantsEpsilon algorithme topologique[MATH] Mathematics [math]Topological epsilon algorithmAccélération de la convergencePolynômes biorthogonauxVector Padé approximants[MATH]Mathematics [math]Vector epsilon algorithmApproximants de type Padé
researchProduct