• 한국통신학회논문지
• /
• 제14권6호
• /
• pp.650-662
• /
• 1989

본 논문에서는 한글문자패턴의 새로운 특징추출 및 분류 알고리즘을 제안하였다. 입력된 패턴을 한글기본 6형식으로 분류하고 자소분리를 시행한 후 각 자소별 위치에 따른 굴곡특징점을 추출하였다. 이 특징점에 의해 입력문자의 내용을 정의하고 이를 색인-순차 파일로 구성하였다. 이 파일과 표준사전화일과의 검색으로 인식처리토록 하였다. 간단한 알고리즘으로 인한 처리시간의 단축과 소프트웨어 작성이 용이함을 보였다. 실험의 결과는 입력패턴의 특징추출과 분류의 결과를 나타내준다. 제안된 알고리즘은 문자를 이루는 최소 4각형 안에서 거리변환을 시켜 굴국특성을 추출하여 이들이 갖고 있는 상대 위치 정보를 이용한 것이 특징으로 실험을 통해 97%의 인식율을 나타내었다.

• Journal of Applied Biological Chemistry
• /
• 제42권3호
• /
• pp.113-118
• /
• 1999

The transgenic plant of Citrus species (Citrus aurantium L.) was constructed with a fatty acid desaturase gene using microprojectile bombardment transformation system. The DNA of a fatty acid desaturase gene, fad7, constructed in pBI121 was coated onto tungsten particles ($1.1{\mu}m$) and introduced into callus cells by bombarding with 1100 psi of helium pressure, 1/4 in of gap distance, 7.0 cm of target distance and 27 in Hg of chamber vacuum. The bombarded cells were selected on the medium containing kanamycin. The selected cells were successfully regenerated into plantlets via somatic embryogenesis on the media containing plant growth regulators. The results of polymerase chain reaction analysis of genomic DNAs from the putative transformants showed that the introduced DNAs of fad7 were present in both the selected callus cells and the regenerated plantlets.

• 로봇학회논문지
• /
• 제11권1호
• /
• pp.33-40
• /
• 2016

In this paper, we propose a method for estimating the pose of the camera using a rectangle feature utilized for the visual SLAM. A warped rectangle feature as a quadrilateral in the image by the perspective transformation is reconstructed by the Coupled Line Camera algorithm. In order to fully reconstruct a rectangle in the real world coordinate, the distance between the features and the camera is needed. The distance in the real world coordinate can be measured by using a stereo camera. Using properties of the line camera, the physical size of the rectangle feature can be induced from the distance. The correspondence between the quadrilateral in the image and the rectangle in the real world coordinate can restore the relative pose between the camera and the feature through obtaining the homography. In order to evaluate the performance, we analyzed the result of proposed method with its reference pose in Gazebo robot simulator.

• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1700-1708
• /
• 2006

Since the most program execution time is consumed in a loop structure, extracting parallelism from loop programs is critical for the taster program execution. In this paper, we proposed data dependency removal method for a single loop. The data dependency removal method can be applied to uniform and non-uniform data dependency distance in the single loop. Procedure calls parallelisms with only a single loop structure or procedure call most of other methods are concerned with the uniform code within the uniform data dependency distance. We also propose an algorithm, which can be applied to uniform, non-uniform, and complex data dependency distance among the multiple procedures. We compared our method with conventional methods using CRAY-T3E for the performance evaluation. The results show that the proposed algorithm is effective.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1999년도 추계학술대회 논문집 - 한국공작기계학회
• /
• pp.99-104
• /
• 1999

This paper proposes an efficient method constructing a local map using the data of a scanning laser range finder. A laser range finder yields distance data of polar form, that is, distance data corresponding to every scanning directions. So, the data consists of directional angle and distance. We propose a new method to find a line fitting with a set of such data. The method uses Log-Hough Transformation. Usually, map building from these data requires some transformations between different coordinate systems. The new method alleviates such complication. Also, the method simplifies computation for line recognition and eliminates the slope quantization problems inherent in the classical Cartesian Hough transform method. To show the efficiency of the proposed method, it is applied to find a local map using the data from a laser range finder PLS(Proximity Laser Scanner, made by SICK).

• 전기학회논문지
• /
• 제57권4호
• /
• pp.700-705
• /
• 2008

In this paper, we propose object classification algorithm for real-time surveillance system. We have approached this problem using silhouette-based template matching. The silhouette of the object is extracted, and then it is compared with representative template models. Template models are previously stored in the database. Our algorithm is similar to previous pixel-based template matching scheme like Hausdorff Distance, but we use 1D image array rather than 2D regions inspired by Hilbert Path. Transformation of images could reduce computational burden to compute similarity between the detected image and the template images. Experimental results show robustness and real-time performance in object classification, even in low resolution images.

