The modeling of topological relations between spatial regions is a primary topic in spatial reasoning, geographic information systems (GIS) and spatial databases. In many geographical applications spatial regions do n...
详细信息
The modeling of topological relations between spatial regions is a primary topic in spatial reasoning, geographic information systems (GIS) and spatial databases. In many geographical applications spatial regions do not always have homogeneous interiors and sharply defined boundaries, but frequently their interiors and boundaries are fuzzy. Recently, representing fuzzy spatial regions and modeling the topological relations between them plays an increasingly important theory and application role. Based on the characteristics of fuzzy regions in raster data model and the requirement of topological relations analysis in applications, a hierarchical topological relations model is proposed. The model can determine the topological relation between fuzzy raster regions on multiple levels with the values of three predicate. When predicates are evaluated within two values, it can deal with crisp raster regions as a specific case and there are 5 possible cases of topological relations. When predicates are evaluated within three values, there are 27 possible cases. There are 51 possible cases when predicates are evaluated within six values. In practical applications, the model can analyze topological relations of fuzzy raster regions according to the existing facts and the requirement. The model is wieldy in practical applications and achieves satisfactory results.
CP-networks provide a convenient means for expressing preferences in reasoning, but it is not good at handling preferences with hard constraints. The paper proposes a new approach, which transforms the CP-network with...
详细信息
CP-networks provide a convenient means for expressing preferences in reasoning, but it is not good at handling preferences with hard constraints. The paper proposes a new approach, which transforms the CP-network with hard constraints into one constraint hierarchy, therefore one could process preferences and constraints in a single formalism with fruitful constraint solving algorithms. Furthermore, illustrates it with some examples, proves that the transformation preserves the ceteris paribus property and presents some complexity results. Finally compares it with related work and concludes the paper.
Concept lattice, the core data structure in formal concept analysis, has been used widely in machine learning, data mining and knowledge discovery, information retrieval, etc. The main difficulty with concept lattice-...
详细信息
Concept lattice, the core data structure in formal concept analysis, has been used widely in machine learning, data mining and knowledge discovery, information retrieval, etc. The main difficulty with concept lattice-based system comes from the lattice construction itself. This paper proposes a new algorithm called SSPCG (search space partition based concepts generation) based on the closures search space partition. The algorithm divides the closures search space into several subspaces in accordance with the criterions prescribed ahead, and introduces an efficient scheme to recognize the valid ones, which bounds searching just in these valid subspaces. An intermediate structure is employed to judge the validity of a subspace and compute closures more efficiently. Since the partition of the search space is recursive and the searching in subspaces is independent, a parallel version can be directly reached. The algorithm is experimental evaluated and compared with the famous NextClosure algorithm proposed by Ganter for random generated data, as well as for real application data. The results show that the algorithm performs much better than the later.
Under the framework of LPU (learning from positive data and unlabeled data), this paper originally proposes a three-step algorithm. First, Co-Training is employed for filtering out the "suspect positive" dat...
详细信息
In this paper, a relatively flexible filter called extended bilateral filter is proposed, by which some particular filters can be designed via selecting an appropriate pixel of interest (POI) and defining a kernel for...
详细信息
Fourier-Mellin transform (FMT) is frequently used in content-based image retrieval and digital image watermarking. This paper extends the application of FMT into image registration and proposes an improved registratio...
详细信息
Most of real-life scheduling problems are semi on-line scheduling,where we do not know all the time variables of jobs in ***,solving such dynamic problems is a hot topic of research in Constraint *** this paper we ana...
详细信息
Most of real-life scheduling problems are semi on-line scheduling,where we do not know all the time variables of jobs in ***,solving such dynamic problems is a hot topic of research in Constraint *** this paper we analyze the constraints in the semi on-line scheduling problems and introduce the concept of monotonic about constraints which appear in general dynamic constraint *** designed a generic dynamic constraint solving algorithm for solving the scheduling *** give an example of its application to semi on-line discrete resource-constrained scheduling problem(ship-loading problem).
In this article, we investigate the problem of preparing qualitative spatial relations before implementing spatial data mining by checking consistency in a constraint network, which includes topological and cardinal d...
详细信息
Intensity degradations are a familiar problem for fluorescein angiogram sequences. In this paper, we attempt to super-resolve a fluorescein angiogram, and to keep the high intensity pixels from degrading. To this end,...
详细信息
A voting-mechanism-based fuzzy neural network system is proposed in this paper. When constructing the network structure, a generalized class cover problem is presented and its two solving algorithm, an improved greedy...
详细信息
暂无评论