• Fashion & Textile Research Journal
• /
• v.15 no.6
• /
• pp.1010-1017
• /
• 2013

Current global textiles and fashion industries have gradually shifted focus to high value-added, high sensibility, and multi-functional products based on new human-friendliness and sustainable growth technologies. Textile design CAD systems have been developed in conjunction with computer hardware and software sector advances. This study compares the patterns or images of actual woven fabrics and virtual fabrics prepared with a textile design CAD system. In this study, several weave structures (such as fancy yarn weave and patterns) were prepared with a shuttle loom. The woven textile images were taken using a CCD camera. The same weave structure data and yarn data were fed into a textile design CAD system in order to simulate fabric images as similarly as possible. Similarity Index analysis methods allowed for an analysis of the index between the actual fabric specimen and the simulated image of the corresponding fabric. The results showed that repeated small pattern weaves provide superior similarity index values than those of a fancy yarn weave that indicate some irregularities due to fancy yarn attributes. A Complex Wavelet Structural Similarity(CW-SSIM) index resulted in a better index than other methods such as Multi-Scale(MS) SSIM, and Feature Similarity(FS) SSIM, across fabric specimen images. A correlation analysis of the similarity index based on an image analysis and a similarity evaluation by panel members was also implemented.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.11
• /
• pp.495-502
• /
• 2014

An effective solution to the variation on scale and rotation is required to recognize contactless palmprint. In this study, we firstly minimize the variation by extracting a region of interest(ROI) according to the size and orientation of hand and normalizing the ROI. This paper proposes a contactless palmprint recognition method based on KLT(Kanade-Lukas-Tomasi) feature points. To detect corresponding feature points, texture in local regions around KLT feature points are compared. Then, we recognize palmprint by measuring the similarity among displacement vectors which represent the size and direction of displacement of each pair of corresponding feature points. An experimental results using CASIA public database show that the proposed method is effective in contactless palmprint recognition. Especially, we can get the performance of exceeding 99% correct identification rate using multiple Gabor filters.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.6 no.3
• /
• pp.77-86
• /
• 2007

Recently, systems based on speech recognition interface such as telematics terminals are being developed. However, many errors still exist in speech recognition and then studies about error correction are actively conducting. This paper proposes an error correction in post-processing of the speech recognition based on features of Korean phoneme. To support this algorithm, we used the phoneme similarity considering features of Korean phoneme. The phoneme similarity, which is utilized in this paper, rams data by mono-phoneme, and uses MFCC and LPC to extract feature in each Korean phoneme. In addition, the phoneme similarity uses a Bhattacharrya distance measure to get the similarity between one phoneme and the other. By using the phoneme similarity, the error of eo-jeol that may not be morphologically analyzed could be corrected. Also, the syllable recovery and morphological analysis are performed again. The results of the experiment show the improvement of 7.5% and 5.3% for each of MFCC and LPC.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4502-4518
• /
• 2015

Fisher linear discriminant analysis (LDA) is one of the most popular projection techniques for feature extraction and has been widely applied in face recognition. However, it cannot be used when encountering the single sample per person problem (SSPP) because the intra-class variations cannot be evaluated. In this paper, we propose a novel method called local similarity based linear discriminant analysis (LS_LDA) to solve this problem. Motivated by the "divide-conquer" strategy, we first divide the face into local blocks, and classify each local block, and then integrate all the classification results to make final decision. To make LDA feasible for SSPP problem, we further divide each block into overlapped patches and assume that these patches are from the same class. To improve the robustness of LS_LDA to outliers, we further propose local similarity based median discriminant analysis (LS_MDA), which uses class median vector to estimate the class population mean in LDA modeling. Experimental results on three popular databases show that our methods not only generalize well SSPP problem but also have strong robustness to expression, illumination, occlusion and time variation.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.9 no.2
• /
• pp.99-104
• /
• 2009

The turn-to-turn short is one major fault of the motor faults of BLDC motors and can appear frequently. When the fault happens, the motor can be operated without breakdown, but it is necessary to maintain the motor for continuous working. In past research, several methods have been applied to detect winding faults. The representative approaches have been focusing on current signals, which can give important information to extract features and to detect faults. In this study, current sensors were installed to measure signals for fault detection of BLDC motors. In this study, the Park's vector method was used to extract the features and to isolate the faults from the current measured by sensors. Because this method can consider the three-phase current values, it is useful to detect features from one-phase and three-phase faults. After extracting two-dimensional features, the final feature was generated by using the two-dimensional values using the distance equation. The values were used in fuzzy similarity to isolate the faults. Fuzzy similarity is an available tool to diagnose the fault without model generation and the fault was converted to the percentage value that can be considered as possibility of the fault.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.4
• /
• pp.315-325
• /
• 2006

