• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.8
• /
• pp.1659-1664
• /
• 2011

Fuzzy C-Means (FCM) is one of the most widely used clustering algorithms and has been used in many applications successfully. However, FCM has some shortcomings and initial prototype selection is one of them. As FCM is only guaranteed to converge on a local optimum, different initial prototype results in different clustering. Therefore, much care should be given to the selection of initial prototype. In this paper, a new initialization method for FCM using kernel density estimation (KDE) is proposed to resolve the initialization problem. KDE can be used to estimate non-parametric data distribution and is useful in estimating local density. After KDE, in the proposed method, one initial point is placed at the most dense region and the density of that region is reduced. By iterating the process, initial prototype can be obtained. The initial prototype such obtained showed better result than the randomly selected one commonly used in FCM, which was demonstrated by experimental results.

• The KSFM Journal of Fluid Machinery
• /
• v.14 no.6
• /
• pp.96-101
• /
• 2011

Korea Aerospace Research Institute is performing 3 stage transonic axial compressor development program. This paper introduces design step of the compressor, the performance test results and its analysis. In the fore part of the paper, aerodynamic process of the 3 stage axial compressor is presented. To satisfy both of the mass flow and pressure rise, the compressor should rotate at a high rotational speed. Therefore the transonic flow field forms in the rotor stages and it is designed with a relatively high pressure rise per stage to satisfy its design target. The compressor stage consists of 3 stages, and the bulk pressure ratio is 2.5. The first stage is burdened with the highest pressure ratio and less pressure rises occur in the following stages. Also it is designed that tip Mach number of the first rotor row does not exceed 1.3, while the maximum relative Mach number in the rotor stage is between 1.3~1.4 to increase the compressor flow coefficient. The final design has been confirmed by iterating three dimensional CFD calculations to verify design target and some design intentions. In the latter part of the paper, its performance test processes and results are presented. The performance test result shows that the overall compressor performance targets; pressure ratio and efficiency are well achieved. The stator static pressure distributions show that the blade loading is gradually increasing from the downstream of the compressor.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.6
• /
• pp.93-100
• /
• 2005

We propose an optimal thresholding method for the voxel coloring in the reconstruction of a 3D shape. Our purposed method is a new approach to resolve the trade-off error of the threshold value on determining the photo-consistency in the conventional method. Optimal thresholding value is decided to compare the photo-consistency of a surface with inside voxel on the optic ray of the center camera. As iterating the process of the vokels, the threshold is approached to the optimal value for the individual surface voxel. And also, graph cut method is reduced to the surface noise on eliminating neighboring voxel. To verify the proposed algorithm, we simulated in the virtual and real environment. It is advantaged to speed up and accuracy of a 3D face reconstruction by applying the methods of optimal threshold and graph as compare with conventional algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.542-549
• /
• 2007

Recently, many research activities in the image processing area are concentrated on developing new algorithms by finding the solution of the 'diffusion equation'. The diffusion algorithms are expected to be utilized in numerous applications including noise removal and image restoration, edge detection, segmentation, etc. In this paper, at first, it will be shown that the anisotropic diffusion algorithms have the similar structure with the adaptive FIR filters with cross-shaped 5-tap kernel, and this relatively small-sized kernel causes many iterating procedure for satisfactory filtering effects. Moreover, it will also be shown that lots of modifications which are adopted to the conventional Gaussian diffusion method in order to weaken the edge blurring nature of the linear filtering process increases another computational burden. We propose a new Median diffusion scheme by replacing the adaptive linear filters in the diffusion process with the AWM (Adaptive Weighted Median) filters. A diffusion-equation-based adaptation scheme is also proposed. With the proposed scheme, the size of the diffusion kernel can be increased, and thus diffusion speed greatly increases. Simulation results shows that the proposed Median diffusion scheme outperforms in noise removal (especially impulsive noise), and edge preservation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.810-816
• /
• 2013

In this paper, we propose a SSD (simultaneous single-band duplex) system using Digital Cancellation. Also, we propose a method for Digital Cancellation when RF Cancellation is effectively performed. The proposed system has estimation frame for effective self-interference channel estimation in time-domain. The proposed system calculates signal power for selection of optimal coefficient after digital cancellation. Then, the proposed system selects coefficient of minimum signal power. Further, the proposed system uses LDPC code to minimize the effects of remaining self-interference signal. The proposed system shows BER performance of at 20dB by cancelling self-interference and iterating LDPC code. That is, the proposed system shows that the SSD communication is possible in static self-interference channel.

• East Asian mathematical journal
• /
• v.40 no.2
• /
• pp.183-207
• /
• 2024

