• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1253-1272
• /
• 2010

In this paper, we propose a new affine shape adaptation scheme for the affine invariant feature detector, in which the convergence stability is still an opening problem. This paper examines the relation between the integration scale matrix of next iteration and the current second moment matrix and finds that the convergence stability of the method can be improved by adjusting the relation between the two matrices instead of keeping them always proportional as proposed by previous methods. By estimating and updating the shape of the integration kernel and differentiation kernel in each iteration based on the anisotropy of the current second moment matrix, we propose a coarse-to-fine affine shape adaptation scheme which is able to adjust the pace of convergence and enable the process to converge smoothly. The feature matching experiments demonstrate that the proposed approach obtains an improvement in convergence ratio and repeatability compared with the current schemes with relatively fixed integration kernel.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1302-1309
• /
• 2008

Traditional clustering methods, like k-means or fuzzy clustering, are prototype-based methods which are applicable only to convex clusters. On the other hand, spectral clustering tries to find clusters only using local similarity information. Its ability to handle concave clusters has gained the popularity recent years together with support vector machine (SVM) which is a kernel-based classification method. However, as is in SVM, the kernel width plays an important role and has a great impact on the result. Several methods are proposed to decide it automatically, it is still determined based on heuristics. In this paper, we proposed an adaptive method deciding the kernel width based on distance histogram. The proposed method is motivated by the fact that the affinity matrix should be formed into a block diagonal matrix to generate the best result. We use the tradition Euclidean distance together with the random walk distance, which make it possible to form a more apparent block diagonal affinity matrix. Experimental results show that the proposed method generates more clear block structured affinity matrix than the existing one does.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2129-2147
• /
• 2019

This paper introduces an adaptive face recognition method based on a Novel Incremental Kernel Nonparametric Discriminant Analysis (IKNDA) that is able to learn through time. More precisely, the IKNDA has the advantage of incrementally reducing data dimension, in a discriminative manner, as new samples are added asynchronously. Thus, it handles dynamic and large data in a better way. In order to perform face recognition effectively, we combine the Gabor features and the ordinal measures to extract the facial features that are coded across local parts, as visual primitives. The variegated ordinal measures are extraught from Gabor filtering responses. Then, the histogram of these primitives, across a variety of facial zones, is intermingled to procure a feature vector. This latter's dimension is slimmed down using PCA. Finally, the latter is treated as a facial vector input for the advanced IKNDA. A comparative evaluation of the IKNDA is performed for face recognition, besides, for other classification endeavors, in a decontextualized evaluation schemes. In such a scheme, we compare the IKNDA model to some relevant state-of-the-art incremental and batch discriminant models. Experimental results show that the IKNDA outperforms these discriminant models and is better tool to improve face recognition performance.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.1
• /
• pp.66-74
• /
• 2008

This paper presents a new small target detection method using scale invariant feature. Detecting small targets whose sizes are varying is very important to automatic target detection. Scale invariant feature using the Laplacian scale-space can detect different sizes of targets robustly compared to the conventional spatial filtering methods with fixed kernel size. Additionally, scale-reflected adaptive thresholding can reduce many false alarms. Experimental results with real IR images show the robustness of the proposed target detection in real world.

• Steel and Composite Structures
• /
• v.21 no.6
• /
• pp.1183-1210
• /
• 2016

Viscoelastic sandwich structures (VSSs) are widely used in mechanical equipment, but in the service process, they always suffer from aging which affect the whole performance of equipment. Therefore, aging state recognition of VSSs is significant to monitor structural state and ensure the reliability of equipment. However, non-stationary vibration response signals and weak state change characteristics make this task challenging. This paper proposes a novel method for this task based on adaptive second generation wavelet packet transform (ASGWPT) and multiwavelet support vector machine (MWSVM). For obtaining sensitive feature parameters to different structural aging states, the ASGWPT, its wavelet function can adaptively match the frequency spectrum characteristics of inspected vibration response signal, is developed to process the vibration response signals for energy feature extraction. With the aim to improve the classification performance of SVM, based on the kernel method of SVM and multiwavelet theory, multiwavelet kernel functions are constructed, and then MWSVM is developed to classify the different aging states. In order to demonstrate the effectiveness of the proposed method, different aging states of a VSS are created through the hot oxygen accelerated aging of viscoelastic material. The application results show that the proposed method can accurately and automatically recognize the different structural aging states and act as a promising approach to aging state recognition of VSSs. Furthermore, the capability of ASGWPT in processing the vibration response signals for feature extraction is validated by the comparisons with conventional second generation wavelet packet transform, and the performance of MWSVM in classifying the structural aging states is validated by the comparisons with traditional wavelet support vector machine.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.1
• /
• pp.25-36
• /
• 2008

