Interactive image segmentation is a process that extracts a foreground object from an image based on limited user input. In this paper, we propose a novel interactive image segmentation algorithm named Perfect Snapping which is inspired by the presented method named Lazy Snapping technique. In the algorithm, the mean shift algorithm with a boundary confidence prior is introduced to efficiently ...

We present a fault-tolerant algorithm that internally synchronizes clocks in multicomputer systems employing notcompletely connected networks (NCCNs). The algorithm is referred to as multistep interactive convergence, and is locally implemented in each node by a time server process (TSP). The algorithm proceeds in rounds, and bases its operation on a logical mapping of the system’s TSPs into an...

We give an overview of interactive methods developed for solving nonlinear multiobjective optimization problems. In interactive methods, a decision maker plays an important part and the idea is to support her/him in the search for the most preferred solution. In interactive methods, steps of an iterative solution algorithm are repeated and the decision maker progressively provides preference in...

Interactive Multi-Objective Optimisation is an increasing field of evolutionary and swarm intelligence-based algorithms. By involving a human decision, a set of relevant non-dominated points can often be acquired at significantly lower computational costs than with a posteriori algorithms. A rarely addressed issue in interactive optimisation is the design of efficient user interfaces and the ap...

This paper explores the application of interactive genetic algorithms to the creation of line drawings. We have built a system that mates or mutates drawings selected by the user to create a new generation of drawings. The initial population from which the user makes selections may be generated randomly or input manually. The process of selection and procreation is repeated many times to evolve...

Interactive evolution has shown the potential to create amazing and complex forms in both 2-D and 3-D settings. However, the algorithm is slow and users quickly become fatigued. We propose that the use of eye tracking for interactive evolution systems will both reduce user fatigue and improve evolutionary success. We describe a systematic method for testing the hypothesis that eye tracking driv...

We give a randomized linear-time algorithm for computing the majority tree, a technique widely used for summarizing sets of phylogenetic trees. We are implementing the algorithm as part of an interactive visualization system for analyzing large sets of

We describe an interactive search algorithm inspired by the immune system. The algorithm learns what parts of the search space are not useful to help a user explore large parameter spaces efficiently. The algorithm is capable of finding consensus solutions for parties with different selection criteria. A simple implementation of the algorithm applied to selecting Biomorphs (Dawkins 1986) is pre...