This paper surveys work of the authors on pattern languages for tree-structured data with XML as the main application in mind. The main focus is on formalisms from formal language theory and logic. In particular, it considers attribute grammars, query automata, treewalking automata, extensions of first-order logic, and monadic secondorder logic. It investigates expressiveness as well as the com...

Keywords: mathematical morphology segmentation connected component attribute profile elongation area stability multiphoton microscopy In this paper, a method to segment elongated objects is proposed. It is based on attribute profiles and area stability. Images are represented as component trees using a threshold decomposition. Then, some attributes are computed on each node of the tree. Finally...

Incremental attribute evaluation of one-pass attribute grammars (AGs) has not yet been fully investigated. However, considering the lightness of one-pass AGs, combining incremental evaluation and parsing in one-pass AGs may bring about a time-and space-eecient language processor. In this paper, an incremental attribute evaluation method based on LR-attributed grammar, a class of one-pass attrib...

There is embryonic importance in scaling up the broadly used decision tree learning algorithms to huge datasets. Even though abundant diverse methodologies have been proposed, a fast tree growing algorithm without substantial decrease in accuracy and substantial increase in space complexity is essential to a greater extent. This paper aims at improving the performance of the SLIQ (Supervised Le...

Cybernetics studies information process in the context of interaction with physical systems. Because such information is sometimes vague and exhibits complex interactions; it can only be discerned using approximate representations. Machine learning provides solutions that create approximate models of information and decision trees are one of its main components. However, decision trees are susc...

Connected filtering is a popular strategy that relies on treebased image representations: for example, one can compute an attribute on each node of the tree and keep only the nodes for which the attribute is sufficiently strong. This operation can be seen as a thresholding of the tree, seen as a graph whose nodes are weighted by the attribute. Rather than being satisfied with a mere thresholdin...