Wonju Lee

Dr. Wonju Lee


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 February 2013 in Fire Safety Journal
Verified
Journal Article
Closed access
WLWonju Lee
Wonju Lee
MCMinkyu Cheon
Minkyu Cheon
CHChang-Ho Hyun
Chang-Ho Hyun
MPMignon Park
Mignon Park

15 July 2024 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
JKJanghyun Kim
Janghyun Kim
JNJeonghyun Noh
Jeonghyun Noh
MJMingyu Jeong
Mingyu Jeong
WLWonju Lee
Wonju Lee
YPYeonchool Park
Yeonchool Park
JPJinsun Park
Jinsun Park
Depth completion is one of the crucial methods to estimate dense depth information of surrounding environments for various real-world applications such as autonomous driving, robotics, and augmented reality. In these real-world applications, it is strictly required for a depth completion model to achieve lightweight network architectures and reduced computational costs to operate in real-time. With this in mind, we propose a non-local affinity distillation network for lightweight depth completion. Our method utilizes a minimal number of neighbors with strong affinities for fast spatial propagation by optimal transport between teacher and student affinities through knowledge distillation. Moreover, existing depth completion algorithms solely focus on exploiting measured LiDAR points of objects while disregarding missing ones fired into the air completely. Since missing rays of a LiDAR sweep can be easily identified based on the data acquisition pipeline of LiDAR sensors, we propose to utilize guidance from missing LiDAR points to further improve the performance of our network especially in regions without LiDAR points. Experimental results show that our method is superior to previous lightweight networks as well as comparable to heavy depth completion methods.

25 September 2013 in Sensors
Verified
Journal Article
Open access
PDF file
WLWonju Lee
Wonju Lee
MCMinkyu Cheon
Minkyu Cheon
CHChang-Ho Hyun
Chang-Ho Hyun
MPMignon Park
Mignon Park
In the face recognition field, principal component analysis is essential to the reduction of the image dimension. In spite of frequent use of this analysis, it is commonly believed that the basis faces with large eigenvalues are chosen as the best subset in the nearest neighbor classifiers. We propose an alternative that can predict the classification error during the training steps and find the useful basis faces for the similarity metrics of the classical pattern algorithms. In addition, we also show the need for the eye-aligned dataset to have the pure face. The experiments using face images verify that our method reduces the negative effect on the misaligned face images and decreases the weights of the useful basis faces in order to improve the classification accuracy.