• Title/Summary/Keyword: String Vector

Search Result 29, Processing Time 0.022 seconds

The Comparison of Pulled and Pushed-SOFM in Single String for Global Path Planning of Mobile Robot (이동로봇의 전역경로계획을 위한 단경로 String에서 당기기와 밀어내기 SOFM을 이용한 방법의 비교)

  • Cha, Young-Youp
    • Proceedings of the KSME Conference
    • /
    • 2008.11a
    • /
    • pp.900-901
    • /
    • 2008
  • In this research uses a predetermined initial weight vectors of 1-dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are moved toward or reverse the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

  • PDF

Global Path Planning of Mobile Robot Using String and Modified SOFM (스트링과 수정된 SOFM을 이용한 이동로봇의 전역 경로계획)

  • Cha, Young-Youp
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.25 no.4
    • /
    • pp.69-76
    • /
    • 2008
  • The self-organizing feature map(SOFM) among a number of neural network uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are moved toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors of the 1-dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the opposite direction of input vector. According to simulation results one can conclude that the method using string and the modified neural network is useful tool to mobile robot for the global path planning.

Modified Version of SVM for Text Categorization

  • Jo, Tae-Ho
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.8 no.1
    • /
    • pp.52-60
    • /
    • 2008
  • This research proposes a new strategy where documents are encoded into string vectors for text categorization and modified versions of SVM to be adaptable to string vectors. Traditionally, when the traditional version of SVM is used for pattern classification, raw data should be encoded into numerical vectors. This encoding may be difficult, depending on a given application area of pattern classification. For example, in text categorization, encoding full texts given as raw data into numerical vectors leads to two main problems: huge dimensionality and sparse distribution. In this research, we encode full texts into string vectors, and apply the modified version of SVM adaptable to string vectors for text categorization.

The Comparison of Pulled- and Pushed-SOFM in Single String for Global Path Planning (전역경로계획을 위한 단경로 스트링에서 당기기와 밀어내기 SOFM을 이용한 방법의 비교)

  • Cha, Young-Youp;Kim, Gon-Woo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.4
    • /
    • pp.451-455
    • /
    • 2009
  • This paper provides a comparison of global path planning method in single string by using pulled and pushed SOFM (Self-Organizing Feature Map) which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial-weight-vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified SOFM method in this research uses a predetermined initial weight vectors of the one dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward or reverse the input vector, by rising a pulled- or a pushed-SOFM. According to simulation results one can conclude that the modified neural networks in single string are useful tool for the global path planning problem of a mobile robot. In comparison of the number of iteration for converging to the solution the pushed-SOFM is more useful than the pulled-SOFM in global path planning for mobile robot.

Theoretical and experimental study on damage detection for beam string structure

  • He, Haoxiang;Yan, Weiming;Zhang, Ailin
    • Smart Structures and Systems
    • /
    • v.12 no.3_4
    • /
    • pp.327-344
    • /
    • 2013
  • Beam string structure (BSS) is introduced as a new type of hybrid prestressed string structures. The composition and mechanics features of BSS are discussed. The main principles of wavelet packet transform (WPT), principal component analysis (PCA) and support vector machine (SVM) have been reviewed. WPT is applied to the structural response signals, and feature vectors are obtained by feature extraction and PCA. The feature vectors are used for training and classification as the inputs of the support vector machine. The method is used to a single one-way arched beam string structure for damage detection. The cable prestress loss and web members damage experiment for a beam string structure is carried through. Different prestressing forces are applied on the cable to simulate cable prestress loss, the prestressing forces are calculated by the frequencies which are solved by Fourier transform or wavelet transform under impulse excitation. Test results verify this method is accurate and convenient. The damage cases of web members on the beam are tested to validate the efficiency of the method presented in this study. Wavelet packet decomposition is applied to the structural response signals under ambient vibration, feature vectors are obtained by feature extraction method. The feature vectors are used for training and classification as the inputs of the support vector machine. The structural damage position and degree can be identified and classified, and the test result is highly accurate especially combined with principle component analysis.

