Iterative tensor voting for perceptual grouping of ill-defined curvilinear structures

In this paper, a novel approach is proposed for perceptual grouping and localization of ill-defined curvilinear structures. Our approach builds upon the tensor voting and the iterative voting frameworks. Its efficacy lies on iterative refinements of curvilinear structures by gradually shifting from an exploratory to an exploitative mode. Such a mode shifting is achieved by reducing the aperture of the tensor voting fields, which is shown to improve curve grouping and inference by enhancing the concentration of the votes over promising, salient structures. The proposed technique is validated on delineating adherens junctions that are imaged through fluorescence microscopy. However, the method is also applicable for screening other organisms based on characteristics of their cell wall structures. Adherens junctions maintain tissue structural integrity and cell-cell interactions. Visually, they exhibit fibrous patterns that may be diffused, heterogeneous in fluorescence intensity, or punctate and frequently perceptual. Besides the application to real data, the proposed method is compared to prior methods on synthetic and annotated real data, showing high precision rates.

First order augmentation to tensor voting for boundary inference and multiscale analysis in 3D

Most computer vision applications require the reliable detection of boundaries. In the presence of outliers, missing data, orientation discontinuities, and occlusion, this problem is particularly challenging. We propose to address it by complementing the tensor voting framework, which was limited to second order properties, with first order representation and voting. First order voting fields and a mechanism to vote for 3D surface and volume boundaries and curve endpoints in 3D are defined. Boundary inference is also useful for a second difficult problem in grouping, namely, automatic scale selection. We propose an algorithm that automatically infers the smallest scale that can preserve the finest details. Our algorithm then proceeds with progressively larger scales to ensure continuity where it has not been achieved. Therefore, the proposed approach does not oversmooth features or delay the handling of boundaries and discontinuities until model misfit occurs. The interaction of smooth features, boundaries, and outliers is accommodated by the unified representation, making possible the perceptual organization of data in curves, surfaces, volumes, and their boundaries simultaneously. We present results on a variety of data sets to show the efficacy of the improved formalism.

Range image statistics can explain the anomalous perception of length

A long-standing puzzle in visual perception is that the apparent extent of a spatial interval (e.g., the distance between two points or the length of a line) does not simply accord with the length of the stimulus but varies as a function of orientation in the retinal image. Here, we show that this anomaly can be explained by the statistical relationship between the length of retinal projections and the length of their real-world sources. Using a laser range scanner, we acquired a database of natural images that included the three-dimensional location of every point in the scenes. An analysis of these range images showed that the average length of a physical interval in three-dimensional space changes systematically as a function of the orientation of the corresponding interval in the projected image, the variation being in good agreement with perceived length. This evidence implies that the perception of visual space is determined by the probability distribution of the possible real-world sources of retinal images.

A hierarchical approach to feature extraction and grouping

In this paper, the problem of extracting and grouping image features from complex scenes is solved by a hierarchical approach based on two main processes: voting and clustering. Voting is performed for assigning a score to both global and local features. The score represents the evidential support provided by input data for the presence of a feature. Clustering aims at individuating a minimal set of significant local features by grouping together simpler correlated observations. It is based on a spatial relation between simple observations on a fixed level, i.e., the definition of a distance in an appropriate space. As the multilevel structure of the system implies that input data for an intermediate level are outputs of the lower level, voting can be seen as a functional representation of the "part-of" relation between features at different abstraction levels. The proposed approach has been tested on both synthetic and real images and compared with other existing feature grouping methods.