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

Tingcheng Cui

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

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

Graphics, computer vision, multimedia, augmented reality and games · 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% Graph learning · 33%

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

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection › scene text detection
arbitrary-shaped text detection
0.712023
Arbitrary-Shape Scene Text Detection via Visual-Relational Rectification and Contour Approximation · IEEE Trans. Multim. 2023
Machine learning › Graph learning › graph neural network
graph convolutional network
0.712023
Arbitrary-Shape Scene Text Detection via Visual-Relational Rectification and Contour Approximation · IEEE Trans. Multim. 2023
Computer vision › Image recognition and object detection
scene text detection
0.712023
Arbitrary-Shape Scene Text Detection via Visual-Relational Rectification and Contour Approximation · IEEE Trans. Multim. 2023

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

weakly supervised node classification · 0.7location-aware transfer · 0.7contour approximation · 0.7
YearPublicationVenuePosition
2023 Arbitrary-Shape Scene Text Detection via Visual-Relational Rectification and Contour Approximation
abstract
One trend in the latest bottom-up approaches for arbitrary-shape scene text detection is to determine the links between text segments using Graph Convolutional Networks (GCNs). However, the performance of these bottom-up methods is still inferior to that of state-of-the-art top-down methods even with the help of GCNs. We argue that a cause of this is that bottom-up methods fail to make proper use of visual-relational features, which results in accumulated false detection, as well as the error-prone route-finding used for grouping text segments. In this paper, we improve classic bottom-up text detection frameworks by fusing the visual-relational features of text with two effective false positive/negative suppression (FPNS) mechanisms and developing a new shape-approximation strategy. First, dense overlapping text segments depicting the “characterness” and “streamline” properties of text are constructed and used in weakly supervised node classification to filter the falsely detected text segments. Then, relational features and visual features of text segments are fused with a novel Location-Aware Transfer (LAT) module and Fuse Decoding (FD) module to jointly rectify the detected text segments. Finally, a novel multiple-text-map-aware contour-approximation strategy is developed based on the rectified text segments, instead of the error-prone route-finding process, to generate the final contour of the detected text. Experiments conducted on five benchmark datasets demonstrate that our method outperforms the state-of-the-art performance when embedded in a classic text detection framework, which revitalizes the strengths of bottom-up methods.
Chengpei Xu, Wenjing Jia, Tingcheng Cui, Ruomei Wang 0001, Yuan-fang Zhang, Xiangjian He
IEEE Trans. Multim.3