• Journal of Ocean Engineering and Technology
• /
• v.22 no.1
• /
• pp.30-36
• /
• 2008

Underwater ambient noise originating from geophysical, biological, and man-made acoustic sources contains information on the source and the ocean environment. Such noise affectsthe performance of sonar equipment. In this paper, three steps are used to identify the ambient noise source, detection, feature extraction, and similarity measurement. First, we use the zero-crossing rate to detect the ambient noisesource from background noise. Then, a set of feature vectors is proposed forthe ambient noise source using the Hilbert-Huang transform and the Karhunen-Loeve transform. Finally, the Euclidean distance is used to measure the similarity between the standard feature vector and the feature vector of the unknown ambient noise source. The developed algorithm is applied to the observed ocean data, and the results are presented and discussed.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.6
• /
• pp.23-28
• /
• 1983

Two measures of similarity between contours, the 1 st-order similarity measure and the 2nd-order similarity measure are proposed. They are based on the residual errors of the least squares fit. In particular, the 2nd-order similarity measure has a good reliability with respect to contours of many variations such as imperfection, affine transform or combination of these properties. By taking experiments of aircraft identification and recognition we show that in the matching performance the 2nd -order similarity measure is superior not only to the 1 st-order similarity measure but also to the previous matching techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1095-1109
• /
• 2022

Along with the popularity of GPS system and smart cell phone, trajectories of pedestrians or vehicles are recorded at any time. The great amount of works had been carried out in order to discover traffic paradigms or other regular patterns buried in the huge trajectory dataset. The core of the mining algorithm is how to evaluate the similarity, that is, the "distance", between trajectories appropriately, then the mining results will be accordance to the reality. Euclidean distance is commonly used in the lots of existed algorithms to measure the similarity, however, the trend of trajectories is usually ignored during the measurement. In this paper, a novel segment transform distance (STD) algorithm is proposed, in which a rule system of line segment transformation is established. The similarity of two-line segments is quantified by the cost of line segment transformation. Further, an improvement of STD, named ST-DTW, is advanced with the use of the traditional method dynamic time warping algorithm (DTW), accelerating the speed of calculating STD. The experimental results show that the error rate of ST-DTW algorithm is 53.97%, which is lower than that of the LCSS algorithm. Besides, all the weights of factors could be adjusted dynamically, making the algorithm suitable for various kinds of applications.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.7
• /
• pp.578-589
• /
• 1991

In this paper, there is proposed a novel concept of Incremintal Circle Transform which can describe the boundary contour of a two-dimensional object without object without occlusions. And a pattern recognition algorithm to determine the posture of an object is developed with the aid of line integral and similarity transform. Also, It is confirmed via experiments that the algorithm can find the posture of an object in a very fast manner independent of the starting point for boundary coding and the position of the object.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.4
• /
• pp.256-261
• /
• 2018

There are three types of noise generated inside the vehicle: BSR (Buzz, Squeak, Rattle). In this paper, we propose a classifier that automatically classifies automotive BSR noise by using features extracted from deep convolutional neural networks. In the preprocessing process, the features of above three noises are represented as noise-map using STFT (Short-time Fourier Transform) algorithm. In order to cope with the problem that the position of the actual noise is unknown in the part of the generated noise map, the noise map is divided using the sliding window method. In this paper, internal parameter of the deep convolutional neural networks is visualized using the t-SNE (t-Stochastic Neighbor Embedding) algorithm, and the misclassified data is analyzed in a qualitative way. In order to analyze the classified data, the similarity of the noise type was quantified by SSIM (Structural Similarity Index) value, and it was found that the retractor tremble sound is most similar to the normal travel sound. The classifier of the proposed method compared with other classifiers of machine learning method recorded the highest classification accuracy (99.15 %).

• Journal of Information Processing Systems
• /
• v.8 no.1
• /
• pp.85-100
• /
• 2012

The Hartley transform based feature extraction method is proposed for fingerprint matching. Hartley transform is applied on a smaller region that has been cropped around the core point. The performance of this proposed method is evaluated based on the standard database of Bologna University and the database of the FVC2002. We used the city block distance to compute the similarity between the test fingerprint and database fingerprint image. The results obtained are compared with the discrete wavelet transform (DWT) based method. The experimental results show that, the proposed method reduces the false acceptance rate (FAR) from 21.48% to 16.74 % based on the database of Bologna University and from 31.29% to 28.69% based on the FVC2002 database.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.5
• /
• pp.905-913
• /
• 1987

This paper presents a speaker dependent isolated digit recognition algorithm using the Mellin transform. Since the Mellin transform converts a scale information into a phase information, attempts have been made to utilize this scale invariance property of the Mellin transform in order to alleviate a time-normalization procedure required for a speech recognition. It has been found that good results can be obtained by taking the Mellin transform to the features such as a ZCR, log energy, normalized autocorrelation coefficients, first predictor coefficient and normalized prediction error. We employed a difference function for evaluating a similarity between two patterns. When the proposed algorithm was tested on Korean digit words, a recognition rate of 83.3% was obtained. The recognition accuracy is not compatible with the other technique such as LPC distance however, it is believed that the Mellin transform can effectively perform the time-normalization processing for the speech recognition.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.179-190
• /
• 2005

We deal with the Cauchy problem for the space-time fractional diffusion equation, which is obtained from standard diffusion equation by replacing the second-order space derivative with a Caputo (or Riemann-Liouville) derivative of order ${\beta}{\in}$ (0, 2] and the first-order time derivative with Caputo derivative of order ${\beta}{\in}$ (0, 1]. The fundamental solution (Green function) for the Cauchy problem is investigated with respect to its scaling and similarity properties, starting from its Fourier-Laplace representation. We derive explicit expression of the Green function. The Green function also can be interpreted as a spatial probability density function evolving in time. We further explain the similarity property by discussing the scale-invariance of the space-time fractional diffusion equation.

• International Journal of Contents
• /
• v.9 no.2
• /
• pp.1-7
• /
• 2013

This paper proposes an efficient matching algorithm based on ASIFT (Affine Scale-Invariant Feature Transform) which is fully invariant to affine transformation. In our approach, we proposed a method of reducing similar measure matching cost and the number of outliers. First, we combined the Manhattan and Chessboard metrics replacing the Euclidean metric by a linear combination for measuring the similarity of keypoints. These two metrics are simple but really efficient. Using our method the computation time for matching step was saved and also the number of correct matches was increased. By applying an Optimized Random Sampling Algorithm (ORSA), we can remove most of the outlier matches to make the result meaningful. This method was experimented on various combinations of affine transform. The experimental result shows that our method is superior to SIFT and ASIFT.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1199-1206
• /
• 2015

This paper introduces an algorithm for computing similarity between two poses in the motion capture data with different scale of skeleton, different number of joints and different joint names. The proposed algorithm first performs the topological analysis on the skeleton hierarchy for classifying the joints into more meaningful groups. The global joints positions of each joint group then are aggregated into a point cloud. The number of joints and their positions are automatically adjusted in this process. Once we have two point clouds, the algorithm finds an optimal 2D transform matrix that transforms one point cloud to the other as closely as possible. Then, the similarity can be obtained by summing up all distance values between two points clouds after applying the 2D transform matrix. After some experiment, we found that the proposed algorithm is able to compute the similarity between two poses regardless of their scale, joint name and the number of joints.