• Title/Summary/Keyword: binary vector

Search Result 368, Processing Time 0.022 seconds

Production of Herbicide-resistant Transgenic Plants from Embryogenic Suspension Cultures of Cucumber (오이의 배발생 현탁 배양세포로부터 제초제 저항성 형질전환 식물체 생산)

  • 우제욱;정원중;최관삼;박효근;백남긴;유장렬
    • Korean Journal of Plant Tissue Culture
    • /
    • v.28 no.1
    • /
    • pp.53-58
    • /
    • 2001
  • To develop herbicide-resistant cucumber plants (Cucumis sativus L. cv Green Angle) embryogenic suspension cultures were co-cultured with Agrobacterium tumefaciens strain LBA4404 carrying a disarmed binary vector pGA-bar. The T-DNA region of this binary vector contains the nopalin synthase/neomycin phosphotransferase Ⅱ (npt Ⅱ) chimeric gene for kanamycin resistance and the cauliflower 35S/phosphinothricin acetyltransferase (bar) chimeric gene for phosphinothricin (PPT) resistance, After co-cultivation for 48 h, embryogenic calli were placed on maturation media containing 20 mg/L PPT. Approximately 200 putatively transgenic plantlets were obtained in hormone free media containing 40 mg/L PPT. Northern blot hybridization analysis confirmed the expression of the bar gene that was integrated into the genome of five transgenic plants. Transgenic cucumber plants were grown to maturity. Mature plants in soil showed tolerance to the commercial herbicide (Basta) of PPT at the manufacturer's suggested level (3 mL/L).

  • PDF

Image Coding Using DCT Map and Binary Tree-structured Vector Quantizer (DCT 맵과 이진 트리 구조 벡터 양자화기를 이용한 영상 부호화)

  • Jo, Seong-Hwan;Kim, Eung-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.1
    • /
    • pp.81-91
    • /
    • 1994
  • A DCT map and new cldebook design algorithm based on a two-dimension discrete cosine transform (2D-DCT) is presented for coder of image vector quantizer. We divide the image into smaller subblocks, then, using 2D DCT, separate it into blocks which are hard to code but it bears most of the visual information and easy to code but little visual information, and DCT map is made. According to this map, the significant features of training image are extracted by using the 2D DCT. A codebook is generated by partitioning the training set into a binary tree based on tree-structure. Each training vector at a nonterminal node of the binary tree is directed to one of the two descendants by comparing a single feature associated with that node to a threshold. Compared with the pairwise neighbor (PPN) and classified VQ(CVQ) algorithm, about 'Lenna' and 'Boat' image, the new algorithm results in a reduction in computation time and shows better picture quality with 0.45 dB and 0.33dB differences as to PNN, 0.05dB and 0.1dB differences as to CVQ respectively.

  • PDF

Optimal EEG Channel Selection using BPSO with Channel Impact Factor (Channel Impact Factor 접목한 BPSO 기반 최적의 EEG 채널 선택 기법)

  • Kim, Jun-Yeup;Park, Seung-Min;Ko, Kwang-Eun;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.6
    • /
    • pp.774-779
    • /
    • 2012
  • Brain-computer interface based on motor imagery is a system that transforms a subject's intention into a control signal by classifying EEG signals obtained from the imagination of movement of a subject's limbs. For the new paradigm, we do not know which positions are activated or not. A simple approach is to use as many channels as possible. The problem is that using many channels causes other problems. When applying a common spatial pattern (CSP), which is an EEG extraction method, many channels cause an overfit problem, in addition there is difficulty using this technique for medical analysis. To overcome these problems, we suggest a binary particle swarm optimization with channel impact factor in order to select channels close to the most important channels as channel selection method. This paper examines whether or not channel impact factor can improve accuracy by Support Vector Machine(SVM).

Binary Tree Architecture Design for Support Vector Machine Using Dynamic Time Warping (DTW를 이용한 SVM 기반 이진트리 구조 설계)

  • Kang, Youn Joung;Lee, Jaeil;Bae, Jinho;Lee, Seung Woo;Lee, Chong Hyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.6
    • /
    • pp.201-208
    • /
    • 2014
  • In this paper, we propose the classifier structure design algorithm using DTW. Proposed algorithm uses DTW result to design the binary tree architecture based on the SVM which classify the multi-class data. Design the binary tree architecture for Support Vector Machine(SVM-BTA) using the threshold criterion calculated by the sum columns in square matrix which components are the reference data from each class. For comparison the performance of the proposed algorithm, compare the results of classifiers which binary tree structure are designed based on database and k-means algorithm. The data used for classification is 333 signals from 18 classes of underwater transient noise. The proposed classifier has been improved classification performance compared with classifier designed by database system, and probability of detection for non-biological transient signal has improved compare with classifiers using k-means algorithm. The proposed SVM-BTA classified 68.77% of biological sound(BO), 92.86% chain(CHAN) the mechanical sound, and 100% of the 6 kinds of the other classes.

Fuzzy SVM for Multi-Class Classification

  • Na, Eun-Young;Hong, Dug-Hun;Hwang, Chang-Ha
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.123-123
    • /
    • 2003
  • More elaborated methods allowing the usage of binary classifiers for the resolution of multi-class classification problems are briefly presented. This way of using FSVC to learn a K-class classification problem consists in choosing the maximum applied to the outputs of K FSVC solving a one-per-class decomposition of the general problem.

  • PDF