This study is a case study that considered fractional senses and fraction operation abilities for 107 gifted students in elementary school classes. In order to find out the fractional sense, in the first question comparing the sizes of fractions 2/3 and 4/5, the students showed a variety of strategies, but the utilization rate of strategies excluding reduction to a common denominator did not exceed 50%. The second question can be solved by using the first question. It is a problem of finding two fractions by selecting four from six numbers 1, 3, 4, 5, 6, and 7 to create two fractions of which sum does not exceed 1. The percentage of correct answers to this question was about 27% (29 out of 107). Only 5 out of 29 students found answers using the first question, and the rest of the students sought answers through trial and error in various calculations. It shows that the item arrangement method from a deductive perspective has no significant effect on elementary school students. The percentage of correct answers was about 27% in the questions to find out the fraction operation ability-the question of drawing a 4/3 bar using a given 3/8-sized bar and 30.7% (23 out of 75) of the students who had wrong answers showed insufficient splitting operation. In addition, it has been shown that the operation of partitioning and iterating to form numerical senses and fractional concepts related to the fractions of the students has no significant impact.

• The Journal of the Korea Contents Association
• /
• v.9 no.5
• /
• pp.61-75
• /
• 2009

Generally, the development of the database application includes the requirement analysis phase of creating ERD (Entity Relationship Diagram) and process models, coding, and testing. From the above phases, the analysis phase is not most formalized. It is usually hard task because (1) customers don't know the details of the desired system; (2) developers can't with ease understand the business logic of the customers; (3) the outcomes of the analysis, which are ERD and process models, are not easy to understand to the customers. This paper propose that the executional forms, which are better to understand the systems, should be presented to the customers instead of the ERD. These forms should accept the data input so that customers can review the various aspects of the outcome models. The developers should be able to instantly implement the business logic and also should be able to visually demonstrate the logic in order to get the details of it. For this goal, the customer supplied business logic should be able to be implemented by the references between forms, actions, constraints from the perspective of the data flow. The customers try to execute the forms implementing the business logic and review their supplied logic find new necessary business logic of their own. Iterating these processes for the requirement analysis would result in the success of the analysis which is sufficiently detailed without conflicts.

• KIISE Transactions on Computing Practices
• /
• v.21 no.12
• /
• pp.774-779
• /
• 2015

In this paper, we present the design and implementation of a large-scale qualitative spatial reasoner using Apache Spark, an in-memory high speed cluster computing environment, which is effective for sequencing and iterating component reasoning jobs. The proposed reasoner can not only check the integrity of a large-scale spatial knowledge base representing topological and directional relationships between spatial objects, but also expand the given knowledge base by deriving new facts in highly efficient ways. In general, qualitative reasoning on topological and directional relationships between spatial objects includes a number of composition operations on every possible pair of disjunctive relations. The proposed reasoner enhances computational efficiency by determining the minimal set of disjunctive relations for spatial reasoning and then reducing the size of the composition table to include only that set. Additionally, in order to improve performance, the proposed reasoner is designed to minimize disk I/Os during distributed reasoning jobs, which are performed on a Hadoop cluster system. In experiments with both artificial and real spatial knowledge bases, the proposed Spark-based spatial reasoner showed higher performance than the existing MapReduce-based one.

• Survey Research
• /
• v.4 no.2
• /
• pp.63-86
• /
• 2003

The objective of this study was to investigate the existence of starting point bias in the bidding game contingent valuation elicitation technique when determining willingness to pay (WTP) for improving the qualify of running water in Seoul and its vicinity. Of all existing contingent techniques, the bidding game most closely mimics the normal price taking behavior in local markets. Three different starting points (low, medium and high) were used to determine WTP and the existence of starting point bias in the meanwhile respectively. The respondents were randomly assigned to the three different starting point groups in order to ensure homogeneity, so that any variation seen in WTP could be attributed to the starting point effects. And a pretested interviewer-administered questionnaire used to elicit WTP. Non-parametric test and the logit model were used to analyze the data for evidence of starting point bias. In this instance, the high starting point group had a high WTP, and low starting point group had a low WTP. This means there exist starting point bias in estimating WTP by bidding game in this instance. This finding might signal that people may actually be making up their minds on the maximum amount they are willing to pay for running water service as a bidding iterating is going on and is influenced by the starting point used in the bidding game. The problem of slaking point bias can be avoided if the respondent is asked directly for the maximum WTP without payment cards or a bidding game. But such a question is perceived as being very difficult to answer and this leads to problems of non-response and being unrealistic.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.6
• /
• pp.514-528
• /
• 2004

An emotion-based video scene retrieval algorithm is proposed in this paper. First, abrupt/gradual shot boundaries are detected in the video clip representing a specific story Then, five video features such as 'average color histogram' 'average brightness', 'average edge histogram', 'average shot duration', and 'gradual change rate' are extracted from each of the videos and mapping between these features and the emotional space that user has in mind is achieved by an interactive genetic algorithm. Once the proposed algorithm has selected videos that contain the corresponding emotion from initial population of videos, feature vectors from the selected videos are regarded as chromosomes and a genetic crossover is applied over them. Next, new chromosomes after crossover and feature vectors in the database videos are compared based on the similarity function to obtain the most similar videos as solutions of the next generation. By iterating above procedures, new population of videos that user has in mind are retrieved. In order to show the validity of the proposed method, six example categories such as 'action', 'excitement', 'suspense', 'quietness', 'relaxation', 'happiness' are used as emotions for experiments. Over 300 commercial videos, retrieval results show 70% effectiveness in average.