Search results for "LYN"

showing 10 items of 910 documents

Morphological exponential entropy driven-HUM.

2006

This paper presents an improvement to the Ex- ponential Entropy Driven - Homomorphic Unsharp Masking (E 2 D − HUM ) algorithm devoted to illumination artifact sup- pression on Magnetic Resonance Images. E 2 D−HUM requires a segmentation step to remove dark regions in the foreground whose intensity is comparable with background, because strong edges produce streak artifacts on the tissues. This new version of the algorithm keeps the same good properties of E 2 D − HUM without a segmentation phase, whose parameters should be chosen in relation to the image. I. INTRODUCTION Most of the studies on illumination correction found in literature are oriented to brain (18) magnetic resonance images (…

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniPolynomialArtifact (error)Brain MappingMRI rf-inhomogeneity homomorphic unsharp masking bias artifactbusiness.industryEntropyModels NeurologicalStreakBrainImage segmentationInformation theoryExpectation–maximization algorithmImage Processing Computer-AssistedHumansComputer visionSegmentationArtificial intelligencebusinessArtifactsAlgorithmAlgorithmsUnsharp maskingMathematics
researchProduct

A distributed Bayesian approach to fault detection in sensor networks

2012

Sensor networks are widely used in industrial and academic applications as the pervasive sensing module of an intelligent system. Sensor nodes may occasionally produce incorrect measurements due to battery depletion, dust on the sensor, manumissions and other causes. The aim of this paper is to develop a distributed Bayesian fault detection algorithm that classifies measurements coming from the network as corrupted or not. The computational complexity is polynomial so the algorithm scales well with the size of the network. We tested the approach on a synthetic dataset and obtained significant results in terms of correctly labeled measurements.

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniPolynomialBrooks–Iyengar algorithmComputer scienceBayesian probabilityReal-time computingFault DetectionSoft sensorWireless sensor networkFault detection and isolation2012 IEEE Global Communications Conference (GLOBECOM)
researchProduct

Central polynomials of graded algebras: Capturing their exponential growth

2022

Let G be a finite abelian group and let A be an associative G-graded algebra over a field of characteristic zero. A central G-polynomial is a polynomial of the free associative G-graded algebra that takes central values for all graded substitutions of homogeneous elements of A. We prove the existence and the integrability of two limits called the central G-exponent and the proper central G-exponent that give a quantitative measure of the growth of the central G-polynomials and the proper central G-polynomials, respectively. Moreover, we compare them with the G-exponent of the algebra.

Settore MAT/02 - AlgebraAlgebra and Number TheoryCentral polynomialExponentCodimension growthPolynomial identity
researchProduct

Superalgebras: Polynomial identities and asymptotics

2022

To any superalgebra A is attached a numerical sequence cnsup(A), n≥1, called the sequence of supercodimensions of A. In characteristic zero its asymptotics are an invariant of the superidentities satisfied by A. It is well-known that for a PI-superalgebra such sequence is exponentially bounded and expsup(A)=limn→∞⁡cnsup(A)n is an integer that can be explicitly computed. Here we introduce a notion of fundamental superalgebra over a field of characteristic zero. We prove that if A is such an algebra, then C1ntexpsup(A)n≤cnsup(A)≤C2ntexpsup(A)n, where C1>0,C2,t are constants and t is a half integer that can be explicitly written as a linear function of the dimension of the even part of A an…

Settore MAT/02 - AlgebraAlgebra and Number TheoryGrowthPolynomial identitySuperalgebra
researchProduct

ON THE ASYMPTOTICS OF CAPELLI POLYNOMIALS

2021

Abstract. We present old and new results about Capelli polynomials, Z2-graded Capelli polynomials and Capelli polynomials with involution and their asymptotics. Let Capm = Pσ2Sm (sgnσ)tσ(1)x1tσ(2) · · · tσ(m−1)xm−1tσ(m) be the m-th Capelli polynomial of rank m. In the ordinary case (see [33]) it was proved the asymptotic equality between the codimensions of the T -ideal generated by the Capelli polynomial Capk2+1 and the codimensions of the matrix algebra Mk(F ). In [9] this result was extended to superalgebras proving that the Z2-graded codimensions of the T2-ideal generated by the Z2-graded Capelli polynomials Cap0 M+1 and Cap1 L+1 for some fixed M, L, are asymptotically equal to the Z2-g…

Settore MAT/02 - AlgebraAlgebras with involution Capelli polynomials Codimension Growth.
researchProduct

Trace Codimensions of Algebras and Their Exponential Growth

2022

The trace codimensions give a quantitative description of the identities satisfied by an algebra with trace. Here we study the asymptotic behaviour of the sequence of trace codimensions c tr n(A) and of pure trace codimensions c ptr n (A) of a finite-dimensional algebra A over a field of characteristic zero. We find an upper and lower bound of both codimensions and as a consequence we get that the limits limn→∞ctrn(A)√n and limn→∞cptrn(A) √n always exist and are integers. This result gives a positive answer to a conjecture of Amitsur in this setting. Finally we characterize the varieties of algebras whose exponential growth is bounded by 2

Settore MAT/02 - AlgebraGeneral MathematicsPolynomial identities trace identities codimension growth
researchProduct

*-Graded Capelli polynomials and their asymptotics

2022

Let [Formula: see text] be the free *-superalgebra over a field [Formula: see text] of characteristic zero and let [Formula: see text] be the [Formula: see text]-ideal generated by the set of the *-graded Capelli polynomials [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] alternating on [Formula: see text] symmetric variables of homogeneous degree zero, on [Formula: see text] skew variables of homogeneous degree zero, on [Formula: see text] symmetric variables of homogeneous degree one and on [Formula: see text] skew variables of homogeneous degree one, respectively. We study the asymptotic behavior of the sequence of *-graded codimensions of [Formula: se…

Settore MAT/02 - AlgebraGeneral MathematicsSuperalgebras graded involutions Capelli polynomials codimension growthInternational Journal of Algebra and Computation
researchProduct

On central polynomials and codimension growth

2022

Let A be an associative algebra over a field of characteristic zero. A central polynomial is a polynomial of the free associative algebra that takes central values of A. In this survey, we present some recent results about the exponential growth of the central codimension sequence and the proper central codimension sequence in the setting of algebras with involution and algebras graded by a finite group.

Settore MAT/02 - AlgebraGeneral Mathematicscentral polynomialsexponentPolynomial identitycodimension growth
researchProduct

MR2966998 Aljadeff, Eli; Kanel-Belov, Alexei Hilbert series of PI relatively free G-graded algebras are rational functions. Bull. Lond. Math. Soc. 44…

2013

Settore MAT/02 - AlgebraGraded Algebra polynomial identity
researchProduct

Capelli identities on algebras with involution or graded involution

2022

We present recent results about Capelli polynomials with involution or graded involution and their asymptotics. In the associative case, the asymptotic equality between the codimensions of the T -ideal generated by the Capelli polynomial of rank k2 + 1 and the codimensions of the matrix algebra Mk(F) was proved. This result was extended to superalgebras. Recently, similar results have been determined by the authors in the case of algebras with involution and superalgebras with graded involution.

Settore MAT/02 - AlgebraInvolution graded involution Capelli polynomials codimensionGeneral MathematicsTurkish Journal of Mathematics
researchProduct