Demo Data from SIGIR 2026 / reviewers in the wild / expert
Siyang Qin
dblp:180/6530
· DBLP profile ↗
13ranked-venue papers
6as first author
5since 2021 · last 2025
0000-0002-5776-1965ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 8 · 5 first-author · 2 since 2021Artificial intelligence and machine learning · 7 · 3 first-author · 4 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 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
4 papers |
Generative modeling · 30% Image recognition and object detection · 20% Information extraction and text analysis · 15% |
Topics — the 9 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Image recognition and object detection
scene text detection |
1.0 | 2 | 2022 | Towards End-to-End Unified Scene Text Detection and Layout Analysis · CVPR 2022 Towards Unconstrained End-to-End Text Spotting · ICCV 2019 |
Machine learning › Generative modeling
autoregressive model |
0.9 | 1 | 2025 | Fluid: Scaling Autoregressive Text-to-image Generative Models with Continuous Tokens · ICLR 2025 |
Natural language and speech › Language models and text generation › neural language model
autoregressive transformer |
0.9 | 1 | 2025 | Fluid: Scaling Autoregressive Text-to-image Generative Models with Continuous Tokens · ICLR 2025 |
Machine learning › Generative modeling › diffusion model
text-to-image generation |
0.9 | 1 | 2025 | Fluid: Scaling Autoregressive Text-to-image Generative Models with Continuous Tokens · ICLR 2025 |
Machine learning › Deep learning architectures and training
transformer |
0.9 | 1 | 2025 | Fluid: Scaling Autoregressive Text-to-image Generative Models with Continuous Tokens · ICLR 2025 |
Computer vision › Image recognition and object detection
scene text recognition |
0.4 | 1 | 2019 | Towards Unconstrained End-to-End Text Spotting · ICCV 2019 |
Machine learning › Generative modeling
diffusion model |
0.3 | 1 | 2025 | Fluid: Scaling Autoregressive Text-to-image Generative Models with Continuous Tokens · ICLR 2025 |
Natural language and speech › Information extraction and text analysis
document understanding |
0.2 | 1 | 2023 | FormNetV2: Multimodal Graph Contrastive Learning for Form Document Information Extraction · ACL (1) 2023 |
Computer vision › Segmentation and scene understanding
instance segmentation |
0.1 | 1 | 2019 | Towards Unconstrained End-to-End Text Spotting · ICCV 2019 |
Methods — techniques the papers use, named apart from their topics
scaling law analysis · 0.9continuous token modeling · 0.9multimodal learning · 0.7graph contrastive learning · 0.7end-to-end unified model · 0.6roi masking · 0.4partially labeled training data · 0.4attention · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Fluid: Scaling Autoregressive Text-to-image Generative Models with Continuous TokensabstractScaling up autoregressive models in vision has not proven as beneficial as in large language models.
In this work, we investigate this scaling problem in the context of text-to-image generation, focusing on two critical factors: whether models use discrete or continuous tokens, and whether tokens are generated in a random or fixed raster order using BERT- or GPT-like transformer architectures. Our empirical results show that, while all models scale effectively in terms of validation loss, their evaluation performance -- measured by FID, GenEval score, and visual quality -- follows different trends. Models based on continuous tokens achieves significantly better visual quality than those using discrete tokens. Furthermore, the generation order and attention mechanisms significantly affect the GenEval score: random-order models achieve notably better GenEval scores compared to raster-order models.
Inspired by these findings, we train Fluid, a random-order autoregressive model on continuous tokens. Fluid 10.5B model achieves a new state-of-the-art zeor-shot FID of 6.16 on MS-COCO 30K, and 0.69 overall score on the GenEval benchmark. We hope our findings and results will encourage future efforts to further bridge the scaling gap between vision and language models. Lijie Fan, Tianhong Li, Siyang Qin, Yuanzhen Li, Chen Sun 0002, Michael Rubinstein, Deqing Sun, Kaiming He, Yonglong Tian |
ICLR | 3 |
| 2024 | Hierarchical Text Spotter for Joint Text Spotting and Layout AnalysisabstractWe propose Hierarchical Text Spotter (HTS), a novel method for the joint task of word-level text spotting and geometric layout analysis. HTS can recognize text in an image and identify its 4-level hierarchical structure: characters, words, lines, and paragraphs. The proposed HTS is characterized by two novel components: (1) a Unified-DetectorPolygon (UDP) that produces Bezier Curve polygons of text lines and an affinity matrix for paragraph grouping between detected lines; (2) a Line-to-Character-to-Word (L2C2W) recognizer that splits lines into characters and further merges them back into words. HTS achieves stateof-the-art results on multiple word-level text spotting benchmark datasets as well as geometric layout analysis tasks. Shangbang Long, Siyang Qin, Yasuhisa Fujii, Alessandro Bissacco, Michalis Raptis |
WACV | 2 |
| 2023 | FormNetV2: Multimodal Graph Contrastive Learning for Form Document Information ExtractionabstractChen-Yu Lee, Chun-Liang Li, Hao Zhang, Timothy Dozat, Vincent Perot, Guolong Su, Xiang Zhang, Kihyuk Sohn, Nikolay Glushnev, Renshen Wang, Joshua Ainslie, Shangbang Long, Siyang Qin, Yasuhisa Fujii, Nan Hua, Tomas Pfister. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2023. Chen-Yu Lee, Chun-Liang Li, Timothy Dozat, Vincent Perot, Guolong Su, Kihyuk Sohn, Nikolay Glushnev, Renshen Wang, Joshua Ainslie, Shangbang Long, Siyang Qin, Yasuhisa Fujii, Nan Hua, Tomas Pfister |
ACL (1) | 13 |
| 2023 | ICDAR 2023 Competition on Hierarchical Text Detection and Recognition
Shangbang Long, Siyang Qin, Dmitry Panteleev, Alessandro Bissacco, Yasuhisa Fujii, Michalis Raptis |
ICDAR (2) | 2 |
| 2022 | Towards End-to-End Unified Scene Text Detection and Layout AnalysisabstractScene text detection and document layout analysis have long been treated as two separate tasks in different image domains. In this paper, we bring them together and introduce the task of unified scene text detection and layout analysis. The first hierarchical scene text dataset is introduced to enable this novel research task. We also propose a novel method that is able to simultaneously detect scene text and form text clusters in a unified way. Comprehensive experiments show that our unified model achieves better performance than multiple well-designed baseline methods. Additionally, this model achieves state-of-the-art results on multiple scene text detection datasets without the need of complex post-processing. Dataset and code: https://github.com/google-research-datasets/hiertext. Shangbang Long, Siyang Qin, Dmitry Panteleev, Alessandro Bissacco, Yasuhisa Fujii, Michalis Raptis |
CVPR | 2 |
| 2019 | Towards Unconstrained End-to-End Text SpottingabstractWe propose an end-to-end trainable network that can simultaneously detect and recognize text of arbitrary shape, making substantial progress on the open problem of reading scene text of irregular shape. We formulate arbitrary shape text detection as an instance segmentation problem; an attention model is then used to decode the textual content of each irregularly shaped text region without rectification. To extract useful irregularly shaped text instance features from image scale features, we propose a simple yet effective RoI masking step. Additionally, we show that predictions from an existing multi-step OCR engine can be leveraged as partially labeled training data, which leads to significant improvements in both the detection and recognition accuracy of our model. Our method surpasses the state-of-the-art for end-to-end recognition tasks on the ICDAR15 (straight) benchmark by 4.6%, and on the Total-Text (curved) benchmark by more than 16%. Siyang Qin, Alessandro Bissacco, Michalis Raptis, Yasuhisa Fujii |
ICCV | 1 |
| 2019 | Scene text access: a comparison of mobile OCR modalities for blind usersabstractWe present a study with seven blind participants using three different mobile OCR apps to find text posted in various indoor environments. The first app considered was Microsoft SeeingAI in its Short Text mode, which reads any text in sight with a minimalistic interface. The second app was Spot+OCR, a custom application that separates the task of text detection from OCR proper. Upon detection of text in the image, Spot+OCR generates a short vibration; as soon as the user stabilizes the phone, a high-resolution snapshot is taken and OCR-processed. The third app, Guided OCR, was designed to guide the user in taking several pictures in a 360° span at the maximum resolution available by the camera, with minimum overlap between pictures. Quantitative results (in terms of true positive ratios and traversal speed) were recorded. Along with the qualitative observation and outcomes from an exit survey, these results allow us to identify and assess the different strategies used by our participants, as well as the challenges of operating these systems without sight. Leo Neat, Peng Ren 0003, Siyang Qin, Roberto Manduchi |
IUI | 3 |
| 2018 | Multi-planar Monocular Reconstruction of Manhattan Indoor ScenesabstractWe present a novel algorithm for geometry and camera pose reconstruction from image sequences that is specialized for indoor Manhattan scenes. Unlike general-purpose SfM/SLAM, our system represents geometric primitives in terms of canonically oriented planes. The algorithm starts by computing multi-planar segmentation and motion estimation from image pairs using constrained homographies. It then proceeds to recover the relative scale at each frame and to determine chains of match clusters, where each cluster is associated with a plane in the scene. Motion and scene geometry (expressed in terms of planar models) are then optimized using a novel formulation of Bundle Adjustment. Compared with other state-of-the-art SfM/SLAM algorithms, our technique is shown to produce superior and realistic surface reconstruction for a monocular indoor scene. Seongdo Kim 0001, Roberto Manduchi, Siyang Qin |
3DV | 3 |
| 2018 | Automatic Semantic Content Removal by Learning to Neglect
Siyang Qin, Jiahui Wei, Roberto Manduchi |
BMVC | 1 |
| 2018 | Robust and Accurate Text Stroke SegmentationabstractWe propose a new technique for the accurate segmentation of text strokes from an image. The algorithm takes in a cropped image containing a word. It first performs a coarse segmentation using a Fully Convolutional Network (FCN). While not accurate, this initial segmentation can usually identify most of the text stroke content even in difficult situations, with uneven lighting and non-uniform background. The segmentation is then refined using a fully connected Conditional Random Field (CRF) with a novel kernel definition that includes stroke width information. In order to train the network, we created a new synthetic data set with 100K text images. Tested against standard benchmarks with pixellevel annotation (ICDAR 2003, ICDAR 2011, and SVT) our algorithm outperforms the state of the art by a noticeable margin. Siyang Qin, Peng Ren 0003, Seongdo Kim 0001, Roberto Manduchi |
WACV | 1 |
| 2017 | Cascaded Segmentation-Detection Networks for Word-Level Text SpottingabstractWe introduce an algorithm for word-level text spotting that is able to accurately and reliably determine the bounding regions of individual words of text "in the wild". Our system is formed by the cascade of two convolutional neural networks. The first network is fully convolutional and is in charge of detecting areas containing text. This results in a very reliable but possibly inaccurate segmentation of the input image. The second network (inspired by the popular YOLO architecture) analyzes each segment produced in the first stage, and predicts oriented rectangular regions containing individual words. No post-processing (e.g. text line grouping) is necessary. With execution time of 450 ms for a 1000 × 560 image on a Titan X GPU, our system achieves good performance on the ICDAR 2013, 2015 benchmarks [2], [1]. Siyang Qin, Roberto Manduchi |
ICDAR | 1 |
| 2017 | Automatic skin and hair masking using fully convolutional networksabstractSelfies have become commonplace. More and more people take pictures of themselves, and enjoy enhancing these pictures using a variety of image processing techniques. One specific functionality of interest is automatic skin and hair segmentation, as this allows for processing one's skin and hair separately. Traditional approaches require user input in the form of fully specified trimaps, or at least of “scribbles” indicating foreground and background areas, with high-quality masks then generated via matting. Manual input, however, can be difficult or tedious, especially on a smartphone's small screen. In this paper, we propose the use of fully convolutional networks (FCN) and fully-connected CRF to perform pixel-level semantic segmentation into skin, hair and background. The trimap thus generated is given as input to a standard matting algorithm, resulting in accurate skin and hair alpha masks. Our method achieves state-of-the-art performance on the LFW Parts dataset [1]. The effectiveness of our method is also demonstrated with a specific application case. Siyang Qin, Seongdo Kim 0001, Roberto Manduchi |
ICME | 1 |
| 2016 | A fast and robust text spotterabstractWe introduce an algorithm for text detection and localization ("spotting") that is computationally efficient and produces state-of-the-art results. Our system uses multi-channel MSERs to detect a large number of promising regions, then subsamples these regions using a clustering approach. Representatives of region clusters are binarized and then passed on to a deep network. A final line grouping stage forms word-level segments. On the ICDAR 2011 and 2015 benchmarks, our algorithm obtains an F-score of 82% and 83%, respectively, at a computational cost of 1.2 seconds per frame. We also introduce a version that is three times as fast, with only a slight reduction in performance. Siyang Qin, Roberto Manduchi |
WACV | 1 |