Inverted Index based Modified Version of K-Means Algorithm for Text Clustering

  • Jo, Tae-Ho
    • Journal of Information Processing Systems
    • /
    • v.4 no.2
    • /
    • pp.67-76
    • /
    • 2008
  • This research proposes a new strategy where documents are encoded into string vectors and modified version of k means algorithm to be adaptable to string vectors for text clustering. Traditionally, when k means algorithm is used for pattern classification, raw data should be encoded into numerical vectors. This encoding may be difficult, depending on a given application area of pattern classification. For example, in text clustering, encoding full texts given as raw data into numerical vectors leads to two main problems: huge dimensionality and sparse distribution. In this research, we encode full texts into string vectors, and modify the k means algorithm adaptable to string vectors for text clustering.

Inverted Index based Modified Version of KNN for Text Categorization

  • Jo, Tae-Ho
    • Journal of Information Processing Systems
    • /
    • v.4 no.1
    • /
    • pp.17-26
    • /
    • 2008
  • This research proposes a new strategy where documents are encoded into string vectors and modified version of KNN to be adaptable to string vectors for text categorization. Traditionally, when KNN are used for pattern classification, raw data should be encoded into numerical vectors. This encoding may be difficult, depending on a given application area of pattern classification. For example, in text categorization, encoding full texts given as raw data into numerical vectors leads to two main problems: huge dimensionality and sparse distribution. In this research, we encode full texts into string vectors, and modify the supervised learning algorithms adaptable to string vectors for text categorization.

A Study on Automatic Classification of Fingerprint Images (지문 영상의 자동 분류에 관한 연구)

  • Lim, In-Sic;Sin, Tae-Min;Park, Goo-Man;Lee, Byeong-Rae;Park, Kyu-Tae
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.628-631
    • /
    • 1988
  • This paper describes a fingerprint classification on the basis of feature points(whorl, core) and feature vector and uses a syntactic approach to identify the shape of flow line around the core. Fingerprint image is divided into 8 by 8 subregions and fingerprint region is separated from background. For each subregion of fingerprint region, the dominant ridge direction is obtained to use the slit window quantized in 8 direction and relaxation is performed to correct ridge direction code. Feature points(whorl, core, delta) are found from the ridge direction code. First classification procedure divides the types of fingerprint into 4 class based on whorl and cores. The shape of flow line around the core is obtained by tracing for the fingerprint which has one core or two core and is represented as string. If the string is acceptable by LR(1) parser, feature vector is obtained from feature points(whorl, core, delta) and the shape of flow line around the core. Feature vector is used hierarchically and linearly to classify fingerprint again. The experiment resulted in 97.3 percentages of sucessful classification for 71 fingerprint impressions.

  • PDF

A Syllable Kernel based Sentiment Classification for Movie Reviews (음절 커널 기반 영화평 감성 분류)

  • Kim, Sang-Do;Park, Seong-Bae;Park, Se-Young;Lee, Sang-Jo;Kim, Kweon-Yang
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.2
    • /
    • pp.202-207
    • /
    • 2010
  • In this paper, we present an automatic sentiment classification method for on-line movie reviews that do not contain explicit sentiment rating scores. For the sentiment polarity classification, positive or negative, we use a Support Vector Machine classifier based on syllable kernel that is an extended model of string kernel. We give some experimental results which show that proposed syllable kernel model can be effectively used in sentiment classification tasks for on-line movie reviews that usually contain a lot of grammatical errors such as spacing or spelling errors.

Spoken Document Retrieval Based on Phone Sequence Strings Decoded by PVDHMM (PVDHMM을 이용한 음소열 기반의 SDR 응용)

  • Choi, Dae-Lim;Kim, Bong-Wan;Kim, Chong-Kyo;Lee, Yong-Ju
    • MALSORI
    • /
    • no.62
    • /
    • pp.133-147
    • /
    • 2007
  • In this paper, we introduce a phone vector discrete HMM(PVDHMM) that decodes a phone sequence string, and demonstrates the applicability to spoken document retrieval. The PVDHMM treats a phone recognizer or large vocabulary continuous speech recognizer (LVCSR) as a vector quantizer whose codebook size is equal to the size of its phone set. We apply the PVDHMM to decode the phone sequence strings and compare the outputs with those of a continuous speech recognizer(CSR). Also we carry out spoken document retrieval experiment through PVDHMM word spotter on the phone sequence strings which are generated by phone recognizer or LVCSR and compare its results with those of retrieval through the phone-based vector space model.

  • PDF