Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Pyung Soo Kim has a total of 58 co-authors. Here are the top co-authors by number of shared publications:

  • Wook Hyun Kwon

    Engineering Research Center for Advanced Control and Instrumentation, School of Electrical Engineering and Computer Science, Seoul National University, Seoul, 151–742, Korea

    9 shared publications
  • Eung Hyuk Lee

    Department of Electronic Engineering, Korea Polytechnic University, Siheung-si, Korea

    7 shared publications
  • Malay Kishore Dutta

    Amity Centre for Artificial Intelligence, Amity University, Noida, Uttar Pradesh, India

    7 shared publications
  • Garima Mehta

    Amity University, Noida, India

    5 shared publications
  • Soo Hee Han

    Engineering Research Center for Advanced Control and Instrumentation, School of Electrical Engineering and Computer Science, Seoul National University, Seoul, 151–742, Korea

    5 shared publications
  • Soohong Park

    Samsung

    4 shared publications

Latest Publications

  • Open Access

    Novel Unbiased Optimal Receding-Horizon Fixed-Lag Smoothers for Linear Discrete Time-Varying Systems

    by Bokyu Kwon, Pyung Soo Kim

    This paper proposes novel unbiased minimum-variance receding-horizon fixed-lag (UMVRHF) smoothers in batch and recursive forms for linear discrete time-varying state space models in order to improve the computational efficiency and the estimation performance of receding-horizon fixed-lag (RHF) smoothers. First, an UMVRHF smoother in batch form is proposed by combining independent receding-horizon local estimators for two separated sub-horizons. The local estimates and their error covariance matrices are obtained based on an optimal receding horizon filter and the smoother in terms of the unbiased minimum variance; they are then optimally combined using Millman’s theorem. Next, the recursive form of the proposed UMVRHF smoother is derived to improve its computational efficiency and extendibility. Additionally, we introduce a method for extending the proposed recursive smoothing algorithm to a posteriori state estimations and propose the Rauch–Tung–Striebel receding-horizon fixed-lag smoother in recursive form. Furthermore, a computational complexity reduction technique that periodically switches the two proposed recursive smoothing algorithms is proposed. The performance and effectiveness of the proposed smoothers are demonstrated by comparing their estimation results with those of previous algorithms for Kalman and receding-horizon fixed-lag smoothers via numerical experiments.


  • Open Access

    Selective Finite Memory Structure Filtering Using the Chi-Square Test Statistic for Temporarily Uncertain Systems

    by Pyung Soo Kim

    In this paper, a finite memory structure (FMS) filtering with two kinds of measurement windows is proposed using the chi-square test statistic to cover nominal systems as well as temporarily uncertain systems. First, the simple matrix form for the FMS filter is developed from the conditional density of the current state given finite past measurements. Then, one of the two FMS filters, the primary FMS filter or the secondary FMS filter, with different measurement windows is operated selectively according to the presence or absence of uncertainty, to obtain a valid estimate. The primary FMS filter is selected for the nominal system and the secondary FMS filter is selected for the temporarily uncertain system, respectively. A declaration rule is defined to indicate the presence or absence of uncertainty, operate the suitable one from two filters, and then obtain the valid filtered estimate. A test variable for the declaration rule is developed using a chi-square test statistic from the estimation error and compared to a precomputed threshold. In order to verify the proposed selective FMS filtering and compare with the existing FMS filter and the infinite memory structure (IMS) filter, computer simulations are performed for a selection of dynamic systems including a F404 gas turbine aircraft engine and an electric motor. Simulation results confirm that the proposed selective FMS filtering works well for nominal systems as well as temporarily uncertain systems. In addition, the proposed selective FMS filtering is shown to be remarkably better than the IMS filtering for the temporarily uncertain system.


  • Open Access

    Finite Memory Structure Filtering and Smoothing for Target Tracking in Wireless Network Environments

    by Pyung Soo Kim

    In this paper, a state estimation problem is considered for a target tracking scheme in wireless network environments. Firstly, a unified algorithm of finite memory structure (FMS) filtering and smoothing is proposed for a discrete-time state-space model. As shown in the terminology unified, both FMS filter and smoother are derived by solving one optimization problem directly with incorporation of the unbiasedness constraint. Hence, the unified algorithm provides simultaneously the current state estimate as well as the lagged state estimate using only finite measurements and inputs on the most recent window. The proposed unified algorithm of FMS filtering and smoothing shows that there are some unique properties such as unbiasedness, deadbeat, time-invariance and intrinsic robustness, which cannot be obtained by the recursive infinite memory structure (IMS) filtering such as Kalman filter. The on-line computational complexity of the proposed unified algorithm is discussed. Secondly, as an application of the proposed unified algorithm, a target tracking scheme in wireless network environments is considered via computer simulations for moving target’s accelerations of various shapes. The proposed unified algorithm-based target tracking scheme provides estimates for position as well as acceleration of moving target in real time, while eliminating unwanted noise effects and maintaining desired moving positions. Due to intrinsic robustness and deadbeat properties, the proposed unified algorithm-based scheme can outperform the existing IMS filtering-based scheme when acceleration suddenly changes.


  • Comparison and Analysis of DNS and DOA for Internet of Things Naming System

    by Pyung Soo Kim

    In this paper, a couple of naming systems for Internet of Things(IoT) are surveyed, analyzed and compared. Firstly, a traditional naming system, Domain Name System(DNS) of Internet Engineer Task Force(IETF), is introduced. In addition, several challenges faced by DNS in the IoT are described. Secondly, the newly upcoming naming system, Digital Object Architecture(DOA) of International Telecommunication Union Telecommunication Standardization Sector(ITU-T), is analyzed. And then, these two kinds of naming systems are analyzed and compared from a variety of views.


  • Open Access

    An Efficient and Lossless Cryptosystem for Security in Tele-Ophthalmology Applications Using Chaotic Theory

    by Garima Mehta, Malay Kishore Dutta, Pyung Soo Kim

    Tele-ophthalmology has gained a lot of popularity as it involves retinal fundus images which can be analyzed for identification of severe diseases like diabetic retinopathy and glaucoma. With this increasing popularity, requirement for medical data confidentiality and privacy has also increased during transmission or storage. To meet this challenge, this paper propose an efficient and lossless cryptosystem based upon chaotic theory for encryption of medical fundus images. In the proposed encryption scheme a strategic combination of scrambling and substitution architecture is proposed which complements each other. The proposed scheme of encryption for fundus images is challenging as these images are 3-D color image and cannot be compressed as compression may not be able to retain all relevant medical information. For performance analysis, the proposed algorithm has been evaluated for perceptual and cryptographic security. The experimental results indicate that the proposed method is lossless and resistant against attacks making the proposed scheme suitable for real time applications.


  • Combinational domain-based encryption using FrWT and hyper-chaotic system for biometric data security

    by Garima Mehta, Malay Kishore Dutta, Pyung Soo Kim

    An efficient hyperchaos-based combinational domain encryption scheme for securing iris images during transmission over unsecured data networks or database storage is presented in this article. From the region of interest (ROI) of an iris image, distinctive features are strategically extracted for template creation. The significant part, i.e., the ROI of an iris image, is encrypted in a transformational domain and the nonsignificant region is encrypted in a spatial domain. The advantage of this encryption scheme is increased key space and high degree of security compared to 1-D chaos-based systems. Apart from security, another advantage is reduced computational time compared to conventional encryption schemes implemented in either the spatial or frequency domain. The proposed scheme inherits the advantages of increased key space due to transform orders of the fractional wavelet transform (FrWT) and complex dynamical characteristics of hyperchaos, making the proposed scheme resistant to attacks. The properties of the FrWT and hyperchaos complement each other, making the system efficient and highly robust. Experimental results indicate that the proposed scheme reduces the computational time without compromising the security. Further security analysis is done for various attacks such as differential, statistical, and perceptual attacks, which give promising results and indicate that the proposed encryption scheme is efficient and robust.


  • Open Access

    A Design of Finite Memory Residual Generation Filter for Sensor Fault Detection

    by Pyung Soo Kim

    In the current paper, a residual generation filter with finite memory structure is proposed for sensor fault detection. The proposed finite memory residual generation filter provides the residual by real-time filtering of fault vector using only the most recent finite measurements and inputs on the window. It is shown that the residual given by the proposed residual generation filter provides the exact fault for noisefree systems. The proposed residual generation filter is specified to the digital filter structure for the amenability to hardware implementation. Finally, to illustrate the capability of the proposed residual generation filter, extensive simulations are performed for the discretized DC motor system with two types of sensor faults, incipient soft bias-type fault and abrupt bias-type fault. In particular, according to diverse noise levels and windows lengths, meaningful simulation results are given for the abrupt bias-type fault.


  • Open Access

    A finite memory structure filtering for indoor positioning in wireless sensor networks with measurement delay

    by Pyung Soo Kim, Eung Hyuk Lee, Mun Seok Jang, Shin-Yoon Kang

    In this article, an alternative indoor positioning mechanism is proposed considering finite memory structure filter as well as measurement delay. First, a finite memory structure filter with a measurement delay is designed for the indoor positioning mechanism under a weighted least-squares criterion, which utilizes only finite measurements on the most recent window. The proposed finite memory structure filtering–based mechanism gives the filtered estimates for position, velocity, and acceleration of moving target in real time, while removing undesired noisy effects and preserving desired moving positions. Second, the proposed mechanism is shown to have good inherent properties such as unbiasedness, efficiency, time-invariance, deadbeat, and robustness due to the finite memory structure. Third, through discussions about the choice of window length, it is shown that this can be considered as a useful design parameter to make the performance of the proposed mechanism as good as possible. Finally, computer simulations show that the performance of the proposed finite memory structure filtering–based mechanism can outperform the existing infinite memory structure filtering–based mechanism for the abruptly varying acceleration of moving target.