This paper describes a sub-object retrieval system based on a segmentation method. We also use dynamic partial function (DPF) and indexing by locality sensitive hashing (LSH) for improving system performance. Such a s...
详细信息
This paper describes a sub-object retrieval system based on a segmentation method. We also use dynamic partial function (DPF) and indexing by locality sensitive hashing (LSH) for improving system performance. Such a system is useful for finding a sub-object from a large image database. In order to obtain the sub-object from a sample image, we use a segmentation method to cut out the object. The system utilizes the segmentation results to capture the higher-level concept of images and gets a stable and accurate result. Experimental and comparison results, which are performed using a general purpose database containing 20,000 images, are encouraging
In recently years there has been plenty of interest in Random Constraint Satisfaction Problem, both from an experimental and a theoretical point of view. In this paper we study and analyze the four popular problem ins...
详细信息
In recently years there has been plenty of interest in Random Constraint Satisfaction Problem, both from an experimental and a theoretical point of view. In this paper we study and analyze the four popular problem instance generating models, and present the extended model B+ based on the most used model B, which has the different domains and constraint tightness meeting some probability distribution function. In the subsequent section we give the relation matrix version of backtracking integrated forward checking algorithms, and introduce the implementation of instances generator and solver based on the new model. Finally we show the experiment results and conclude the paper, point that our extended model B+ has the common phase transition region with the transitional models and it has the advantage of being suited to the testing of heuristic based constraint solving algorithms, such as variables selection heuristic algorithms.
Fuzziness modeling for spatial data is currently an important problem in geographic information systems and spatial databases. In many geographical applications, spatial regions do not always have sharply defined boun...
详细信息
Fuzziness modeling for spatial data is currently an important problem in geographic information systems and spatial databases. In many geographical applications, spatial regions do not always have sharply defined boundaries but frequently their interiors and boundaries are fuzzy. A fuzzy spatial region model was proposed based on pleat set and the property of fuzzy regions was analyzed. The calculation method of relative membership of point in fuzzy region was given, and visualization model based on absolute membership value was proposed. The practical case shows that the model based on pleat set is valuable in the fields such as GIS, geography and spatial database.
In Containing Order Rough Set Methodology (CORS),terminologies on rules or rules set, such as robust, minimality,completeness, mutuality degree, and conflict are discussed. The rules generation algorithm IGRs is given...
详细信息
In Containing Order Rough Set Methodology (CORS),terminologies on rules or rules set, such as robust, minimality,completeness, mutuality degree, and conflict are discussed. The rules generation algorithm IGRs is given and the details of algorithm IGRs are studied. Heuristic knowledge, which is mutuality degree of a condition item with a decision part, is used to choose condition item when generating rules. In primary and modified IGRs, two kinds of mutuality degree,simple and weighted mutuality are introduced respectively. In addition, the variable precision method is used to solve the conflict problem in modified IGRs. By experiments, the effects of two kinds heuristic knowledge and different weight values in synthetic mutuality on algorithms properties are shown,such as time consumption, calculation precision etc. The performances of IGRs with the primary and new conflict solution are compared by experiments.
The conclusion is that the weighted mutuality degree is more sound and the choice of appropriate weight values in it are important to optimize the quality of rules set. The variable precision method for dealing with conflict when generating rules is more reasonable. Both two modifications to primary IGRs make the performance of IGRs enhanced and the quality of rules set better. Algorithm IGRs still need further improvement.
A hybrid discrete particle swarm algorithm is presented in this paper to solve open-shop problems. The operations are redefined in the discrete particle swarm algorithm. To improve the performance the simulated anneal...
详细信息
In Containing Order Rough Set Methodology (CORS), ordered attribute 'criterion' is introduced. Criterion is related semantically with decision attributes, which results in producing more rational and significa...
详细信息
ISBN:
(纸本)1424404754
In Containing Order Rough Set Methodology (CORS), ordered attribute 'criterion' is introduced. Criterion is related semantically with decision attributes, which results in producing more rational and significant rules utilizing dominance relations. In this paper, some terminologies and properties on rules or rules set, such as robust, minimal, complete are discussed, the state of art in algorithms on rules generation are analyzed, and algorithms GRs and IGRs are proposed. We compare these two algorithms by experiments in time complexity, rules count and accuracy. We find that GRs can generate all minimal rules, but time complexity is high and IGRs' efficiency is better, but quality of rules are inferior to that of GRs. We also discuss the completeness of rules set and present a viewpoint that there are three hierarchies for completeness. In accuracy calculation, three formulas for accuracy calculation and two approaches for experimental test are given.
The complex mapping z larr z a is important in dynamical application, but it is not received as much attention in the literature as the mapping z larr z a +c, for there is not fractal structure by using escape time a...
详细信息
The complex mapping z larr z a is important in dynamical application, but it is not received as much attention in the literature as the mapping z larr z a +c, for there is not fractal structure by using escape time algorithm. This paper utilizes a new method named as distance ratio iteration method and discusses the iteration properties of the complex mapping z larr z a . The distance ratio iteration method can render the convergence region of the mapping, so the image has complex and self-similarity structure. This paper generates fractal image using distance ratio iteration method for various exponents of z larr z a and discusses their visual properties. There is rich detail fractal structure in the mapping z larr z a
In this paper, we introduce the condition of distributed computing at present firstly. On this foundation, according to the analysis of particular case of distributed computing network, we implement a distributed netw...
详细信息
In this paper, we introduce the condition of distributed computing at present firstly. On this foundation, according to the analysis of particular case of distributed computing network, we implement a distributed network environment of P2P whose bottom layer frame is based on JXTA. It improves issuing method of message based on pipeline decomposition mechanism of task based on usage ratio of processor and distributed mechanism of object based on serialization. We build an improved distributed computing network platform on the platform of Linux and Windows and simulate a distributed computing environment. The simulated experiment proves the feasibility and the validity of the distributed network computing platform that is constructed in this paper
Large scale terrain visualization with high- resolution has an increasing demand in many research fields. To realize the efficient rendering of terrain, this paper presents an out-of-core terrain visualization method ...
详细信息
Large scale terrain visualization with high- resolution has an increasing demand in many research fields. To realize the efficient rendering of terrain, this paper presents an out-of-core terrain visualization method based on multi-resolution storage techniques. In external memory, the terrain data set is subdivided from top to bottom to build a multi-resolution hierarchical structure based on a quad-tree. The hierarchical structure can decimate the elevation data that must be loaded into internal memory. Thus it can improve the efficiency of I/O access greatly. Moreover, in order to implement rapid data retrieval of the real time terrain flyover, an efficient indexing algorithm is proposed, in which those nodes in the hierarchical structure will be divided into several clusters in terms of the similarities of static error and the closed space constraint. In addition, a method for crack-free is also proposed here. The comprehensive experiment conducted on the GTOP30 data set shows that this approach outperforms the Block and the Hierarchy algorithms in the both ways of efficiency and simplification ratio.
暂无评论