Results 21 to 30 of about 714,042 (275)

Incremental 3-D pose graph optimization for SLAM algorithm without marginalization

International Journal of Advanced Robotic Systems, 2020
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

Dimensionality Reduction via Multiple Locality-Constrained Graph Optimization

IEEE Access, 2018
In recent years, graph-based dimensionality reduction methods became increasingly more significant since they have been successfully applied in various computer vision and machine learning problems.
Caixia Zheng, Rui Zhao, Fucong Liu, Jun Kong, Jianzhong Wang, Chao Bi, Yugen Yi   +6 more
doaj   +1 more source

Optimal pebbling of graphs

Discrete Mathematics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jessica Muntz, Sivaram Narayan, Noah Streib, Kelly Van Ochten   +3 more
openaire   +1 more source

Optimal Control for Diffusions on Graphs [PDF]

SIAM Journal on Discrete Mathematics, 2018
32 pages, 2 ...
Laura Florescu, Yuval Peres, Miklós Z. Rácz   +2 more
openaire   +2 more sources

Automated 3-D Retinal Layer Segmentation From SD-OCT Images With Neurosensory Retinal Detachment

IEEE Access, 2019
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, Sijie Niu, Xiaojun He, Ping Li, Idowu Paul Okuwobi, Chenchen Yu, Wen Fan, Songtao Yuan, Qiang Chen   +8 more
doaj   +1 more source

Discrete Optimal Graph Clustering [PDF]

IEEE Transactions on Cybernetics, 2020
Graph based clustering is one of the major clustering methods. Most of it work in three separate steps: similarity graph construction, clustering label relaxing and label discretization with k-means. Such common practice has three disadvantages: 1) the predefined similarity graph is often fixed and may not be optimal for the subsequent clustering.
Yudong Han, Lei Zhu 0002, Zhiyong Cheng 0001, Jingjing Li 0001, Xiaobai Liu   +4 more
openaire   +3 more sources

Local optimization on graphs

Discrete Applied Mathematics, 1989
This paper is devoted to the study of the complexity of finding a local optimum of an arbitrary function over a neighborhood graph. Some kind of two-person game is introduced to yield an estimation of the amount of work needed to find a local optimum.
Donna Crystal Llewellyn, Craig A. Tovey, Michael A. Trick   +2 more
openaire   +1 more source

Hierarchical Instance Recognition of Individual Roadside Trees in Environmentally Complex Urban Areas from UAV Laser Scanning Point Clouds

ISPRS International Journal of Geo-Information, 2020
Individual tree segmentation is essential for many applications in city management and urban ecology. Light Detection and Ranging (LiDAR) system acquires accurate point clouds in a fast and environmentally-friendly manner, which enables single tree ...
Yongjun Wang, Tengping Jiang, Jing Liu, Xiaorui Li, Chong Liang   +4 more
doaj   +1 more source

Optimization Over Graphs [PDF]

SSRN Electronic Journal, 2019
This paper defines isomorphism for network formation that is not mathematically isomorphic. Once the pattern of network formation is characterized, one can test for (i) location fixed effects, (ii) heterogeneity, (iii) private information allowing for long-term contracts.
openaire   +2 more sources

Efficient Reversible Data Hiding Based on Connected Component Construction and Prediction Error Adjustment

Mathematics, 2022
To achieve a good trade-off between the data-embedding payload and the data-embedding distortion, mainstream reversible data hiding (RDH) algorithms perform data embedding on a well-built prediction error histogram.
Limengnan Zhou, Chongfu Zhang, Asad Malik, Hanzhou Wu   +3 more
doaj   +1 more source