• Journal of Integrative Natural Science
• /
• v.9 no.1
• /
• pp.10-15
• /
• 2016

In this paper the approximation methods of offset curve of conic with explicit error bound are considered. The quadratic approximation of conic(QAC) method, the method based on quadratic circle approximation(BQC) and the Pythagorean hodograph cubic(PHC) approximation have the explicit error bound for approximation of offset curve of conic. We present the explicit upper bound of the Hausdorff distance between the offset curve of conic and its PHC approximation. Also we show that the PHC approximation of any symmetric conic is closer to the line passing through both endpoints of the conic than the QAC.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.429-431
• /
• 2012

Vehicle-logo recognition technology is very important in vehicle automatic recognition technique. The intended application is automatic recognition of vehicle type for secure access and traffic monitoring applications, a problem not hitherto considered at such a level of accuracy. Vehicle-logo recognition can improve Vehicle type recognition accuracy. So in this paper, introduces how to vehicle-logo recognition. First introduces the region of the license plate by algorithm and roughly located the region of car emblem based on the relationship of license plate and car emblem. Then located the car emblem with precision by the distance of Hausdorff. On the base, processing the region by morphologic, edge detection, analysis of connectivity and pick up the PCA character by lowing the dimension of the image and unifying the PCA character. At last the logo can be recognized using the algorithm of support vector machine. Experimental results show the effectiveness of the proposed method.

• Journal of the Semiconductor & Display Technology
• /
• v.16 no.4
• /
• pp.79-85
• /
• 2017

Understanding of human emotion has a high importance in interaction between human and machine communications systems. The most expressive and valuable way to extract and recognize the human's emotion is by facial expression analysis. This paper presents and implements an automatic extraction and recognition scheme of facial expression and emotion through still image. This method has three main steps to recognize the facial emotion: (1) Detection of facial areas with skin-color method and feature maps, (2) Creation of the Bezier curve on eyemap and mouthmap, and (3) Classification and distinguish the emotion of characteristic with Hausdorff distance. To estimate the performance of the implemented system, we evaluate a success-ratio with emotional face image database, which is commonly used in the field of facial analysis. The experimental result shows average 76.1% of success to classify and distinguish the facial expression and emotion.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.28 no.1
• /
• pp.22-32
• /
• 2024

In this paper we present a method of conic section approximation by hexic Bézier curves. The hexic Bézier approximants are G³ Hermite interpolations of conic sections. We show that there exists at least one hexic Bézier approximant for each weight of the conic section The hexic Bézier approximant depends one parameter and it can be obtained by solving a quartic polynomial, which is solvable algebraically. We present the explicit upper bound of the Hausdorff distance between the conic section and the hexic Bézier approximant. We also prove that our approximation method has the maximal order of approximation. The numerical examples for conic section approximation by hexic Bézier curves are given and illustrate our assertions.

• The Pure and Applied Mathematics
• /
• v.31 no.3
• /
• pp.251-265
• /
• 2024

The main aim of this article is to present new fixed point results concerning existence of selection for a multivalued map on hyperconvex product space taking values on bounded, externally hyperconvex subsets under some appropriate hypothesis. Our results are significant extensions of some pioneering results in the literature, in particular M. A. Khamsi, W. A. Krik and Carlos Martinez Yanez, have proved the existence of single valued selection of a lipschitzian multi-valued map on hyperconvex space. Some suitable examples are also given to support and understand the applicability of our results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.3
• /
• pp.568-576
• /
• 2003

This paper proposes a moving object tracking algorithm by using hierarchical search method in dynamic scenes. Proposed algorithm is based on two main steps: generation step of initial model from different pictures, and tracking step of moving object under the time-yawing scenes. With a series of this procedure, tracking process is not only stable under far distance circumstance with respect to the previous frame but also reliable under shape variation from the 3-dimensional(3D) motion and camera sway, and consequently, by correcting position of moving object, tracking time is relatively reduced. Partial Hausdorff distance is also utilized as an estimation function to determine the similarity between model and moving object. In order to testify the performance of proposed method, the extraction and tracking performance have tested using some kinds of moving car in dynamic scenes. Experimental results showed that the proposed algorithm provides higher performance. Namely, matching order is 28.21 times on average, and considering the processing time per frame, it is 53.21ms/frame. Computation result between the tracking position and that of currently real with respect to the root-mean-square(rms) is 1.148. In the occasion of different vehicle in terms of size, color and shape, tracking performance is 98.66%. In such case as background-dependence due to the analogy to road is 95.33%, and total average is 97%.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.45-52
• /
• 2004

