3D registration with maximal cliques
As a fundamental problem in computer vision, 3D point cloud registration (PCR) aims to
seek the optimal pose to align a point cloud pair. In this paper, we present a 3D registration …
seek the optimal pose to align a point cloud pair. In this paper, we present a 3D registration …
Teaser: Fast and certifiable point cloud registration
We propose the first fast and certifiable algorithm for the registration of two sets of three-
dimensional (3-D) points in the presence of large amounts of outlier correspondences. A …
dimensional (3-D) points in the presence of large amounts of outlier correspondences. A …
Simultaneous denoising, deconvolution, and demixing of calcium imaging data
EA Pnevmatikakis, D Soudry, Y Gao, TA Machado… - Neuron, 2016 - cell.com
We present a modular approach for analyzing calcium imaging recordings of large neuronal
ensembles. Our goal is to simultaneously identify the locations of the neurons, demix …
ensembles. Our goal is to simultaneously identify the locations of the neurons, demix …
Segmatch: Segment based place recognition in 3d point clouds
Place recognition in 3D data is a challenging task that has been commonly approached by
adapting image-based solutions. Methods based on local features suffer from ambiguity and …
adapting image-based solutions. Methods based on local features suffer from ambiguity and …
Sisa: Set-centric instruction set architecture for graph mining on processing-in-memory systems
M Besta, R Kanakagiri, G Kwasniewski… - MICRO-54: 54th Annual …, 2021 - dl.acm.org
Simple graph algorithms such as PageRank have been the target of numerous hardware
accelerators. Yet, there also exist much more complex graph mining algorithms for problems …
accelerators. Yet, there also exist much more complex graph mining algorithms for problems …
Truss decomposition in massive networks
J Wang, J Cheng - arxiv preprint arxiv:1205.6693, 2012 - arxiv.org
The k-truss is a type of cohesive subgraphs proposed recently for the study of networks.
While the problem of computing most cohesive subgraphs is NP-hard, there exists a …
While the problem of computing most cohesive subgraphs is NP-hard, there exists a …
Listing all maximal cliques in large sparse real-world graphs
D Eppstein, M Löffler, D Strash - Journal of Experimental Algorithmics …, 2013 - dl.acm.org
We modify an algorithm of Bron and Kerbosch [1973] for maximal clique enumeration to
choose more carefully the order in which the vertices are processed, giving us a fixed …
choose more carefully the order in which the vertices are processed, giving us a fixed …
[كتاب][B] Geometric and topological inference
JD Boissonnat, F Chazal, M Yvinec - 2018 - books.google.com
Geometric and topological inference deals with the retrieval of information about a geometric
object using only a finite set of possibly noisy sample points. It has connections to manifold …
object using only a finite set of possibly noisy sample points. It has connections to manifold …
JGraphT—A Java library for graph data structures and algorithms
Mathematical software and graph-theoretical algorithmic packages to efficiently model,
analyze, and query graphs are crucial in an era where large-scale spatial, societal, and …
analyze, and query graphs are crucial in an era where large-scale spatial, societal, and …
A survey on global lidar localization: Challenges, advances and open problems
Abstract Knowledge about the own pose is key for all mobile robot applications. Thus pose
estimation is part of the core functionalities of mobile robots. Over the last two decades …
estimation is part of the core functionalities of mobile robots. Over the last two decades …