A network for the perception of illusory contours inspired from neurophysio-logical and psychophysical ndings is proposed, incorporating a relaxation phase labeling and diiusion process. The network groups visual features into perceptual entities by (de)synchronising parametric phase labels of simple neuronal oscillators using a constraint satisfaction mechanism. The local constraints between f...

We propose a method of image segmentation by integrating pairwise attraction and directional repulsion derived from local grouping and figure-ground cues. These two kinds of pairwise relationships are encoded in the real and imaginary parts of an Hermitian graph weight matrix, through which we can directly generalize the normalized cuts criterion. With bi-graph constructions, this method can be...

In this paper, we propose a novel method to address the segmentation problem of multiple independently moving objects. Based on the fact that multiple objects’ trajectories correspond to multiple independent subspaces, first, bases of these subspaces are extracted by applying independent subspace analysis (ISA). Then, these bases are grouped properly after evaluating the correlation coefficient...

An L-vertex, the point at which two contours coterminate, provides highly reliable evidence that a surface terminates at that vertex, thus providing the strongest constraint on the extraction of shape from images (Guzman, 1968). Such vertices are pervasive in our visual world but the importance of a statistical regularity about them has been underappreciated: The contours defining the vertex ar...

Contour detection has been extensively investigated as a fundamental problem in computer vision. In this study, a biologically-inspired candidate weighting framework is proposed for the challenging task of detecting meaningful contours. In contrast to previous models that detect contours from pixels, a modified superpixel generation processing is proposed to generate a contour candidate set and...

We present five performance measures to evaluate grouping modules in the context of constrained search and indexing based object recognition. Using these measures, we demonstrate a sound experimental framework, based on statistical ANOVA tests, to compare and contrast three edge based organization modules, namely, those of Etemadi et al., Jacobs, and Sarkar-Boyer in the domain of aerial objects...

The problem of recovering the 3-D camera and scene structure has been intensively studied and is considered well understood. Starting with two images, a process of establishing point correspondences is usually followed by the estimation of epipolar geometry while also rejecting outlier matches, and finally by 3-D structure estimation. However, most existing methods tend to fail in the combined ...

Network based on distributed caching of content is a new architecture to alleviate the ongoing explosive demands for rate of multi-media traffic. In caching networks, coded caching is a recently proposed technique that achieves significant performance gains compared to uncoded caching schemes. In this paper, we derive a lower bound on the average rate with a memory constraint for a family of ca...

The 8-coin insight problem requires the problem solver to move 2 coins so that each coin touches exactly 3 others. Ormerod, MacGregor, and Chronicle (2002) explained differences in task performance across different versions of the 8-coin problem using the availability of particular moves in a 2-dimensional search space. We explored 2 further explanations by developing 6 new versions of the 8-co...

The most important challenge in Wireless Sensor Networks (WSNs) is the energy constraint. Numerous solutions have been proposed to alleviate this problem, the most efficient of which is to cluster the sensor nodes. Although clustering in the realm of WSNs has widely been explored by researchers, a few effective mechanisms in grouping the nodes, including coalitional games, need more attention a...