According tothe development of digital media technologies various algorithms for video sequence matching have been proposed to match the video sequences efficiently. A large number of video sequence matching methods have focused on frame-wise query, whereas a relatively few algorithms have been presented for video sequence matching or video shot matching. In this paper, we propose an efficientalgorithm to index the video sequences and to retrieve the sequences for video sequence query. To improve the accuracy and performance of video sequence matching, we employ the Cauchy function as a similarity measure between histograms of consecutive frames, which yields a high performance compared with conventional measures. The key frames extracted from segmented video shots can be used not only for video shot clustering but also for video sequence matching or browsing, where the key frame is defined by the frame that is significantly different from the previous fames. Several key frame extraction algorithms have been proposed, in which similar methods used for shot boundary detection were employed with proper similarity measures. In this paper, we propose the efficient algorithm to extract key frames using the cumulative Cauchy function measure and. compare its performance with that of conventional algorithms. Video sequence matching can be performed by evaluating the similarity between data sets of key frames. To improve the matching efficiency with the set of extracted key frames we employ the Cauchy function and the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed method yields the high matching performance and accuracy with a low computational load compared with conventional algorithms.

• Journal of the Korean Society of Radiology
• /
• v.18 no.3
• /
• pp.213-222
• /
• 2024

This study analyzed the volumes generated by deep learning and atlas-based automatic segmentation methods, as well as the Dice similarity coefficient and 95% Hausdorff distance, according to the conditions of conduction voltage and conduction current in computed tomography for lung radiotherapy. The first result, the volumes generated by the atlas-based smart segmentation method showed the smallest volume change as a function of the change in tube voltage and tube current, while Aview RT ACS and OncoStudio using deep learning showed smaller volumes at tube currents lower than 100 mA. The second result, the Dice similarity coefficient, showed that Aview RT ACS was 2% higher than OncoStuido, and the 95% Hausdorff distance results also showed that Aview RT ACS analyzed an average of 0.2-0.5% higher than OncoStudio. However, the standard deviation of the respective results for tube current and tube voltage is lower for OncoStudio, which suggests that the results are consistent across volume variations. Therefore, caution should be exercised when using deep learning-based automatic segmentation programs at low perfusion voltages and low perfusion currents in CT imaging conditions for lung radiotherapy, and similar results were obtained with conventional atlas-based automatic segmentation programs at certain perfusion voltages and perfusion currents.

• Journal of the Korea society of information convergence
• /
• v.7 no.2
• /
• pp.59-65
• /
• 2014

Grassfire spot matching method is based on similarity comparison of topological patterns for neighbor spots. This is a method where spot matching is performed as if fire spreads all around on grass. Spot matching starts from a seed spot pair confirmed as a matched pair of spots and spot matching spreads to the direction where the best matching result is produced. In this paper, it is a bit complicated way of grassfire method where multi-seed matched spot pair are manually selected and spot matching is performed from each multi-seed matched spot pair. The proposed method shows better performance in detection rate and accuracy than that of the previous method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2788-2808
• /
• 2023

Brain tumors are one of the most threatening malignancies for humans. Misdiagnosis of brain tumors can result in false medical intervention, which ultimately reduces a patient's chance of survival. Manual identification and segmentation of brain tumors from Magnetic Resonance Imaging (MRI) scans can be difficult and error-prone because of the great range of tumor tissues that exist in various individuals and the similarity of normal tissues. To overcome this limitation, the Amended Convolutional Neural Network (ACNN) model has been introduced, a unique combination of three techniques that have not been previously explored for brain tumor detection. The three techniques integrated into the ACNN model are image tissue preprocessing using the Kalman Bucy Smoothing Filter to remove noisy pixels from the input, image tissue segmentation using the Isotonic Regressive Image Tissue Segmentation Process, and feature extraction using the Marr Wavelet Transformation. The extracted features are compared with the testing features using a sigmoid activation function in the output layer. The experimental findings show that the suggested model outperforms existing techniques concerning accuracy, precision, sensitivity, dice score, Jaccard index, specificity, Positive Predictive Value, Hausdorff distance, recall, and F1 score. The proposed ACNN model achieved a maximum accuracy of 98.8%, which is higher than other existing models, according to the experimental results.