Search results for " Computer Science"

showing 10 items of 3983 documents

An Approximating-Interpolatory Subdivision Scheme.

2011

International audience; In the last decade, study and construction of quad/triangle subdivision schemes have attracted attention. The quad/triangle subdivision starts with a control mesh consisting of both quads and triangles and produces ner and ner meshes with quads and triangles (Fig. 1). Design- ers often want to model certain regions with quad meshes and others with triangle meshes to get better visual qual- ity of subdivision surfaces. Smoothness analysis tools exist for regular quad/triangle vertices. Moreover C1 and C2 quad/triangle schemes (for regular vertices) have been con- structed. But to our knowledge, there are no quad/triangle schemes that uni es approximating and interpola…

Polynomial generationComputer Science::GraphicsNumerical analysis Computer science[INFO.INFO-GR] Computer Science [cs]/Graphics [cs.GR]Mathematics::Analysis of PDEsSubdivision[ INFO.INFO-GR ] Computer Science [cs]/Graphics [cs.GR]Computer Science::Computational GeometryQuad/triangle SubdivisionQuasi-interpolants[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]
researchProduct

Study and construction of the quasi-linear subdivision schemes over bi-regular meshs

2012

Subdivision schemes are commonly used to generate a smooth shape from a much more coarseone. The reverse subdivision is designed to describe a high resolution mesh from a coarse one. Bothof these tools are used in numerous graphical modelisation domains. In this thesis, we focused ontwo distinct aspects: on one hand the construction of quasi-linear subdivision schemes and on theother hand the construction of reverse quad/triangle subdivision schemes. The work, presented inthe context of the subdivision, describes the construction of a new type of subdivision schemes, andtheirs applications to solve some problems coming from the application of linear subdivision schemes.The work presented in…

Polynomial generationPolynomial reproduction[ MATH.MATH-GM ] Mathematics [math]/General Mathematics [math.GM][INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]Subdivision quad/triangle[MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM]Génération des polynômesInterpolation[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH]QuasiinterpolationReverse subdivision[MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM][ INFO.INFO-OH ] Computer Science [cs]/Other [cs.OH]Schémas de subdivisionQuad/triangle subdivisionSubdivision schemesReproduction des polynômesSchémas de subdivision inverseApproximation
researchProduct

Non-consistent cell-average multiresolution operators with application to image processing

2016

In recent years different techniques to process signal and image have been designed and developed. In particular, multiresolution representations of data have been studied and used successfully for several applications such as compression, denoising or inpainting. A general framework about multiresolution representation has been presented by Harten (1996) 20. Harten's schemes are based on two operators: decimation, D , and prediction, P , that satisfy the consistency property D P = I , where I is the identity operator. Recently, some new classes of multiresolution operators have been designed using learning statistical tools and weighted local polynomial regression methods obtaining filters…

Polynomial regressionDecimationTheoretical computer scienceApplied MathematicsInpaintingImage processing010103 numerical & computational mathematics01 natural sciences010101 applied mathematicsComputational MathematicsOperator (computer programming)Consistency (statistics)0101 mathematicsRepresentation (mathematics)AlgorithmMathematicsImage compressionApplied Mathematics and Computation
researchProduct

Monads in double categories

2010

We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to that of double categories. In particular, we introduce the double category Mnd(C) of monads in a double category C and define what it means for a double category to admit the construction of free monads. Our main theorem shows that, under some mild conditions, a double category that is a framed bicategory admits the construction of free monads if its horizontal 2-category does. We apply this result to obtain double adjunctions which extend the adjunction between graphs and categories and the adjunction between polynomial endofunctors and polynomial monads.

