VLDB 2026 Research / reviewers in the wild / expert
Gao Yan
dblp:03/6992
· DBLP profile ↗
3ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Directional shadow price in linearly constrained nonconvex optimization models
Tao Jie, Gao Yan |
J. Glob. Optim. | 2 |
| 2019 | C-MIDN: Coupled Multiple Instance Detection Network With Segmentation Guidance for Weakly Supervised Object DetectionabstractWeakly supervised object detection (WSOD) that only needs image-level annotations has obtained much attention recently. By combining convolutional neural network with multiple instance learning method, Multiple Instance Detection Network (MIDN) has become the most popular method to address the WSOD problem and been adopted as the initial model in many works. We argue that MIDN inclines to converge to the most discriminative object parts, which limits the performance of methods based on it. In this paper, we propose a novel Coupled Multiple Instance Detection Network (C-MIDN) to address this problem. Specifically, we use a pair of MIDNs, which work in a complementary manner with proposal removal. The localization information of the MIDNs is further coupled to obtain tighter bounding boxes and localize multiple objects. We also introduce a Segmentation Guided Proposal Removal (SGPR) algorithm to guarantee the MIL constraint after the removal and ensure the robustness of C-MIDN. Through a simple implementation of the C-MIDN with online detector refinement, we obtain 53.6% and 50.3% mAP on the challenging PASCAL VOC 2007 and 2012 benchmarks respectively, which significantly outperform the previous state-of-the-arts. Gao Yan, Boxiao Liu, Nan Guo 0003, Xiaochun Ye, Fang Wan 0001, Haihang You, Dongrui Fan |
ICCV | 1 |
| 2005 | The Eigen-Problem In The Completely Max-AlgebraabstractThe eigen-problem of max-algebraic matrix in the sense of the completely max-algebra is analyzed in detail in this paper. It is proved that \lambda = \varpi(\gamma) must be the eigenvalue of the matrix A in the sense of the completely max-algebra if real number \varpi(\gamma) is the average weight of the critical circuit ? for some strongly connected subgraph G(A\gamma) in the graph G(A). Ma Jun, Gao Yan, Dai zhi yong |
PDCAT | 2 |