• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.287-290
• /
• 2000

In this paper we have presented approach to automatic the direction feature vectors detection, which detects the ridge line directly in gray scale images. In spite of a greater conceptual complexity, we have shown that our technique has less computational complexity than the complexity of the techniques which require binarization and thinning. Afterwards a various direction feature vectors is changed four direction feature vectors. In this paper used matching method is four direction feature vectors based matching. This four direction feature vectors consist feature patterns in fingerprint images. This feature patterns were used for identification of individuals inputed multilayer Neural Networks(NN) which has capability of excellent pattern identification.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.4
• /
• pp.243-253
• /
• 2003

This paper presents a new geometric morphing algorithm for polygons based on a simple geometric structure called direction map, which is mainly composed of a circular list of direction vectors defined by two neighboring vertices of a polygon. To generate a sequence of intermediate morphing shapes, first we merge direction maps of given control shapes based on a certain ordering rule of direction vectors, and scale the length of each direction vectors using Bezier or blossom controls. We show that the proposed algorithm is an improvement of the previous methods based on Minkowski sum (or convolution) in th aspects of computational efficiency and geometric properties.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.12-16
• /
• 2007

In this paper, a new method is proposed for tracking the direction-of-arrival (DOA) of the wideband moving source incident on uniform linear array sensors. DOA is estimated by focusing transformation matrices. To update focusing matrices along with new data snap shots, we use the FAST (Fast Approximate Subspace Tracking) method. Present focusing matrices are constructed by previous signal and its orthogonal basis vectors as well as present signal and its orthogonal basis vectors, which are the left and right singular vectors of the inner product of two approximated matrices. Simulation results are shown to illustrate the performance of the proposed method.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.824-828
• /
• 2000

Prior to the downloading of the NC codes to a machining center, the NC tool-path can be verified in a computer. The Z-map is one of the tools for the verification of NC tool-path. The Z-map is a two dimensional array in which the height values of the Z-axis direction vectors are stored. The Z-axis direction vectors are arranged in a rectangular grid pattern on the XY plane. The accuracy of the simulation comes from the grid interval. In the rectangular Z-map, the distances between the grid points are different. The distance in diagonal direction is larger than those in X or Y axis directions. For the rendering of the Z-map, a rectangular grid is divided into two triangular facets. Depending on the selection of a diagonal, there are two different cases. In this paper, triangular Z-map, in which the Z-axis direction vectors are arranged in a triangular grid pattern on XY plane, is proposed. In the triangular Z-map, the distances between grid points are equal. There is no ambiguity to make triangular facets for the rendering.

• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.880-887
• /
• 2015

In this paper, frame rate up conversion (FRUC) algorithm considering the direction and magnitude of identical motion vectors is proposed. extended bilateral motion estimation (EBME) has higher complexity than bilateral motion estimation (BME). By using average magnitude of motion vector with x and y direction respectively, dynamic frame and static frame are decided. We reduce complexity to decide EBME. also, After we compare the direction and magnitude of identical motion vectors, We reduce complexity to decide motion vector smoothing(MVS). Experimental results show that this proposed algorithm has fast computation and better peak singnal to noise ratio(PSNR) results compared with EBME.

• Journal of Korean Association for Spatial Structures
• /
• v.8 no.3
• /
• pp.75-82
• /
• 2008

In this study, the modified genetic algorithm, D-GA, is proposed. D-GA is a hybrid genetic algorithm combined a simple genetic algorithm and the local search algorithm using direction vectors. Also, two types of direction vectors, learning direction vector and random direction vector, are defined without the sensitivity analysis. The accuracy of D-GA is compared with that of simple genetic algorithm. It is demonstrated that the proposed approach can be an effective optimization technique through a minimum weight structural optimization of ten bar truss.

• Journal of Broadcast Engineering
• /
• v.1 no.1
• /
• pp.35-43
• /
• 1996

In this paper, we present efficient six-connected contour coding algorithms which can uniquely reconstruct any contour image and efficiently compress the contour data. We first design chain difference codes using two onward direction states, based on the fact that the probability distribution of the direction vectors of horiwntal/vertical direction state is different from that of the direction vectors of diagonal direction state. In order to increase coding efficiency, we also design chain difference codes using five states which are classified according to current and previous onward direction vectors. In addition, we also remove the END codeword to reduce total codeword occurrency. Experimental results show that when using 2 states and 5 states without END codeword total entropy decreases by about 12% and 14% for real images and by about 10% and 26% for a synthetic image, respectively.

• Communications for Statistical Applications and Methods
• /
• v.5 no.1
• /
• pp.25-33
• /
• 1998

We review a multivariate version of Kendall's tau based on direction vectors of observations. And with this statistic we propose an analog of the forward variable selection method which selects a set of independent variables for further studies to build the eventual predicting model. This method does not assume the distributions of observations and the linear model and it is strong to the outliers with high asymptotic efficiencies relative to the parametric Pearson's correlation coefficient.

• Journal of Educational Research in Mathematics
• /
• v.25 no.2
• /
• pp.177-188
• /
• 2015

In this paper, I investigated the historical development process for the product of two vectors in the plane and space, and draw implications for educational guidance to internal and external product of vectors based on it. The results of the historical analysis show that efforts to define the product of the two line segments having different direction in the plane justified the rules of complex algebraic calculations with its length of the product of their lengths and its direction of the sum of their directions. Also, the efforts to define the product of the two line segments having different direction in three dimensional space led to the introduction of quaternion. In addition, It is founded that the inner product and outer product of vectors was derived from the real part and vector part of multiplication of two quaternions. Based on these results, I claimed that we should review the current deployment method of making inner product and outer product as multiplications that are not related to each other, and suggested one approach for connecting the inner and outer product.

• Honam Mathematical Journal
• /
• v.44 no.4
• /
• pp.594-617
• /
• 2022

In this study, firstly Smarandache ruled surfaces whose base curves are Smarandache curves derived from Frenet vectors of the curve, and whose direction vectors are unit vectors plotting Smarandache curves, are created. Then, the Gaussian and mean curvatures of the obtained ruled surfaces are calculated separately, and the conditions to be developable or minimal for the surfaces are given. Finally, the examples are given for each surface and the graphs of these surfaces are drawn.