Results 31 to 40 of about 2,474,612 (263)
Improved IMU Preintegration with Gravity Change and Earth Rotation for Optimization-Based GNSS/VINS
IMU preintegration technology has been widely used in the optimization-based sensor fusion framework, in order to avoid reintegrating the high-frequency IMU measurements at each iteration and maintain the ability of bias correction when bias estimation ...
Junxiang Jiang, Xiaoji Niu, Jingnan Liu
doaj +1 more source
Automated 3-D Retinal Layer Segmentation From SD-OCT Images With Neurosensory Retinal Detachment
Neurosensory retinal detachment (NRD) is a separation of the neurosensory retina from the retinal pigment epithelium (RPE) because of the subretinal fluid that can result in significant vision loss.
Loza Bekalo +8 more
doaj +1 more source
Incremental 3-D pose graph optimization for SLAM algorithm without marginalization
Pose graph optimization algorithm is a classic nonconvex problem which is widely used in simultaneous localization and mapping algorithm. First, we investigate previous contributions and evaluate their performances using KITTI, Technische Universität ...
Feng Youyang, Wang Qing, Yang Gaochao
doaj +1 more source
A survey of two-dimensional graph layout techniques for information visualisation [PDF]
Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
core +1 more source
A tightly coupled hybrid monocular visual SLAM system for unmanned underwater vehicles (UUVs) is introduced in this paper. Specifically, we propose a robust three-step hybrid tracking strategy.
Tiedong Zhang +6 more
doaj +1 more source
This paper provides a construction method of the nearest graph Laplacian to a matrix identified from measurement data of graph Laplacian dynamics that include biochemical systems, synchronization systems, and multi-agent systems. We consider the case where the network structure, i.e., the connection relationship of edges of a given graph, is known.
openaire +2 more sources
Rubbling and optimal rubbling of graphs
A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move one pebble is removed at vertices v and w adjacent to a vertex u and an extra pebble is added at vertex u. A vertex is reachable from a pebble distribution if it is
Christopher Belford, Nándor Sieben
openaire +4 more sources
The complexity of combinatorial optimization problems on d‐dimensional boxes [PDF]
The Maximum Independent Set problem in d-box graphs, i.e., in intersection graphs of axis-parallel rectangles in R-d, is known to be NP-hard for any fixed d >= 2.
Chlebikova, Janka +3 more
core +1 more source
Graph Optimization Model Fusing BLE Ranging with Wi-Fi Fingerprint for Indoor Positioning
To improve the user’s positioning accuracy of a Wi-Fi fingerprint-based positioning algorithm, this study proposes a graph optimization model based on the framework of g2o that fuses a Wi-Fi fingerprint and Bluetooth Low Energy (BLE) ranging technologies.
Rong Zhou +3 more
doaj +1 more source
Non-heuristic reduction of the graph in graph-cut optimization [PDF]
During the last ten years, graph cuts had a growing impact in shape optimization. In particular, they are commonly used in applications of shape optimization such as image processing, computer vision and computer graphics.
Malgouyres, François, Lermé, Nicolas
core +4 more sources

