• Korean Journal of Computational Design and Engineering
• /
• v.13 no.3
• /
• pp.187-199
• /
• 2008

This paper describes a C++ class hierarchy of implicit objects for geometry modeling and processing. This class structure provides a software kernel for integrating many various models and methods found in current implicit modeling areas. The software kernel includes primitive objects playing a role of unit element in creating a complex shape, and operator objects used to construct more complex shape of implicit object formed with the primitive objects and other operators. In this paper, class descriptions of these objects are provided to better understand the details of the algorithm or implementation, and its instance examples to show the capabilities of the object classes for constructive shape geometry. In addition, solid modeling system shown as an application example demonstrates that the proposed implicit object classes allow us to carry out modern solid modeling techniques, which means they have the capabilities to extend to various applications.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.4
• /
• pp.271-276
• /
• 2001

A geometric kernel is the library of core mathematical functions that defines and stores 3D shapes in response to users'commands. We developed a light geometric kernel suitable to develop CAD/CAM application systems. The kernel contains geometric objects, such as points, curves and surfaces and a minimal set of functions for each type but does not contain lots of modeling and handling functions that are useful to create and maintain complex shapes from an idea sketch. The kernel was developed on MS-Windows NT using C++ with STL(Standard Template Library) but it is compatible with UNIX environments. This paper describes the structure of the kernel including several components: base, math, point sequence curve, geometry, translators. The base kernel gives portability to applications and the math kernel contains basic arithmetic and their classes, such as vector and matrix. The geometry kernel contains points, parametric curves, and parametric surfaces. A neutral fie format and programming and document styles are also presented in this paper.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.5
• /
• pp.1083-1088
• /
• 2013

Detection and classification of undersea mines in shallow waters using active sonar returns is a difficult task due to complexity of underwater environment. Support vector machine(SVM) is a binary classifier that is well known to provide a global optimum solution. In this paper, classification experiments of sonar returns from mine-like objects and non-mine-like objects are carried out using the SVM, and classification performance is analyzed and presented with discussions depending on parameter values of SVM kernel functions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2523-2538
• /
• 2017

In most of the existing literature, the definition of the class label has the following characteristics. First, the class label of the samples from the same object has an absolutely fixed value. Second, the difference between class labels of the samples from different objects should be maximized. However, the appearance of a face varies greatly due to the variations of the illumination, pose, and expression. Therefore, the previous definition of class label is not quite reasonable. Inspired by discriminative least squares regression algorithm (DLSR), a noisy label based discriminative least squares regression algorithm (NLDLSR) is presented in this paper. In our algorithm, the maximization difference between the class labels of the samples from different objects should be satisfied. Meanwhile, the class label of the different samples from the same object is allowed to have small difference, which is consistent with the fact that the different samples from the same object have some differences. In addition, the proposed NLDLSR is expanded to the kernel space, and we further propose a novel kernel noisy label based discriminative least squares regression algorithm (KNLDLSR). A large number of experiments show that our proposed algorithms can achieve very good performance.

• Journal of Information Processing Systems
• /
• v.17 no.5
• /
• pp.1020-1033
• /
• 2021

Nowadays, online or mobile social network services (SNS) are very popular and widely spread in our society and daily lives to instantly share, disseminate, and search information. In particular, SNS such as YouTube, Flickr, Facebook, and Amazon allow users to upload billions of images or videos and also provide a number of multimedia information to users. Information retrieval in multimedia-rich SNS is very useful but challenging task. Content-based media retrieval (CBMR) is the process of obtaining the relevant image or video objects for a given query from a collection of information sources. However, CBMR suffers from the dimensionality curse due to inherent high dimensionality features of media data. This paper investigates the effectiveness of the kernel trick in CBMR, specifically, the kernel principal component analysis (KPCA) for dimensionality reduction. KPCA is a nonlinear extension of linear principal component analysis (LPCA) to discovering nonlinear embeddings using the kernel trick. The fundamental idea of KPCA is mapping the input data into a highdimensional feature space through a nonlinear kernel function and then computing the principal components on that mapped space. This paper investigates the potential of KPCA in CBMR for feature extraction or dimensionality reduction. Using the Gaussian kernel in our experiments, we compute the principal components of an image dataset in the transformed space and then we use them as new feature dimensions for the image dataset. Moreover, KPCA can be applied to other many domains including CBMR, where LPCA has been used to extract features and where the nonlinear extension would be effective. Our results from extensive experiments demonstrate that the potential of KPCA is very encouraging compared with LPCA in CBMR.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3721-3737
• /
• 2015

