• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.6
• /
• pp.486-491
• /
• 2013

This paper proposes a fast and efficient Haar-like feature selection algorithm for training classifier used in object detection. Many features selected by Haar-like feature selection algorithm and existing AdaBoost algorithm are either similar in shape or overlapping due to considering only feature's error rate. The proposed algorithm calculates similarity of features by their shape and distance between features. Fast and efficient feature selection is made possible by removing selected features and features with high similarity from feature set. FERET face database is used to compare performance of classifiers trained by previous algorithm and proposed algorithm. Experimental results show improved performance comparing classifier trained by proposed method to classifier trained by previous method. When classifier is trained to show same performance, proposed method shows 20% reduction of features used in classification.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.20-27
• /
• 2003

In this paper, we implemented a content-based image retrieval system that user can choose a wanted query region of object and retrieve similar object from image database. Query image is induced to wavelet transformation after divided into hue components and gray components that hue features is extracted through color autocorrelogram and dispersion in hue components. Texture feature is extracted through autocorrelogram and GLCM in gray components also. Using features of two components, retrieval is processed to compare each similarity with database image. In here, weight value is applied to each similarity value. We make up for each defect by deriving features from two components beside one that elevations of recall and precision are verified in experiment results. Moreover, retrieval efficiency is improved by weight value. And various features of database images are indexed automatically in feature library that make possible to rapid image retrieval.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3295-3311
• /
• 2020

With the wide application of hyperspectral images, it becomes more and more important to compress hyperspectral images. Conventional recursive least squares (CRLS) algorithm has great potentiality in lossless compression for hyperspectral images. The prediction accuracy of CRLS is closely related to the correlations between the reference bands and the current band, and the similarity between pixels in prediction context. According to this characteristic, we present an improved CRLS with adaptive band selection and adaptive predictor selection (CRLS-ABS-APS). Firstly, a spectral vector correlation coefficient-based k-means clustering algorithm is employed to generate clustering map. Afterwards, an adaptive band selection strategy based on inter-spectral correlation coefficient is adopted to select the reference bands for each band. Then, an adaptive predictor selection strategy based on clustering map is adopted to select the optimal CRLS predictor for each pixel. In addition, a double snake scan mode is used to further improve the similarity of prediction context, and a recursive average estimation method is used to accelerate the local average calculation. Finally, the prediction residuals are entropy encoded by arithmetic encoder. Experiments on the Airborne Visible Infrared Imaging Spectrometer (AVIRIS) 2006 data set show that the CRLS-ABS-APS achieves average bit rates of 3.28 bpp, 5.55 bpp and 2.39 bpp on the three subsets, respectively. The results indicate that the CRLS-ABS-APS effectively improves the compression effect with lower computation complexity, and outperforms to the current state-of-the-art methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.2
• /
• pp.1-8
• /
• 2003

This paper proposes an object-based image retrieval technique based on the dominant color pair information. Most of existing methods for content based retrieval extract the features from an image as a whole, instead of an object of interest. As a result, the retrieval performance tends to degrade due to the background colors. This paper proposes an object based retrieval scheme, in which an object of interest is used as a query and the similarity is measured on candidate regions of DB images where the object may exist. From the segmented image, the dominant color pair information between adjacent regions is used for selecting candidate regions. The similarity between the query image and DB image is measured by using the color correlogram technique. The dominant color pair information is robust against translation, rotation, and scaling. Experimental results show that the performance of the proposed method has been improved by reducing the errors caused by background colors.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.92-103
• /
• 2010

In this paper, a method for the recognition of dynamic hand gestures in various backgrounds using Dynamic Space Time Warping(DSTW) algorithm is proposed. The existing method using DSTW algorithm compares multiple candidate hand regions detected from every frame of the query sequence with the model sequences in terms of the time. However the existing method can not exactly recognize the models because a false path can be generated from the candidates including not-hand regions such as background, elbow, and so on. In order to solve this problem, in this paper, we use the invariant moments extracted from the candidate regions of hand and compare the similarity of invariant moments among candidate regions. The similarity is utilized as a weight and the corresponding value is applied to the matching cost between the model sequence and the query sequence. Experimental results have shown that the proposed method can recognize the dynamic hand gestures in the various backgrounds. Moreover, the recognition rate has been improved by 13%, compared with the existing method.

• The Journal of the Korea Contents Association
• /
• v.9 no.3
• /
• pp.99-107
• /
• 2009