Error Correcting Output Codes (ECOC) can improve generalization performance when applied to multicategory classification problem. In this study we propose a new criterion to select hyperparameters included in ECOC scheme. Instead of margins of a data we propose to use the probability of misclassification error since it makes the criterion simple. Using this we obtain an upper bound of leave-one-out error of OVA(one vs all) method. Our experiments from real and synthetic data indicate that the bound leads to good estimates of parameters.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.1
• /
• pp.1-11
• /
• 2023

Deep-learning-based image segmentation is one of the most widely employed lane detection approaches, and it requires a post-process for extracting the key points on the lanes. A general approach for key-point extraction is using a fixed threshold defined by a user. However, finding the best threshold is a manual process requiring much effort, and the best one can differ depending on the target data set (or an image). We propose a novel key-point extraction algorithm that automatically adapts to the target image without any manual threshold setting. In our adaptive key-point extraction algorithm, we propose a line-level normalization method to distinguish the lane region from the background clearly. Then, we extract a representative key point for each lane at a line (row of an image) using a kernel density estimation. To check the benefits of our approach, we applied our method to two lane-detection data sets, including TuSimple and CULane. As a result, our method achieved up to 1.80%p and 17.27% better results than using a fixed threshold in the perspectives of accuracy and distance error between the ground truth key-point and the predicted point.

• Journal of Broadcast Engineering
• /
• v.15 no.3
• /
• pp.362-367
• /
• 2010

As the resolution of the image display devices has been diversified, the image interpolation methods has played a more important role. The cubic convolution interpolation method has been widely used because it is simple but it has no limitation of using and a good performance. This paper suggests an adaptive method to the cubic convolution interpolation. Considering the difference of the neighbored pixels values to a prediction pixel, a parameter value in the cubic convolution interpolation kernel is chosen.

• Korean Chemical Engineering Research
• /
• v.46 no.2
• /
• pp.233-247
• /
• 2008

Process monitoring technology is able to detect the faults and the process changes which occur in a process unpredictably, which makes it possible to find the reasons of the faults and get rid of them, resulting in a stable process operation, high-quality product. Statistical process monitoring method based on data set has a main merit to be a tool which can easily supervise a process with the statistics and can be used in the analysis of process data if a high quality of data is given. Because a real process has the inherent characteristics of nonlinearity, non-Gaussianity, multiple operation modes, sensor faults and process changes, however, the conventional multivariate statistical process monitoring method results in inefficient results, the degradation of the supervision performances, or often unreliable monitoring results. Because the conventional methods are not easy to properly supervise the process due to their disadvantages, several advanced monitoring methods are developed recently. This review introduces the theories and application results of several remarkable monitoring methods, which are a nonlinear monitoring with kernel principle component analysis (KPCA), an adaptive model for process change, a mixture model for multiple operation modes and a sensor fault detection and reconstruction, in order to tackle the weak points of the conventional methods.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.163-171
• /
• 2008

In this paper, we present an adaptive parametric cubic convolution technique in order to enlarge the low resolution image to the high resolution image. The proposed method consists of two steps. During the first interpolation step, we acquire adaptive parameters in introducing a new cost-function to reflect frequency properties. And, the second interpolation step performs cubic convolution by applying the parameters obtained from the first step. The enhanced interpolation kernel using adaptive parameters produces output image better than the conventional one using a fixed parameter. Experimental results show that the proposed method can not only provides the performances of $0.5{\sim}4dB$ improvements in terms of PSNR, but also exhibit better edge preservation ability and original image similarity than conventional methods in the enlarged images.