• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.426-429
• /
• 2003

This paper proposes the threshold value selection for surface classification of 3-dimensional objects. Pre-existing method which uses the H-curvature and K-curvature has limitation in the practical threshold value selection. For this, this paper proposes the threshold value selection by the statistical method. Finally, the effectiveness of this paper demonstrated by experiment.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.3
• /
• pp.20-25
• /
• 2000

This paper proposes the method of surface classification and threshold value selection for surface classification of the three-dimensional object recognition. The processings of three-dimensional image processing system consist of three steps, i.e, acquisition of range data, feature extraction and matching process. This paper proposes the method of shape feature extraction from the acquired rage data in the entire three-dimensional image processing system. In order to achieve these goals, firstly, this article proposes the surface classification method by using the distribution characteristics of sign value from range values. Also pre-existing method which uses the K-curvature and K-curvature has limitation in the practical threshold value selection. To overcome this, this article proposes the selection of threshold value for surface classification. Finally, the effectiveness of this article is demonstrated by the several experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.553-563
• /
• 1996

Detecting edges is one of issues with essentialimprotance in the area of image analysis. An edge in an image is a boundary or contour at which a significant change occurs in image intensity. Edge detection has been studied in many addlications such as imagesegmentation, robot vision, and image compression. In this paper, we propose an automatic threshold selection scheme for edge detection and show its application to noise elimination. The scheme suggested here applied statistical properties of the noise estimated from a noisy image to threshold selection. Since a selected threshold value in the scheme depends on not the characgreistic of an orginal image but the statistical feature of added noise, we can remove ad-hoc manners used for selecting the threshold value as well as decide the value theoretically. Furthermore, that shceme can reduce the number of edge pixels either generated or lost by noise. an application of the scheme to noise elimination is shown here. Noise in the input image can be eliminated with considering the direction of each edge pixedl on the edge map obtained by applying the threshold selection scheme proposed in this paper. Achieving significantly improved results in terms of SNR as well as subjective quality, we can claim that the suggested method works well.

• Journal of information and communication convergence engineering
• /
• v.13 no.2
• /
• pp.113-122
• /
• 2015

Feature subset selection is as a pre-processing step in learning algorithms. In this paper, we propose an efficient algorithm, ModifiedFAST, for feature subset selection. This algorithm is suitable for text datasets, and uses the concept of information gain to remove irrelevant and redundant features. A new optimal value of the threshold for symmetric uncertainty, used to identify relevant features, is found. The thresholds used by previous feature selection algorithms such as FAST, Relief, and CFS were not optimal. It has been proven that the threshold value greatly affects the percentage of selected features and the classification accuracy. A new performance unified metric that combines accuracy and the number of features selected has been proposed and applied in the proposed algorithm. It was experimentally shown that the percentage of selected features obtained by the proposed algorithm was lower than that obtained using existing algorithms in most of the datasets. The effectiveness of our algorithm on the optimal threshold was statistically validated with other algorithms.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.5
• /
• pp.2080-2085
• /
• 2018

There have been numerous studies that extract the R-peak from electrocardiogram (ECG) signals. All of these studies can extract R-peak from ECG. However, these methods are complicated and difficult to implement in a real-time portable ECG device. After filtration choosing a threshold value for R-peak detection is a big challenge. Fixed threshold scheme is sometimes unable to detect low R-peak value and adaptive threshold sometime detect wrong R-peak for more adaptation. In this paper, a simple and robustness algorithm is proposed to detect R-peak with less complexity. This method also solves the problem of threshold value selection. Using the adaptive filter, the baseline drift can be removed from ECG signal. After filtration, an appropriate threshold value is automatically chosen by using the minimum and maximum value of an ECG signals. Then the neighborhood searching scheme is applied under threshold value to detect R-peak from ECG signals. Proposed method improves the detection and accuracy rate of R-peak detection. After R-peak detection, we calculate heart rate to know the heart condition.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.297-302
• /
• 2004

In this paper, the 3-D shape description for the objects with the cone ridge and valley surfaces, and the corresponding threshold value selection for surface classification are considered. The existing method based on the mean and Gaussian curvatures(H and K) of differential geometries cannot properly describe cone primitives, which are some of the most common objects in the real world. Also the existing method for surface classification based on the sign values of H and K has Problems in practical applications. For this, cone surface shapes are classified cone ridges and cone valleys are derived from surfaces using the fact that H values are constant case of cylinder surfaces and variable for cone surfaces, respectively. Also threshold value selection for surface classification from a statistical point of view is proposed. The effectiveness of the proposed methods are verified through experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.721-726
• /
• 2004

The image binarization is applied frequently as one part of the preprocessing phase for a variety of image processing techniques such as character recognition and image analysis, etc. The performance of binarization algorithms is determined by the selection of threshold value for binarization, and most of the previous binarization algorithms analyze the intensity distribution of the original images by using the histogram and determine the threshold value using the mean value of Intensity or the intensity value corresponding to the valley of the histogram. The previous algorithms could not get the proper threshold value in the case that doesn't show the bimodal characteristic in the intensity histogram or for the case that tries to separate the feature area from the original image. So, this paper proposed the novel algorithm for image binarization, which, first, segments the intensity range of grayscale images to several intervals and calculates mean value of intensity for each interval, and next, repeats the interval integration until getting the final threshold value. The interval integration of two neighborhood intervals calculates the ratio of the distances between mean value and adjacent boundary value of two intervals and determine as the threshold value of the new integrated interval the intensity value that divides the distance between mean values of two intervals according to the ratio. The experiment for performance evaluation of the proposed binarization algorithm showed that the proposed algorithm generates the more effective threshold value than the previous algorithms.

• Computers and Concrete
• /
• v.5 no.2
• /
• pp.101-116
• /
• 2008

The microscopic determination of air void characteristics in hardened concrete, defined in EN 480-11 as the linear-traverse method, is an extremely time-consuming and tedious task. Over past decades, several researchers have proposed relatively expensive mechanical automated systems which could replace the human operator in this procedure. Recently, the appearance of new high-resolution flatbed scanners has made it possible for the procedure to be automated in a fully-computerized and thus cost-effective way. The results of our work indicate the high sensitivity of such image analysis automated systems firstly to the quality of sample surface preparation, secondly to the selection of the air void threshold value, and finally to the selection of the probe system. However, it can be concluded that in case of careful validation and the use of the approach which is proposed in the paper, such automated systems can give very good estimate of the air void system parameters, defined in EN 480-11. The amount of time saved by using such a procedure is immense, and there is also the possibility of using alternative stereological methods to assess other, perhaps also important, characteristics of air void system in hardened concrete.

• 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 the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.67-72
• /
• 2005

Most of image binarization algorithms analyzes the intensity distribution using the histogram for the determination of threshold value. When the intensity difference between the foreground object and the background is great, the histogram shows the tendency to be bimodal and the selection of the histogram valley as the threshold value shows the good result. On the other side. when the intensity difference is not great and the histogram doesn't show the bimodal property, the histogram analysis doesn't support the selection of the proper threshold value. This Paper Proposed the novel binarization method that applies the fuzzy membership function to each color value on the RGB color model and, by using the operation results, separates the features having the great readability from the background. The proposed method prevents the loss of information incurred by the gray scale conversion by using the RGB color model and extracts effectively the readable features by using the fuzzy inference Compared with the traditional binarization methods, the proposed method is able to remove the majority of noise areas and show the improved results on the image of transport containers , etc.