Journal•ISSN: 0169-2968

# Fundamenta Informaticae

IOS Press

About: Fundamenta Informaticae is an academic journal published by IOS Press. The journal publishes majorly in the area(s): Petri net & Rough set. It has an ISSN identifier of 0169-2968. Over the lifetime, 3475 publications have been published receiving 54551 citations. The journal is also known as: Fundam. Inform. & FI.

##### Papers published on a yearly basis

##### Papers

More filters

••

TL;DR: A critical review of several definitions of watershed transform and associated sequential algorithms is presented in this paper, where the need to distinguish between definition, algorithm specification and algorithm implementation is pointed out.

Abstract: The watershed transform is the method of choice for image segmentation in the field of mathematical morphology. We present a critical review of several definitions of the watershed transform and the associated sequential algorithms, and discuss various issues which often cause confusion in the literature. The need to distinguish between definition, algorithm specification and algorithm implementation is pointed out. Various examples are given which illustrate differences between watershed transforms based on different definitions and/or implementations. The second part of the paper surveys approaches for parallel implementation of sequential watershed algorithms.

1,439 citations

••

TL;DR: In tolerance approximation spaces the lower and upper set approximations are defined and the tolerance relation defined by the so called uncertainty function or the positive region of a given partition of objects have been chosen as invariants in the attribute reduction process.

Abstract: We generalize the notion of an approximation space introduced in [8] In tolerance approximation spaces we define the lower and upper set approximations We investigate some attribute reduction problems for tolerance approximation spaces determined by tolerance information systems The tolerance relation defined by the so called uncertainty function or the positive region of a given partition of objects have been chosen as invariants in the attribute reduction process We obtain the solutions of the reduction problems by applying boolean reasoning [1] The solutions are represented by tolerance reducts and relative tolerance reducts

955 citations

••

TL;DR: The paper is a overview of the major qualitative spatial representation and reasoning techniques including ontological aspects, topology, distance, orientation and shape, and qualitative spatial reasoning including reasoning about spatial change.

Abstract: The paper is a overview of the major qualitative spatial representation and reasoning techniques. We survey the main aspects of the representation of qualitative knowledge including ontological aspects, topology, distance, orientation and shape. We also consider qualitative spatial reasoning including reasoning about spatial change. Finally there is a discussion of theoretical results and a glimpse of future work. The paper is a revised and condensed version of [33,34].

745 citations

•

TL;DR: In this article, the authors introduce a class of neural-like P systems which they call spiking neural P systems (in short, SN P systems), in which the result of a computation is the time between the moments when a specified neuron spikes.

Abstract: This paper proposes a way to incorporate the idea of spiking neurons into the area of membrane computing, and to this aim we introduce a class of neural-like P systems which we call spiking neural P systems (in short, SN P systems). In these devices, the time (when the neurons fire and/or spike) plays an essential role. For instance, the result of a computation is the time between the moments when a specified neuron spikes. Seen as number computing devices, SN P systems are shown to be computationally complete (both in the generating and accepting modes, in the latter case also when restricting to deterministic systems). If the number of spikes present in the system is bounded, then the power of SN P systems falls drastically, and we get a characterization of semilinear sets. A series of research topics and open problems are formulated.

589 citations

••

TL;DR: A new version of the rule induction system LERS is described and compared with the old version and the new LERS system performance is fully comparable with performance of the other two systems.

Abstract: A new version of the rule induction system LERS is described and compared with the old version of LERS. Experiments were done for comparison of performance for both versions of LERS and the two other rule-induction systems: AQ15 and C4.5. The new LERS system performance is fully comparable with performance of the other two systems.

472 citations