29798457
Adaptive Image Segmentation Using Modified Pulse Coupled Neural Network
This paper proposes a novel image segmentation algorithm based on Pulse Coupled Neural Network (PCNN).Unlike the traditional PCNN image segmentation methods, the presented algorithm can achieve the optimum parameters automatically. Experimental results show its good performance and robustness. The research fruits have great importance both on the theory research and practical application of PCNN.
35636017
A Novel Pixel-Level and Feature-Level Combined Multisensor Image Fusion Scheme
This paper proposes a novel image fusion scheme, which combines the merits of pixel-level and feature-level fusion algorithms. It avoids some of the well-known problems in pixel-level fusion such as blurring effects and high sensitivity to noise and misregistration. The algorithm first segments images into several regions, then extract features from each segmented region to get the fused image. Two typical image segmentation methods, region growing and edge detection based are both presented in this paper. Experimental results have demonstrated that the proposed method has extensive application scope and it outperforms the multiscale decompositions (MSD) based fusion approaches, both in visual effect and objective evaluation criteria.
7724537
Design and Implementation of GeoBrain Online Analysis System (GeOnAS)
GeOnAS is an extensible, scalable and powerful online geospatial analysis system based on Service Oriented Architecture (SOA), and is designed and implemented with the complementary technologies, Asynchronous JavaScript and XML (Ajax) and Web services, which greatly increase the interactive capabilities of graphical user interfaces and improve the user experience. It provides a highly interoperable way of accessing Open Geospatial Consortium (OGC) compliant web services for geospatial data discovery, retrieval, visualization and analysis, and leverages web service standards to enable service discovery, selection, negotiation and invocation for making more informed decisions.
26669443
Bottom-up discovery of frequent rooted unordered subtrees
In the past decade, XML has emerged as the standard language for information exchanging over the Internet. Due to its tree-structure paradigm, XML is superior for its capability of storing, querying, and manipulating complex data. Therefore, discovering frequent tree patterns over tree-structured data has become an interesting topic for XML data management. In this paper, we propose a tree mining algorithm, named BUXMiner, for finding a special class of frequent trees, called rooted unordered trees, from a tree-structured database. BUXMiner employs an efficient bottom-up approach to enumerate all candidate trees over a compact global tree guide and computes the frequent trees based on the tree guide. In addition to BUXMiner, we also propose a mining approach called BUMXMiner to discover the maximal frequent rooted unordered trees. We compare BUXMiner with previous tree-structure mining algorithms, namely XQPMinerTID and FastXMiner, which were also proposed to discover rooted unordered trees. The experimental results show that our algorithm outperforms XQPMinerTID and FastXMiner in terms of efficiency. The performance results from real-world applications also indicate the usefulness of our proposed tree mining algorithms in a variety of web applications, such as analysis of web page access patterns and mining frequent XML query patterns for caching.
42670703
A Latent Image Semantic Indexing Scheme for Image Retrieval on the Web
In this paper, we present a novel latent image semantic indexing scheme for efficient retrieval of WWW images. We present a hierarchical image semantic structure called HIST, which captures image semantics in an ontology tree and visual features in a set of specific semantic domains. The query algorithm works in two phases. First, the ontology is used for quickly locating the relevant semantic domains. Second, within each semantic domain, the visual features are extracted, and similarity techniques are exploited to break the “dimensionality curse”. The target images can then be efficiently retrieved with high precision. The experimental results show that HIST achieves good query performance. Therefore, our method is promising in diverse Web image retrieval.
1979432
Using Fault Injection and Modeling to Evaluate the Performability of Cluster-Based Services
We propose a two-phase methodology for quantifying the performability (performance and availability) of cluster-based Internet services. In the first phase, evaluators use a fault-injection infrastructure to measure the impact of faults on the server's performance. In the second phase, evaluators use an analytical model to combine an expected fault load with measurements from the first phase to assess the server's performability. Using this model, evaluators can study the server's sensitivity to different design decisions, fault rates, and environmental factors. To demonstrate our methodology, we study the performability of 4 versions of the PRESS Web server against 5 classes of faults, quantifying the effects of different design decisions on performance and availability. Finally, to further show the utility of our model, we also quantify the impact of two hypothetical changes, reduced human operator response time and the use of RAIDs.
13231021
Optimized Grey RBF Prediction Model Based on Genetic Algorithm
When combining grey system with RBF neural network, local optimization and convergence problems are still existed, so genetic algorithm is introduced to assist the modeling of grey neural network in this paper. Firstly, genetic algorithm is employed to solve the parameters of improved GM(1,1) with Lagrange's value theorem, and then RBF neural network is parallel connected to compensate errors. A new dynamic prediction model integrating genetic algorithm and grey RBF, for short GA-GRBF is proposed. This new model with preferable structure and parameters is applied to simulation and analysis of time-displacement data of wind response. The comparative experiment results show that this model is capable of predicting a small sample of data accurately, easily and conveniently.