• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.2
• /
• pp.146-151
• /
• 2010

This paper proposes a rank-based control method of mutation probability for improving the performances of genetic algorithms (GAs). In order to improve the performances of GAs, GAs should not fall into premature convergence phenomena and should also be able to easily get out of the phenomena when GAs fall into the phenomena without destroying good individuals. For this, it is important to keep diversity of individuals and to keep good individuals. If a method for keeping diversity, however, is not elaborately devised, then good individuals are also destroyed. We should devise a method that keeps diversity of individuals and also keeps good individuals at the same time. To achieve these two objectives, we introduce a rank-based control method of mutation probability in this paper. We set high mutation probabilities to lowly ranked individuals not to fall into premature convergence phenomena by keeping diversity and low mutation probabilities to highly ranked individuals not to destroy good individuals. We experimented our method with typical four function optimization problems in order to measure the performances of our method. It was found from extensive experiments that the proposed rank-based control method could accelerate the GAs considerably.

• Journal of Digital Contents Society
• /
• v.19 no.1
• /
• pp.157-163
• /
• 2018

People who use SNS publish their diverse ideas on SNS every day. The data posted on the SNS contains many people's thoughts and opinions. In particular, popular keywords served on Twitter compile the number of frequently appearing words in user posts and rank them. However, this method is sensitive to unnecessary data simply by listing duplicate words. The proposed method determines the ranking based on the topic of the word using the relationship diagram between words, so that the influence of unnecessary data is less and the main word can be stably extracted. For the performance comparison in terms of the descending keyword rank and the ratios of meaningless keywords among high rank 20 keywords, we make a comparison between the proposed scheme which is based on morphological analysis and PageRank, and the existing scheme which is based on the number of appearances. As a result, the proposed scheme and the existing scheme have included 55% and 70% of meaningless keywords among high rank 20 keywords, respectively, where the proposed scheme is improved about 15% compared with the existing scheme.

• Communications for Statistical Applications and Methods
• /
• v.24 no.6
• /
• pp.673-683
• /
• 2017

The least absolute shrinkage and selection operator (LASSO) has been a popular regression estimator with simultaneous variable selection. However, LASSO does not have the oracle property and its robust version is needed in the case of heavy-tailed errors or serious outliers. We propose a robust penalized regression estimator which provide a simultaneous variable selection and estimator. It is based on the rank regression and the non-convex penalty function, the smoothly clipped absolute deviation (SCAD) function which has the oracle property. The proposed method combines the robustness of the rank regression and the oracle property of the SCAD penalty. We develop an efficient algorithm to compute the proposed estimator that includes a SCAD estimate based on the local linear approximation and the tuning parameter of the penalty function. Our estimate can be obtained by the least absolute deviation method. We used an optimal tuning parameter based on the Bayesian information criterion and the cross validation method. Numerical simulation shows that the proposed estimator is robust and effective to analyze contaminated data.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.3
• /
• pp.173-178
• /
• 2008

In this paper, we present a new impulsive noise detection technique. To remove the impulse noise without detail loss, only corrupted pixels must be filtered. In order to identify the corrupted pixels, a new impulse detector based on rank and value estimations of the current pixel is proposed. Based on the rank and value estimations of the current pixel, the new proposed method provides excellent statistics for detecting an impulse noise while reducing the probability of detecting image details as impulses. The proposed detection is efficient and can be used with any noise removal filter. Simulation results show that the proposed method significantly outperforms many other well-known detection techniques in terms of image restoration and noise detection.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.27-34
• /
• 2014

In this paper, we propose a pupil detection method using hybrid projection function and rank order filter. To reduce error to detect eyebrows as pupil, eyebrows are detected using hybrid projection function in face region and eye region is set to not include the eyebrows. In the eye region, potential pupil candidates are detected using rank order filter and then the positions of pupil candidates are corrected. The pupil candidates are grouped into pairs based on geometric constraints. A similarity measure is obtained for two eye of each pair using template matching, we select a pair with the smallest similarity measure as final two pupils. The experiments have been performed for 700 images of the BioID face database. The pupil detection rate is 92.4% and the proposed method improves about 21.5% over the existing method..

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3745-3761
• /
• 2020

Low-rank representation methods already achieve many applications in the image reconstruction. However, for high-gradient image patches with rich texture details and strong edge information, it is difficult to find sufficient similar patches. Existing low-rank representation methods usually destroy image critical details and fail to preserve edge structure. In order to promote the performance, a new representation-based image super-resolution reconstruction method is proposed, which combines gradient domain guided image filter with the structure-constrained low-rank representation so as to enhance image details as well as reveal the intrinsic structure of an input image. Firstly, we extract the gradient domain guided filter of each atom in high resolution dictionary in order to acquire high-frequency prior information. Secondly, this prior information is taken as a structure constraint and introduced into the low-rank representation framework to develop a new model so as to maintain the edges of reconstructed image. Thirdly, the approximate optimal solution of the model is solved through alternating direction method of multipliers. After that, experiments are performed and results show that the proposed algorithm has higher performances than conventional state-of-the-art algorithms in both quantitative and qualitative aspects.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.19 no.4
• /
• pp.175-184
• /
• 2024

This research addresses the problem of robot localization in corridor environments using LiDAR (Light Detection and Ranging). Due to the rank deficiency problem in scan matching with LiDAR alone, the accuracy of robot localization may degenerate seriously. This paper proposes an adaptive sampling-based particle filtering method using depth sensors to overcome the rank deficiency problem. The increase in the sample size in particle filters can be considered to solve the problem. But, it may cause much computation cost. In the proposed method, the sample size of the particle set in the proposed method is adjusted adaptively to the confidence of depth sensor data. The performance of the proposed method was test by real experiments in various environments. The experimental results showed that the proposed method was capable of reducing the estimation errors and more accurate than the conventional method.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.235-241
• /
• 2019

In this paper, we propose a rank-weighted reconstruction feature to improve the robustness of a feed-forward deep neural network (FFDNN)-based acoustic model. In the FFDNN-based acoustic model, an input feature is constructed by vectorizing a submatrix that is created by slicing the feature vectors of frames within a context window. In this type of feature construction, the appropriate context window size is important because it determines the amount of trivial or discriminative information, such as redundancy, or temporal context of the input features. However, we ascertained whether a single parameter is sufficiently able to control the quantity of information. Therefore, we investigated the input feature construction from the perspectives of rank and nullity, and proposed a rank-weighted reconstruction feature herein, that allows for the retention of speech information components and the reduction in trivial components. The proposed method was evaluated in the TIMIT phone recognition and Wall Street Journal (WSJ) domains. The proposed method reduced the phone error rate of the TIMIT domain from 18.4% to 18.0%, and the word error rate of the WSJ domain from 4.70% to 4.43%.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.40 no.4
• /
• pp.35-48
• /
• 2015

We analyze the systemic risk based on the information flows using the variance decomposition, DebtRank methods, and the Industry Sector Indices during 2001. 01 to 2015. 08. Using the KOSPI stock market as our setting, we find that (i) the systemic risk calculated by information flows of variance decompositions method shows strong positive relations with the market volatility, (ii) the magnitude of systemic risk measured from the information flows network by DebtRank method increases after the subprime financial crisis.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.607-618
• /
• 2002

Crossover design is often used in clinical trials about chronic diseases like hypertension, asthma and arthritis. In this paper, we suggest nonparametric approaches of Friedman-type rank test based on Bernard-van Elteren test and of aligned method keeping the information of blocks based on the AB/BA/AA/BB crossover design. The simulation results are presented to compare experimental error and power of several methods.