• Journal of Biomedical Engineering Research
• /
• v.24 no.2
• /
• pp.91-97
• /
• 2003

The Propose of this paper is hierarchical detection method for the optic disc in fundus image. We detected the optic disc boundary by using the Prior information. It is based on the anatomical knowledge of fundus which are the vessel information. the image complexity. and etc. The whole method can be divided into three stages . First, we selected the region of interest(ROI) which included optic disc region. This is used to calculate location and size of the optic disc which are prior knowledge to simplify image preprocessing. And then. we divided the fundus image into numberous regions with watershed algorithm and detected intial boundary of the optic disc by reducing the number of the separated regions in ROI. Finally, we have searching the defective parts of boundary as a result of serious vessel interference in order to detect the accurate boundary of optic disc and we have removing and interpolating them.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.334-338
• /
• 2010

컴퓨터 기술의 발달 및 웹의 확산으로 인해 개인이 얻을 수 있는 정보의 양이 증가되었지만, 이로 인해 필요한 관련 정보를 탐색하는 것과 다량의 정보로부터 지식을 창출한다는 것이 어렵게 되었고, 고객 또는 사용자에 대한 학습 과정 및 정보의 개인화 등의 문제가 대두되게 되었다. 이러한 문제들을 해소하기 위해 웹으로부터 정보를 얻을 수 있는 자동화된 툴이 필요하게 되었고, 얻은 정보를 이용하여 웹 사용자들의 패턴을 식별할 수 있는 방법 또한 필요하게 되었다. 이러한 관심은 데이터 마이닝을 온라인에서 적용하고자 하는 노력으로 이어졌고, 현재 데이터 마이닝 기술을 온라인에 적용한 웹 마이닝 기술을 사용하고 있다. 웹 마이닝은 웹의 방대한 양의 자료 및 구조를 좀 더 유용하고, 효율적인 정보로 가공하여 사용자에게 제공할 수 있도록 도와주는 기술이다. 본 논문에서는 웹 마이닝의 전반적인 개념과 분류를 소개한다. 또한, 웹 마이닝의 분류 중 웹 구조 마이닝에 초점을 맞추어 개념 및 웹 구조 마이닝의 대표적인 알고리듬을 소개한다.

• Journal of Broadcast Engineering
• /
• v.13 no.6
• /
• pp.915-929
• /
• 2008

In this paper, we propose an algorithm for pixel-based disparity estimation with reliability in the multi-view image. The proposed method estimates an initial disparity map using edge information of an image, and the initial disparity map is used for reducing the search range to estimate the disparity efficiently. Furthermore, disparity-mismatch on object boundaries and textureless-regions get reduced by adaptive block size. We generated intermediate-view images to evaluate the estimated disparity. Test results show that the proposed algorithm obtained $0.1{\sim}1.2dB$ enhanced PSNR(peak signal to noise ratio) compared to conventional block-based and pixel-based disparity estimation methods.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.11
• /
• pp.1796-1801
• /
• 2001

For micro-machines, very few design methodologies based on optimization hale been developed so far. To overcome the difficulties of design optimization of micro-machines, the search method for multi-dimensional design window (DW)s is proposed. The proposed method is defined as areas of satisfactory design solutions in a design parameter space, using both continuous evolutionary algorithms (CEA) and the modified K-means clustering algorithm . To demonstrate practical performance of the proposed method, it was applied to an optimal shape design of micro electrostatic actuator of optical memory. The shape design problem has 5 design parameters and 5 objective functions, and finally shows 4 specific design shapes and design characters based on the proposed DWs.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.114-122
• /
• 2010

The Probabilistic Traveling Salesman Problem (PTSP) is an important topic in the study of traveling salesman problem and stochastic routing problem. The goal of PTSP is to find a priori tour visiting all customers with a minimum expected length, which simply skips customers not requiring a visit in the tour. There are many existing researches for the homogeneous version of the problem, where all customers have an identical visiting probability. Otherwise, the researches for the heterogeneous version of the problem are insufficient and most of them have focused on search base algorithms. In this paper, we propose a simple construction algorithm to solve the heterogeneous PTSP. The Minimum Expected Length Insertion (MELI) algorithm is a construction algorithm and consists of processes to decide a sequence of visiting customers by inserting the one, with the minimum expected length between two customers already in the sequence. Compared with optimal solutions, the MELI algorithm generates better solutions when the average probability is low and the customers have different visiting probabilities. We also suggest a local search method which improves the initial solution generated by the MELI algorithm.

