Sangbin Lee

dblp:34/2180 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
1since 2021 · last 2025
0000-0002-0736-5040ORCID · reported

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

Computer networks · 2Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

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% Trustworthy machine learning · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection › object detection
knowledge distillation for detection
0.912025
ELDET: Early-Learning Distillation with Noisy Labels for Object Detection · NeurIPS 2025
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.912025
ELDET: Early-Learning Distillation with Noisy Labels for Object Detection · NeurIPS 2025
Computer vision › Image recognition and object detection
object detection
0.912025
ELDET: Early-Learning Distillation with Noisy Labels for Object Detection · NeurIPS 2025
Medical and health informatics › medical imaging
medical image analysis
0.312025
ELDET: Early-Learning Distillation with Noisy Labels for Object Detection · NeurIPS 2025

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

knowledge distillation · 1.7early-learning regularization · 1.7location information encoding · 0.1
YearPublicationVenuePosition
2025 ELDET: Early-Learning Distillation with Noisy Labels for Object Detection
abstract
The performance of learning-based object detection algorithms, which attempt to both classify and locate objects within images, is determined largely by the quality of the annotated dataset used for training. Two types of labelling noises are prevalent: objects that are incorrectly classified (categorization noise) and inaccurate bounding boxes (localization noise); both noises typically occur together in large-scale datasets. In this paper we propose a distillation-based method to train object detectors that takes into account both categorization and localization noise. The key insight underpinning our method is that the early-learning phenomenon - in which models trained on noisy data with mixed clean and false labels tend to first fit to the clean data, and memorize the false labels later -- manifests earlier for localization noise than for categorization noise. We propose a method that uses models from the early-learning phase (before overfitting to noisy data occurs) as a teacher network. A plug-in module implementation compatible with general object detection architectures is developed, and its performance is validated against the state-of-the-art using PASCAL VOC, MS COCO and VinDr-CXR medical detection datasets.
Dongmin Choi, Sangbin Lee, EungGu Yun 0001, Jonghyuk Baek, Frank C. Park 0001
NeurIPS2
2010 Priority-Based Hybrid Routing in Wireless Sensor Networks
abstract
By the wide range of researches on Wireless Sensor Networks (WSNs), various routing schemes with diverse criterion have been introduced. However, techniques that consider the characteristics of the sensed data as definitive parameters in determining the behavior of WSNs are extremely rare. In most monitoring applications, sampled data are not equal in their importance. Unexpected data is more likely to be important. That is, data collected during abrupt changes in the environment are more critical than the others. In this paper, we propose Priority-Based Hybrid Routing (PHR) that provides functions ranging from data priority verification to differentiated services according to different priorities. Data priorities, or importance, are determined by their distinctiveness in relation to past data. Dixon's Test, a hypothesis testing method, is adopted for the process. To provide more reliable routing method for high priority data, PHR offers them a novel, diffusion-based forwarding scheme, referred to as Geographic Diffusion. On the other hand, low priority data are delivered by a famous single path routing algorithm, Ad hoc On-demand Distance Vector (AODV). Furthermore, AODV is revised to compensate with the increased traffic caused by Geographic Diffusion. The performance of PHR is evaluated through various simulations.
Songmin Kim, Sangbin Lee, Hyeong-Jong Ju, Doohyun Ko, Sunshin An
WCNC2
2009 Prediction Based Mobile Data Aggregation in Wireless Sensor Network
Sangbin Lee, Songmin Kim, Doohyun Ko, Sunshin An
GPC1
2008 Demonstration of Location Information Based Network
abstract
In ubiquitous network, node location information is the most essential data for efficiently managing increased mobility and supporting location based services. Therefore, we propose a next generation location information based network, which uses address containing location information. Finally, its functions, effectiveness, and feasibility will be verified through this demonstration.
Younghwan Jung, Sangbin Lee, Songmin Kim, Eunsook Lee, Soonwook Hwang, Chang-Su Kim 0001, Dongseung Kim, Sunshin An
IPSN2
2007 Zone Based Data Aggregation Scheduling Scheme for Maximizing Network Lifetime
Sangbin Lee, Kyu-Ho Han, Kyungsoo Lim, Jin Wook Lee, Sunshin An
ISPA1