Jiyeon Nam
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jiyeon Nam has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Hyungbo Shim
Department of Electrical and Computer Engineering, ASRI, Seoul National University, Seoul, South Korea
2 shared publications - DongKi Noh
Advanced Robotics Laboratory, CTO Division, LG Electronics Inc., Seoul, Republic of Korea
1 shared publication - Gyunghoon Park
School of Electrical and Computer Engineering, University of Seoul, Seoul, South Korea
1 shared publication - Soojeong Hyeon
Department of Electrical and Computer Engineering, Seoul National University, Seoul, South Korea
1 shared publication - Taekyoo Kim
Train Control and Communication Team, Korea Railroad Research Institute (KRRI), Uiwang, South Korea
1 shared publication - Youngjun Joo
Department of Electrical Engineering and Institute of Advanced Materials and Systems, Sookmyung Women’s University, Seoul, Republic of Korea
1 shared publication
Latest Publications
- 29 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (1) , 723-730
Spectral Trade-Off for Measurement Sparsification of Pose-Graph SLAM
In this letter, we propose a trade-off optimization algorithm to compute an appropriate number of edges for measurement (edge) sparsification in pose-graph simultaneous localization and mapping (SLAM). The greater the amount of measurement data, the larger is the computational burden. To reduce computational burden, one can remove a portion of measurements. However, reliable data, such as odometric measurements, can be lost if measurements are removed without any principle. To remove measurements which is redundant, we propose a trade-off optimization algorithm between maximization of the Fiedler value and minimization of the largest eigenvalue of adjacency matrix for measurement graph. This problem formulation gives virtues twofold. First, it is scalable. For any dataset, when a weight for trade-off is given, this algorithm determines the appropriate number of edges since this is a trade-off optimization problem. Second, the edges of the measurement graph can be distributed evenly. The algorithm considers the minimization of the largest eigenvalue of the adjacency matrix, so it suppresses the upper bound of the maximum degree of the measurement graph. It removes the redundant information concentrated on a few nodes, and improves the estimation accuracy of the sparsified graph. To validate the performance of the proposed trade-off optimization algorithm, we apply our approach to CSAIL, Intel, and Manhattan datasets.
- 29 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (1) , 723-730
Spectral Trade-Off for Measurement Sparsification of Pose-Graph SLAM
In this letter, we propose a trade-off optimization algorithm to compute an appropriate number of edges for measurement (edge) sparsification in pose-graph simultaneous localization and mapping (SLAM). The greater the amount of measurement data, the larger is the computational burden. To reduce computational burden, one can remove a portion of measurements. However, reliable data, such as odometric measurements, can be lost if measurements are removed without any principle. To remove measurements which is redundant, we propose a trade-off optimization algorithm between maximization of the Fiedler value and minimization of the largest eigenvalue of adjacency matrix for measurement graph. This problem formulation gives virtues twofold. First, it is scalable. For any dataset, when a weight for trade-off is given, this algorithm determines the appropriate number of edges since this is a trade-off optimization problem. Second, the edges of the measurement graph can be distributed evenly. The algorithm considers the minimization of the largest eigenvalue of the adjacency matrix, so it suppresses the upper bound of the maximum degree of the measurement graph. It removes the redundant information concentrated on a few nodes, and improves the estimation accuracy of the sparsified graph. To validate the performance of the proposed trade-off optimization algorithm, we apply our approach to CSAIL, Intel, and Manhattan datasets.
- Open Access
- 1 January 2018
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 51 (23) , 188-193
A Posteriori Detection of Moment of Attack on Cyber-physical Systems: A Back-and-forth Observer Approach
- 1 January 2018
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 51 (23) , 188-193
Open AccessA Posteriori Detection of Moment of Attack on Cyber-physical Systems: A Back-and-forth Observer Approach