Search results for " norma"
showing 10 items of 623 documents
Multi-channel chromatic transformations for nonlinear color pattern recognition
2002
We present a new approach for color pattern recognition based on multi-channel nonlinear correlations. High discrimination capability is obtained in comparison with common linear multi-channel detection methods. We apply the nonlinear morphological correlation to different color channel decompositions as RGB and ATD channels. Moreover, in order to improve the discrimination we have introduced a new color transformation. When a high selectivity is required, the combination of the nonlinear correlation and the new color decomposition yields to detect the object using just a single channel. Simulation results are provided.
A neural network based automatic road signs recognizer
2003
Automatic road sign recognition systems are aimed at detection and recognition of one or more road signs from real-world color images. In this research, road signs are detected and extracted from real world scenes on the basis of their color and shape features. A dynamic region growing technique is adopted to enhance color segmentation results obtained in the HSV color space. The technique is based on a dynamic threshold that reduces the effect of hue instability in real scenes due to external brightness variation. Classification is then performed on extracted candidate regions using multilayer perceptron neural networks. The obtained results show good detection and recognition rates of the…
Application of the S-CIELAB color model to processed and calibrated images with a colorimetric dithering method.
2009
This work uses the S-CIELAB color model to compare images that have been calibrated and processed using a colorimetric dithering method which simulates increments in viewing distance. Firstly, we obtain XYZ calibrated images by applying the appropriate color transformations to the original images. These transformations depend on whether the image is viewed on a display device or encoded by a capture device, for example. Secondly, we use a colorimetric dithering method consisting of a partitive additive mixing of XYZ tristimulus values. The number of dithered pixels depends on simulated viewing distance. The dithered tristimulus values are transformed to digital data to observe the dithering…
Bayesian hypothesis testing: A reference approach
2002
Summary For any probability model M={p(x|θ, ω), θeΘ, ωeΩ} assumed to describe the probabilistic behaviour of data xeX, it is argued that testing whether or not the available data are compatible with the hypothesis H0={θ=θ0} is best considered as a formal decision problem on whether to use (a0), or not to use (a0), the simpler probability model (or null model) M0={p(x|θ0, ω), ωeΩ}, where the loss difference L(a0, θ, ω) –L(a0, θ, ω) is proportional to the amount of information δ(θ0, ω), which would be lost if the simplified model M0 were used as a proxy for the assumed model M. For any prior distribution π(θ, ω), the appropriate normative solution is obtained by rejecting the null model M0 wh…
Parabolic Subgroups of Artin Groups
1997
Abstract Let ( A , Σ) be an Artin system. For X ⊆ Σ, we denote by A X the subgroup of A generated by X . Such a group is called a parabolic subgroup of A . We reprove Van der Lek's theorem: “a parabolic subgroup of an Artin group is an Artin group.” We give an algorithm which decides whether two parabolic subgroups of an Artin group are conjugate. Let A be a finite type Artin group, and let A X be a parabolic subgroup with connected associated Coxeter graph. The quasi-centralizer of A X in A is the set of β in A such that β X β −1 = X . We prove that the commensurator of A X in A is equal to the normalizer of A X in A , and that this group is generated by A X and the quasi-centralizer of…
Centralizers of Parabolic Subgroups of Artin Groups of TypeAl,Bl, andDl
1997
Abstract Let ( A , Σ) be an Artin system of one of the types A l , B l , D l . For X ⊆ Σ, we denote by A X the subgroup of A generated by X . Such a group is called a parabolic subgroup of ( A , Σ). Let A X be a parabolic subgroup with connected associated Coxeter graph. We exhibit a generating set of the centralizer of A X in A . Moreover, we prove that there exists X ′ ⊆ Σ such that A X ′ is conjugate to A X and such that the centralizer of A X ′ in A is generated by the centers of all the parabolic subgroups containing A X ′ .
The McKay conjecture and Galois automorphisms
2004
The main problem of representation theory of finite groups is to find proofs of several conjectures stating that certain global invariants of a finite group G can be computed locally. The simplest of these conjectures is the ?McKay conjecture? which asserts that the number of irreducible complex characters of G of degree not divisible by p is the same if computed in a p-Sylow normalizer of G. In this paper, we propose a much stronger version of this conjecture which deals with Galois automorphisms. In fact, the same idea can be applied to the celebrated Alperin and Dade conjectures.
Extensions of cocycles for hyperfinite actions and applications
1997
Given a countable, hyperfinite, ergodic and measure-preserving equivalence relationR on a standard probability space (X, ℬ, μ) and an elementW of the normalizerN (R) ofR, we investigate the problem of extendingR-cocycles to\(\bar R\), where\(\bar R\) is the relation generated byR andW. As an application, we obtain that for a Bernoulli automorphism the smallest family of natural factors in sense of [6] consists of all factors. Given an automorphism which is embeddable in a measurable flow and a compact, metric group, we show that for a typical cocycle we cannot lift the whole flow to the centralizer of the corresponding group extension.
p-Brauer characters ofq-defect 0
1994
For ap-solvable groupG the number of irreducible Brauer characters ofG with a given vertexP is equal to the number of irreducible Brauer characters of the normalizer ofP with vertexP. In this paper we prove in addition that for solvable groups one can control the number of those characters whose degrees are divisible by the largest possibleq-power dividing the order of |G|.
Soluble groups with their centralizer factor groups of bounded rank
2007
Abstract For a group class X , a group G is said to be a C X -group if the factor group G / C G ( g G ) ∈ X for all g ∈ G , where C G ( g G ) is the centralizer in G of the normal closure of g in G . For the class F f of groups of finite order less than or equal to f , a classical result of B.H. Neumann [Groups with finite classes of conjugate elements, Proc. London Math. Soc. 1 (1951) 178–187] states that if G ∈ C F f , the commutator group G ′ belongs to F f ′ for some f ′ depending only on f . We prove that a similar result holds for the class S r ( d ) , the class of soluble groups of derived length at most d which have Prufer rank at most r . Namely, if G ∈ C S r ( d ) , then G ′ ∈ S d…