• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1380-1385
• /
• 2015

Collaborative filtering is one of the most successfully used methods for recommender systems and has been utilized in various areas such as books and music. The key point of this method is selecting the most proper recommenders, for which various similarity measures have been studied. To improve recommendation performance, this study analyzes problems of existing recommender selection methods based on similarity and presents a method of dynamically determining recommenders based on the rate of co-rated items as well as similarity. Examination of performance with varying thresholds through experiments revealed that the proposed method yielded greatly improved results in both prediction and recommendation qualities, and that in particular, this method showed performance improvements with only a few recommenders satisfying the given thresholds.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.221-228
• /
• 2005

The paper proposes the improved error diffusion halftoning system to enhance the edges using the spatial perceptual characteristics of the human visual system. The proposed method computes a spatial variation(SV), which is the difference between a pixel luminance and the average of its $3{\times}3$ neighborhood pixels' luminances weighted according to the spatial positioning. Information of edge enhancement(IEE) Is computed using the SV and the local average luminance. The IEE is added to the quantizer's input pixel and feeds into the halftoning quantizer. The quantizer produces the halftone image having the enhanced edge. The performance of the proposed method is compared with conventional methods by measuring the edge correlation. The halftone images by using the proposed method show better quality due to the enhanced edge. And the detailed edge is preserved in the halftone images by using the proposed method.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.4
• /
• pp.89-97
• /
• 2015

In this paper, a method of color image segmentation based on DBSCAN(Density Based Spatial Clustering of Applications with Noise) using compactness of superpixels and texture information is presented. The DBSCAN algorithm can generate clusters in large data sets by looking at the local density of data samples, using only two input parameters which called minimum number of data and distance of neighborhood data. Superpixel algorithms group pixels into perceptually meaningful atomic regions, which can be used to replace the rigid structure of the pixel grid. Each superpixel is consist of pixels with similar features such as luminance, color, textures etc. Superpixels are more efficient than pixels in case of large scale image processing. In this paper, superpixels are generated by SLIC(simple linear iterative clustering) as known popular. Superpixel characteristics are described by compactness, uniformity, boundary precision and recall. The compactness is important features to depict superpixel characteristics. Each superpixel is represented by Lab color spaces, compactness and texture information. DBSCAN clustering method applied to these feature spaces to segment a color image. To evaluate the performance of the proposed method, computer simulation is carried out to several outdoor images. The experimental results show that the proposed algorithm can provide good segmentation results on various images.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.75-79
• /
• 2009

In this paper the method was proposed which uses ${\lambda}$-fuzzy measure to detect the edge of the features of the face region. In the conventional method the features was founded using valley, brightness and edge. This method had its drawbacks that it is so sensitive to the external noises and environments. This paper proposed ${\lambda}$-fuzzy measure to cope with this drawbacks. By considering each weight of the pixels the integral evaluation was considered using the center of area method. Thus the continuity of the edge was kept by way of the neighborhood information and the reduction of time complexity wad resulted in.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.1
• /
• pp.81-88
• /
• 2002

This paper proposes an extraction method which extracts two different thematic maps, which have different line thickness from each other in a raster image that contains the two thematic maps. In the proposed method, the depth of each pixel is calculated according to the amount of pixels in its surrounding neighborhood, and then the thinning is performed. By using depth threshold, two thematic maps are first extracted from the thinning result. There are noise images and skeleton disconnection in the lines of each extracted thematic map. Each thematic map extraction is finally completed after removing the noise images and connecting the disconnected lines. Through the experiment, we showed that the proposed method could be used for the extraction of each thematic map of a raster image which included two thematic maps.

• Journal of Intelligence and Information Systems
• /
• v.18 no.2
• /
• pp.131-141
• /
• 2012

In this paper, we propose a new method for collaborative filtering (CF)-based recommender systems. Traditional CF-based recommendation algorithms have applied constant settings such as a reference group (neighborhood) size and a significance level to all users. In this paper we develop a new method that identifies optimal personalized settings for each user and applies them to generating recommendations for individual users. Personalized parameters are identified through iterative simulations with 'training' and 'verification' datasets. The method is compared with traditional 'constant settings' methods using Netflix data. The results show that the new method outperforms traditional, ordinary CF. Implications and future research directions are also discussed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.347-370
• /
• 2019

In the computer-aided detection (CAD) system of pulmonary nodules, a high false positive rate is common because the density and the computed tomography (CT) values of the vessel and the nodule in the CT images are similar, which affects the detection accuracy of pulmonary nodules. In this paper, a method of automatic detection of pulmonary nodules based on multi-scale enhancement filters and 3D shape features is proposed. The method uses an iterative threshold and a region growing algorithm to segment lung parenchyma. Two types of multi-scale enhancement filters are constructed to enhance the images of nodules and blood vessels in 3D lung images, and most of the blood vessel images in the nodular images are removed to obtain a suspected nodule image. An 18 neighborhood region growing algorithm is then used to extract the lung nodules. A new pulmonary nodules feature descriptor is proposed, and the features of the suspected nodules are extracted. A support vector machine (SVM) classifier is used to classify the pulmonary nodules. The experimental results show that our method can effectively detect pulmonary nodules and reduce false positive rates, and the feature descriptor proposed in this paper is valid which can be used to distinguish between nodules and blood vessels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.1105-1118
• /
• 2014

In this paper, a new reversible data hiding method based on a dual binary tree of embedding levels is proposed. Four neighborhood pixels in the upper, below, left and right of each pixel are used as reference pixels to estimate local complexity for deciding embeddable and non-embeddable pixels. The proposed method does not need to record pixels that might cause underflow, overflow or unsuitable for embedment. This can reduce the size of location map and release more space for payload. Experimental results show that the proposed method is more effective in increasing payload and improving image quality than some recently proposed methods.

• Korean Journal of Computational Design and Engineering
• /
• v.16 no.4
• /
• pp.260-267
• /
• 2011

Nowadays, automobile manufacturers are faced with increasing global competition which is required low cost as well as high quality. To reduce shipping and handling cost and delivery time, lots of automobile manufactures tried to build their new factory in the neighborhood of market. Simultaneously, many factories are under construction in developing countries to make efficient use of low-wage workers. However, because systems are installed in developing countries as the same type of domestic facilities, systems have lots of problems such as high installation cost and inefficient use of manpower. To find core problems and generate optimal solution of these problems, thinking process of TOC(Theory Of Constrains) is used. In case of transmission gear machining system, semi-auto system is proposed as the best solution to increase manpower efficiency and system utilization. Semi-auto system consists of automatic machining process and manual transporting process. The system layout is generated based on semi-auto process concept. And, 3D simulation method using QUEST is used to verify production volume of generated system.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.158-163
• /
• 1998

This paper is our first attempt to construct a information processing system such as the living creatures' brain based on artificial life technique. In this paper, we propose a method of constructing neural networks using bio-inspired emergent and evolutionary concept, Ontogeny of living things is realized by cellular automata model and Phylogeny that is living things adaptation ability themselves to given environment, are realized by evolutionary algorithms. Proposing evolving cellular automata neural systems are calledin a word ECANS. A basic component of ECANS is 'cell' which is modeled on chaotic neuron with complex characteristics, In our system, the states of cell are classified into eight by method of connection neighborhood cells. When a problem is given, ECANS adapt itself to the problem by evolutionary method. For fixed cells transition rule, the structure of neural network is adapted by change of initial cell' arrangement. This initial cell is to become a network b developmental process. The effectiveness and the capability of proposed scheme are verified by applying it to pattern classification and robot control problem.