Search results for "METHODOLOGIE"

showing 10 items of 2141 documents

Variational multiframe restoration of images degraded by noisy (stochastic) blur kernels

2013

This article introduces and explores a class of degradation models in which an image is blurred by a noisy (stochastic) point spread function (PSF). The aim is to restore a sharper and cleaner image from the degraded one. Due to the highly ill-posed nature of the problem, we propose to recover the image given a sequence of several observed degraded images or multiframes. Thus we adopt the idea of the multiframe approach introduced for image super-resolution, which reduces distortions appearing in the degraded images. Moreover, we formulate variational minimization problems with the robust (local or nonlocal) L^1 edge-preserving regularizing energy functionals, unlike prior works dealing wit…

Point spread functionSequenceMathematical optimizationApplied MathematicsComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION010103 numerical & computational mathematics02 engineering and technology01 natural sciencesImage (mathematics)Computational MathematicsComputer Science::Computer Vision and Pattern Recognition0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingSegmentationMinification0101 mathematicsAlgorithmEnergy (signal processing)Image restorationDegradation (telecommunications)MathematicsJournal of Computational and Applied Mathematics
researchProduct

Characterization of Orlicz–Sobolev space

2007

We give a new characterization of the Orlicz–Sobolev space W1,Ψ(Rn) in terms of a pointwise inequality connected to the Young function Ψ. We also study different Poincaré inequalities in the metric measure space.

PointwiseMathematics::Functional AnalysisGeneral MathematicsMathematical analysisFunction (mathematics)Characterization (mathematics)Space (mathematics)Measure (mathematics)Sobolev spacesymbols.namesakeTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONPoincaré conjectureMetric (mathematics)symbolsMathematicsArkiv för Matematik
researchProduct

Matroid optimization problems with monotone monomials in the objective

2022

Abstract In this paper we investigate non-linear matroid optimization problems with polynomial objective functions where the monomials satisfy certain monotonicity properties. Indeed, we study problems where the set of non-linear monomials consists of all non-linear monomials that can be built from a given subset of the variables. Linearizing all non-linear monomials we study the respective polytope. We present a complete description of this polytope. Apart from linearization constraints one needs appropriately strengthened rank inequalities. The separation problem for these inequalities reduces to a submodular function minimization problem. These polyhedral results give rise to a new hiera…

PolynomialMonomialOptimization problemRank (linear algebra)Applied Mathematics0211 other engineering and technologies021107 urban & regional planningPolytopeMonotonic function0102 computer and information sciences02 engineering and technology01 natural sciencesMatroidCombinatoricsMonotone polygon010201 computation theory & mathematicsComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONDiscrete Mathematics and CombinatoricsMathematicsDiscrete Applied Mathematics
researchProduct

Locally tame plane polynomial automorphisms

2010

Abstract For automorphisms of a polynomial ring in two variables over a domain R , we show that local tameness implies global tameness provided that every 2-generated locally free R -module of rank 1 is free. We give examples illustrating this property.

PolynomialRank (linear algebra)Polynomial ringPolynomial automorphismsCommutative Algebra (math.AC)01 natural sciencesCombinatoricsMathematics - Algebraic GeometryFOS: MathematicsAlgebra en Topologie0101 mathematicsAlgebraic Geometry (math.AG)MathematicsAlgebra and TopologyAlgebra and Number TheoryPlane (geometry)local tameness010102 general mathematicsA domainMathematics - Commutative AlgebraAutomorphism[ MATH.MATH-AG ] Mathematics [math]/Algebraic Geometry [math.AG]010101 applied mathematicsComputingMethodologies_DOCUMENTANDTEXTPROCESSING[MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]14R10Journal of Pure and Applied Algebra
researchProduct

A Characterization of Quintic Helices

2005

A polynomial curve of degree 5, @a, is a helix if and only if both @[email protected]^'@? and @[email protected]^'@[email protected]^''@? are polynomial functions.

PolynomialTheorem of LancreteducationComputingMilieux_LEGALASPECTSOFCOMPUTINGCharacterization (mathematics)behavioral disciplines and activitiesMathematics::Algebraic TopologyCombinatoricsMathematics - Geometric TopologyTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYhealth services administrationComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONFOS: Mathematicshealth care economics and organizationsMathematicsPhysics::Biological PhysicsQuantitative Biology::BiomoleculesDegree (graph theory)InformationSystems_INFORMATIONSYSTEMSAPPLICATIONSApplied MathematicsMathematical analysisGeometric Topology (math.GT)Pythagorean hodograph curveshumanitiesQuintic functionComputational MathematicsGeneralized polynomial helices
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

Influence of processing conditions on rheological and mechanical properties of polycarbonate/polypropylene blends

1987

Abstract Rheological and mechanical data on polycarbonate/polypropylene blends are reported as a function of the blend preparation. Both kinds of properties depend on the properties of the homopolymers and on the processing conditions. In the molten state the blends are compatible at low content of polypropylene and incompatible at high content. The blends with intermediate compositions can be called semicompatible. Also in the solid state the blends with low content of polypropylene are compatible, while all other blends are incompatible.

PolypropyleneMaterials scienceSolid-stateCondensed Matter PhysicsMolten statechemistry.chemical_compoundchemistryRheologyvisual_artvisual_art.visual_art_mediumGeneral Materials SciencePolycarbonateComposite materialComputingMethodologies_COMPUTERGRAPHICSMaterials Chemistry and Physics
researchProduct

An unexpected biomaterial against SARS-CoV-2: Bio-polyphosphate blocks binding of the viral spike to the cell receptor.

2021

Graphical abstract

PopulationSpike proteinmedicine.disease_causeVirusInorganic polyphosphate03 medical and health scienceschemistry.chemical_compoundResearch (Mid Blue)0302 clinical medicineNanoparticleViral envelopemedicineGeneral Materials ScienceReceptoreducation030304 developmental biologyCoronavirusComputingMethodologies_COMPUTERGRAPHICSHost cell surfacechemistry.chemical_classification0303 health scienceseducation.field_of_studySARS-CoV-2Mechanical EngineeringPolyphosphateCondensed Matter Physics3. Good healthCell biologyAmino acidchemistryMechanics of Materials030220 oncology & carcinogenesisPolyanionMaterials today (Kidlington, England)
researchProduct

The algebra of symmetric analytic functions on L∞

2017

We consider the algebra of holomorphic functions on L∞ that are symmetric, i.e. that are invariant under composition of the variable with any measure-preserving bijection of [0, 1]. Its spectrum is identified with the collection of scalar sequences such that is bounded and turns to be separable. All this follows from our main result that the subalgebra of symmetric polynomials on L∞ has a natural algebraic basis.

Power sum symmetric polynomialTriple systemGeneral Mathematics010102 general mathematicsSubalgebraStanley symmetric functionComplete homogeneous symmetric polynomial01 natural sciences010101 applied mathematicsAlgebraSymmetric polynomialComputingMethodologies_DOCUMENTANDTEXTPROCESSINGElementary symmetric polynomial0101 mathematicsRing of symmetric functionsMathematicsProceedings of the Royal Society of Edinburgh: Section A Mathematics
researchProduct