Filters








60,280 Hits in 4.7 sec

Batch Dynamic Algorithm to Find k-Cores and Hierarchies [article]

Kasimir Gabert and Ali Pınar and Ümit V. Çatalyürek
2022 arXiv   pre-print
Finding k-cores in graphs is a valuable and effective strategy for extracting dense regions of otherwise sparse graphs.  ...  We focus on the important problem of maintaining cores on rapidly changing dynamic graphs, where batches of edge changes need to be processed quickly.  ...  INTRODUCTION An important problem in graph analysis is finding locally dense regions in globally sparse graphs.  ... 
arXiv:2203.13095v1 fatcat:x2faugj3sfbgfn4wxcdc4nzowq

Batch dynamic algorithm to find k -core hierarchies

Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek
2022 Proceedings of the 5th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)  
Finding 𝑘-cores in graphs is a valuable and effective strategy for extracting dense regions of otherwise sparse graphs.  ...  We focus on the important problem of maintaining cores on rapidly changing dynamic graphs, where batches of edge changes need to be processed quickly.  ...  Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc.,  ... 
doi:10.1145/3534540.3534694 fatcat:vy4ob5kl4ze3tlmrsqlaunlttm

Interactive image-based rendering using feature globalization

Daniel G. Aliaga, Dimah Yanovsky, Thomas Funkhouser, Ingrid Carlbom
2003 Proceedings of the 2003 symposium on Interactive 3D graphics - SI3D '03  
We first detect point features in a dense set of omnidirectional images captured on an eye-height plane.  ...  Among the potential correspondences, we select the maximal consistent set using a greedy graph-labeling algorithm.  ...  To vary the amount of globalization, we either change the region size or change the maximum number of iterations of the globalization algorithm.  ... 
doi:10.1145/641508.641511 fatcat:ruwfm6erd5esvd3ohuajmkx5u4

Interactive image-based rendering using feature globalization

Daniel G. Aliaga, Dimah Yanovsky, Thomas Funkhouser, Ingrid Carlbom
2003 Proceedings of the 2003 symposium on Interactive 3D graphics - SI3D '03  
We first detect point features in a dense set of omnidirectional images captured on an eye-height plane.  ...  Among the potential correspondences, we select the maximal consistent set using a greedy graph-labeling algorithm.  ...  To vary the amount of globalization, we either change the region size or change the maximum number of iterations of the globalization algorithm.  ... 
doi:10.1145/641480.641511 dblp:conf/si3d/AliagaYFC03 fatcat:3a63eebbrvczballgzlru3mapu

Sparse Tangential Network (SPARTAN): Motion planning for micro aerial vehicles

Hugh Cover, Sanjiban Choudhury, Sebastian Scherer, Sanjiv Singh
2013 2013 IEEE International Conference on Robotics and Automation  
We find that SPARTAN can navigate a vehicle autonomously through an outdoor environment producing plans 172 times faster than the state of the art (RRT*).  ...  Micro aerial vehicles operating outdoors must be able to maneuver through both dense vegetation and across empty fields. Existing approaches do not exploit the nature of such an environment.  ...  The work described in this paper is funded by the Office of Naval Research under grant number N00014-10-1-0715.  ... 
doi:10.1109/icra.2013.6630967 dblp:conf/icra/CoverCSS13 fatcat:czaxeylsmjgipbiws6nsjpezqm

Sparse Multilevel Roadmaps for High-Dimensional Robot Motion Planning [article]

Andreas Orthey, Marc Toussaint
2021 arXiv   pre-print
To this end, we represent multilevel abstractions using the language of fiber bundles, and generalize sparse roadmap planners by using the concept of restriction sampling with visibility regions.  ...  This changed with the advent of near-optimal sparse roadmaps [17] .  ...  Since uniform sampling on B with visibility regions will eventually cover the free base space [33] , π(U ) will be a subset of the visibility region of the graph on B.  ... 
arXiv:2011.00832v3 fatcat:4fz4gus2inav5e6orbrjyul5ie

On the non-trivial dynamics of complex networks

Ginestra Bianconi, Matteo Marsili, Fernando Vega-Redondo
2005 Physica A: Statistical Mechanics and its Applications  
Networks are relevant also for their dynamic properties. 1 The complexity of many systems arises precisely from the fact that the network of ARTICLE IN PRESS www.elsevier.com/locate/physa 0378-4371/$ -  ...  For example, static properties of networks-such as their scale-free nature [1] or the small world property [2]-are not only ubiquitous, but bear dramatic consequences on simple processes-such as epidemics  ...  In addition, for a range of parameters, the sparse and the dense network phase coexist, and the system exhibits hysteresis. In what follows, we shall first briefly review the findings of Ref.  ... 
doi:10.1016/j.physa.2004.08.057 fatcat:fyh6yiu3trgqxnobtangrjd3pm

Planning approaches to constraint-aware navigation in dynamic environments

Kai Ninomiya, Mubbasir Kapadia, Alexander Shoulson, Francisco Garcia, Norman Badler
2014 Computer Animation and Virtual Worlds  
We introduce two hybrid environment representations that balance computational efficiency and search space density to provide a minimal, yet sufficient, discretization of the search graph for constraint-aware  ...  The type of constraints specified can include staying behind a building, walking along walls, or avoiding the line of sight of patrolling agents.  ...  Citation of manufacturers or trade names does not constitute an official endorsement or approval of the use thereof. The U.S.  ... 
doi:10.1002/cav.1622 fatcat:m4zsgbb7c5bznlbq4twwjrkxbm

