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

Su Been Lee

dblp:288/3200 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 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
3 papers
Segmentation and scene understanding · 44% Image recognition and object detection · 36% Video understanding and tracking · 16%

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

TopicWeightPapersLastEvidence papers
Computer vision › Video understanding and tracking
background subtraction
0.812024
Task-Disruptive Background Suppression for Few-Shot Segmentation · AAAI 2024
Computer vision › Segmentation and scene understanding › semantic segmentation
few-shot segmentation
0.812024
Task-Disruptive Background Suppression for Few-Shot Segmentation · AAAI 2024
Computer vision › Segmentation and scene understanding
semantic segmentation
0.712023
Leveraging Hidden Positives for Unsupervised Semantic Segmentation · CVPR 2023
Computer vision › Segmentation and scene understanding › annotation-efficient segmentation
unsupervised semantic segmentation
0.712023
Leveraging Hidden Positives for Unsupervised Semantic Segmentation · CVPR 2023
Computer vision › Image recognition and object detection › region localization
discriminative region localization
0.612022
Task Discrepancy Maximization for Fine-grained Few-Shot Classification · CVPR 2022
Computer vision › Image recognition and object detection › image classification › fine-grained image classification
few-shot fine-grained classification
0.612022
Task Discrepancy Maximization for Fine-grained Few-Shot Classification · CVPR 2022
Computer vision › Image recognition and object detection › image classification
fine-grained image classification
0.612022
Task Discrepancy Maximization for Fine-grained Few-Shot Classification · CVPR 2022
Machine learning › Representation and self-supervised learning
contrastive learning
0.212023
Leveraging Hidden Positives for Unsupervised Semantic Segmentation · CVPR 2023

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

spatial attention · 0.8prototype learning · 0.8vision transformer · 0.7gradient propagation · 0.7contrastive learning · 0.7support attention · 0.6query attention · 0.6channel attention · 0.6
YearPublicationVenuePosition
2024 Task-Disruptive Background Suppression for Few-Shot Segmentation
abstract
Few-shot segmentation aims to accurately segment novel target objects within query images using only a limited number of annotated support images. The recent works exploit support background as well as its foreground to precisely compute the dense correlations between query and support. However, they overlook the characteristics of the background that generally contains various types of objects. In this paper, we highlight this characteristic of background which can bring problematic cases as follows: (1) when the query and support backgrounds are dissimilar and (2) when objects in the support background are similar to the target object in the query. Without any consideration of the above cases, adopting the entire support background leads to a misprediction of the query foreground as background. To address this issue, we propose Task-disruptive Background Suppression(TBS), a module to suppress those disruptive support background features based on two spatial-wise scores: query-relevant and target-relevant scores. The former aims to mitigate the impact of unshared features solely existing in the support background, while the latter aims to reduce the influence of target-similar support background features. Based on these two scores, we define a query background relevant score that captures the similarity between the backgrounds of the query and the support, and utilize it to scale support background features to adaptively restrict the impact of disruptive support backgrounds. Our proposed method achieves state-of-the-art performance on standard few-shot segmentation benchmarks. Our official code is available at github.com/SuhoPark0706/TBSNet.
Suho Park, Su Been Lee, Sangeek Hyun, Hyun Seok Seong, Jae-Pil Heo
AAAI2
2023 Leveraging Hidden Positives for Unsupervised Semantic Segmentation
abstract
Dramatic demand for manpower to label pixel-level annotations triggered the advent of unsupervised semantic segmentation. Although the recent work employing the vision transformer (ViT) backbone shows exceptional performance, there is still a lack of consideration for task-specific training guidance and local semantic consistency. To tackle these issues, we leverage contrastive learning by excavating hidden positives to learn rich semantic relationships and ensure semantic consistency in local regions. Specifically, we first discover two types of global hidden positives, task-agnostic and task-specific ones for each anchor based on the feature similarities defined by a fixed pre-trained back-bone and a segmentation head-in-training, respectively. A gradual increase in the contribution of the latter induces the model to capture task-specific semantic features. In addition, we introduce a gradient propagation strategy to learn semantic consistency between adjacent patches, under the inherent premise that nearby patches are highly likely to possess the same semantics. Specifically, we add the loss propagating to local hidden positives, semantically similar nearby patches, in proportion to the predefined similarity scores. With these training schemes, our proposed method achieves new state-of-the-art (SOTA) results in COCO-stuff, Cityscapes, and Potsdam-3 datasets. Our code is available at: https://github.com/hynnsk/HP.
Hyun Seok Seong, WonJun Moon, Su Been Lee, Jae-Pil Heo
CVPR3
2022 Evaluation of a Machine Learning Approach to Identify ADL Impairment in Clinical Notes of People with Dementia
John Laurentiev, Mufaddal Mahesri, Lily G. Bessette, Cassandra York, Heidi Zakoul, Su Been Lee, Li Zhou 0007, Joshua Lin
AMIA6
2022 Task Discrepancy Maximization for Fine-grained Few-Shot Classification
abstract
Recognizing discriminative details such as eyes and beaks is important for distinguishing fine-grained classes since they have similar overall appearances. In this regard, we introduce Task Discrepancy Maximization (TDM), a simple module for fine-grained few-shot classification. Our objective is to localize the class-wise discriminative regions by highlighting channels encoding distinct information of the class. Specifically, TDM learns task-specific channel weights based on two novel components: Support Attention Module (SAM) and Query Attention Module (QAM). SAM produces a support weight to represent channel-wise discriminative power for each class. Still, since the SAM is basically only based on the labeled support sets, it can be vulnerable to bias toward such support set. Therefore, we propose QAM which complements SAM by yielding a query weight that grants more weight to object-relevant channels for a given query image. By combining these two weights, a class-wise task-specific channel weight is defined. The weights are then applied to produce task-adaptive feature maps more focusing on the discriminative details. Our experiments validate the effectiveness of TDM and its complementary benefits with prior methods in fine- grained few-shot classification.
Su Been Lee, WonJun Moon, Jae-Pil Heo
CVPR1