Search results for "algorithm"

showing 10 items of 4887 documents

On the arithmetic of a family of degree-two K3 surfaces

2018

Let $\mathbb{P}$ denote the weighted projective space with weights $(1,1,1,3)$ over the rationals, with coordinates $x,y,z,$ and $w$; let $\mathcal{X}$ be the generic element of the family of surfaces in $\mathbb{P}$ given by \begin{equation*} X\colon w^2=x^6+y^6+z^6+tx^2y^2z^2. \end{equation*} The surface $\mathcal{X}$ is a K3 surface over the function field $\mathbb{Q}(t)$. In this paper, we explicitly compute the geometric Picard lattice of $\mathcal{X}$, together with its Galois module structure, as well as derive more results on the arithmetic of $\mathcal{X}$ and other elements of the family $X$.

Surface (mathematics)Rational numberPure mathematicsDegree (graph theory)Mathematics - Number TheoryGeneral Mathematics010102 general mathematics11G35 14J2801 natural sciencesMathematics - Algebraic GeometryTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY0103 physical sciencesFOS: Mathematics010307 mathematical physicsNumber Theory (math.NT)0101 mathematicsArithmeticElement (category theory)Weighted projective spaceAlgebraic Geometry (math.AG)Mathematics
researchProduct

Facial scanning accuracy depending on the alignment algorithm and digitized surface area location: An in vitro study.

2021

To measure the accuracy (trueness and precision) of a facial scanner depending on the alignment method and the digitized surface area location.Fourteen markers were adhered on a head mannequin and digitized using an industrial scanner (GOM Atos Q 3D 12 M; Carl Zeiss Industrielle Messtechnik GmbH). A control mesh was acquired. Subsequently, the mannequin was digitized using a facial scanner (Arc4; Bellus3D) (n = 30). The control mesh was delineated into 10 areas. Based on the alignment procedures, two groups were created: reference best fit (RBF group) and landmark-based best fit (LA group). The root mean square was used to calculate the discrepancy between the control mesh and each facial s…

Surface (mathematics)ScannerDental Impression Technique030206 dentistryModels DentalRoot mean square03 medical and health sciences0302 clinical medicineImaging Three-DimensionalFace (geometry)In vitro studyComputer-Aided Design030212 general & internal medicineGeneral DentistryAlgorithmAlgorithmsMathematicsJournal of dentistry
researchProduct

Approximation of Continuous Media Models for Granular Systems Using Cellular Automata

2004

In this paper a new cellular automata model suitable for granular systems simulation is presented. The proposed model is shown to be equivalent to a particularization of the well known BCRE model of granular systems and a correspondence between the parameters of the presented model and the BCRE model is also set, allowing to fit these parameters for a given system. The model has the advantage over other cellular automata models of being more realistic in the behavior of the surface of heaps and slopes. The dynamics of the CA is analyzed in order to confirm that it also has one of the most important features of these systems, 1/f noise.

Surface (mathematics)Set (abstract data type)NoiseSystems simulationComputer scienceContinuous modellingBiological systemAlgorithmCellular automaton
researchProduct

An Automatic Three-Dimensional Fuzzy Edge Detector

2009

Three-dimensional object analysis is of particular interest in many research fields. In this context, the most common data representation is boundary mesh, namely, 2D surface embedded in 3D space. We will investigate the problem of 3D edge extraction, that is, salient surface regions characterized by high flexure. Our automatic edge detection method assigns a value, proportional to the local bending of the surface, to the elements of the mesh. Moreover, a proper scanning window, centered on each element, is used to discriminate between smooth zones of the surface and its edges. The algorithm does not require input parameters and returns a set of elements that represent the salient features …

Surface (mathematics)Settore INF/01 - InformaticaMatching (graph theory)Winged edgeComputer sciencebusiness.industryBoundary (topology)Context (language use)Surface segmentationEdge detectionAutomatic three-dimensional edge detectionSalientCanny edge detectorComputer visionArtificial intelligencebusinessAlgorithmComputingMethodologies_COMPUTERGRAPHICS
researchProduct

