Demo Data from EDBT 2026 / reviewers in the wild / expert
Nan Guo 0003
dblp:42/617-3
· DBLP profile ↗
6ranked-venue papers
0as first author
4since 2021 · last 2025
0000-0002-2250-5224ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021
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 |
Image recognition and object detection · 67% Learning paradigms · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Image recognition and object detection › object detection
multiple instance detection network |
0.4 | 1 | 2019 | C-MIDN: Coupled Multiple Instance Detection Network With Segmentation Guidance for Weakly Supervised Object Detection · ICCV 2019 |
Machine learning › Learning paradigms
multiple instance learning |
0.4 | 1 | 2019 | C-MIDN: Coupled Multiple Instance Detection Network With Segmentation Guidance for Weakly Supervised Object Detection · ICCV 2019 |
Computer vision › Image recognition and object detection › object detection
weakly supervised object detection |
0.4 | 1 | 2019 | C-MIDN: Coupled Multiple Instance Detection Network With Segmentation Guidance for Weakly Supervised Object Detection · ICCV 2019 |
Methods — techniques the papers use, named apart from their topics
segmentation-guided proposal removal · 0.4multiple instance learning · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | ITERTL: An Iterative Framework for Fine-tuning LLMs for RTL Code GenerationabstractRecently, large language models (LLMs) have demonstrated excellent performance, inspiring researchers to explore their use in automating register transfer level (RTL) code generation and improving hardware design efficiency. However, the existing approaches to fine-tune LLMs for RTL generation typically are conducted on fixed datasets, which do not fully stimulate the capability of LLMs and require large amounts of reference data, which are costly to acquire. To mitigate these issues, we innovatively introduce an iterative training paradigm named ITERTL. During each iteration, samples are drawn from the model trained in the previous cycle. Then these new samples are employed for training in current loop. Furthermore, we introduce a plug-and-play data filtering strategy, thereby encouraging the model to generate high-quality, self-contained code. Our model outperforms GPT4 and state-of-the-art (SOTA) open-source models, achieving remarkable 53.8% pass@1 rate on VerilogEval-human benchmark. Under similar conditions of data quantity and quality, our approach significantly outperforms the baseline. Extensive experiments validate the effectiveness of the proposed method. Peiyang Wu, Nan Guo 0003, Xiaochun Ye, Dongrui Fan |
ISCAS | 2 |
| 2025 | Multi-hierarchical semantic graph learning for video moment retrieval
De Han, Nan Guo 0003, Xiaochun Ye, Benjamin Rainer, Peter Priller |
Multim. Tools Appl. | 3 |
| 2024 | Momentum Cross-Modal Contrastive Learning for Video Moment RetrievalabstractVideo moment retrieval aims to locate the timestamps best matching the query description within an untrimmed video. However, existing video moment retrieval approaches typically suffer from two major limitations: (1)Utilize only negative moment-sentence pairs sampled from intra-videos, which may overfit the bias of the dataset and not have an excellent understanding of the video and query due to the dataset size and annotation biases. (2)Decouple the video and the query, perform unimodal learning separately, and then concatenate them together as multimodal fusion features. In this paper, we propose a novel approach named Momentum Contrastive Matching Network(MCMN). Inspired by MoCo, we propose the Momentum Cross-modal Contrast for cross-modal learning to enable large-scale negative sample interactions, which contributes to the generation of more precise and discriminative representations, and use temporal decay to model key attenuation in the memory queue when computing the contrastive loss. In addition, we use an attention module to adaptively generate clip-specific word embeddings to achieve semantic alignment from a temporal perspective, which are considered to be more important for finding relevant video contents with large boundary ambiguities. Experimental results on the three major video moment retrieval benchmark datasets, including TACoS, Charades-STA, and ActivityNet Captions demonstrate that MCMN surpasses previous methods and reaches state-of-the-art with disparate visual features. De Han, Nan Guo 0003, Xiaochun Ye, Benjamin Rainer, Peter Priller |
IEEE Trans. Circuits Syst. Video Technol. | 3 |
| 2023 | Domain adaptive person re-identification with memory-based circular ranking
Honggang Chen, Nan Guo 0003, Xiaochun Ye, Dongrui Fan |
Appl. Intell. | 3 |
| 2020 | Pixel-Semantic Revising of Position: One-Stage Object Detector with Shared Encoder-Decoder
Nan Guo 0003, Xiaochun Ye, Dongrui Fan |
ICONIP (4) | 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 | 3 |