It is very often necessary to search for similar parts during designing a new product because its parts are often easily designed by modifying existing similar parts. In this way, the design time and cost can be reduced. Thus it would be nice to have an efficient similarity comparison algorithm that can be used anytime in the design process. There have been many approaches to compare shape similarity between two solids. In this paper, two parts represented in B-Rep is compared in two steps: one for overall appearances and the other for detail features. In the first step, geometric information is used in low level of detail for easy and fast pre-classification by the overall appearance. In the second step, feature information is used to compare the detail shape in high level of detail to find more similar design. To realize the idea above, a multi resolution algorithm is proposed so that a given solid is described by an overall appearance in a low resolution and by detail features in high resolution. Using this multi-resolution representation, parts can be compared based on the overall appearance first so that the number of parts to be compared in high resolution is reduced, and then detail features are investigated to retrieve the most similar part. In this way, computational time can be reduced by the fast classification in the first step while reliability can be preserved by detail comparison in the second step.

• Journal of Korea Multimedia Society
• /
• v.21 no.8
• /
• pp.952-959
• /
• 2018

Clustering is one of the most fundamental algorithms in machine learning. The performance of clustering is affected by the distribution of data, and when there are more data or more dimensions, the performance is degraded. For this reason, we use a stacked auto encoder, one of the deep learning algorithms, to reduce the dimension of data which generate a feature vector that best represents the input data. We use k-means, which is a famous algorithm, as a clustering. Sine the feature vector which reduced dimensions are also multi dimensional, we use the Euclidean distance as well as the cosine similarity to increase the performance which calculating the similarity between the center of the cluster and the data as a vector. A deep clustering networks combining a stacked auto encoder and k-means re-trains the networks when the k-means result changes. When re-training the networks, the loss function of the stacked auto encoder and the loss function of the k-means are combined to improve the performance and the stability of the network. Experiments of benchmark image ad document dataset empirically validated the power of the proposed algorithm.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.655-664
• /
• 2001

The continuous data such as video streams and voice analog signals can be modeled as multidimensional data sequences(MDS's) in the feature space, In this paper, we investigate the clustering technique for multidimensional data sequence, Each sequence is represented by a small number by hyper rectangular clusters for subsequent storage and similarity search processing. We present a linear clustering algorithm that guarantees a predefined level of clustering quality and show its effectiveness via experiments on various video data sets.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.369-384
• /
• 2021

In a personalized product recommendation system, when the amount of log data is large or sparse, the accuracy of model recommendation will be greatly affected. To solve this problem, a personalized product recommendation method using deep factorization machine (DeepFM) to analyze user behavior is proposed. Firstly, the K-means clustering algorithm is used to cluster the original log data from the perspective of similarity to reduce the data dimension. Then, through the DeepFM parameter sharing strategy, the relationship between low- and high-order feature combinations is learned from log data, and the click rate prediction model is constructed. Finally, based on the predicted click-through rate, products are recommended to users in sequence and fed back. The area under the curve (AUC) and Logloss of the proposed method are 0.8834 and 0.0253, respectively, on the Criteo dataset, and 0.7836 and 0.0348 on the KDD2012 Cup dataset, respectively. Compared with other newer recommendation methods, the proposed method can achieve better recommendation effect.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.4300-4314
• /
• 2019

With the development of video-related applications, media content has increased dramatically through applications. There is a substantial amount of near-duplicate videos (NDVs) among Internet videos, thus NDVR is important for eliminating near-duplicates from web video searches. This paper proposes a novel NDVR system that supports large-scale retrieval and contributes to the efficient and accurate retrieval performance. For this, we extracted keyframes from each video at regular intervals and then extracted both commonly used features (LBP and HSV) and new image features from each keyframe. A recent study introduced a new image feature that can provide more robust information than existing features even if there are geometric changes to and complex editing of images. We convert a vector set that consists of the extracted features to binary code through a set of hash functions so that the similarity comparison can be more efficient as similar videos are more likely to map into the same buckets. Lastly, we calculate similarity to search for NDVs; we examine the effectiveness of the NDVR system and compare this against previous NDVR systems using the public video collections CC_WEB_VIDEO. The proposed NDVR system's performance is very promising compared to previous NDVR systems.