• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.163-174
• /
• 2004

The 3D tooth model in which each tooth can be manipulated individualy is essential component for the orthodontic simulation and implant simulation in dental field. For the reconstruction of such a tooth model, we need an image segmentation algorithm capable of separating individual tooth from neighboring teeth and alveolar bone. In this paper we propose a CT image normalization method and adaptive optimal thresholding algorithm for the segmenation of tooth region in CT image slices. The proposed segmentation algorithm is based on the fact that the shape and intensity of tooth change gradually among CT image slices. It generates temporary boundary of a tooth by using the threshold value estimated in the previous imge slice, and compute histograms for the inner region and the outer region seperated by the temporary boundary. The optimal threshold value generating the finnal tooth region is computed based on these two histogram.

• The Korean Journal of Applied Statistics
• /
• v.22 no.5
• /
• pp.911-921
• /
• 2009

Receiver Operating Characteristic(ROC) and Cumulative Accuracy Profile(CAP) curves are two methods used to assess the discriminatory power of different credit-rating approaches. The points of optimal classification accuracy on an ROC curve and of maximal profit on a CAP curve can be found by using iso-performance tangent lines, which are based on the standard notion of accuracy. In this paper, we offer an alternative accuracy measure called the true rate. Using this rate, one can obtain alternative optimal threshold points on both ROC and CAP curves. For most real populations of borrowers, the number of the defaults is much less than that of the non-defaults, and in such cases the true rate may be more efficient than the accuracy rate in terms of cost functions. Moreover, it is shown that both alternative scores of optimal classification accuracy and maximal profit are the identical, and this single score coincides with the score corresponding to Kolmogorov-Smirnov statistic used to test the homogeneous distribution functions of the defaults and non-defaults.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.6
• /
• pp.1489-1496
• /
• 2013

Consider the ROC surface which is a generalization of the ROC curve for three-class diagnostic problems. In this work, we propose ve criteria for the three-class ROC surface by extending the Youden index, the sum of sensitivity and specificity, the maximum vertical distance, the amended closest-to-(0,1) and the true rate. It may be concluded that these five criteria can be expressed as a function of two Kolmogorov-Smirnov statistics. A paired optimal thresholds could be obtained simultaneously from the ROC surface. It is found that the paired optimal thresholds selected from the ROC surface are equivalent to the two optimal thresholds found from the two ROC curves.

• Communications for Statistical Applications and Methods
• /
• v.25 no.1
• /
• pp.91-97
• /
• 2018

In this paper, we show that there exists an optimal investment policy for the surplus in a risk model, in which the surplus is continuously invested to other business at a constant rate a > 0, whenever the level of the surplus exceeds a given threshold V > 0. We assign, to the risk model, two costs, the penalty per unit time while the level of the surplus being under V > 0 and the opportunity cost per unit time by keeping a unit amount of the surplus. After calculating the long-run average cost per unit time, we show that there exists an optimal investment rate $a^*$>0 which minimizes the long-run average cost per unit time, when the claim amount follows an exponential distribution.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.103.2-103
• /
• 2002

1. Introduction 2. Structure of BNN 3. Decision of weight value and threshold value 4. Principle of Extension in the ETL algorithm 5. Approximation problem of one circular region 6. Problem of synthetic image having four class 7. Conclusion

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.2
• /
• pp.151-159
• /
• 2008

An efficient location registration scheme is essential to accommodate continuously increasing mobile subscribers and to offer a variety of multimedia services with good quality. In this study, we consider a distance-based registration scheme where the number of location areas varies on the basis of cell-by-cell, not of ring-by-ring, to analyze the optimal size of the location area. Using our proposed cell-by-cell distance-based registration scheme with random walk mobility model, we analyze a variety of circumstances to obtain the optimal number of cells for location area that minimizes total signaling traffic on radio channels. From our analysis results, we show that the optimal number of cells for location area is between 4 and 6 in most cases, and our cell-by-cell distance-based location registration scheme has less signaling traffic than optimal ring-by-ring distance-based location registration scheme where optimal distance threshold is 2 (thus the optimal number of cells for location area is 7).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1418-1432
• /
• 2013

This paper studies the problem of secure information exchange between two sources via multiple relays in the presence of an eavesdropper. To this end, we propose a relay beamforming scheme, i.e., relay beamforming with artificial noise (RBwA), where the relay beamforming vector and the artificial noise vector are jointly designed to maintain the received signal-to-interference-ratio (SINR) at the two sources over a predefined Quality of Service (QoS) threshold while limiting the received SINR at the eavesdropper under a predefined secure threshold. For comparison, the relay beamforming without artificial noise (RBoA) is also considered. We formulate two optimization problems for the two schemes, where our goal is to seek the optimal beamforming vector to minimize the total power consumed by relay nodes such that the secrecy of the information exchange between the two sources can be protected. Since both optimization problems are nonconvex, we solve them by semidefinite program (SDP) relaxation theory. Simulation results show that, via beamforming design, physical layer secrecy of two-way relay networks can be greatly improved and our proposed RBwA outperforms the RBoA in terms of both low power consumption and low infeasibility rate.

• Journal of Biomedical Engineering Research
• /
• v.16 no.3
• /
• pp.337-344
• /
• 1995

Because of the high energy of the treatment beam, contrast of portal films is very poor. Many image processing techniques have been applied to the portal images but a significant drawback is the loss of definition on the edges of the treatment field. Analysis of this problem shows that it may be remedied by separating the treatment field from the background prior to enhancement and uslng only the pixels within the field boundary in the enhancement procedure. A new edge extraction algorithm for accurate extraction of the radiation field boundary from portal Images has been developed for contrast enhancement of portal images. In this paper, portal image segmentation algorithm based on Sobel filtration, labelling processes and morphological thinning has been presented. This algorithm could automatically search the optimal threshold value which is sensitive to the variation of the type and quality of portal images.

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

This paper proposes a new data classification method based on the tolerant rough set that extends the existing equivalent rough set. Similarity measure between two data is described by a distance function of all constituent attributes and they are defined to be tolerant when their similarity measure exceeds a similarity threshold value. The determination of optimal similarity theshold value is very important for the accurate classification. So, we determine it optimally by using the genetic algorithm (GA), where the goal of evolution is to balance two requirements such that (1) some tolerant objects are required to be included in the same class as many as possible. After finding the optimal similarity threshold value, a tolerant set of each object is obtained and the data set is grounded into the lower and upper approximation set depending on the coincidence of their classes. We propose a two-stage classification method that all data are classified by using the lower approxi ation at the first stage and then the non-classified data at the first stage are classified again by using the rough membership functions obtained from the upper approximation set. We apply the proposed classification method to the handwritten numeral character classification. problem and compare its classification performance and learning time with those of the feed forward neural network's back propagation algorithm.

• Fisheries and Aquatic Sciences
• /
• v.4 no.1
• /
• pp.1-9
• /
• 2001

This paper describes a procedure extracting feature vector of a target cell more precisely in the case of identifying specified cell. The classification of object type is based on feature vector such as area, complexity, centroid, rotation angle, effective diameter, perimeter, width and height of the object So, the feature vector plays very important role in classifying objects. Because the feature vectors is affected by noises and holes, it is necessary to remove noises contaminated in original image to get feature vector extraction exactly. In this paper, we propose the following method to do to get feature vector extraction exactly. First, by Otsu's optimal threshold selection method and morphological filters such as cleaning, filling and opening filters, we separate objects from background an get rid of isolated particles. After the labeling step by 4-adjacent neighborhood, the labeled image is filtered by the area filter. From this area-filtered image, feature vector such as area, complexity, centroid, rotation angle, effective diameter, the perimeter based on chain code and the width and height based on rotation matrix are extracted. To prove the effectiveness, the proposed method is applied for yeast Zygosaccharomyces rouxn. It is also shown that the experimental results from the proposed method is more efficient in measuring feature vectors than from only Otsu's optimal threshold detection method.