• Communications for Statistical Applications and Methods
• /
• v.17 no.1
• /
• pp.17-27
• /
• 2010

Feature selection and feature weighting are useful techniques for improving the classification accuracy of k-Nearest Neighbor (k-NN) classifier. The main propose of feature selection and feature weighting is to reduce the number of features, by eliminating irrelevant and redundant features, while simultaneously maintaining or enhancing classification accuracy. In this paper, a novel hybrid approach is proposed for simultaneous feature selection, feature weighting and choice of k in k-NN classifier based on Genetic Algorithm. The results have indicated that the proposed algorithm is quite comparable with and superior to existing classifiers with or without feature selection and feature weighting capability.

• International Journal of Human Ecology
• /
• v.9 no.1
• /
• pp.53-62
• /
• 2008

This paper examines the changes in housing characteristics occupied by two or more households from 1995-2005, as a replicated follow-up study done by the previous decade of 1985-1995. The data analyzed were based on the Population and Housing Census in 1995, 2000, and 2005 by the Korean National Statistical Office. Results showed decreasing trends in the percentages of housing units occupied by multi-households and of households sharing a housing unit, while the average number of households for a shared housing unit was increasing. Detached dwellings in dongs (neighborhood) including ordinarily single-family detached ones, mainly multi-family houses, were the most often shared with other households even in the trend of the decreasing number of the detached housing. Further research is suggested to focus on housing circumstances of households sharing a detached dwelling in Dongs by the type of detached dwellings.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.6
• /
• pp.30-37
• /
• 1997

We present an efficient technique, bidirectioanl inertial maximum cost search technique, for th edetection and segmentation of circular shaped objects using the spatial information around the neighborhood of the boundary candidates. This technique searches boundary candidates using local pixdl information such as pixel value and its direction. And then to exclude pseudo-boundary caused by shadows or noises, the local contrast is defined between the clique of the boundary candidates and the cliques of the background. In order to effectively segment circular shaped boundary, the technique also uses the curvature based on trigonometirc function which determines circular shaped boundary segments. Since the proposed technique is applied to the pixel cliques instead of a pixel itself, it is proposed method can easily find out circular boundaries form iamges of the PCB containing circular shaped parts and the trees with round fruits compared to boundary detection by using the pixel information and the laplacian curvature.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.1
• /
• pp.64-72
• /
• 1993

We propose "algorithm MA" which can detect PSF that is the functional fault in RAM. This algorithm based on the restricted PSF(or neighborhood PSF) and can detect not only conventional stuck-at and transition faults but also SNPSF, PNPSF and partially ANPSF. The time complexity of "algorithm MA" has 1536xP(P=no. of partition). We propose total BIST(built-in self test) scheme which implement this algorithm in memory chip.ithm in memory chip.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3397-3413
• /
• 2016

Considering that the layered cellular automata (LCA) are naturally fit for representing image data in various applications, a novel reverse iterative image encryption scheme based on LCA is proposed. Specifically, the plain image is set as the final configuration of an 8-layer CA, and some sequences derived from a random sequence are set as the pre-final configuration, which ensure that the same plain image will never be encrypted in the same way when encrypted many times. Then, this LCA is backward evolved by following some reversible two order rules, which are generated with the aid of a newly defined T-shaped neighborhood. The cipher image is obtained from the recovered initial configuration. Several analyses and experimental results show that the proposed scheme possesses a high security level and executive performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.1107-1115
• /
• 1997

In this paper, we propose an error concealment method to recovre damaged block-based image coding schemes. Channel errors during transmission of image data such as bit errors or cell loss result in damaged image blocks in the reconstructed images. To recover damaged blocks is to estimate them using the correctly received or undamaged neighborhood information. In the proposed method, an overcomplete basis for a large block containing a damaged block at its center is introduced and damaged blocks are recovered by sequentially projecting the known neighborhood information onto the overcomplete basis function. Computer simulations show that the proposed algorithm outperforms the conventional method in subjectie recovery qualities as well as objective ones.

• Annual Conference of KIPS
• /
• 2013.05a
• /
• pp.215-218
• /
• 2013

In this paper, we proposed a method for enhancement of color images with sky regions. The input image is converted into HSV space and then sky and non-sky regions are separated. For sky region, saturation enhancement is performed for each pixel based on the enhancement factor calculated from the average saturation of its local neighborhood. On the other hand, for the non-sky region, the enhancement is applied only on the luminance value (V) component of the HSV color image, which is performed in two steps. The luminance enhancement, which is also called as dynamic range compression, is carried out using nonlinear transfer function. Again, each pixel is further enhanced for the adjustment of the image contrast depending upon the center pixel and its neighborhood pixel values. At last, the original H and V component image and enhanced S component image for the sky region, and original H and S component image and enhanced V component image for the non-sky region are converted back to RGB image.

• Advances in aircraft and spacecraft science
• /
• v.10 no.5
• /
• pp.393-418
• /
• 2023

Drones are increasingly used in logistics delivery due to their low cost, high-speed and straight-line flight. Considering the small cargo capacity, limited endurance and other factors, this paper optimized the pickup and delivery vehicle routing problem with time windows in the mode of "truck+drone". A mixed integer programming model with the objective of minimizing transportation cost was proposed and an improved adaptive large neighborhood search algorithm is designed to solve the problem. In this algorithm, the performance of the algorithm is improved by designing various efficient destroy operators and repair operators based on the characteristics of the model and introducing a simulated annealing strategy to avoid falling into local optimum solutions. The effectiveness of the model and the algorithm is verified through the numerical experiments, and the impact of the "truck+drone" on the route cost is analyzed, the result of this study provides a decision basis for the route planning of "truck+drone" mode delivery.

• The KIPS Transactions:PartB
• /
• v.16B no.1
• /
• pp.55-62
• /
• 2009

Collaborative filtering is a popular technique that recommends items based on the opinions of other people in recommender systems. Memory-based collaborative filtering which uses user database can be divided in user-based approaches and item-based approaches. User-based collaborative filtering predicts a user's preference of an item using the preferences of similar neighborhood, while item-based collaborative filtering predicts the preference of an item based on the similarity of items. This paper proposes a combined forecast scheme that predicts the preference of a user to an item by combining user-based prediction and item-based prediction using the ratio of the number of similar users and the number of similar items. Experimental results using MovieLens data set and the BookCrossing data set show that the proposed scheme improves the accuracy of prediction for movies and books compared with the user-based scheme and item-based scheme.

• Proceedings of the Korean Society of Environment and Ecology Conference
• /
• 2009.10a
• /
• pp.211-214
• /
• 2009