Search results for "COMPUTATION"

showing 10 items of 7362 documents

Preprocessing of region of interest localization based on local surface curvature analysis for three-dimensional reconstruction with multiresolution

2009

We present an approach to integrate a preprocessing step of the region of interest ROI localization into 3-D scanners laser or ste- reoscopic. The definite objective is to make the 3-D scanner intelligent enough to localize rapidly in the scene, during the preprocessing phase, the regions with high surface curvature, so that precise scanning will be done only in these regions instead of in the whole scene. In this way, the scanning time can be largely reduced, and the results contain only per- tinent data. To test its feasibility and efficiency, we simulated the prepro- cessing process under an active stereoscopic system composed of two cameras and a video projector. The ROI localization is…

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image Processing[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingComputer scienceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION3d scanningStereoscopyImage processing0102 computer and information sciences02 engineering and technologyIterative reconstruction[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processingCurvature01 natural sciencesVideo projectorsurface curvaturelaw.invention[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingRegion of interestlaw0202 electrical engineering electronic engineering information engineeringPreprocessorComputer visionImage resolution[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processingComputingMethodologies_COMPUTERGRAPHICSbusiness.industryintelligent 3D scannerGeneral EngineeringAtomic and Molecular Physics and OpticsROI localisation010201 computation theory & mathematics020201 artificial intelligence & image processingArtificial intelligencebusiness[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingadaptive pattern
researchProduct

Computational approach to compact Riemann surfaces

2017

International audience; A purely numerical approach to compact Riemann surfaces starting from plane algebraic curves is presented. The critical points of the algebraic curve are computed via a two-dimensional Newton iteration. The starting values for this iteration are obtained from the resultants with respect to both coordinates of the algebraic curve and a suitable pairing of their zeros. A set of generators of the fundamental group for the complement of these critical points in the complex plane is constructed from circles around these points and connecting lines obtained from a minimal spanning tree. The monodromies are computed by solving the defining equation of the algebraic curve on…

[ MATH ] Mathematics [math]Fundamental groupEquations[PHYS.MPHY]Physics [physics]/Mathematical Physics [math-ph]Holomorphic functionGeneral Physics and AstronomyFOS: Physical sciences010103 numerical & computational mathematics01 natural sciencessymbols.namesakeMathematics - Algebraic Geometrynumerical methodsFOS: MathematicsSpectral Methods0101 mathematics[MATH]Mathematics [math]Algebraic Geometry (math.AG)Mathematical PhysicsMathematicsCurvesKadomtsev-Petviashvili equationCollocationNonlinear Sciences - Exactly Solvable and Integrable SystemsPlane (geometry)Applied MathematicsRiemann surface010102 general mathematicsMathematical analysisStatistical and Nonlinear PhysicsMathematical Physics (math-ph)Methods of contour integrationHyperelliptic Theta-FunctionsRiemann surfacessymbolsDispersion Limit[ PHYS.MPHY ] Physics [physics]/Mathematical Physics [math-ph]Algebraic curveExactly Solvable and Integrable Systems (nlin.SI)Complex plane
researchProduct

The pure descent statistic on permutations

2017

International audience; We introduce a new statistic based on permutation descents which has a distribution given by the Stirling numbers of the first kind, i.e., with the same distribution as for the number of cycles in permutations. We study this statistic on the sets of permutations avoiding one pattern of length three by giving bivariate generating functions. As a consequence, new classes of permutations enumerated by the Motzkin numbers are obtained. Finally, we deduce results about the popularity of the pure descents in all these restricted sets. (C) 2017 Elsevier B.V. All rights reserved.

[ MATH ] Mathematics [math]Golomb–Dickman constantDistribution (number theory)PermutationStirling numbers of the first kindStirling number0102 computer and information sciences01 natural sciencesTheoretical Computer ScienceCombinatoricsPermutationComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONDiscrete Mathematics and CombinatoricsStirling number[MATH]Mathematics [math]0101 mathematicsPatternsStatisticMathematicsDiscrete mathematicsMathematics::Combinatorics010102 general mathematicsDescentParity of a permutationGray Code010201 computation theory & mathematicsRandom permutation statisticsDyck pathPopularity Fixed NumberDiscrete Mathematics
researchProduct

The dual and the double of a Hopf algebroid are Hopf algebroids

2017

Let $H$ be a $\times$-bialgebra in the sense of Takeuchi. We show that if $H$ is $\times$-Hopf, and if $H$ fulfills the finiteness condition necessary to define its skew dual $H^\vee$, then the coopposite of the latter is $\times$-Hopf as well. If in addition the coopposite $\times$-bialgebra of $H$ is $\times$-Hopf, then the coopposite of the Drinfeld double of $H$ is $\times$-Hopf, as is the Drinfeld double itself, under an additional finiteness condition.

[ MATH ] Mathematics [math]Pure mathematicsGeneral Computer ScienceDuality (optimization)01 natural sciencesTheoretical Computer ScienceMathematics::Category TheoryMathematics::Quantum AlgebraMathematics - Quantum Algebra0103 physical sciencesFOS: Mathematics[MATH.MATH-RA] Mathematics [math]/Rings and Algebras [math.RA]Quantum Algebra (math.QA)[ MATH.MATH-CT ] Mathematics [math]/Category Theory [math.CT]0101 mathematics[MATH]Mathematics [math]Hopf algebroid[MATH.MATH-CT]Mathematics [math]/Category Theory [math.CT]Mathematics[MATH.MATH-QA] Mathematics [math]/Quantum Algebra [math.QA]Algebra and Number TheoryMSC: 16T99 18D10[ MATH.MATH-QA ] Mathematics [math]/Quantum Algebra [math.QA]010308 nuclear & particles physicsbialgebroid[MATH.MATH-RA]Mathematics [math]/Rings and Algebras [math.RA]010102 general mathematicsMathematics::Rings and AlgebrasSkewMathematics - Rings and Algebras[MATH.MATH-CT] Mathematics [math]/Category Theory [math.CT][ MATH.MATH-RA ] Mathematics [math]/Rings and Algebras [math.RA]Dual (category theory)Rings and Algebras (math.RA)Theory of computation[MATH.MATH-QA]Mathematics [math]/Quantum Algebra [math.QA]duality
researchProduct

Spectral approach to D-bar problems

2017

We present the first numerical approach to D-bar problems having spectral convergence for real analytic, rapidly decreasing potentials. The proposed method starts from a formulation of the problem in terms of an integral equation that is numerically solved with Fourier techniques. The singular integrand is regularized analytically. The resulting integral equation is approximated via a discrete system that is solved with Krylov methods. As an example, the D-bar problem for the Davey-Stewartson II equations is considered. The result is used to test direct numerical solutions of the PDE.© 2017 Wiley Periodicals, Inc.

[ MATH ] Mathematics [math]Spectral approachInverse conductivity problemBar (music)General MathematicsElectrical-impedance tomographyFOS: Physical sciences2 dimensions010103 numerical & computational mathematics01 natural sciencesDiscrete systemsymbols.namesakeConvergence (routing)FOS: MathematicsApplied mathematicsUniquenessStewartson-ii equationsMathematics - Numerical Analysis0101 mathematics[MATH]Mathematics [math]Electrical impedance tomographyReconstruction algorithmsNumerical-solutionMathematicsNonlinear Sciences - Exactly Solvable and Integrable SystemsApplied MathematicsNumerical Analysis (math.NA)Integral equation010101 applied mathematicsFourier transformsymbolsUniquenessExactly Solvable and Integrable Systems (nlin.SI)
researchProduct

Convergence Rates for Persistence Diagram Estimation in Topological Data Analysis

2014

International audience; Computational topology has recently seen an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field. In this paper, we study topological persistence in general metric spaces, with a statistical approach. We show that the use of persistent homology can be naturally considered in general statistical frameworks and that persistence diagrams can be used as statistics with interesting convergence properties. Some numerical experiments are performed in various contexts to illustrate our results.

[ MATH ] Mathematics [math][STAT.TH] Statistics [stat]/Statistics Theory [stat.TH][ MATH.MATH-AT ] Mathematics [math]/Algebraic Topology [math.AT][STAT.TH]Statistics [stat]/Statistics Theory [stat.TH][MATH.MATH-AT] Mathematics [math]/Algebraic Topology [math.AT][INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG][ STAT.TH ] Statistics [stat]/Statistics Theory [stat.TH]persistent homologytopological data analysis[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG][MATH.MATH-AT]Mathematics [math]/Algebraic Topology [math.AT]convergence rates[ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG][MATH]Mathematics [math]ComputingMilieux_MISCELLANEOUS
researchProduct

The non-degenerate Dupin cyclides in the space of spheres using Geometric Algebra

2012

International audience; Dupin cyclides are algebraic surfaces of degree 4 discovered by the French mathematician Pierre-Charles Dupin early in the 19th century and \textcolor{black}{were} introduced in CAD by R. Martin in 1982. A Dupin cyclide can be defined, in two different ways, as the envelope of a one-parameter family of oriented spheres. So, it is very interesting to model the Dupin cyclides in the space of spheres, space wherein each family of spheres can be seen as a conic curve. In this paper, we model the non-degenerate Dupin cyclides and the space of spheres using Conformal Geometric Algebra. This new approach permits us to benefit from the advantages of the use of Geometric Alge…

[ MATH.MATH-GM ] Mathematics [math]/General Mathematics [math.GM]Dupin cyclideDupin cyclide[INFO.INFO-GR] Computer Science [cs]/Graphics [cs.GR]010103 numerical & computational mathematics02 engineering and technologySpace (mathematics)[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]01 natural sciencesGeometric algebra[MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM]space of spheresAlgebraic surface0202 electrical engineering electronic engineering information engineering0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsconformal geometric algebraApplied MathematicsDegenerate energy levelsConformal geometric algebra020207 software engineering[ INFO.INFO-GR ] Computer Science [cs]/Graphics [cs.GR][INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]AlgebraConic section[ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG]SPHERES
researchProduct

A simple algorithm for finding short sigma-definite representatives

2010

We describe a new algorithm which for each braid returns a quasi-geodesic sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears either only positively or only negatively.

[ MATH.MATH-GR ] Mathematics [math]/Group Theory [math.GR]Braid groupbraid monoids20F3620M0506F05Group Theory (math.GR)02 engineering and technology01 natural sciences[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]Mathematics::Group TheoryMathematics::Category TheoryMathematics::Quantum AlgebraFOS: MathematicsBraidBraid group0101 mathematicsSIMPLE algorithmMathematicsDiscrete mathematicsGenerator (computer programming)algorithmAlgebra and Number Theory010102 general mathematicsSigmaComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)021001 nanoscience & nanotechnologyMathematics::Geometric Topologybraid orderingIndex (publishing)0210 nano-technologyMathematics - Group TheoryWord (computer architecture)Journal of Algebra
researchProduct

IRREDUCIBLE COXETER GROUPS

2004

We prove that a non-spherical irreducible Coxeter group is (directly) indecomposable and that an indefinite irreducible Coxeter group is strongly indecomposable in the sense that all its finite index subgroups are (directly) indecomposable. Let W be a Coxeter group. Write W = WX1 × ⋯ × WXb × WZ3, where WX1, … , WXb are non-spherical irreducible Coxeter groups and WZ3 is a finite one. By a classical result, known as the Krull–Remak–Schmidt theorem, the group WZ3 has a decomposition WZ3 = H1 × ⋯ × Hq as a direct product of indecomposable groups, which is unique up to a central automorphism and a permutation of the factors. Now, W = WX1 × ⋯ × WXb × H1 × ⋯ × Hq is a decomposition of W as a dir…

[ MATH.MATH-GR ] Mathematics [math]/Group Theory [math.GR]General MathematicsGroup Theory (math.GR)0102 computer and information sciencesPoint group01 natural sciences[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]CombinatoricsMathematics::Group TheoryFOS: Mathematics0101 mathematicsLongest element of a Coxeter groupMathematics::Representation Theory[MATH.MATH-GR] Mathematics [math]/Group Theory [math.GR]MathematicsMathematics::CombinatoricsCoxeter notationMathematics::Rings and Algebras010102 general mathematicsCoxeter group010201 computation theory & mathematicsCoxeter complexArtin group20F55Indecomposable moduleMathematics - Group TheoryCoxeter elementInternational Journal of Algebra and Computation
researchProduct

Free vs. Locally Free Kleinian Groups

2015

Abstract We prove that Kleinian groups whose limit sets are Cantor sets of Hausdorff dimension < < 1 are free. On the other hand we construct for any ε > > 0 an example of a non-free purely hyperbolic Kleinian group whose limit set is a Cantor set of Hausdorff dimension < < 1 + + ε.

[ MATH.MATH-GT ] Mathematics [math]/Geometric Topology [math.GT]0209 industrial biotechnologyPure mathematicsMathematics::Dynamical SystemsGeneral MathematicsMathematics::General TopologyGroup Theory (math.GR)02 engineering and technology01 natural sciencesMathematics - Geometric Topology020901 industrial engineering & automationDimension (vector space)[MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT]FOS: MathematicsLimit (mathematics)topologia0101 mathematicsMathematicsApplied Mathematics010102 general mathematicsryhmäteoriaGeometric Topology (math.GT)16. Peace & justiceMathematics::Geometric TopologyKleinian groupsCantor setTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESHausdorff dimensionComputingMethodologies_DOCUMENTANDTEXTPROCESSINGLimit setMathematics - Group Theory
researchProduct