As the information and the network technology are improved, the system which can express the interactions between the individuals becomes to play more important roles in these days. In fact, that tendency is especially well shown in the community area of P2P and social network service programs. This paper suggest an intelligent character manipulation system which can be effectively used to express emotional representation in an intelligent way in spite of many constraints. The system employs an emotion searching mechanism by attaching emotional information to each object in the database and defining a function of emotional similarity. It is expected that the system can be successfully used not only to find and represent the suitable emotional character representations but also to provide brand new services in the area of mobile platform based contents.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.34 no.2
• /
• pp.174-184
• /
• 1998

In order to accumulate fundamental. data for control of fishes’ behavior at the real fishing ground, the fitness of the numerical model for describing the behavior of fishes was examined by the marine fish. Mullet, Mugil cephalus were used as experimental fishes. The numerical model of fishes’ behavior presented in our earlier paper was modified on the vertical movement of fish school. For the comparision of parameters of the modified numerical model between mullet and rainbow trout, the estimated values of parameters were identified with dimension. The fitness of the modified numerical model was examined by the comparision between experiment and simulation on the several indexes represented by fishes’ swimming characteristics. The obtained result are summarized a follows : 1. The non-dimensional parameter a’ of propulsive force and kb’ of interactive force by the experiment without model net showed a similarity, but the non-dimensional parameter k sub(c’) of schooling force for rainbow trout was lager than one for mullet and the non-dimensional parameter k sub(w’) of repulsive force for mullet was lager than one for rainbow trout. 2. The non-dimensional parameter a’ and k sub(b’) for rainbow trout by the experiment with model net were a little lager than ones for mullet, but non-dimensional parameter k sub(c’) and k sub(w’) for mullet were lager than ones for rainbow trout. 3. The non-dimensional parameter k sub(c’) and k sub(b’) showed the largest and the smallest value among the non-dimensional parameters for rainbow trout and mullet, respectively. 4. The fitness of the modified numerical model was confirmed by means of the compulsion between experiment and simulation on the swimming trajectory of fishes, the mean distance of individual from wall, the mean swimming speed, the mean swimming depth and the mean distance between the nearest individuals. Especially, the similarity of mean swimming depth was improved by using the modified numerical model.

• Journal of Digital Contents Society
• /
• v.10 no.3
• /
• pp.423-431
• /
• 2009

There are various image retrieval methods using shape, color and texture features. One of the most active area is using shape and color information. A number of shape representations have been suggested to recognize shapes even under affine transformation. There are many kinds of method for shape recognition, the well-known method is Fourier descriptors and moment invariant. The other method is CSS(Curvature Scale Space). The maxima of curvature scale space image have already been used to represent 2-D shapes in different applications. Because preexistence CSS exists several problems, in this paper we use improved CSS method for retrieval image. There are two kinds of method, One is using RGB color information feature and the other is using HSI color information feature. In this paper we used HSI color model to represent color histogram before, then use it as comparison measure. The similarity is measured by using Euclidean distance and for reduce search time and accuracy, We use DTW for measure similarity. Compare with the result of using Euclidean distance, we can find efficiency elevated.

• Journal of the Korea Convergence Society
• /
• v.11 no.3
• /
• pp.19-26
• /
• 2020

In this paper, we propose a method to analyze the loss region of the dictionary-based super resolution result learned for image quality improvement and to map the learning data according to the analyzed loss region. In the conventional learned dictionary-based method, a result different from the feature configuration of the input image may be generated according to the learning image, and an unintended artifact may occur. The proposed method estimate loss information of low resolution images by analyzing the reconstructed contents to reduce inconsistent feature composition and unintended artifacts in the example-based super resolution process. By mapping the training data according to the final interpolation feature map, which improves the noise and pixel imbalance of the estimated loss information using a Gaussian-based kernel, it generates super resolution with improved noise, artifacts, and staircase compared to the existing super resolution. For the evaluation, the results of the existing super resolution generation algorithms and the proposed method are compared with the high-definition image, which is 4% better in the PSNR (Peak Signal to Noise Ratio) and 3% in the SSIM (Structural SIMilarity Index).

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.6
• /
• pp.189-196
• /
• 2014

Though the plagiarism is illegal and should be avoided, it still occurs frequently. Particularly, the plagiarism of source codes is more frequently committed than others since it is much easier to copy them because of their digital nature. To prevent code plagiarism, there have been reported a variety of studies. However, previous studies for plagiarism detection techniques on source codes do not consider the data structures although a source code consists both of data structures and algorithms. In this paper, a plagiarism detection technique for source codes considering data structures is proposed. Specifically, the data structures of two source codes are represented as sets of trees and compared with each other using Hungarian Method. To show the usefulness of this technique, an experiment has been performed on 126 source codes submitted as homework results in an object-oriented programming course. When both the data structures and the algorithms of the source codes are considered, the precision and the F-measure score are improved 22.6% and 19.3%, respectively, than those of the case where only the algorithms are considered.