PolynomialPure mathematicsDemostració Teoria de la02 engineering and technology01 natural sciences510 - Consideracions fonamentals i generals de les matemàtiquesdouble categoriesDistributive law between monadsComputer Science::Logic in Computer ScienceMathematics::Category TheoryFOS: Mathematics0202 electrical engineering electronic engineering information engineeringCategory Theory (math.CT)0101 mathematicsMathematicsDiscrete mathematicsAlgebra and Number TheoryTheory010102 general mathematicsMathematics - Category Theory16. Peace & justiceAdjunctionBicategorySettore MAT/02 - AlgebraCategories (Matemàtica)Monad020201 artificial intelligence & image processing18D05 18C15Journal of Pure and Applied Algebra
researchProduct

A New Set of Quartic Trivariate Polynomial Equations for Stratified Camera Self-calibration under Zero-Skew and Constant Parameters Assumptions

2012

This paper deals with the problem of self-calibrating a moving camera with constant parameters. We propose a new set of quartic trivariate polynomial equations in the unknown coordinates of the plane at infinity derived under the no-skew assumption. Our new equations allow to further enforce the constancy of the principal point across all images while retrieving the plane at infinity. Six such polynomials, four of which are independent, are obtained for each triplet of images. The proposed equations can be solved along with the so-called modulus constraints and allow to improve the performance of existing methods.

