Node-link diagrams are widely used in information visualization to show relationships among data. However, when the size of data becomes very large, node-link diagrams will become cluttered and visually confusing for users. In this paper, we propose a novel controllable edge clustering method based on Delaunay triangulation to reduce visual clutter for node-link diagrams. Our method uses curves...

We propose a biologically motivated computational step, called non-classical receptive field (non-CRF) inhibition, to improve contour detection in images of natural scenes. We augment a Gabor energy operator with non-CRF inhibition. The resulting contour operator responds strongly to isolated lines, edges, and contours but exhibits a weaker or no response to edges that make part of texture. As ...

The primary visual cortex employs simple, complex and end-stopped cells to create a scale space of 1D singularities (lines and edges) and of 2D singularities (line and edge junctions and crossings called keypoints). In this paper we show first results of a biological model which attributes information of the local image structure to keypoints at all scales, ie junction type (L, T, +) and main l...

In this study, a new approach to edge detection on images, corrupted with Gaussian and impulsive noise, is presented. The concept, under the decomposition of image with its principal component being an analysis on local pixel grouping for noise suppression, called LPGPCA based denoising, is adopted in order to obtain noiseless gradient maps for edge extraction. As a result, an algorithm has bee...

Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...

one of the generalizations of the wiener number to weighted graphs is to assign probabilities to edges, meaning that in nonstatic conditions the edge is present only with some probability. the reliability wiener number is defined as the sum of reliabilities among pairs of vertices, where the reliability of a pair is the reliability of the most reliable path. closed expressions are derived for t...

Abstract Smaller and more complex three-dimensional periodic nanostructures are part of the next generation integrated electronic circuits. Additionally, decreasing dimensions increases effect line-edge roughness on performance nanostructures. Efficient methods for characterizing required process control. Here, extreme-ultraviolet (EUV) scatterometry is exploited analysis from In line with prev...

although host species generally face increased risk of brood parasitism in fragmented temperate landscapes and forest edge, little information exists to assess such risks in tropical birds. we studied how cuculidae species populations, host species population, and micro-environmental variables changed along an edge-to-interior gradient in peninsular malaysia. bird observations and environmental...

This paper describes a vectorial representation that can be used to assess the symmetry of objects in 2D images. The method exploits the calculus of vector fields. Commencing from the gradient field extracted from filtered grey-scale images we construct a vector potential. Our image representation is based on the distribution of tangential gradient vectors residing on the image plane. By embedd...