Deep Gaussian Processes for Geophysical Parameter Retrieval

2018

This paper introduces deep Gaussian processes (DGPs) for geophysical parameter retrieval. Unlike the standard full GP model, the DGP accounts for complicated (modular, hierarchical) processes, provides an efficient solution that scales well to large datasets, and improves prediction accuracy over standard full and sparse GP models. We give empirical evidence of performance for estimation of surface dew point temperature from infrared sounding data.

Surface (mathematics)Signal Processing (eess.SP)FOS: Computer and information sciencesComputer Science - Machine Learning010504 meteorology & atmospheric sciencesComputer science0211 other engineering and technologiesFOS: Physical sciences02 engineering and technologyAtmospheric model01 natural sciencesStatistics - ApplicationsMachine Learning (cs.LG)Physics - Geophysicssymbols.namesakeKernel (linear algebra)FOS: Electrical engineering electronic engineering information engineeringApplications (stat.AP)Electrical Engineering and Systems Science - Signal ProcessingGaussian process021101 geological & geomatics engineering0105 earth and related environmental sciencesbusiness.industryGeophysics (physics.geo-ph)Depth soundingDew pointsymbolsGlobal Positioning SystembusinessAlgorithmIGARSS 2018 - 2018 IEEE International Geoscience and Remote Sensing Symposium
researchProduct

Boolean operations with implicit and parametric representation of primitives using R-functions

2005

We present a new and efficient algorithm to accurately polygonize an implicit surface generated by multiple Boolean operations with globally deformed primitives. Our algorithm is special in the sense that it can be applied to objects with both an implicit and a parametric representation, such as superquadrics, supershapes, and Dupin cyclides. The input is a constructive solid geometry tree (CSG tree) that contains the Boolean operations, the parameters of the primitives, and the global deformations. At each node of the CSG tree, the implicit formulations of the subtrees are used to quickly determine the parts to be transmitted to the parent node, while the primitives' parametric definition …

Surface (mathematics)Theoretical computer scienceComputer scienceInformation Storage and Retrieval02 engineering and technologyConstructive solid geometryImaging Three-DimensionalParametric surfaceSuperquadricsImage Interpretation Computer-Assisted[ INFO.INFO-TI ] Computer Science [cs]/Image Processing0202 electrical engineering electronic engineering information engineeringparametric surfaceDifferentiable functionBoolean functionRepresentation (mathematics)ComputingMilieux_MISCELLANEOUSComputingMethodologies_COMPUTERGRAPHICSParametric statisticsGielis curveImplicit functionNumerical analysis020207 software engineeringNumerical Analysis Computer-Assistedsupershape[ INFO.INFO-GR ] Computer Science [cs]/Graphics [cs.GR]Computational geometryImage EnhancementComputer Graphics and Computer-Aided Design[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]Vertex (geometry)Tree (data structure)Mesh generation[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]Signal ProcessingCurve fitting020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionAlgorithmSoftwareAlgorithms
researchProduct

Multiresolution Analysis for Irregular Meshes

2003

International audience; The concept of multiresolution analysis applied to irregular meshes has become more and more important. Previous contributions proposed a variety of methods using simplification and/or subdivision algorithms to build a mesh pyramid. In this paper, we propose a multiresolution analysis framework for irregular meshes with attributes. Our framework is based on simplification and subdivision algorithms to build a mesh pyramid. We introduce a surface relaxation operator that allows to build a non-uniform subdivision for a low computational cost. Furthermore, we generalize the relaxationoperator to attributes such as color, texture, temperature, etc. The attribute analysis…

Surface (mathematics)Theoretical computer scienceMultiresolution analysisNoise reductionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION[INFO.INFO-GR] Computer Science [cs]/Graphics [cs.GR]02 engineering and technology[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]01 natural sciencesmultiresolution analysisIrregular mesh010309 opticsOperator (computer programming)[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]0103 physical sciences0202 electrical engineering electronic engineering information engineeringPolygon meshPyramid (image processing)SubdivisionMathematicsComputingMethodologies_COMPUTERGRAPHICSbusiness.industrysurface attributes[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]020207 software engineeringsurface relaxation[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]Computer Science::Graphics[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]Computer Science::Computer Vision and Pattern RecognitionRelaxation (approximation)businessAlgorithm
researchProduct

