• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.6
• /
• pp.1129-1136
• /
• 2022

This study leads to the shortcoming that the RSSI distance measurement method is easily affected by the external environment and the position error is large, leading to the problem of optimizing the distance values measured by the RSSI distance measurement nodes in this three-dimensional configuration environment. We proposed the CA-PSO-BP algorithm, which is an improved version of the CA-PSO algorithm. The proposed algorithm allows setting unknown nodes in WSN 3D space. In addition, since CA-PSO was applied to the BP neural network, it was possible to shorten the learning time of the BP network and improve the convergence speed of the algorithm through learning. Through the algorithm proposed in this study, it was proved that the precision of the network location can be increased significantly (15%), and significant results were obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1C
• /
• pp.87-95
• /
• 2010

In this paper, we propose an improved TDoA (Time Difference of Arrival) localization scheme using PSO (Particle Swarm Optimization) in UWB (Ultra Wide Band) systems. The proposed scheme is composed of two steps: re-estimation of TDoA parameters and re-localization of a tag position. In both steps, the PSO algorithm is employed to improve the performance. In the first step, the proposed scheme re-estimates the TDoA parameters obtained by traditional TDoA localization to reduce the TDoA estimation error. In the second step, the proposed scheme with the TDoA parameters estimated in the first step, re-localizes the tag to minimize the location error. The simulation results show that the proposed scheme achieves a more superior location performance to the traditional TDoA localization in both LoS (Line-of-Sight) and NLoS (Non-Line-of-Sight) channel environments.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.7
• /
• pp.638-643
• /
• 2012

This paper presents an intelligent reduction method for external noise. The main idea comes from PSO-FCM (Particle Swam Optimization Fused fuzzy C-Means) clustering. The data of the target is transformed from the antenna coordinates to the vessel one and to the system coordinates. In the conversion, the overall noises hinder observer to get the exact position and velocity of the maneuvering target. While the filter is used for tracking system, unexpected acceleration becomes the main factor which makes the uncertainty. In this paper, the tracking efficiency is improved with the PSO-FCM and the compensation methodology. The acceleration is approximated from the external noise splitted by the proposed clustering method. After extracting the approximated acceleration, the rest in the noise is filtered by the filter and the compensation is added to after that. Proposed tracking method is applicable to the linear model and nonlinear one together. Also, it can do to the on-line system. Finally, some examples are provided to examine the reliability of the proposed method.

• Structural Engineering and Mechanics
• /
• v.63 no.6
• /
• pp.825-835
• /
• 2017

Significant improvements to methodologies on structural damage detection (SDD) have emerged in recent years. However, many methods are related to inversion computation which is prone to be ill-posed or ill-conditioning, leading to low-computing efficiency or inaccurate results. To explore a more accurate solution with satisfactory efficiency, a PSO-INM algorithm, combining particle swarm optimization (PSO) algorithm and an improved Nelder-Mead method (INM), is proposed to solve multi-sample objective function defined based on Bayesian inference in this study. The PSO-based algorithm, as a heuristic algorithm, is reliable to explore solution to SDD problem converted into a constrained optimization problem in mathematics. And the multi-sample objective function provides a stable pattern under different level of noise. Advantages of multi-sample objective function and its superior over traditional objective function are studied. Numerical simulation results of a two-storey frame structure show that the proposed method is sensitive to multi-damage cases. For further confirming accuracy of the proposed method, the ASCE 4-storey benchmark frame structure subjected to single and multiple damage cases is employed. Different kinds of modal identification methods are utilized to extract structural modal data from noise-contaminating acceleration responses. The illustrated results show that the proposed method is efficient to exact locations and extents of induced damages in structures.

• Journal of Korean Neurosurgical Society
• /
• v.63 no.1
• /
• pp.99-107
• /
• 2020

