Search results for "Normal"
showing 10 items of 2571 documents
Mathematical Morphology for Color Images: An Image-Dependent Approach
2012
This paper proposes one possibility to generalize the morphological operations (particularly, dilation, erosion, opening, and closing) to color images. First, properties of a desirable generalization are stated and a brief review is done on former approaches. Then, the method is explained, which is based on a total ordering of the colors in an image induced by its color histogram; this is valid for just one image and may present problems in smoothly coloured images. To solve these drawbacks a refinement consisting of smoothing the histogram and using a joint histogram of several images is presented. Results of applying the so-defined morphological operations on several sets of images are sh…
Multichannel single-output color pattern recognition by use of a joint-transform correlator.
1996
A novel method for performing color image recognition by the use of the coherent joint-transform correlator is introduced. The input plane of the proposed method is a spatial rearrangement of the separation into color channels of both the color input scene and the color target. This input plane is gray scaled and monochromatic, thus it can be displayed by the use of amplitude spatial light modulators to achieve real-time operation. The system provides a single output-plane result of the optical coherent addition of the separate channels’ correlation outputs. At the output plane no electronic postprocessing is needed, and the detection decision is achieved simply by the application of thresh…
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…
On generalized covering subgroups and a characterisation of ?pronormal?
1983
Introduction. The context of this note is the theory of Schunck classes and formations of finite soluble groups. In a 1972 manuscript Fischer [4] generalized the concept of an ~-covering subgroup of a group G to a (P, ~)-covering subgroup, where P is some pronormal subgroup of G, and proved universal existence (for P satisfying a stronger embedding property) in case the class ~ is a saturated formation. The fact tha t the Schunck classes are the classes ~ with the property that every group has an ~-projector [9, 4.3, 4.4; 6] (which coincides with an ~-covering subgroup in the soluble universe | [6, II.15]) raises the question whether it is possible to determine the whole range of universal …
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 ′ .
On partial CAP-subgroups of finite groups
2015
Abstract Given a chief factor H / K of a finite group G, we say that a subgroup A of G avoids H / K if H ∩ A = K ∩ A ; if H A = K A , then we say that A covers H / K . If A either covers or avoids the chief factors of some given chief series of G, we say that A is a partial CAP-subgroup of G. Assume that G has a Sylow p-subgroup of order exceeding p k . If every subgroup of order p k , where k ≥ 1 , and every subgroup of order 4 (when p k = 2 and the Sylow 2-subgroups are non-abelian) are partial CAP-subgroups of G, then G is p-soluble of p-length at most 1.