3D reconstruction based on binocular data is significant to machine vision. In our method, we propose a new and high efficiency 3D reconstruction approach by using a consumer camera aiming to: 1) address the configuration problem of dual camera in the binocular reconstruction system; 2) address stereo matching can hardly be done well problem in both time computing and precision. The kernel feature is firstly proposed in calibration stage to rectify the epipolar. Then, we segment the objects in the camera into background and foreground, for which system obtains the disparity by different method: local window matching and kernel feature-based matching. Extensive experiments demonstrate our proposed algorithm represents accurate 3D model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.272-287
• /
• 2016

Recently, various and effective contrast based salient object detection models to focus on a single target have been proposed. However, there is a lack of research on detection of multiple objects, and also it is a more challenging task than single target process. In the multiple target problem, we are confronted by new difficulties caused by distinct difference between properties of objects. The characteristic of existing models depending on the global maximum distribution of data point would become a drawback for detection of multiple objects. In this paper, by analyzing limitations of the existing methods, we have devised three main processes to detect multiple salient objects. In the first stage, regional features are extracted from over-segmented regions. In the second stage, the regional features are categorized into homogeneous cluster using the mean-shift algorithm with the kernel function having various sizes. In the final stage, we compute saliency scores of the categorized regions using only spatial features without the contrast features, and then all scores are integrated for the final salient regions. In the experimental results, the scheme achieved superior detection accuracy for the SED2 and MSRA-ASD benchmarks with both a higher precision and better recall than state-of-the-art approaches. Especially, given multiple objects having different properties, our model significantly outperforms all existing models.

• Korean Journal of Remote Sensing
• /
• v.32 no.1
• /
• pp.13-24
• /
• 2016

This paper presents a method to evaluate the performance of subpixel localization operators using target image data. Subpixel localization of edges is important to extract the precise shape of objects from images. In this study, each target image was designed to provide reference lines and edges to which the localization operators can be applied. We selected two types of moment-based operators: Gray-level Moment (GM) operator and Spatial Moment (SM) operator for comparison. The original edge localization operators with kernel size 5 are tested and their extended versions with kernel size 7 are also tested. Target images were collected with varying Camera-to-Object Distance (COD). From the target images, reference lines are estimated and edge profiles along the estimated reference lines are accumulated. Then, evaluation of the performance of edge localization operators was performed by comparing the locations calculated by each operator and by superimposing them on edge profiles. Also, enhancement of edge localization by increasing the kernel size was also quantified. The experimental result shows that the SM operator whose kernel size is 7 provides higher accuracy than other operators implemented in this study.

• Communications for Statistical Applications and Methods
• /
• v.22 no.3
• /
• pp.265-276
• /
• 2015

In this paper, we propose hierarchical cluster analysis and multidimensional scaling for joint distribution valued data. Information technology is increasing the necessity of statistical methods for large and complex data. Symbolic Data Analysis (SDA) is an attractive framework for the data. In SDA, target objects are typically represented by aggregated data. Most methods on SDA deal with objects represented as intervals and histograms. However, those methods cannot consider information among variables including correlation. In addition, objects represented as a joint distribution can contain information among variables. Therefore, we focus on methods for joint distribution valued data. We expanded the two well-known exploratory methods using the dissimilarities adopted Hall Type relative projection index among joint distribution valued data. We show a simulation study and an actual example of proposed methods.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.766-770
• /
• 2010

In this paper, we present an effective covariance tracking algorithm based on adaptive size changing of tracking window. Recent researches have advocated the use of a covariance matrix of object image features for tracking objects instead of the conventional histogram object models used in popular algorithms. But, according to the general covariance tracking algorithm, it can not deal with the scale changes of the moving objects. The scale of the moving object often changes in various tracking environment and the tracking window(or object kernel) has to be adapted accordingly. In addition, the covariance matrix of moving objects should be adaptively updated considering of the tracking window size. We provide a solution to this problem by segmenting the moving object from the background pixels of the tracking window. Therefore, we can improve the tracking performance of the covariance tracking method. Our several simulations prove the effectiveness of the proposed method.