PolynomialZero skewCalibration (statistics)Mathematical analysisPrincipal point[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]020207 software engineering02 engineering and technology[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Set (abstract data type)[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Plane at infinityQuartic functionComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingConstant (mathematics)ComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses

2013

International audience; We examine the problem of computing exactly the Voronoi diagram (via the dual Delaunay graph) of a set of, possibly intersecting, smooth convex \pc in the Euclidean plane, given in parametric form. Pseudo-circles are (convex) sites, every pair of which has at most two intersecting points. The Voronoi diagram is constructed incrementally. Our first contribution is to propose robust and efficient algorithms, under the exact computation paradigm, for all required predicates, thus generalizing earlier algorithms for non-intersecting ellipses. Second, we focus on \kcn, which is the hardest predicate, and express it by a simple sparse $5\times 5$ polynomial system, which a…

Polynomialexact computationAerospace Engineering02 engineering and technologyComputer Science::Computational GeometryEllipse[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]01 natural sciencesIncircle and excircles of a triangleCombinatoricsparametric curveTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY0202 electrical engineering electronic engineering information engineeringPower diagramVoronoi diagramParametric equationimplementationComputingMethodologies_COMPUTERGRAPHICSMathematicsDiscrete mathematics[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]Regular polygon020207 software engineeringCGALComputer Graphics and Computer-Aided DesignWeighted Voronoi diagram[ INFO.INFO-SC ] Computer Science [cs]/Symbolic Computation [cs.SC]0104 chemical sciences010404 medicinal & biomolecular chemistryModeling and SimulationAutomotive Engineering[ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG]InCircle predicateVoronoi diagram
researchProduct

Modeling elastic properties of short flax fiber-reinforced composites by orientation averaging

2010

Abstract Natural fibers of plant origin, used as reinforcement in polymer matrix composite materials, exhibit highly anisotropic elastic properties due to their complex internal structure. Mechanical properties can be evaluated not only by tests but also by mechanical models reflecting the principal morphological features of fibers. Such a FEM model is applied to estimate the elastic properties of a unit cell of a short-fiber-reinforced composite, an elementary flax fiber embedded in a polymer matrix. Orientation averaging approach is used for prediction of the stiffness of short flax fiber reinforced polymer matrix composite. The numerical estimates of Young’s modulus are compared to the t…

Polypropylenechemistry.chemical_classificationMaterials scienceGeneral Computer ScienceComposite numberGeneral Physics and AstronomyModulusStiffnessYoung's modulusGeneral ChemistryPolymerFinite element methodComputational Mathematicssymbols.namesakechemistry.chemical_compoundchemistryMechanics of MaterialssymbolsmedicineGeneral Materials ScienceComposite materialmedicine.symptomAnisotropyComputational Materials Science
researchProduct

Stability and l1-gain analysis for positive 2D T–S fuzzy state-delayed systems in the second FM model

2014

This paper considers the problems of delay-dependent stability and l"1-gain analysis for a class of positive two-dimensional (2D) Takagi-Sugeno (T-S) fuzzy linear systems with state delays described by the second FM model. Firstly, the co-positive type Lyapunov function method is applied to establish sufficient conditions of asymptotical stability for the addressed positive 2D T-S fuzzy system. Then, the l"1-gain performance analysis for the positive 2D T-S fuzzy delayed system is studied. All the obtained results are formulated in the form of linear matrix inequalities (LMIs) which are computationally tractable. Finally, an illustrative example is given to verify the effectiveness of the p…

Positive 2D systemsLyapunov functionT-S fuzzy systemsCognitive NeuroscienceLinear systemLinear matrix inequalityDelay-dependent stabilityComputer Science Applications1707 Computer Vision and Pattern RecognitionFuzzy control systemState (functional analysis)Fuzzy logicStability (probability)Computer Science Applicationssymbols.namesakeArtificial IntelligenceControl theorysymbolsCo-positive type Lyapunov functionFuzzy numberCo-positive type Lyapunov function; Delay-dependent stability; Positive 2D systems; T-S fuzzy systems; Computer Science Applications1707 Computer Vision and Pattern Recognition; Cognitive Neuroscience; Artificial IntelligenceMathematicsNeurocomputing
researchProduct

A probabilistic framework for automatic prostate segmentation with a statistical model of shape and appearance

2011

International audience; Prostate volume estimation from segmented prostate contours in Trans Rectal Ultrasound (TRUS) images aids in diagnosis and treatment of prostate diseases, including prostate cancer. However, accurate, computationally efficient and automatic segmentation of the prostate in TRUS images is a challenging task owing to low Signal-To-Noise-Ratio (SNR), speckle noise, micro-calcifications and heterogeneous intensity distribution inside the prostate region. In this paper, we propose a probabilistic framework for propagation of a parametric model derived from Principal Component Analysis (PCA) of prior shape and posterior probability values to achieve the prostate segmentatio…

Posterior probability030218 nuclear medicine & medical imaging03 medical and health sciences0302 clinical medicineExpectation–maximization algorithm[ INFO.INFO-TI ] Computer Science [cs]/Image ProcessingActive Appearance Model.Computer visionMathematicsbusiness.industryBayes ClassificationProbabilistic logicStatistical modelSpeckle noisePattern recognitionImage segmentationProstate SegmentationExpectationMaximizationActive appearance modelActive Appearance Model[INFO.INFO-TI] Computer Science [cs]/Image Processing [eess.IV][INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]Parametric modelArtificial intelligencebusiness030217 neurology & neurosurgery
researchProduct

Quantum chemical modelling of point defects in KNbO3 perovskite crystals

2000

Abstract We present results of semi-empirical quantum chemical calculations for several perovskite KNb x Ta 1−x O 3 (KTN) solid solutions, as well as point intrinsic defects – F centers and hole polarons bound to K vacancy – in KNbO 3 . Method of the intermediate neglect of the differential overlap (INDO) was combined with typically 320-atom supercells and atomic geometry optimization. Analysis of the optimized atomic and electronic structure has clearly demonstrated that several nearest Nb atoms substituting for Ta in KTaO 3 – unlike Ta impurities in KNbO 3 – reveal the self-ordering effect, which probably triggers the ferroelectricity observed in KTN. We predict co-existence of one-site (…

Potassium niobateGeneral Computer ScienceChemistryGeneral Physics and AstronomyGeneral ChemistryElectronic structureFerroelectricityCrystallographic defectMolecular physicsComputational Mathematicschemistry.chemical_compoundMechanics of MaterialsComputational chemistryAb initio quantum chemistry methodsVacancy defectGeneral Materials ScienceSolid solutionPerovskite (structure)Computational Materials Science
researchProduct