Objective : The purpose of this study was to report the results of pedicle subtraction osteotomy (PSO) for fixed sagittal imbalance with a minimum 2-year follow-up. Besides, authors evaluated the effect of adjunctive multi-level posterior column osteotomy (PCO) on achievement of additional lumbar lordosis (LL) during PSO. Methods : A total of 31 consecutive patients undergoing PSO for fixed sagittal imbalance were enrolled and analyzed. Correction angle of osteotomized vertebra (PSO angle) and other radiographic parameters including pelvic incidence (PI), thoracic kyphosis, LL, and sagittal vertical axis (SVA) were evaluated. Clinical outcomes and surgical complications were also assessed. Results : The mean age was 66.0±9.3 years with a mean follow-up period of 33.2±10.5 months. The mean number of fused segments was 9.6±3.5. The mean operative time and surgical bleeding were 475.9±160.5 minutes and 1406.1±932.1 mL, respectively. The preoperative SRS-22 score was 2.3±0.7 and improved to 3.2±0.8 at the final follow-up. The mean PI was 54.5±9.5°. LL was changed from 7.0±28.9° to -50.2±13.2°. The PSO angle was 33.7±13.5° (15.6±20.1° preoperatively, -16.1±19.4° postoperatively). The difference of correction angle of LL (57.3°) was greater about 23.6° than which of PSO angle (33.7°). SVA was improved from 189.5±93.0 mm, preoperatively to 12.4±40.8 mm, postoperatively. There occurred six, eight, and 14 cases of complications at intraoperative, early (<2 weeks) postoperative, and late (≥2 weeks) postoperative period, respectively. Additional operations were needed in nine patients due to the complications. Conclusion : PSO could provide satisfactory results for patients with fixed sagittal imbalance regarding clinical and radiographic outcomes. Additional correction of LL could be achieved with conduction of adjunctive multi-level PCOs during PSO.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.26 no.2
• /
• pp.218-225
• /
• 2015

Inverse synthetic aperture radar(ISAR) is coherent imaging system formed by conducting signal processing of received data which consists of radar cross section(RCS) reflected from maneuvering target. A novel algorithm is proposed to compensate inter-pulse motion(IPM) for the purpose of forming an well-focused ISAR image through signals generated by stepped chirp waveform( SCW). The velocity and acceleration of the target related to IPM are estimated based on particle swarm optimization (PSO) which has been widely used in optimization technique. Furthermore, a modified PSO which enables us to improve the performance of PSO is used to compensate IPM in a very short-time. Simulation results using point scatterer model of a Boeing-737 aircraft validate the performance of the proposed algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.4
• /
• pp.527-531
• /
• 2012

In this paper, a novel DPSO-QI (Distributed PSO with quantum-infusion mechanism) algorithm improving one of the fatal defect, the so-called premature convergence, that degrades the performance of the conventional PSO algorithms is proposed. The proposed scheme has the following two distinguished features. First, a concept of neighborhood of each particle is introduced, which divides the whole swarm into several small groups with an appropriate size. Such a strategy restricts the information exchange between particles to be done only in each small group. It thus results in the improvement of particles' diversity and further minimization of a probability of occurring the premature convergence phenomena. Second, a quantum-infusion (QI) mechanism based on the quantum mechanics is introduced to generate a meaningful offspring in each small group. This offspring in our PSO mechanism improves the ability to explore a wider area precisely compared to the conventional one, so that the degree of precision of the algorithm is improved. Finally, some numerical results are compared with those of the conventional researches, which clearly demonstrates the effectiveness and reliability of the proposed DPSO-QI algorithm.

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.986-1016
• /
• 2019

Mobile user interface pattern (MUIP) is a kind of structured representation of interaction design knowledge. Several studies have suggested that MUIPs are a proven solution for recurring mobile interface design problems. To facilitate MUIP selection, an effective clustering method is required to discover hidden knowledge of pattern data set. In this paper, we employ the semi-supervised kernel fuzzy c-means clustering (SSKFCM) method to cluster MUIP data. In order to improve the performance of clustering, clustering parameters are optimized by utilizing the global optimization capability of particle swarm optimization (PSO) algorithm. Since the PSO algorithm is easily trapped in local optima, a novel PSO algorithm is presented in this paper. It combines an improved intuitionistic fuzzy entropy measure and a new population search strategy to enhance the population search capability and accelerate the convergence speed. Experimental results show the effectiveness and superiority of the proposed clustering method.

• The KIPS Transactions:PartB
• /
• v.15B no.4
• /
• pp.331-340
• /
• 2008

Feature Selection is one of methods to improve the classification accuracy of data in the field of machine learning. Many feature selection algorithms have been proposed and discussed for years. However, the problem of finding the optimal feature subset from full data still remains to be a difficult problem. Bio-inspired algorithms are well-known evolutionary algorithms based on the principles of behavior of organisms, and very useful methods to find the optimal solution in optimization problems. Bio-inspired algorithms are also used in the field of feature selection problems. So in this paper we proposed new improved bio-inspired algorithms for feature selection. We used well-known bio-inspired algorithms, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), to find the optimal subset of features that shows the best performance in classification accuracy. In addition, we modified the bio-inspired algorithms considering the prior importance (prior relevance) of each feature. We chose the mRMR method, which can measure the goodness of single feature, to set the prior importance of each feature. We modified the evolution operators of GA and PSO by using the prior importance of each feature. We verified the performance of the proposed methods by experiment with datasets. Feature selection methods using GA and PSO produced better performances in terms of the classification accuracy. The modified method with the prior importance demonstrated improved performances in terms of the evolution speed and the classification accuracy.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.58-68
• /
• 2010

Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.