Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Liu Yuhe

dblp:259/5111 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
3D vision · 50% Probabilistic and Bayesian machine learning · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › geometric estimation
3d registration
0.412019
Robust Variational Bayesian Point Set Registration · ICCV 2019
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › bayesian network
hierarchical bayesian network
0.412019
Robust Variational Bayesian Point Set Registration · ICCV 2019
Computer vision › 3D vision › point cloud registration
point set registration
0.412019
Robust Variational Bayesian Point Set Registration · ICCV 2019
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.412019
Robust Variational Bayesian Point Set Registration · ICCV 2019

Methods — techniques the papers use, named apart from their topics

variational inference · 0.4student's t latent mixture model · 0.4cooling schedule · 0.4
YearPublicationVenuePosition
2019 Robust Variational Bayesian Point Set Registration
abstract
In this work, we propose a hierarchical Bayesian network based point set registration method to solve missing correspondences and various massive outliers. We construct this network first using the finite Student s t latent mixture model (TLMM), in which distributions of latent variables are estimated by a tree-structured variational inference (VI) so that to obtain a tighter lower bound under the Bayesian framework. We then divide the TLMM into two different mixtures with isotropic and anisotropic covariances for correspondences recovering and outliers identification, respectively. Finally, the parameters of mixing proportion and covariances are both taken as latent variables, which benefits explaining of missing correspondences and heteroscedastic outliers. In addition, a cooling schedule is adopted to anneal prior on covariances and scale variables within designed two phases of transformation, it anneal priors on global and local variables to perform a coarse-to- fine registration. In experiments, our method outperforms five state-of-the-art methods in synthetic point set and realistic imaging registrations.
Xinke Ma, Li Liang 0006, Liu Yuhe, Shijin Xu, Sim Heng Ong, Yang Yang 0032
ICCV4