Adjacency list

About: Adjacency list is a research topic. Over the lifetime, 4419 publications have been published within this topic receiving 78449 citations.

Topology Preserved Regular Superpixel

Abstract: Most existing super pixel algorithms ignore the topology and regularities, which results in undesirable sizes and location relationships for subsequent processing. In this paper, we introduce a new method to compute the regular super pixels while preserving the topology. Start from regular seeds, our method relocates them to the pixel with locally maximal edge magnitudes. Then, we find the local optimal path between each relocated seed and its four neighbors using Dijkstra algorithm. Thanks to the local constraints, our method obtains homogeneous super pixels with explicit adjacency in low-texture and uniform regions and, simultaneously, maintains the edge cues in the high contrast and salient contents. Quantitative and qualitative experimental results on Berkeley Segmentation Database Benchmark demonstrate that our proposed algorithm outperforms the existing regular super pixel methods.

The permanental polynomial.

Abstract: This study identifies properties and uses of the permanental polynomial of adjacency matrixes of unweighted chemical graphs Coefficients and zeroes of the polynomial for several representative structures are provided, and their properties are discussed A computer program for calculating the permanental polynomial from the adjacency matrix is also described

The quadcode and its arithmetic

Abstract: The quadcode is a hierarchical data structure for describing digital images It has the following properties: (1) straightforward representation of dimension, size, and the relationship between an image and its subsets; (2) explicit description of geometric properties, such as location, distance, and adjacency; and (3) ease of conversion from and to raster representation The quadcode has applications to computer graphics and image processing because of its ability to focus on selected subsets of the data and to allow utilization of multiple resolutions in different parts of the image A related approach is the quadtree Samet recently presented a thorough survey of the literature in that field [7] Gargantini [2] and Abel and Smith [1] presented linear quadtrees and linear locational keys that are efficient labeling techniques for quadtrees In those papers the geometric concepts of the image are discussed by using the tree as an interpretive medium, and the approaches and procedures are based on traversal of the nodes in the tree In this paper we present the quadcode system, which is a direct description of the image, and discuss the geometric concepts in terms of the coded images themselves

Efficient traversal of mesh edges using adjacency primitives

Abstract: Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We present a scheme for efficient traversal of mesh edges that builds on the adjacency primitives and programmable geometry shaders introduced in recent graphics hardware. Our scheme aims to minimize the number of primitives while maximizing SIMD parallelism. These objectives reduce to a set of discrete optimization problems on the dual graph of the mesh, and we develop practical solutions to these graph problems. In addition, we extend two existing vertex cache optimization algorithms to produce cache-efficient traversal orderings for adjacency primitives. We demonstrate significant runtime speedups for several practical real-time rendering algorithms.

Compressed virtual routing and forwarding in a communications network

Abstract: In one embodiment, an apparatus includes a plurality of network site interfaces in communication with two or more networks, each of the networks associated with a different Virtual Routing and Forwarding (VRF) instance, and a processor configured for mapping the VRF instances to an Interior Gateway Protocol (IGP) adjacency and transmitting VRF information on the IGP adjacency along with a VRF identifier indicating the network associated with the VRF information. A method is also disclosed.