• Genomics & Informatics
• /
• 제17권4호
• /
• pp.39.1-39.20
• /
• 2019

Analyzing patterns in data points embedded in linear and non-linear feature spaces is considered as one of the common research problems among different research areas, for example: data mining, machine learning, pattern recognition, and multivariate analysis. In this paper, data points are heterogeneous sets of biosequences (composite data points). A composite data point is a set of ordinary data points (e.g., set of feature vectors). We theoretically extend the derivation of the largest generalized eigenvalue-based distance metric D_ij(γ₁) in any linear and non-linear feature spaces. We prove that D_ij(γ₁) is a metric under any linear and non-linear feature transformation function. We show the sufficiency and efficiency of using the decision rule $\bar{{\delta}}_{{\Xi}i}$(i.e., mean of D_ij(γ₁)) in classification of heterogeneous sets of biosequences compared with the decision rules min_𝚵iand median_𝚵i. We analyze the impact of linear and non-linear transformation functions on classifying/clustering collections of heterogeneous sets of biosequences. The impact of the length of a sequence in a heterogeneous sequence-set generated by simulation on the classification and clustering results in linear and non-linear feature spaces is empirically shown in this paper. We propose a new concept: the limiting dispersion map of the existing clusters in heterogeneous sets of biosequences embedded in linear and nonlinear feature spaces, which is based on the limiting distribution of nucleotide compositions estimated from real data sets. Finally, the empirical conclusions and the scientific evidences are deduced from the experiments to support the theoretical side stated in this paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.5785-5804
• /
• 2019

The information of localization is a fundamental requirement in wireless sensor network (WSN). The method of distance vector-hop (DV-Hop), a range-free localization algorithm, can locate the ordinary nodes by utilizing the connectivity and multi-hop transmission. However, the error of the estimated distance between the beacon nodes and ordinary nodes is too large. In order to enhance the positioning precision of DV-Hop, fast triangle flip bat algorithm, which is based on curve strategy and rank transformation (FTBA-TCR) is proposed. The rank is introduced to directly select individuals in the population of each generation, which arranges all individuals according to their merits and a threshold is set to get the better solution. To test the algorithm performance, the CEC2013 test suite is used to check out the algorithm's performance. Meanwhile, there are four other algorithms are compared with the proposed algorithm. The results show that our algorithm is greater than other algorithms. And this algorithm is used to enhance the performance of DV-Hop algorithm. The results show that the proposed algorithm receives the lower average localization error and the best performance by comparing with the other algorithms.

• 한국정보통신학회논문지
• /
• 제24권2호
• /
• pp.219-224
• /
• 2020

이진 분류(binary classification)는 머신러닝(machine learning) 분야에서 많이 다루어진 주제이다. 게다가 이진 분류는 다중 분류로 쉽게 발전될 수 있는 중요한 분야이다. 머신러닝 방법들을 적용할 때에 전처리(preprocessing)이나 특징 추출(feature extraction)과 같은 작업이 필수적이다. 이는 분류기 성능을 향상시키기 위한 중요한 작업이다. 본 논문에서는 가중된 최소 자승법을 기반으로 새로운 머신러닝 방법을 제안한다. 또한, 특징 변환시킬 수 있는 새로운 가중치 계산 방법을 제안한다. 이를 통해 특징 변환과 동시에 학습을 진행할 수 있는 방법을 제안한다. 본 제안을 다섯 개의 머신러닝 데이터베이스에서 실험을 진행하였으며 이 데이터베이스에서 우수한 성능을 얻을 수 있었다.

• 한국의류산업학회지
• /
• 제17권2호
• /
• pp.265-277
• /
• 2015

The aim of this study was to successfully reflect human body changes on the transformation of the virtual body within 3D virtual fitting spaces. For this purpose, existing problems of shape transformation of the virtual body were analyzed and regression equations which provides useful basic data for transformation of the virtual body that can be applied usefully to the 3D virtual fitting system was developed. Necessary data for the analyses were body measurement and 3D scan data of women with average physical form between the ages of 40 through 49. The reason that we used human body changes of the female subjects in their forties was based on the recognition that fundamental female body changes start to occur from age of forty. Body shapes were largely divided into 3 groups according to obesity which was found to be the biggest factor of shape change. Seven factors were extracted based on factor analysis of 47 body measurement categories and regression equations were created to extract specific measurements for each BMI group based on these seven factors. The major contribution of this paper can be summarized as follows. First, the regression equations to extract specific measurements based on the 7 representative variables remediated existing problem of virtual bodies as it increased the number of body shape transformation areas. Second, the regression equations helped to overcome the problem of current failing to reflecting changes in body cross-section shape based on simple girth measurements based on analysis of cross-section distances.