Structure Characteristics of the International Stock Market Complex Network in the Perspective of Whole and Part

Guangxi Cao, Yingying Shi, Qingchen Li
2017 Discrete Dynamics in Nature and Society  
Robustness is applied to analyze the stability of the network and the result shows that ISMN has robustness against random attack but intentional attack breaks the connection integrity of ISMN rapidly.  ...  International stock market forms an abstract complex network through the fluctuation correlation of stock price index. Past studies of complex network almost focus on single country's stock market.  ...  Acknowledgments The authors acknowledge the financial support from National Natural Science Foundation of China (nos. 71371100, 71271118, and 70901044) and the Humanities and  ... 
doi:10.1155/2017/9731219 fatcat:7id4tu2dgzcjbmz2jzzgnuke7m

Dense Active Appearance Models Using a Bounded Diameter Minimum Spanning Tree

Robert Anderson, Bjorn Stenger, Roberto Cipolla
2012 Procedings of the British Machine Vision Conference 2012  
We present a method for producing dense Active Appearance Models (AAMs), suitable for video-realistic synthesis.  ...  This is achieved by defining a graph on the image set whose edge weights correspond to registration errors and computing a bounded diameter minimum spanning tree (BDMST).  ...  We have demonstrated the use of a BDMST as a method for choosing these registrations.  ... 
doi:10.5244/c.26.131 dblp:conf/bmvc/AndersonSC12 fatcat:b6xi4pr52vdsbovsabpmwtdspe

Image webs: Computing and exploiting connectivity in image collections

Kyle Heath, Natasha Gelfand, Maks Ovsjanikov, Mridul Aanjaneya, Leonidas J. Guibas
2010 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition  
While earlier efforts studied local neighborhoods of such graphs, we are interested in understanding global structure and exploiting connectivity at larger scales.  ...  We propose building graphs called Image Webs to represent such connections.  ...  Acknowledgements The authors acknowledge the support of ONR grant N0001470710747, NSF grants CNS-0619926, CNS-0832820, and FODAVA 0808515, ARO grant W911NF-07-2-0027, and also the contributions of Nokia  ... 
doi:10.1109/cvpr.2010.5539991 dblp:conf/cvpr/HeathGOAG10 fatcat:to35olhmundkrbdqxv7q754jym

Self-supervised Dense 3D Reconstruction from Monocular Endoscopic Video [article]

Xingtong Liu, Ayushi Sinha, Masaru Ishii, Gregory D. Hager, Russell H. Taylor, Mathias Unberath
2019 arXiv   pre-print
We present a self-supervised learning-based pipeline for dense 3D reconstruction from full-length monocular endoscopic videos without a priori modeling of anatomy or shading.  ...  In a cross-patient study using CT scans as groundtruth, we show that our method is able to produce photo-realistic dense 3D reconstructions with submillimeter mean residual errors from endoscopic videos  ...  We change the Depth Consistency Loss of [8] from a normalized L2 loss to a dense log-likelihood loss.  ... 
arXiv:1909.03101v1 fatcat:wed2lc36kzdj5c4bbfnqlymte4

An Efficient Velocity Estimation Approach for Face Liveness Detection using Sparse Optical Flow Technique

N Nanthini, Annamalai University, Chidambaram, India, N Puviarasan, P Aruna
2021 Indian Journal of Science and Technology  
Findings: From the input video, the motion information of specific facial landmark points is captured by an optical flow algorithm.  ...  The Empirical study shows that the proposed face liveness detection model is effective with an accuracy of 88% and Half Total Error Rate (HTER) of 2.45.  ...  This graph shows the sudden and gradual changes that occur due to the 'shaking' action.  ... 
doi:10.17485/ijst/v14i25.942 fatcat:irzi3erfejh5xcctj5r2rn73vm

Frontier Detection and Reachability Analysis for Efficient 2D Graph-SLAM Based Active Exploration [article]

Zezhou Sun, Banghe Wu, Cheng-Zhong Xu, Sanjay E. Sarma, Jian Yang, Hui Kong
2020 arXiv   pre-print
to active exploration by exploiting the Cartographer method as the base SLAM module for submap creation and performing efficient frontier detection in the geometrically co-aligned submaps induced by graph  ...  Our method is tested on a mobile robot in real indoor scene to demonstrate the effectiveness and efficiency of our approach.  ...  Frontier detection refers to finding the boundary between an unknown area and a known region that is not occupied by obstacles in a map.  ... 
arXiv:2009.02869v1 fatcat:vkjv4shdvrh7vjswd23dg5juje

SpotLight

Dhivya Eswaran, Christos Faloutsos, Sudipto Guha, Nina Mishra
2018 Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD '18  
of large dense subgraphs (e.g., near bicliques) in near real-time using sublinear memory?  ...  In general, given a sequence of weighted, directed or bipartite graphs, each summarizing a snapshot of activity in a time window, how can we spot anomalous graphs containing the sudden appearance or disappearance  ...  illuminating a small enough region of the graph.  ... 
doi:10.1145/3219819.3220040 dblp:conf/kdd/EswaranFGM18 fatcat:g4yviy5fhnh5bhoe2rn6iplila
« Previous Showing results 1 — 15 out of 60,280 results