23,844 Hits in 4.7 sec

Using node merging to enhance graph coloring

Steven R. Vegdahl
1999 SIGPLAN notices  
We have enhanced Chaitin's coloring algorithm so that it attempts node-merging during graph simplification; this often allows simplification to continue, while still guaranteeing a coloring for the graph  ...  We observe that the merging of two nodes in a graph causes a reduction in the degree of any node that had been adjacent to both.  ...  ACKNOWLEDGEMENTS I am grateful to Gord Vreugdenhil and Max Hailperin for their comments on earlier drafts of this paper, and to Andrew Appel for making available his graph-coloring database [ 1 J.  ... 
doi:10.1145/301631.301657 fatcat:uaztedzazff4rai6nzqo3mholq

Geometry-Based Edge Clustering for Graph Visualization

Weiwei Cui, Hong Zhou, Huamin Qu, Pak Chung Wong, Xiaoming Li
2008 IEEE Transactions on Visualization and Computer Graphics  
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore.  ...  Users can further interact with the edge-clustering results through several advanced visualization techniques such as color and opacity enhancement.  ...  Fig. 8 . 8 Color and opacity enhancement: (a) an edge-clustered graph; (b) the graph after color and opacity enhancement.  ... 
doi:10.1109/tvcg.2008.135 pmid:18988974 fatcat:ankpac43arhpvedniq4jr344n4

Creating Integrated Evidence Graphs for Network Forensics [chapter]

Changwei Liu, Anoop Singhal, Duminda Wijesekera
2013 IFIP Advances in Information and Communication Technology  
Probabilistic evidence graphs can be used to model network intrusion evidence and the underlying dependencies to support network forensic analysis.  ...  This paper presents an algorithm for merging evidence graphs with or without a corresponding attack graph.  ...  Algorithm 2 uses an attack graph to merge evidence graphs that have missing evidence. It enhances Algorithm 1 by looking up the missing evidence in attack graph A.  ... 
doi:10.1007/978-3-642-41148-9_16 fatcat:j27xjfocvffszdchk2yghqvrbu

3D Edge Bundling for Geographical Data Visualization

Antoine Lambert, Romain Bourqui, David Auber
2010 2010 14th International Conference Information Visualisation  
preserving edge color.  ...  Visualization of graphs containing many nodes and edges efficiently is quite challenging since representations generally suffer from visual clutter induced by the large amount of edge crossings and node-edge  ...  Coloring edges: Another mean of enhancing edgebundled graph visualization is to use edges colors and opacities to encode informations.  ... 
doi:10.1109/iv.2010.53 dblp:conf/iv/LambertBA10 fatcat:mdkgpeiz7bc35j2bukgr2m3zra

Multistage graph-based segmentation of thoracoscopic images

Guillaume-Alexandre Bilodeau, Yueyun Shu, Farida Cheriet
2006 Computerized Medical Imaging and Graphics  
This paper presents a novel method of graph-based segmentation using multiple criteria in successive stages to segment thoracoscopic images acquired during a diskectomy procedure commonly used for thoracoscopic  ...  Starting with image pre-processing, including Gaussian smoothing, brightness and contrast enhancement, and histogram thresholding, a standard graph-based method is applied to produce a coarse segmentation  ...  Image pre-processing using Gaussian smoothing, brightness and contrast enhancement, color space conversion and specular reflections removal. 2.  ... 
doi:10.1016/j.compmedimag.2006.07.003 pmid:17029724 fatcat:fg4uhpl535hvde4sa6riczuobi

Winding Roads: Routing edges into bundles