A Note on Linear SVM in Gaussian Classes

  • Jeon, Yongho
    • Communications for Statistical Applications and Methods
    • /
    • v.20 no.3
    • /
    • pp.225-233
    • /
    • 2013
  • The linear support vector machine(SVM) is motivated by the maximal margin separating hyperplane and is a popular tool for binary classification tasks. Many studies exist on the consistency properties of SVM; however, it is unknown whether the linear SVM is consistent for estimating the optimal classification boundary even in the simple case of two Gaussian classes with a common covariance, where the optimal classification boundary is linear. In this paper we show that the linear SVM can be inconsistent in the univariate Gaussian classification problem with a common variance, even when the best tuning parameter is used.

Vector Quantization Codebook Design Using Unbalanced Binary Tree and DCT Coefficients (불균형 이진트리와 DCT 계수를 이용한 벡터양자화 코드북)

  • 이경환;최정현;이법기;정원식;김경규;김덕규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12B
    • /
    • pp.2342-2348
    • /
    • 1999
  • DCT-based codebook design using binary tree was proposed to reduce computation time and to solve the initial codebook problem. In this method, DCT coefficient of training vectors that has maximum variance is to be a split key and the mean of coefficients at the location is used as split threshold, then balanced binary tree for final codebook is formed. However edge degradation appears in the reconstructed image, since the blocks of shade region are frequently selected for codevector. In this paper, we propose DCT-based vector quantization codebook design using unbalanced binary tree. Above all, the node that has the largest split key is splited. So the number of edge codevector can be increased. From the simulation results, this method reconstructs the edge region sincerely and shows higher PSNR than previous methods.

  • PDF

Development of Fuzzy Support Vector Machine and Evaluation of Performance Using Ionosphere Radar Data (Fuzzy Twin Support Vector Machine 개발 및 전리층 레이더 데이터를 통한 성능 평가)

  • Cheon, Min-Kyu;Yoon, Chang-Yong;Kim, Eun-Tai;Park, Mig-Non
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.4
    • /
    • pp.549-554
    • /
    • 2008
  • Support Vector machine is the classifier which is based on the statistical training theory. Twin Support Vector Machine(TWSVM) is a kind of binary classifier that determines two nonparallel planes by solving two related SVM-type problems. The training time of TWSVM is shorter than that of SVM, but TWSVM doesn't shows worse performance than that of SVM. This paper proposes the TWSVM which is applied fuzzy membership, and compares the performance of this classifier with the other classifiers using Ionosphere radar data set.

Construction of a Plant Expression Vector for the Coat Protein Gene of Cucumber Mosaic Virus-As Strain for Plant Transformation (오이 모자이크 바이러스 As계통 외피단백질 유전자의 식물체 형질질환을 위한 발현벡타의 구축)

  • 류기현;박원목
    • Korean Journal Plant Pathology
    • /
    • v.11 no.1
    • /
    • pp.66-72
    • /
    • 1995
  • The coat protein (CP) gene of cucumber mosaic virus-As (CMV-As) strain was engineered for expression in the plant by using the cauliflower mosaic virus 35S transcript regulatory sequences. The CP gene was cloned into an Agrobacterium-derived binary vector. A chimeric gene was constructed by the cDNA of CMV-As CP and plant expression vector pBI121. The clone, pCMAS66, was first introduced into the phagemid vector pSPORT1 for situating sense orientation for translation and making restriction sites in order to re-introduce plant expression vector, pHI121. The resulting subclone pCASCP02 and plant expression vector pBI121 were treated with BamHI-SacI for excising the target gene and removing GUS gene, respectively. After Agrobacterium transformation by freeze-thaw technique, the clone, pCMASCP121-123 which contains sense orientation of the target gene, was selected and confirmed by restriction endonuclease analysis. The CMV-As CP gene was introduced into A. tumefaciens. The results on tobacco plant transformation with the vector system revealed that the system could be successfully introduced and showed high frequency of selection to putative transformations.

  • PDF

Dual-Encoded Features from Both Spatial and Curvelet Domains for Image Smoke Recognition

  • Yuan, Feiniu;Tang, Tiantian;Xia, Xue;Shi, Jinting;Li, Shuying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.2078-2093
    • /
    • 2019
  • Visual smoke recognition is a challenging task due to large variations in shape, texture and color of smoke. To improve performance, we propose a novel smoke recognition method by combining dual-encoded features that are extracted from both spatial and Curvelet domains. A Curvelet transform is used to filter an image to generate fifty sub-images of Curvelet coefficients. Then we extract Local Binary Pattern (LBP) maps from these coefficient maps and aggregate histograms of these LBP maps to produce a histogram map. Afterwards, we encode the histogram map again to generate Dual-encoded Local Binary Patterns (Dual-LBP). Histograms of Dual-LBPs from Curvelet domain and Completed Local Binary Patterns (CLBP) from spatial domain are concatenated to form the feature for smoke recognition. Finally, we adopt Gaussian Kernel Optimization (GKO) algorithm to search the optimal kernel parameters of Support Vector Machine (SVM) for further improvement of classification accuracy. Experimental results demonstrate that our method can extract effective and reasonable features of smoke images, and achieve good classification accuracy.