Anamorphic Projection: Analogical/Digital Algorithms

2014

The study presents the first outcomes of a wider research dealing with the theme of “anamorphosis”, a specific technique of geometric projection of a shape on a surface. Anamorphosis represents the synthesis among geometry, art and architecture and is realized in scientific and empirical research approaches. In this study we investigated how new digital techniques allow to simplify the anamorphic applications even in case of projections on complex surfaces. After a short excursus of the most famous historical and contemporary applications, we propose some possible approaches that allow you to manage the geometry of anamorphic curves both in Descriptive Geometry field (by using interactive t…

Surface (mathematics)Visual Arts and Performing ArtsGeneral MathematicsAnamorphosisRealization (linguistics)Field (computer science)Architectural geometryDescriptive geometryProjection (mathematics)Architectureanamorphic technique generative algorithms Architectural GeometrySettore ICAR/17 - DisegnoTheme (computing)AlgorithmMathematics
researchProduct

Systematic Error Correction of a 3D Laser Scanning Measurement Device

2011

International audience; Non-contact measurement techniques using laser scanning have the advantage of fast acquiring large numbers of points. However, compared to their contact-based counterparts, these techniques are known to be less accurate. The work presented in this paper aims at improving the accuracy of these techniques through an error correction procedure based on an experimental process that concerns mechanical parts. The influence of the three parameters defining the relative position and the orientation between the sensor and the surface is studied. The process used to build an experimental global model of error is presented and applied to a typical part composed of planes or sk…

Surface (mathematics)[ SPI.MECA.GEME ] Engineering Sciences [physics]/Mechanics [physics.med-ph]/Mechanical engineering [physics.class-ph]0209 industrial biotechnologyWork (thermodynamics)Laser scanningComputer science[PHYS.MECA.GEME]Physics [physics]/Mechanics [physics]/Mechanical engineering [physics.class-ph]02 engineering and technology01 natural sciences010309 optics3D inspection020901 industrial engineering & automationOpticsPosition (vector)0103 physical sciencesElectrical and Electronic EngineeringLaser scanningOrientation (computer vision)business.industryMechanical EngineeringProcess (computing)uncertaintieserrors correctionAtomic and Molecular Physics and OpticsElectronic Optical and Magnetic Materials[SPI.MECA.GEME]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Mechanical engineering [physics.class-ph][ PHYS.MECA.GEME ] Physics [physics]/Mechanics [physics]/Mechanical engineering [physics.class-ph]Measurement uncertaintyError detection and correctionbusinessAlgorithm
researchProduct

A surface hopping algorithm for nonadiabatic minimum energy path calculations

2015

The article introduces a robust algorithm for the computation of minimum energy paths transiting along regions of near-to or degeneracy of adiabatic states. The method facilitates studies of excited state reactivity involving weakly avoided crossings and conical intersections. Based on the analysis of the change in the multiconfigurational wave function the algorithm takes the decision whether the optimization should continue following the same electronic state or switch to a different state. This algorithm helps to overcome convergence difficulties near degeneracies. The implementation in the MOLCAS quantum chemistry package is discussed. To demonstrate the utility of the proposed procedur…

Surface PropertiesComputationSurface hoppingCASSCFretinalHeterocyclic Compounds 1-RingHeterocyclic CompoundsasulamConvergence (routing)dioxetaneAdiabatic processWave functionSchiff BasesChemistrysurface hopping algorithmGeneral ChemistryKineticsComputational MathematicsExcited statePath (graph theory)RetinaldehydeQuantum TheoryThermodynamicsCarbamatesCASSCF; asulam; dioxetane; minimum energy path; retinal; surface hopping algorithm; thymineProtonsDegeneracy (mathematics)Algorithmminimum energy pathAlgorithmsThymineJournal of Computational Chemistry
researchProduct