62548744
Hidden semantic concept discovery in region based image retrieval
This work addresses content based image retrieval (CBIR), focusing on developing a hidden semantic concept discovery methodology to address effective semantics-intensive image retrieval. In our approach, each image in the database is segmented to region; associated with homogenous color, texture, and shape features. By exploiting regional statistical information in each image and employing a vector quantization method, a uniform and sparse region-based representation is achieved. With this representation a probabilistic model based on statistical-hidden-class assumptions of the image database is obtained, to which expectation-maximization (EM) technique is applied to analyze semantic concepts hidden in the database. An elaborated retrieval algorithm is designed to support the probabilistic model. The semantic similarity is measured through integrating the posterior probabilities of the transformed query image, as well as a constructed negative example, to the discovered semantic concepts. The proposed approach has a solid statistical foundation and the experimental evaluations on a database of 10,000 general-purposed images demonstrate its promise of the effectiveness.
62753126
A Bayesian framework for automatic concept discovery in image collections
This paper develops a Bayesian framework for automatic hidden semantic concept discovery to address effective semantics-intensive content-based image retrieval. Each image in the database is segmented to regions associated with homogenous color, texture, and shape features. By employing self-organization map learning, a uniform and sparse region-based representation is obtained. With this representation a probabilistic model based on the statistical-hidden-class assumptions of the image database is developed, to which expectation-maximization technique is applied to analyze semantic concepts hidden in the database. An elaborated retrieval algorithm is designed to support the probabilistic model. The semantic similarity is measured through integrating the posterior probabilities of the transformed query image, as well as a constructed negative vector, to the discovered semantic concepts. The proposed approach has a solid statistical foundation and the experimental evaluations on a database of 10,000 general-purposed images demonstrate its promise of the retrieval effectiveness.
3159534
FAST: Toward more effective and efficient image retrieval
This paper focuses on developing a Fast And Semantics-Tailored (FAST) image retrieval methodology. Specifically, the contributions of FAST methodology to the CBIR literature include: (1) development of a new indexing method based on fuzzy logic to incorporate color, texture, and shape information into a region-based approach to improving the retrieval effectiveness and robustness; (2) development of a new hierarchical indexing structure and the corresponding hierarchical, elimination-based A* retrieval (HEAR) algorithm to significantly improve the retrieval efficiency without sacrificing the retrieval effectiveness; it is shown that HEAR is guaranteed to deliver a logarithm search in the average case; (3) employment of user relevance feedback to tailor the effective retrieval to each user's individualized query preference through the novel indexing tree pruning (ITP) and adaptive region weight updating (ARWU) algorithms. Theoretical analysis and experimental evaluations show that FAST methodology holds great promise in delivering fast and semantics-tailored image retrieval in CBIR.
1852867
Semantic repository modeling in image database
This work is about content based image database retrieval, focusing on developing a classification based methodology to address semantics-intensive image retrieval. With self organization map based image feature grouping, a visual dictionary is created for color, texture, and shape feature attributes, respectively. Labeling each training image with the keywords in the visual dictionary, a classification tree is built. Based on the statistical properties of the feature space we define a structure, called /spl alpha/-semantics graph, to discover the hidden semantic relationships among the semantic repositories embodied in the image database. With the /spl alpha/-semantics graph, each semantic repository is modeled as a unique fuzzy set to explicitly address the semantic uncertainty and the semantic overlap existing among the repositories in the feature space. A retrieval algorithm combining the classification tree with the fuzzy set models to deliver semantically relevant image retrieval is provided. The experimental evaluations have demonstrated that the proposed approach models the semantic relationships effectively and outperforms a state-of-the-art content based image retrieval system in the literature both in effectiveness and efficiency.
5682515
Addressing CBIR efficiency, effectiveness, and retrieval subjectivity simultaneously
This work is about Content Based Image Retrieval (CBIR), focusing on developing a Fast And Semantics-Tailored (FAST) image retrieval methodology. Specifically, the contributions of FAST methodology to the CBIR literature include: (1) development of a new indexing method based on fuzzy logic to incorporate color, texture, and shape information into a region based approach to improving the retrieval effectiveness and robustness (2) development of a new hierarchical indexing structure and the corresponding Hierarchical, Elimination-based A* Retrieval algorithm (HEAR) to significantly improve the retrieval efficiency without sacrificing the retrieval effectiveness; it is shown that HEAR is guaranteed to deliver a logarithm search in the average case (3) employment of user relevance feedbacks to tailor the semantic retrieval to each user's individualized query preference through the novel Indexing Tree Pruning (ITP) and Adaptive Region Weight Updating (ARWU) algorithms. Theoretical analysis and experimental evaluations show that FAST methodology holds a great promise in delivering fast and semantics-tailored image retrieval in CBIR.
8272087
OGSA-based grid workload monitoring
In heterogeneous and dynamic distributed systems like the grid, detailed monitoring of workload and its resulting system performance (e.g. response time) is required to facilitate performance diagnosis and adaptive performance tuning. In this paper, we present a workload monitoring infrastructure for this purpose. The infrastructure classifies and monitors workload across components in grids based on the open grid service architecture (OGSA) in an end-to-end manner. It provides the abilities to assess what components are involved in processing a work unit, to report time elapsed at these components, and to capture concurrency and isolate which components are critical to overall performance observed. These are enclosed in an automatically constructed Response Time Service Petri Net (RT-SPN) model. A tool is provided to accept queries about work units and visualise corresponding RTSPNs. The infrastructure is also designed and implemented so as to be portable, scalable and lightweight.
17591841
State encoding of finite-state machines targeting threshold and majority logic based implementations with application to nanotechnologies
In this paper, we address the problem of state encoding of finite-state machines (FSMs) targeting threshold and majority logic based implementations, which have applications in nanotechnologies. Previous work on state encoding is based on Boolean logic. These methods try to optimize either the literal count or sum-of-product (SOP) terms count, which are more relevant for CMOS technology based circuits. As progress is made in the material and physical understanding of nanoscale devices, functionally-correct nanoscale circuits based on threshold and majority gates are being successfully demonstrated. However, there exists no methodology or design automation tool for state encoding targeting threshold and majority gate based implementations. We propose such a methodology based on an evolutionary algorithm. Experimental results indicate that large reductions in gate count, area and interconnect count are possible, compared to some traditional state encoding methods.
9661168
Synthesis of majority and minority networks and its applications to QCA, TPL and SET based nanotechnologies
In this paper, we present a methodology for efficient majority/minority network synthesis of arbitrary multioutput Boolean functions. Many emerging nanoscale technologies, such as quantum cellular automata (QCA), tunneling phase logic (TPL), and single electron tunneling (SET), are capable of implementing majority or minority logic very efficiently. However, there exists no comprehensive methodology or design automation tool for general multilevel majority/minority network synthesis. We have built the first such tool, majority logic synthesizer (MALS), on top of an existing Boolean logic synthesis tool. We have performed experiments with 40 MCNC benchmarks. They indicate that up to 68.0% reduction in gate count is possible when utilizing majority logic, with the average reduction being 21.9%, compared to traditional logic synthesis, in which two-input AND/OR gates in the circuit are converted to majority gates.
10950819
An Efficient Sequential RBF Network for Gene Expression-Based Multi-category classification
This paper presents a fast and efficient sequential learning method for RBF networks that can perform classification directly for multi-category cancer diagnosis problems based on microarray data. The recently developed algorithm, referred to as Fast Growing And Pruning-RBF (FGAP-RBF) can perform incremental learning on the future data directly. No training of all the previous data is needed. This character can reduce the learning complexity and improve the learning efficiency and is greatly favored in the real implementation of a gene expression-based cancer diagnosis system. We have evaluated FGAP-RBF algorithm on a benchmark multi-category cancer diagnosis problem based on microarray data, namely GCM dataset. The results indicate that compared with the results available in literature FGAP-RBF algorithm produces a higher classification accuracy with reduced training time and implementation complexity.
43789567
A Self-Organizing Flock of Condors