نتایج جستجو برای: mathematical morphology
تعداد نتایج: 342482 فیلتر نتایج به سال:
This paper describes the implementation of a two-level morphological analyzer for the Turkmen Language. Like all Turkic languages, the Turkmen Language is an agglutinative language that has productive inflectional and derivational suffixes. In this work, we implemented a finite-state two-level morphological analyzer for Turkmen Language by using Xerox Finite State Tools.
Abstraet--A new approach to digital implementation of continuous-scale mathematical morphology is presented. The approach is based on discretization of evolution equations associated with continuous multiscale morphological operations. Those equations, and their corresponding numerical implementation, can be derived either directly from mathematical morphology definitions or from curve evolutio...
We establish in this paper the link between the two main approaches for fuzzy mathematical morphology, based on duality with respect to complementation and on the adjunction property, respectively. We also prove that the corresponding definitions of fuzzy dilation and erosion are the most general ones if a set of classical properties is required. © 2009 Elsevier B.V. All rights reserved.
This work presents a taxonomy of derivative suffixes and completions used in Spanish useful for the establishment of morpholexical relations deduced from a corpus of 134109 canonical forms. A system able is developed to solve and to respond to any morphologic aspect of a word of the Spanish that includes all related to the derivative morphology and other nearby aspects. It allows the tagged, th...
Mathematical morphology has traditionally been grounded in lattice theory. For non-scalar data lattices often prove too restrictive, however. In this paper we present a more general alternative, sponges, that still allows useful definitions of various properties and concepts from morphological theory. It turns out that some of the existing work on “pseudo-morphology” for non-scalar data can in ...
In this article, we study a particular example of general random tessellation, the dead leaves model. This model, first studied by the Mathematical Morphology school, is defined as a sequential superimposition of random closed sets, and provides the natural tool to study the occlusion phenomenon, essential ingredient in the formation of visual images. We generalize results from G. Matheron, and...
We introduce the proceedings from the workshop ‘Computing and Historical Phonology: 9th Meeting of the ACL Special Interest Group for Computational Morphology and Phonology’.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید