• The Korean Journal of Applied Statistics
• /
• v.23 no.1
• /
• pp.13-28
• /
• 2010

Assuming a mixture distribution for credit evaluation studies, we discuss estimating threshold methods to minimize errors that default borrowers are predicted as non defaults or non defaults are regarded as defaults. A method by using statistical hypotheses tests, the most powerful test and generalized likelihood ratio test, for the probability density functions which are defined with the score random variable and the parameter space consisted of only two elements such as the default and non default states is proposed to estimate a threshold. And anther optimal thresholds to maximize classification accuracy measures of the accuracy and the true rate for ROC and CAP curves are estimated as equations related with these probability density functions. Three kinds of optimal thresholds in terms of the hypotheses testing, the accuracy and the true rate are obtained from normal random samples with various means and variances. The sums of the type I and type II errors corresponding to each optimal threshold are obtained and compared. Finally we discuss about their efficiency and derive conclusions.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.559-570
• /
• 2005

ECN is accurate in determining traffic congestion since it explicitly notifies the incipient congestion. Therefore, ECN method has been thoroughly studied in the field of wireless TCP. This paper introduces a formula to find the optimal threshold for ECN marking. We have implemented a Petri net model of 'TCP with ECN strategy' and performed simulations on it in order to verify the validity of the formula. We have also introduced ideas of applying the formula in practice. The primary contribution of this paper is proposing a formula to find the optimal threshold for ECN marking. However, introducing the Petri net model of 'TCP with ECN strategy' is no less valuable contribution because it can be helpfully used by the researchers in studying network protocols. We have built the Petri net model by modifying the existing Petri net model of TCP. In order to add ECN strategy to the existing model, we have mainly modified the network part. We have also modified sender part and receiver part as well.

• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.268-271
• /
• 2014

Conventional forward error correction (FEC) code rate decision schemes using analytical source coding distortion model and channel-induced distortion model are usually complex, and require the typical process of model parameter training which involves potentially high computational complexity and implementation cost. To avoid the complex modeling procedure, we propose a simple but accurate joint source-channel distortion model to estimate channel loss threshold set for optimal FEC code rate decision.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.368-374
• /
• 2010

Image segmentation is the basic step in the field of the image processing for pattern recognition, environment recognition, and context analysis. The Otsu's automatic threshold selection, which determines the optimal threshold value to maximize the between class scatter using the distribution information of the normalized histogram of a image, is the famous method among the various image segmentation methods. For the automatic threshold selection proposed by Otsu, it is difficult to determine the optimal threshold value by considering the sub-region characteristic of the image because the Otsu's algorithm analyzes the global histogram of a image. In this paper, to alleviate this difficulty of Otsu's image segmentation algorithm and to improve image segmentation capability, the original image is divided into several sub-images by using context fuzzy c-means algorithm. The proposed fuzzy Otsu threshold algorithm is applied to the divided sub-images and the several threshold values are obtained.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.163-169
• /
• 2017

There are various algorithms evaluating a threshold for image segmentation. Among them, Otsu's algorithm sets a threshold based on the histogram. It finds the between-class variance for all over gray levels and then sets the largest one as Otsu's optimal threshold, so we can see that Otsu's algorithm requires a lot of the computation. In this paper, we improved the amount of computational needs by using estimated Otsu's threshold rather than computing for all the threshold candidates. The proposed algorithm is compared with the original one in computation amount and accuracy. we confirm that the proposed algorithm is about 29 times faster than conventional method on single processor and about 4 times faster than on parallel processing architecture machine.

• The Korean Journal of Applied Statistics
• /
• v.24 no.1
• /
• pp.185-191
• /
• 2011

In the credit evaluation study with the assumption of mixture distributions, the ROC curve is a useful method to explore the discriminatory power of default and non-default borrowers. The AROC curve is an adjusted ROC curve that can be identified with the corresponding score and is mathematically analyzed in this work. We obtain patterns of this curve by applying normal distributions. Moreover, the relationship between the AROC curve and many classification accuracy statistics are explored to find the optimal threshold. In the case of equivalent variances of two distributions, we obtain that the local minimum of the AROC curve is estimated at the optimal threshold to maximize certain classification accuracies.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.1-10
• /
• 1995

In this study, a threshold policy is considered for the M/M/2 queueing system with server vacations. The probability generating function for the number of customers present in the system is derived using an embedded Markov chain approach. Then, assuming a linear cost structure, an efficient procedure to find an optimal threshold policy is presented. The Laplace-Stieltjes transofrm for th waiting time of an arbitrary customer under a "FIFO" discipline is also derived.o derived.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.107-113
• /
• 1991

This article develops a control model for an open queueing network in terms of both the input and the output processes with stochastic intensities. The input and the output intensities are subject to some capacity limits and optimum control is characterized by a threshold type with a finite upper barrier. A discounted profit is used as a decision criteria, which is revenue minus operating and holding cost.

• Journal of Biomedical Engineering Research
• /
• v.25 no.4
• /
• pp.235-242
• /
• 2004

In this paper, we proposed the algorithm for detection of microtalcification by automatic threshold decision based on region growing method. The region for optimal threshold is grown from local maximum pixel by increasing repeatedly threshold in microralcification candidate region. Then, the optimal threshold is automatically decided at the maximum value of the contrast and edge sharpness in this region. Microcalcifications could be efficiently detected as satisfied result that true positive ratio is 81.5% and average false positive numbers are 1.1 about total 299 microcalcifirations in real image. In a result, we showed that this algorithm can be used to aid diagnostic-radiologist for the diagnosis of the early phase of breast cancer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4617-4632
• /
• 2021

IEEE 802.11ax is a protocol being developed for high-density Wireless Local Area Networks (WLAN). Several algorithms have been proposed to improve the level of spatial reuse applied in IEEE 802.11ax. However, these algorithms are tentative and do not specify how to select the transmit power and carrier sense threshold in practice; It is unclear when and why the tuned parameters lead to better network performance. In this paper, we restricted the scale of transmit power tuning to prevent the case of backfire in which spatial reuse will result in transmission failure. If the restrictions cannot be satisfied, spatial reuse will be abandoned. This is why we named the proposed scheme as Arbitration based Spatial Reuse (ASR). We quantified the network performance after spatial reuse, and formulate a corresponding maximum problem whose solution is the optimal carrier sense threshold and transmit power. We verified our theoretical analysis by simulation and compared it with previous studies, and the results show that ASR improves the throughput up to 8.6% compared with 802.11ax. ASR can avoid failure of spatial reuse, while the spatial reuse failure rate of existing schemes can up to 36%. To use the ASR scheme in practice, we investigate the relation between the optimal carrier sense threshold and transmit power. Based on the relations got from ASR, the proposed Relation based Spatial Reuse (RSR) scheme can get a satisfactory performance by using only the interference perceived and the previously found relations.