• School Mathematics
• /
• v.11 no.1
• /
• pp.71-91
• /
• 2009

The purpose of this study was to analyze operation sense in detail with regard to division of fraction. For this purpose, two sixth grade students who were good at calculation were clinically interviewed three times. The analysis was focused on (a) how the students would understand the multiple meanings and models of division of fraction, (b) how they would recognize the meaning of algorithm related to division of fraction, and (c) how they would employ the meanings and properties of operation in order to translate them into different modes of representation as well as to develop their own strategies. This paper includes several episodes which reveal students' qualitative difference in terms of various dimensions of operation sense. The need to develop operation sense is suggested specifically for upper grades of elementary school.

• Journal of Integrative Natural Science
• /
• v.2 no.2
• /
• pp.55-58
• /
• 2009

A ligand-receptor docking program is an indispensible tool in modern pharmaceutical design. An accurate prediction of small molecular docking pose to a receptor is essential in drug design as well as molecular recognition. An effective docking program requires the ability to locate a correct binding pose in a surprisingly complex conformational space. However, there is an inherent difficulty to predict correct binding pose. The odds are more demanding than finding a needle in a haystack. This mainly comes from the flexibility of both ligand and receptor. Because the searching space to consider is so vast, receptor rigidity has been often applied in docking programs. Even nowadays the receptor may not be considered to be fully flexible although there have been some progress in search algorithm. Improving the efficiency of searching algorithm is still in great demand to explore other applications areas with inherently flexible ligand and/or receptor. In addition to classical search algorithms such as molecular dynamics, Monte Carlo, genetic algorithm and simulated annealing, rather recent algorithms such as tabu search, stochastic tunneling, particle swarm optimizations were also found to be effective. A good search algorithm would require a good balance between exploration and exploitation. It would be a good strategy to combine algorithms already developed. This composite algorithms can be more effective than an individual search algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.1
• /
• pp.42-48
• /
• 2002

In this paper, a decision method using multiple threshold values for PN code acquisition in Direct Sequence Code Division Multiple Access (DS-CDMA) systems is described. We apply this technique to the conventional double dwell serial search algorithm and analyze it in terms of mean code acquisition time. For the analysis, we present mathematical model of proposed algorithm and also perform the simulation under IMT-2000 channel models. Numerical results show that our proposed scheme outperforms the conventional one by 0.2 - 0.5 sec with respect to the mean code acquisition time because multiple threshold values mitigate the possible decline in search performance caused by the use of a single threshold.

• Speech Sciences
• /
• v.8 no.4
• /
• pp.17-33
• /
• 2001

In this paper, we implement the large variable vocabulary speech recognition system, which is characterized by no additional pre-training process and no limitation of recognized word list. We have designed the system in order to achieve the high recognition rate using the decision tree based state tying algorithm and in order to reduce the processing time using the gaussian selection based variable flooring algorithm, the limitation algorithm of the number of nodes and ENNS algorithm. The gaussian selection based variable flooring algorithm shows that it can reduce the total processing time by more than half of the recognition time, but it brings about the reduction of recognition rate. In other words, there is a trade off between the recognition rate and the processing time. The limitation algorithm of the number of nodes shows the best performance when the number of gaussian mixtures is a three. Both of the off-line and on-line experiments show the same performance. In our experiments, there are some differences of the recognition rate and the average recognition time according to the distinction of genders, speakers, and the number of vocabulary.

• Journal of Information Technology Applications and Management
• /
• v.9 no.4
• /
• pp.13-34
• /
• 2002

This paper considers a postal transportation planning problem in the transportation network of the form of hub and spoke Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. The tabu search uses the best-admissible strategy, BA, and the first-best-admissible strategy, FBA. The algorithm was tested on problems consisting of 11, 16 and 21 mail sorting centers including one exchange center. Solutions of the problems consisting of 11 mail sorting centers including one exchange center were compared with optimal solutions On average, solutions using BA strategy were within 0.287% of the optimum and solutions using FBA strategy were within 0.508% of the optimum. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is very good.