A. Lambert, R. Bourqui, D. Auber
2010 Computer graphics forum (Print)  
Our method is based on the use of a grid built using the original graph to compute the edge rerouting.  ...  Visualizing graphs containing many nodes and edges efficiently is quite challenging.  ...  In [ Coloring edges : Another method of enhancing edgebundled graph visualization is to use edge colors and opacities to encode information.  ... 
doi:10.1111/j.1467-8659.2009.01700.x fatcat:tgghgjb2vza33fsbvgvo4g5pga

Code Flows: Visualizing Structural Evolution of Source Code

Alexandru Telea, David Auber
2008 Computer graphics forum (Print)  
drift, splits, merges, insertions and deletions.  ...  We enhance an existing visual metaphor to depict software structure changes with techniques that emphasize both following unchanged code as well as detecting and highlighting important events such as code  ...  Although colors get mixed at merge/split events, the repeated propagation causes split or merged code-flows to retain similar colors before and after the event.  ... 
doi:10.1111/j.1467-8659.2008.01214.x fatcat:5hljkzk75rfmtilezhyfcr7an4

Cascade Graph Neural Networks for RGB-D Salient Object Detection [article]

Ao Luo, Xin Li, Fan Yang, Zhicheng Jiao, Hong Cheng, Siwei Lyu
2020 arXiv   pre-print
In this paper, we study the problem of salient object detection (SOD) for RGB-D images using both color and depth information.A major technical challenge in performing salient object detection fromRGB-D  ...  Contrast to the previous approaches, the explicitly modeling and reasoning of high-level relations between complementary data sources allows us to better overcome challenges such as occlusions and ambiguities  ...  In this section, we elaborate on how to design a graph reasoning module and how to further enhance the capability of graph-based reasoning using the network cascade technique.  ... 
arXiv:2008.03087v1 fatcat:nrjn4fkk65bynf3yyzfjn4wimy

VarVis: Visualizing Anatomical Variation in Branching Structures [article]

Noeska Smit, Annelot Kraima, Daniel Jansma, Marco DeRuiter, Elmar Eisemann, Anna Vilanova
2016 EuroVis 2016 - Short Papers  
We propose a novel graph representation to provide an overview of the topological changes.  ...  After a selection is made, local topological differences can be interactively explored using illustrations and topology graphs.  ...  Acknowledgments We would like to thank Gerrit Rijken for the organ illustrations he designed for this application.  ... 
doi:10.2312/eurovisshort.20161160 dblp:conf/vissym/SmitKJDEV16 fatcat:km22s2lulvhfnnbh3fsziyeo64

SIGMA: A Semantic Integrated Graph Matching Approach for identifying reused functions in binary code

Saed Alrabaee, Paria Shirani, Lingyu Wang, Mourad Debbabi
2015 Digital Investigation. The International Journal of Digital Forensics and Incident Response  
The SIG s enhance and merge several existing concepts from classic program analysis, including control flow graph, register flow graph, and function call graph into a joint data structure.  ...  Such a comprehensive representation allows us to capture different semantic descriptors of common functionalities in a unified manner as graph traces, which can be extracted from binaries and matched to  ...  the node by merging nodes from the other graph into one node.  ... 
doi:10.1016/j.diin.2015.01.011 fatcat:6khwembtdrap5bgosy5zwcidpy


Miao Xie, Sourav S Bhowmick, Hao Su, Gao Cong, Wook-Shin Han
2018 Proceedings of the VLDB Endowment  
Unfortunately, end users in practice may not always have precise knowledge about the topological relationships between nodes in a query graph to formulate a connected query.  ...  graph.  ...  Using these merged nodes, it constructs a new connected graph called merged graph from G by "hiding" sm via merged nodes.  ... 
doi:10.14778/3229863.3236236 fatcat:v766icorxjeytlptioy7wpltou

An Emphasizing Approach based on Enhanced Intuitionistic Fuzzy Logic Segmentation on Objects in Video Sequences

D. ShanmugaPriyaa, S. Karthikeyan
2013 International Journal of Computer Applications  
Using such graph structures reduces our correspondence problem to a subgraph finest isomorphism problem.  ...  This system uses the Intuitionsitc fuzzy logic to employ a humanlike color perception in its decision making stage in order to handle color inconstancy.  ...  ACKNOWLEDGEMENTS The authors thank the management of Karpagam University for their kind support to do this article successfully and also they thank their friends for their support.  ... 
doi:10.5120/13043-0109 fatcat:2x33th3nfrgvvaka5rtgw5jxoe

Understanding the Scene Data- Pavement Area Grouping in Images

Sromona Chatterjee, Björn Hildebrandt, Lutz Maria Kolbe
2017 International Conference on Information Systems  
The approach is numerically simple, yet retains the ability to merge similar regions. Assignment with Hungarian method is used to achieve hierarchical region merging.  ...  We use an approach combining region similarity, split and merge, and pairwise assignment, to merge image regions according to a homogeneity criteria, and group pavement regions in images.  ...  The nodes selected within the graphs for the edge creation, as needed for merging, are obtained using closeness centrality to maintain the representation.  ... 
dblp:conf/icis/ChatterjeeHK17 fatcat:47ytintrebg4dodaacnxfzvxeu

Color Image Segmentation Based on Mean Shift and Normalized Cuts

Wenbing Tao, Hai Jin, Yimin Zhang
2007 IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)  
Furthermore, to avoid some inappropriate partitioning when considering every region as only one graph node, we develop an improved segmentation strategy using multiple child nodes for each region.  ...  In addition, the image clustering using the segmented regions, instead of the image pixels, also reduces the sensitivity to noise and results in enhanced image segmentation performance.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their valuable comments.  ... 
doi:10.1109/tsmcb.2007.902249 pmid:17926718 fatcat:aibnyh3ekzerdgntew2ndw3ahe

An Automatic Cognitive Graph-Based Segmentation for Detection of Blood Vessels in Retinal Images

Rasha Al Shehhi, Prashanth Reddy Marpu, Wei Lee Woon
2016 Mathematical Problems in Engineering  
., color and black top-hat (BTH) morphology and context) and graph-analysis algorithms (e.g., Dijkstra path).  ...  Preprocessing is to enhance lighting condition, due to low illumination contrast, and to construct necessary features to enhance vessel structure due to sensitivity of vessel patterns to multiscale/multiorientation  ...  Second is the merging/homogeneity criteria to group adjacent vertices/nodes to have connected components. The graph starts with color-layer and BTHlayer, followed by Dijkstra-layer.  ... 
doi:10.1155/2016/7906165 fatcat:m5rrkmkrgnbbfkjphbuqqcdz2i
« Previous Showing results 1 — 15 out of 23,844 results