• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.8
• /
• pp.1129-1135
• /
• 2013

A new vehicle detection algorithm based on the multiple optimal Adaboost classifiers with optimal feature selection is proposed. It consists of two major modules: 1) Theoretical DDISF(Distance Dependent Image Scaling Factor) based image scaling by site modeling of the installed cameras. and 2) optimal features selection by Haar-like feature analysis depending on the distance of the vehicles. The experimental results of the proposed algorithm shows improved recognition rate compare to the previous methods for vehicles and non-vehicles. The proposed algorithm shows about 96.43% detection rate and about 3.77% false alarm rate. These are 3.69% and 1.28% improvement compared to the standard Adaboost algorithmt.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.3
• /
• pp.554-559
• /
• 2009

This paper proposes a new method of weighted template matching fur machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. The experiment compares confusion matrices of the template matching, error back propagation neural network classifier, and the proposed weighted template matching respectively. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.764-776
• /
• 2008

Image identification is the process of checking whether the query image is the transformed version of the specific original image or not. In this paper, image identification method based on feature composition is proposed. Used features include color distance, texture information and average pixel intensity. We extract color characteristics using color distance and texture information by Modified Generalized Symmetry Transform as well as average intensity of each pixel as features. Individual feature is quantized adaptively to be used as bins of histogram. The histogram is normalized according to data type and it is used as the signature in comparing the query image with database images. In matching part, Manhattan distance is used for measuring distance between two signatures. To evaluate the performance of the proposed method, independent test and accuracy test are achieved. In independent test, 60,433 images are used to evaluate the ability of discrimination between different images. And 4,002 original images and its 29 transformed versions are used in accuracy test, which evaluate the ability that the proposed algorithm can find the original image correctly when some transforms was applied in original image. Experiment results show that the proposed identification method has good performance in accuracy test. And the proposed method is very useful in real environment because of its high accuracy and fast matching capacity.

• Journal of Korea Multimedia Society
• /
• v.22 no.1
• /
• pp.27-34
• /
• 2019

In this paper, a new type of lip feature is proposed as distance metric in CIELUV color system. The performance of the proposed feature was tested on face image database, Helen dataset from University of Illinois. The test processes consists of three steps. The first step is feature extraction and second step is principal component analysis for the optimal projection of a feature vector. The final step is Otsu's threshold for a two-class problem. The performance of the proposed feature was better than conventional features. Performance metrics for the evaluation are OverLap and Segmentation Error. Best performance for the proposed feature was OverLap of 65% and 59 % of segmentation error. Conventional methods shows 80~95% for OverLap and 5~15% of segmentation error usually. In conventional cases, the face database is well calibrated and adjusted with the same background and illumination for the scene. The Helen dataset used in this paper is not calibrated or adjusted at all. These images are gathered from internet and therefore, there are no calibration and adjustment.

• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.794-803
• /
• 2009

In this paper, we will present a container auto-landing system, the system use the stereo camera to measure the container depth information. And the container region can be detected by using its hough line feature. In the line feature detection algorithm, we will detect the parallel lines and perpendicular lines which compose the rectangle region. Among all the candidate regions, we can select the region with the same aspect-ratio to the container. The region will be the detected container region. After having the object on both left and right images, we can estimate the distance from camera to object and container dimension. Then all the detect dimension information and depth inform will be applied to reconstruct the virtual environment of crane which will be introduce in this paper. Through the simulation result, we can know that, the container detection rate achieve to 97% with simple background. And the estimation algorithm can get a more accuracy result with a far distance than the near distance.

• Journal of Industrial Technology
• /
• v.20 no.B
• /
• pp.219-226
• /
• 2000

In this paper, we propose a new novel method for similarity search that supports time warping. Our primary goal is to innovate on search performance in large databases without false dismissal. To attain this goal, we devise a new distance function $D_{tw-lb}$ that consistently underestimates the time warping distance and also satisfies the triangular inequality. $D_{tw-lb}$ uses a 4-tuple feature vector extracted from each sequence and is invariant to time warping. For efficient processing, we employ a multidimensional index that uses the 4-tuple feature vector as indexing attributes and $D_{tw-lb}$ as a distance function. We prove that our method does not incur false dismissal. To verify the superiority of our method, we perform extensive experiments. The results reveal that our method achieves significant speedup up to 43 times with real-world S&P 500 stock data.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1231-1233
• /
• 1996

