• The Korean Journal of Applied Statistics
• /
• v.27 no.5
• /
• pp.773-786
• /
• 2014

We propose the multiplication of false rates (MFR) which is a classification accuracy criteria and an area type of rectangle from ROC curve. Optimal threshold obtained using MFR is compared with other criteria in terms of classification performance. Their optimal thresholds for various distribution functions are also found; consequently, some properties and advantages of MFR are discussed by comparing FNR and FPR corresponding to optimal thresholds. Based on general cost function, cost ratios of optimal thresholds are computed using various classification criteria. The cost ratios for cost curves are observed so that the advantages of MFR are explored. Furthermore, the de nition of MFR is extended to multi-dimensional ROC analysis and the relations of classification criteria are also discussed.

• Journal of Applied Reliability
• /
• v.18 no.2
• /
• pp.184-191
• /
• 2018

Purpose: The purpose of this study is to propose a method to calculate the optimal preventive maintenance cycle of radar used in the aviation weapon system of ROKAF. Methods: A hybrid model is used to estimate the optimal preventive maintenance cycle in a system that can perform condition based predictive maintenance (CBPM) through continuous diagnosis. The failure data of the radars operating in the military were used to calculate the reliability. Results: According to the research results, the reliability threshold of the radar began to decrease after 5 flights, and decreased rapidly after 12 flights. Since the second check, costs have continued to decline. Conclusion: A method is proposed to determine the cycle of optimal preventive maintenance of radar within operational budget through modeling results between reliability limit and cost for radar. The results can be used to determine the optimal preventive maintenance cycle and frequency of various avionics equipment.

• The Journal of the Korea Contents Association
• /
• v.11 no.6
• /
• pp.18-25
• /
• 2011

Salient object attracts more and more attention from researchers due to its important role in many fields of multimedia processing like tracking, segmentation, adaptive compression, and content-base image retrieval. Usually, a saliency map is binarized into black and white map, which is considered as the binary mask of the salient object in the image. Still, the threshold is heuristically chosen or parametrically controlled. This paper suggests using the global optimal threshold to perform saliency map thresholding. This work also considers the usage of multi-level optimal thresholds and the local adaptive thresholds in the experiments. These experimental results show that using global optimal threshold method is better than parametric controlled or local adaptive threshold method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4603-4624
• /
• 2016

In this paper, a new reversible watermarking algorithm with adaptive embedding threshold matrix is proposed. Firstly, to avoid the overflow and underflow, two flexible thresholds, TL and TR, are applied to preprocess the image histogram with least histogram shift cost. Secondly, for achieving an optimal or near optimal tradeoff between the embedding capacity and imperceptibility, the embedding threshold matrix, composed of the embedding thresholds of all blocks, is determined adaptively by the combination between the composite chaos and the average energy of Integer Wavelet Transform (IWT) block. As a non-liner system with good randomness, the composite chaos is suitable to search the optimal embedding thresholds. Meanwhile, the average energy of IWT block is calculated to adjust the block embedding capacity, and more data are embedded into those IWT blocks with larger average energy. The experimental results demonstrate that compared with the state-of-the-art reversible watermarking schemes, the proposed scheme has better performance for the tradeoff between the embedding capacity and imperceptibility.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.172-174
• /
• 2004

무선 네트워크의 TCP 성능을 제고하기 위한 방법으로 ECN 방법이 심도 있게 연구되었다. 그러나, ECN 마킹을 위한 최적의 threshold에 대한 연구 결과는 찾아 보기 힘들다. 본 논문은 ECN 마킹을 위한 최적의 threshold를 찾는 식을 제시하고, ECN 전략을 적용하는 TCP의 페트리 넷 모형을 구축한 다음, 시뮬레이션을 통하여 제시된 식의 타당성을 검증한다. 또한 제시된 식의 실용화 방안도 제안한다.

• IE interfaces
• /
• v.24 no.4
• /
• pp.295-303
• /
• 2011

This paper presents a discrete time optimal asset buying problem with a predetermined final deadline where an available budget is limited. A cost is paid to search for assets called the search cost. A seller who shows up offers a price for the asset and then the buyer decides whether or not to buy the asset by comparing the offered price to his optimal selection threshold. When the budget becomes less than the search cost or the price of the asset the buyer can get a necessary loan with some interests. We clarify the properties of the buyer's optimal selection threshold in order to maximize the expected value of budget which is left after paying all the search costs and the price of the asset at that point in time.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.862-863
• /
• 2015

This paper presents an improved estimation procedure for the contribution to no-load flux linkage created by the permanent magnet (PM) in interior permanent magnet synchronous machines. In the proposed method, the saturation effect in stator and rotor cores are taken into account by utilizing the frozen permeability method (FPM). This improved procedure can evaluate the contribution for each local element in the PM to the no-load flux linkage. According to the analysis results, an effective PM topology optimal design can be carried out to achieve high utilization ratio of PM in the machine. In order to determine the threshold of the low contribution of PM for removing, one multi-objective optimization model is proposed. Based on the optimal threshold, the final optimal topology design of PM can be achieved.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.131-138
• /
• 2016

In this paper, we propose a simple linear bottleneck assignment problems (LBAP) algorithm to find the optimal solution. Generally, the LBAP has been solved by threshold or augmenting path algorithm. The primary characteristic of proposed algorithm is derived the optimal solution of LBAP from linear sum assignment problem (LSAP). Firstly, we obtains the solution for LSAP from the selected minimum cost of rows and moves the duplicated costs in row to unselected row with minimum increasing cost in direct and indirect paths. Then, we obtain the optimal solution of LBAP according to the maximum cost of LSAP can be move to less cost. For the 29 balanced and 7 unbalanced problem, this algorithm finds optimal solution as simple.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.312-321
• /
• 2007

We address a disposal issue of returned products in a product recovery system where a single product is stocked in order to meet a demand from customers who may return products after usage. Product returns occur randomly and can be accepted for remanufacturing or disposed of depending on the state of the system. We examine the structure of the optimal disposal policy for returned product that utilizes the information of the inventory of both serviceable and remanufacturable products. Numerical study indicates that it can be characterized by a monotonic threshold type of the curve. A disposal is allowed only when the remanufacturable inventory level exceeds a threshold which is the function of the inventory level of serviceable product and it is decreasing as the serviceable inventory level increases. Sensitivity analysis also indicates that the optimal disposal policy and the optimal profit have monotonic properties with respect to system parameters.

• The Korean Journal of Applied Statistics
• /
• v.25 no.6
• /
• pp.1027-1036
• /
• 2012

Among various biometrics recognition systems, statistical fingerprint recognition matching methods are considered using minutiae on fingerprints. We define similarity distance measures based on the coordinate and angle of the minutiae, and suggest a fingerprint recognition model following statistical distributions. We could obtain confidence intervals of similarity distance for the same and different persons, and optimal thresholds to minimize two kinds of error rates for distance distributions. It is found that the two confidence intervals of the same and different persons are not overlapped and that the optimal threshold locates between two confidence intervals. Hence an alternative statistical matching method can be suggested by using nonoverlapped confidence intervals and optimal thresholds obtained from the distributions of similarity distances.