• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.655-660
• /
• 2003

In general, Support Vector Machine has a good performance in binary classification, but it has the limitation on multi-pattern classification. So, we proposed an Import Vector Voting model for two or more labels classification. This model applied kernel bagging strategy to Import Vector Machine by Zhu. The proposed model used a voting strategy which averaged optimal kernel function from many kernel functions. In experiments, not only binary but multi-pattern classification problems, our proposed Import Vector Voting model showed good performance for given machine learning data.

• Journal of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.609-624
• /
• 1996

Recently, Giannessi [9] firstly introduced the vector-valued variational inequalities in a real Euclidean space. Later Chen et al. [5] intensively discussed vector-valued variational inequalities and vector-valued quasi variationl inequalities in Banach spaces. They [4-8] proved some existence theorems for the solutions of vector-valued variational inequalities and vector-valued quasi-variational inequalities. Lee et al. [14] established the existence theorem for the solutions of vector-valued variational inequalities for multifunctions in reflexive Banach spaces.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.772-775
• /
• 2006

Muilti-dimensional feature vector matching algorithm uses multiple features such as intensity, gradient, variance, first or second derivative of a pixel to find correspondence pixels in stereo images. In this paper, we proposed a new method for adjusting automatically the weight of feature in multi-dimensional feature vector matching considering sharpeness of a pixel in feature vector distance curve. The sharpeness consists of minimum and maximum vector distances of a small window mask. In the experiment we used IKONOS satellite stereo imagery and obtained accurate matching results comparable to the manual weight-adjusting method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.1006-1008
• /
• 2013

A novel recombinant baculovirus vector system containing coding genes for polyhedron promoter, vesicular stomatitis virus G (VSVG), polyA, cytomegalovirus (CMV) promoter, enhanced green fluorescent protein (EGFP), and protein transduction domain (PTD) was constructed. We applied this recombinant baculovirus vector into cells and murine tissues and compared efficacy of gene transfer and expression of this recombinant baculovirus vector system with control vector system. From this result, we confirmed that this novel recombinant baculovirus vector system was very effective than control vector system.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.744-751
• /
• 2003

A hybrid least square Support Vector Machine combined with First Principle(FP) knowledge is proposed. We compare hybrid least square Support Vector Machine(HLS-SVM) with early proposed models such as Hybrid Neural Network(HNN) and HNN with Extended Kalman Filter(HNN-EKF). In the training and validation stage HLS-SVM shows similar performance with HNN-EKF but better than HNN, whereas, in the testing stage, it shows three times better than HNN-EKF, hundred times better than HNN model.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.3
• /
• pp.77-88
• /
• 1995

It is assumed in the block matching algorithm(BMA) that all the pels in a block have a same motion vector. Then, the motion vector of a block in the BMA is matched to only one or none of the objects in the worst case if objects in a block have different motion vectors. This is apparent in the motion estimation using the fast BMA which has the effect of reducing the computation time and hardware complexity, compared to the full search BMA. Although the motion vector in the motion estimation using small block size is accurate, the increased number of bits is required to represent motion vectors. In this paper, new motion vector segmentation with less additional information and hardware complexity than the conventional method is proposed. In the proposed method, a motion vector is derived from the block for motion vector segmentation and another motion vector is extracted from four neighboring blocks to consiture a motion vector pair. For the accurate motion vector of each subblock, the motion vector is assigned to each subblock by mean squared error measure. And the overlapped motion compensation using window is also applied to reduce displaced frame difference.

• Kyungpook Mathematical Journal
• /
• v.45 no.2
• /
• pp.167-169
• /
• 2005

Here we introduce and study vector bundles, E, on a smooth projective curve X having many "spread" sections and for which $E^{*}\;{\otimes}{\omega}X$ has many "spread" sections. We show that no such bundle exists on X if the gonality of X is too low.

• Journal of the Korean Mathematical Society
• /
• v.37 no.5
• /
• pp.849-856
• /
• 2000

We give a new saddle point theorem for vector-valued functions on an admissible compact convex set in a topological vector space under weak condition that is the semicontinuity of two function scalarization and acyclicty of the involved sets. As application, we obtain the minimax theorem.

• Communications of the Korean Mathematical Society
• /
• v.22 no.3
• /
• pp.401-410
• /
• 2007

Some existence theorems of solutions of a new class of generalized vector F-implicit complementarity problems with the corresponding generalized vector F-implicit variational inequality problems were established.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.539-551
• /
• 2005

In this paper, sufficient optimality conditions and duality results for nonsmooth vector optimization problems are given under near invexity and infineness assumptions. Also, weak vector saddle-point theorems are obtained under near invexity-infineness assumptions.