This paper presents an estimation of relative distance and angle from a mobile robot to an object. From the number of pulses required to make the mobile robot move to the feature point, we find the relative distance and angle between the mobile robot and the object. The proposed method shows a practical way of measuring the relative distance and angle between the mobile robot and an object without setting up real world coordinate system.

• Journal of Welding and Joining
• /
• v.16 no.5
• /
• pp.108-118
• /
• 1998

This study proposes th analysis and evaluation method of time series ultrasonic signal using the chaos feature extraction for ultrasonic pattern recognition. Features extracted from time series data using the chaos time series signal analyze quantitatively weld defects. For this purpose, analysis objective in this study is fractal dimension and Lyapunov exponent. Trajectory changes in the strange attractor indicated that even same type of defects carried substantial difference in chaosity resulting from distance shifts such as 0.5 and 1.0 skip distance. Such differences in chaosity enables the evaluation of unique features of defects in the weld zone. In quantitative chaos feature extraction, feature values of 4.511 and 0.091 in the case of side hole and 4.539 and 0.115 in the case of vertical hole were proposed on the basis of fractal dimension and Lyapunov exponent. Proposed chaos feature extraction in this study can enhances ultrasonic pattern recognition results from defect signals of weld zone such as side hole and vertical hole.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.23 no.7 s.166
• /
• pp.1065-1074
• /
• 1999

This study proposes the analysis and evaluation method of time series ultrasonic signal using the chaotic feature extraction for ultrasonic pattern recognition. Features extracted from time series data using the chaotic time series signal analysis quantitatively welding defects. For this purpose analysis objective in this study is fractal dimension and Lyapunov exponent. Trajectory changes in the strange attractor indicated that even same type of defects carried substantial difference in chaoticity resulting from distance shills such as 0.5 and 1.0 skip distance. Such differences in chaoticity enables the evaluation of unique features of defects in the weld zone. In experiment fractal(correlation) dimension and Lyapunov exponent extracted from 6dB ultrasonic defect signals of weld zone showed chaoticity. In quantitative chaotic feature extraction, feature values(mean values) of 4.2690 and 0.0907 in the case of porosity and 4.2432 and 0.0888 in the case of incomplete penetration were proposed on the basis of fractal dimension and Lyapunov exponent. Proposed chaotic feature extraction in this study enhances ultrasonic pattern recognition results from defect signals of weld zone such as vertical hole.

• Genomics & Informatics
• /
• v.17 no.4
• /
• pp.39.1-39.20
• /
• 2019

Analyzing patterns in data points embedded in linear and non-linear feature spaces is considered as one of the common research problems among different research areas, for example: data mining, machine learning, pattern recognition, and multivariate analysis. In this paper, data points are heterogeneous sets of biosequences (composite data points). A composite data point is a set of ordinary data points (e.g., set of feature vectors). We theoretically extend the derivation of the largest generalized eigenvalue-based distance metric D_ij(γ₁) in any linear and non-linear feature spaces. We prove that D_ij(γ₁) is a metric under any linear and non-linear feature transformation function. We show the sufficiency and efficiency of using the decision rule $\bar{{\delta}}_{{\Xi}i}$(i.e., mean of D_ij(γ₁)) in classification of heterogeneous sets of biosequences compared with the decision rules min_𝚵iand median_𝚵i. We analyze the impact of linear and non-linear transformation functions on classifying/clustering collections of heterogeneous sets of biosequences. The impact of the length of a sequence in a heterogeneous sequence-set generated by simulation on the classification and clustering results in linear and non-linear feature spaces is empirically shown in this paper. We propose a new concept: the limiting dispersion map of the existing clusters in heterogeneous sets of biosequences embedded in linear and nonlinear feature spaces, which is based on the limiting distribution of nucleotide compositions estimated from real data sets. Finally, the empirical conclusions and the scientific evidences are deduced from the experiments to support the theoretical side stated in this paper.