Search Results for author: Guobao Xiao

Found 14 papers, 5 papers with code

Latent Semantic Consensus For Deterministic Geometric Model Fitting

1 code implementation11 Mar 2024 Guobao Xiao, Jun Yu, Jiayi Ma, Deng-Ping Fan, Ling Shao

The principle of LSC is to preserve the latent semantic consensus in both data points and model hypotheses.

BCLNet: Bilateral Consensus Learning for Two-View Correspondence Pruning

1 code implementation7 Jan 2024 Xiangyang Miao, Guobao Xiao, Shiping Wang, Jun Yu

In our approach, we design a distinctive self-attention block to capture global context and parallel process it with the established local context learning module, which enables us to simultaneously capture both local and global consensuses.

Graph Context Transformation Learning for Progressive Correspondence Pruning

no code implementations26 Dec 2023 Junwen Guo, Guobao Xiao, Shiping Wang, Jun Yu

To further apply the recalibrated graph contexts to the global domain, we propose the Graph Context Guidance Transformer.

Pose Estimation

VSFormer: Visual-Spatial Fusion Transformer for Correspondence Pruning

1 code implementation14 Dec 2023 Tangfei Liao, Xiaoqin Zhang, Li Zhao, Tao Wang, Guobao Xiao

Then, we model these visual cues and correspondences by a joint visual-spatial fusion module, simultaneously embedding visual cues into correspondences for pruning.

Hierarchical Representation via Message Propagation for Robust Model Fitting

no code implementations29 Dec 2020 Shuyuan Lin, Xing Wang, Guobao Xiao, Yan Yan, Hanzi Wang

In this paper, we propose a novel hierarchical representation via message propagation (HRMP) method for robust model fitting, which simultaneously takes advantages of both the consensus analysis and the preference analysis to estimate the parameters of multiple model instances from data corrupted by outliers, for robust model fitting.

Hypergraph Optimization for Multi-structural Geometric Model Fitting

no code implementations13 Feb 2020 Shuyuan Lin, Guobao Xiao, Yan Yan, David Suter, Hanzi Wang

Recently, some hypergraph-based methods have been proposed to deal with the problem of model fitting in computer vision, mainly due to the superior capability of hypergraph to represent the complex relationship between data points.

Clustering

Learning a Layout Transfer Network for Context Aware Object Detection

no code implementations9 Dec 2019 Tao Wang, Xuming He, Yuanzheng Cai, Guobao Xiao

We present a context aware object detection method based on a retrieve-and-transform scene layout model.

Autonomous Driving Object +2

Superpixel-guided Two-view Deterministic Geometric Model Fitting

no code implementations3 May 2018 Guobao Xiao, Hanzi Wang, Yan Yan, David Suter

Specifically, SDF includes three main parts: a deterministic sampling algorithm, a model hypothesis updating strategy and a novel model selection algorithm.

Model Selection Superpixels +1

Searching for Representative Modes on Hypergraphs for Robust Geometric Model Fitting

no code implementations4 Feb 2018 Hanzi Wang, Guobao Xiao, Yan Yan, David Suter

We cast the task of geometric model fitting as a representative mode-seeking problem on hypergraphs.

Superpixel-based Two-view Deterministic Fitting for Multiple-structure Data

no code implementations20 Jul 2016 Guobao Xiao, Hanzi Wang, Yan Yan, David Suter

The feature appearances are beneficial to reduce the computational complexity for deterministic fitting methods.

Model Selection Superpixels +1

Hypergraph Modelling for Geometric Model Fitting

no code implementations11 Jul 2016 Guobao Xiao, Hanzi Wang, Taotao Lai, David Suter

The hypergraph, with large and "data-determined" degrees of hyperedges, can express the complex relationships between model hypotheses and data points.

Mode-Seeking on Hypergraphs for Robust Geometric Model Fitting

no code implementations ICCV 2015 Hanzi Wang, Guobao Xiao, Yan Yan, David Suter

In addition to the mode seeking algorithm, MSH includes a similarity measure between vertices on the hypergraph and a weight-aware sampling technique.

Cannot find the paper you are looking for? You can Submit a new open access paper.