Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Active learning (1)
- Ambiguous answer (1)
- Animated Mosaics (1)
- Classic Mosaics (1)
- Community Mining (1)
-
- Computer Graphics (1)
- Computer Vision (1)
- Discrete optimization (1)
- Energy Optimization (1)
- Energy minimization (1)
- Generalized queries (1)
- Graph Cuts (1)
- Graph cuts (1)
- K-means (1)
- Labeling cost (1)
- Link Analysis (1)
- Metric labeling (1)
- Minimum description length (1)
- Multi-Agent cooperation (1)
- Online Social Network (1)
- Oracle (1)
- Query Categorization (1)
- Query Extension (1)
- Segmentation (1)
- Stereo (1)
- Text Categorization (1)
- Visual Correspondence (1)
- Web Search (1)
- Workflow-net (1)
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
Classic Mosaics And Visual Correspondence Via Graph-Cut Based Energy Optimization, Yu Liu
Classic Mosaics And Visual Correspondence Via Graph-Cut Based Energy Optimization, Yu Liu
Electronic Thesis and Dissertation Repository
Computer graphics and computer vision were traditionally two distinct research fields focusing on opposite topics. Lately, they have been increasingly borrowing ideas and tools from each other. In this thesis, we investigate two problems in computer vision and graphics that rely on the same tool, namely energy optimization with graph cuts.
In the area of computer graphics, we address the problem of generating artificial classic mosaics, still and animated. The main purpose of artificial mosaics is to help a user to create digital art. First we reformulate our previous static mosaic work in a more principled global optimization framework. Then, …
Improving Search Engine Results By Query Extension And Categorization, Guo Mei
Improving Search Engine Results By Query Extension And Categorization, Guo Mei
Electronic Thesis and Dissertation Repository
Since its emergence, the Internet has changed the way in which information is distributed and it has strongly influenced how people communicate. Nowadays, Web search engines are widely used to locate information on the Web, and online social networks have become pervasive platforms of communication.
Retrieving relevant Web pages in response to a query is not an easy task for Web search engines due to the enormous corpus of data that the Web stores and the inherent ambiguity of search queries. We present two approaches to improve the effectiveness of Web search engines. The first approach allows us to retrieve …
Advances In Graph-Cut Optimization: Multi-Surface Models, Label Costs, And Hierarchical Costs, Andrew T. Delong
Advances In Graph-Cut Optimization: Multi-Surface Models, Label Costs, And Hierarchical Costs, Andrew T. Delong
Electronic Thesis and Dissertation Repository
Computer vision is full of problems that are elegantly expressed in terms of mathematical optimization, or energy minimization. This is particularly true of "low-level" inference problems such as cleaning up noisy signals, clustering and classifying data, or estimating 3D points from images. Energies let us state each problem as a clear, precise objective function. Minimizing the correct energy would, hypothetically, yield a good solution to the corresponding problem. Unfortunately, even for low-level problems we are confronted by energies that are computationally hard—often NP-hard—to minimize. As a consequence, a rather large portion of computer vision research is dedicated to proposing …
Active Learning With Generalized Queries, Jun Du
Active Learning With Generalized Queries, Jun Du
Electronic Thesis and Dissertation Repository
We study active learning with generalized queries in the thesis.
In contrast to supervised learning, active learning can usually achieve the same predictive accuracy with much fewer labeled training examples, thus significantly reducing the labeling cost. However, previous studies of active learning mostly assume that the learner can only ask specific queries (i.e., require labels for specific examples by providing all feature values). For instance, if the task is to predict osteoarthritis based on a patient data set with 30 features, the previous active learners could only ask the specific queries as: does this patient have osteoarthritis, if ID is …
Workflow-Net Based Cooperative Multi-Agent Systems, Yehia T. Kotb
Workflow-Net Based Cooperative Multi-Agent Systems, Yehia T. Kotb
Electronic Thesis and Dissertation Repository
Workflow-nets are mathematical frameworks that are used to formally describe, model and implement workflows. First, we propose critical section workflow nets (abbreviated WFCSnet). This framework allows feedbacks in workflow systems while ensuring the soundness of the workflow. Feedback is generally not recommended in workflow systems as they threaten the soundness of the system. The proposed WFCSnet allows safe feedback and limits the maximum number of activities per workflow as required. A theorem for soundness of WFCSnet is presented. Serializability, Separability, Quasi-liveness and CS-Properties of WFCSnet are examined and some theorems and lemmas are proposed to mathematically formalize them. In this …