A number of leading theories (e.g., Grossberg & Mingolla, 1985; Kellman & Shipley, 1991; Rensink & Enns, 1995) commonly assume that perceptual grouping by contour alignment occurs preattentively across reversing contrast polarity elements. We examined this notion in seven visual search experiments. We found that only grouping by attachment supported preattentive visual search and that grouping ...

Many time-critical applications require dynamic scheduling with predictable performance. Tasks corresponding to these applications have deadlines to be met despite the presence of faults. In this paper, we propose a technique called dynamic grouping, to be used with backup overloading in a primary-backup based fault-tolerant dynamic scheduling algorithm in multiprocessor real-time systems. In d...

Many time-critical applications require dynamic scheduling with predictable performance. Tasks corresponding to these applications have deadlines to be met despite the presence of faults. In this paper, we propose a technique called dynamic grouping, to be used with backup overloading in a primary-backup based fault-tolerant dynamic scheduling algorithm in multiprocessor real-time systems. In d...

Perceptual grouping is a pre-attentive process which serves to group local elements into global wholes, based on shared properties. One effect of perceptual grouping is to distort the ability to estimate the distance between two elements. In this study, biases in distance estimates, caused by four types of perceptual grouping, were measured across three tasks, a perception, a drawing and a cons...

The concept of grouping in relational algebra is well-known from its connection to aggregation. In this paper we generalize the grouping notion by defining a simultaneous grouping of more than one relation, and we discuss the application of operations on grouping elements other than just arithmetic aggregation. Finally we show that this grouping mechanism can be added to relational algebra with...

If a robot is supposed to roam an environment and interact with objects, it is often necessary to know all possible objects in advance, so that a database with models of all objects can be generated for visual identification. However, this constraint cannot always be fulfilled. Due to that reason, a model based object recognition cannot be used to guide the robots interactions. Therefore, this ...

Contemporary user interface development systems greatly simplify the creation of traditional dialogue user interface made of buttons or menus, but they do not support the construction and manipulation of application-specific graphical objects. This report describes Rollit, a domain-specific, interactive, application builder. The goal of this system is to automatically generate, as a result of d...

To reduce the implementation complexity of a belief propagation (BP) based low-density parity-check (LDPC) decoder, shuffled BP decoding schedules, which serialize the decoding process by dividing a complete parallel message-passing iteration into a sequence of sub-iterations, have been proposed. The so-called group horizontal shuffled BP algorithm partitions the check nodes of the code graph i...

We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their “length”. The algorithm inherits the perceptual grouping approaches. But, instead of using only local cues, a global constraint is imposed to each extracted subset of edgels, that the underlying curve belongs to a specific class. In order to reduce the complexity of the solut...

In this paper, we proposed a new segmentation-and-grouping framework for road map inference from sparsely-sampled GPS traces. First, we extended DBSCAN with the orientation constraint to partition the whole point set of traces to clusters representing road segments. Second, we proposed an adaptive k-means algorithm that the k value is determined by an angle threshold to reconstruct nearly strai...