5720205
Using Relevance Feedback in Content-Based Image Metasearch
MetaSeek is an image metasearch engine developed to explore the querying of large, distributed, online visual information systems. The current implementation integrates user feedback into a performance-ranking mechanism. MetaSeek selects and queries the target image search engines according to their success under similar query conditions in previous searches. The current implementation keeps track of each target engine's performance by integrating user feedback for each visual query into a performance database. We begin with a review of the issues in content-based visual query, then describe the current MetaSeek implementation. We present the results of experiments that evaluated the implementation in comparison to a previous version of the system and a baseline engine that randomly selects the individual search engines to query. We conclude by summarizing open issues for future research.
39945679
Iconic Language Design for People with Significant Speech and Multiple Impairments
34016873
Parsing 2D Languages by a Pictorial GLR Parser
6609571
Efficient Techniques for Feature-Based Image/Video Access and Manipulation
Efficient, effective methods for indexing, searching, and retrieving images and videos from large archives are critical techniques required in visual information systems (VIS) applications. Users need a more powerful method for searching images than just traditional text-based query (e.g., keywords). Manual creation of keywords is too time-consuming for many practical applications. Subjective descriptions based on users’ input will be neither consistent nor complete. Also, the vocabulary used in describing visual contents is usually domain specific.
35519508
Extending Visual Languages for Multimedia
Visual languages, which let users customize iconic sentences, can be extended to accommodate multimedia objects, letting users access media dynamically. Teleaction objects, or multimedia objects with knowledge structures, can be designed using visual languages to automatically respond to events and perform tasks like "find related books" in a virtual library.
23414354
An iconic query system with intensional feedback capabilities
In recent years the issue of the interaction between casual users and database systems has become increasingly important. Moreover, the introduction of multimedia and distributed databases has necessitated the design of querying systems capable of reducing unnecessary and costly accesses. The authors address these issues by proposing a visual query system based on (1) the extensive utilization of icons and natural language in order to facilitate the access and the understanding of the database and (2) the use of knowledge, or the intensional part of the database, in order to reduce the physical access to the actual data (extensional part). In their query system the perception of the database structure is made particularly easy by introducing the concept of generalized attribute.<<ETX>>
28693312
A new architecture for motion-compensated image coding
Abstract In motion-compensated image coding (MCIC), the block matching algorithm requires a very complex computational procedure. To overcome this problem, several fast search procedures have been proposed. However, the resultant errors for these procedures may be too large unless small displacement is assumed. In order to reduce the computational complexity and preserve the quality of the original image, a new architecture for MCIC without the small displacement assumption is proposed in this paper. Based on a so-called characteristic mapping, certain important features of the block will be extracted and matched in the space of features. Hence, the procedure of matching any two blocks is very much simplified and the time required is drastically reduced. Moreover, the simulation results indicate that its performance is superior to those fast search procedures based on the error between the reconstructed image and the original one. This property will result in low bit rates for transmitting the error frame.
15655721
The Worst-case Analysis of the MULTIFIT Algorithm for Scheduling Nonsimultaneous Parallel Machines
Abstract In this paper we consider the nonsimultaneous multiprocessor scheduling problem, or NMSP for short. The NMSP is a makespan minimization scheduling problem which involves the nonpreemptive assignment of independent jobs on m parallel machines with different starting times. It is well known that the longest processing time (LPT) algorithm and the modified LPT(MLPT) algorithm yield schedules with makespans bounded by 3 2 − 1 2m and 4/3 times the optimum makespan, respectively. In this paper, we show that the best known worst-case performance bound, 4/3 of the MLPT, is tight by constructing a worst-case example. Then, we employ the bin-packing heuristic algorithm called the MULTIFIT to solve the NMSP and show that the makespan of the schedule generated by the MULTIFIT algorithm is bounded by 9/7+2−k times the optimum makespan, where k is the selected number of the major iterations in the MULTIFIT. This worst-case bound of the MULTIFIT algorithm is, so far, the best bound for the NMSP and the tightness of the bound is still an open question.
44477744
Efficient selection of scheduling rule combination by combining design of experiment and ordinal optimization-based simulation
In a fab with heterogeneous machine groups, the number of scheduling policies grows in a combinatorial way because each machine group has its specific dispatching rules. In this paper, we design a fast simulation methodology by an innovative combination of the notions of ordinal optimization (OO) and design of experiments (DOE) to efficiently select a good scheduling policy for fab operation, Instead of finding the exact performance among scheduling policies, our approach compares their relative orders of performance to a specified level of confidence. The DOE method is exploited to largely reduce the number of scheduling policies to be evaluated by the OO-based simulation. Simulation results of applications to scheduling wafer fabrications show that most of the OO-based DOE simulations require 2 to 3 orders of magnitude less computation time than those of traditional approach, and the speedup is up to 7,000 times in certain cases.
7967901
The effect of machine availability on the worst-case performance of LPT
We consider the makespan minimization parallel machine scheduling problem where each machine may be unavailable for a known time interval. For this problem, we investigate how the worst-case behavior of the longest processing time first algorithm (LPT) is affected by the availability of machines. In particular, for given m machines, we analyze the cases where arbitrary number, λ, ranging from one to m - 1, machines are unavailable simultaneously. Then, we show that the makespan of the schedule generated by LPT is never more than the tight worst-case bound of 1 + ½ ⌊m/(m - λ)⌋ times the optimum makespan.
20494586
The implementation of a secure and pervasive multimodal Web system architecture
While most users currently access Web applications from Web browser interfaces, pervasive computing is emerging and offering new ways of accessing Internet applications from any device at any location, by utilizing various modes of interfaces to interact with their end users. The PC and its back-end servers remain important in a pervasive system, and the technology could involve new ways of interfacing with a PC and/or various types of gateways to back-end servers. In this research, cellular phone was used as the pervasive device for accessing an Internet application prototype, a multimodal Web system (MWS), through voice user interface technology. This paper describes how MWS was developed to provide a secure interactive voice channel using an Apache Web server, a voice server, and Java technology. Securing multimodal applications proves more challenging than securing traditional Internet applications. Various standards have been developed within a context of Java 2 Micro Edition (J2ME) platform to secure multimodal and wireless applications. In addition to covering these standards and their applicability to the MWS system implementation, this paper also shows that multimodal user-interface page can be generated by using XSLT stylesheet which transforms XML documents into various formats including XHTML, WML, and VoiceXML.