• Title/Summary/Keyword: Vector Data

Search Result 3,325, Processing Time 0.043 seconds

Watermarking technique and algorithm review of digital data for GIS

  • Kim Jung-Yeop;Hong Sung-Eon;Lee Yong-Ik;Park Soo-Hong
    • Spatial Information Research
    • /
    • v.13 no.4 s.35
    • /
    • pp.393-400
    • /
    • 2005
  • Due to the development of the network and Internet, it is easy to copy and spread digital data. These data has the advantage of being able to be copy without loss. However, this has generated a problem over copyright. The problem occurred in GIS, too. Although GIS data acquisition is the major cost there is insufficient effort made to protect copyright. For this reason watermarking could be a good method to guarantee owner's copyright. This paper will explain watermarking, and show an overview of watermarking studies connecting image and vector data.

  • PDF

An Efficient Vector Quantization Codebook generation using a Triangle Inequality (삼각 부등식을 이용한 빠른 벡터 양자화 코드북 생성)

  • Lee, Hyun-Jin
    • Journal of Digital Contents Society
    • /
    • v.13 no.3
    • /
    • pp.309-315
    • /
    • 2012
  • Active data are the input data which are changed its membership as Vector Quantization codebook generation algorithm is processed. In the process of VQ codebook generation algorithm performed, the actual active data out of the entire input data will be less presented as the process is performed. Therefore, if we can accurately find the active data and only if we are going to do VQ codebook generation on the active data, then we can significantly reduce the overall generation time. In this paper, we presented the triangle inequality based algorithm to select the active data. Experimental results show that our algorithm is superior to other methods in terms of the VQ codebook generation time.

Development of the Modified Preprocessing Method for Pipe Wall Thinning Data in Nuclear Power Plants (원자력 발전소 배관 감육 측정데이터의 개선된 전처리 방법 개발)

  • Seong-Bin Mun;Sang-Hoon Lee;Young-Jin Oh;Sung-Ryul Kim
    • Transactions of the Korean Society of Pressure Vessels and Piping
    • /
    • v.19 no.2
    • /
    • pp.146-154
    • /
    • 2023
  • In nuclear power plants, ultrasonic test for pipe wall thickness measurement is used during periodic inspections to prevent pipe rupture due to pipe wall thinning. However, when measuring pipe wall thickness using ultrasonic test, a significant amount of measurement error occurs due to the on-site conditions of the nuclear power plant. If the maximum pipe wall thinning rate is decided by the measured pipe wall thickness containing a significant error, the pipe wall thinning rate data have significant uncertainty and systematic overestimation. This study proposes preprocessing of pipe wall thinning measurement data using support vector machine regression algorithm. By using support vector machine, pipe wall thinning measurement data can be smoothened and accordingly uncertainty and systematic overestimation of the estimated pipe wall thinning rate data can be reduced.

An analysis of satisfaction index on computer education of university using kernel machine (커널머신을 이용한 대학의 컴퓨터교육 만족도 분석)

  • Pi, Su-Young;Park, Hye-Jung;Ryu, Kyung-Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.5
    • /
    • pp.921-929
    • /
    • 2011
  • In Information age, the academic liberal art Computer education course set up goals for promoting computer literacy and for developing the ability to cope actively with in Information Society and for improving productivity and competition among nations. In this paper, we analyze on discovering of decisive property and satisfaction index to have a influence on computer education on university students. As a preprocessing method, the proposed method select optimum property using correlation feature selection of machine learning tool based on Java and then we use multiclass least square support vector machine based on statistical learning theory. After applying that compare with multiclass support vector machine and multiclass least square support vector machine, we can see the fact that the proposed method have a excellent result like multiclass support vector machine in analysis of the academic liberal art computer education satisfaction index data.

Multi-Vector Document Embedding Using Semantic Decomposition of Complex Documents (복합 문서의 의미적 분해를 통한 다중 벡터 문서 임베딩 방법론)

  • Park, Jongin;Kim, Namgyu
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.3
    • /
    • pp.19-41
    • /
    • 2019
  • According to the rapidly increasing demand for text data analysis, research and investment in text mining are being actively conducted not only in academia but also in various industries. Text mining is generally conducted in two steps. In the first step, the text of the collected document is tokenized and structured to convert the original document into a computer-readable form. In the second step, tasks such as document classification, clustering, and topic modeling are conducted according to the purpose of analysis. Until recently, text mining-related studies have been focused on the application of the second steps, such as document classification, clustering, and topic modeling. However, with the discovery that the text structuring process substantially influences the quality of the analysis results, various embedding methods have actively been studied to improve the quality of analysis results by preserving the meaning of words and documents in the process of representing text data as vectors. Unlike structured data, which can be directly applied to a variety of operations and traditional analysis techniques, Unstructured text should be preceded by a structuring task that transforms the original document into a form that the computer can understand before analysis. It is called "Embedding" that arbitrary objects are mapped to a specific dimension space while maintaining algebraic properties for structuring the text data. Recently, attempts have been made to embed not only words but also sentences, paragraphs, and entire documents in various aspects. Particularly, with the demand for analysis of document embedding increases rapidly, many algorithms have been developed to support it. Among them, doc2Vec which extends word2Vec and embeds each document into one vector is most widely used. However, the traditional document embedding method represented by doc2Vec generates a vector for each document using the whole corpus included in the document. This causes a limit that the document vector is affected by not only core words but also miscellaneous words. Additionally, the traditional document embedding schemes usually map each document into a single corresponding vector. Therefore, it is difficult to represent a complex document with multiple subjects into a single vector accurately using the traditional approach. In this paper, we propose a new multi-vector document embedding method to overcome these limitations of the traditional document embedding methods. This study targets documents that explicitly separate body content and keywords. In the case of a document without keywords, this method can be applied after extract keywords through various analysis methods. However, since this is not the core subject of the proposed method, we introduce the process of applying the proposed method to documents that predefine keywords in the text. The proposed method consists of (1) Parsing, (2) Word Embedding, (3) Keyword Vector Extraction, (4) Keyword Clustering, and (5) Multiple-Vector Generation. The specific process is as follows. all text in a document is tokenized and each token is represented as a vector having N-dimensional real value through word embedding. After that, to overcome the limitations of the traditional document embedding method that is affected by not only the core word but also the miscellaneous words, vectors corresponding to the keywords of each document are extracted and make up sets of keyword vector for each document. Next, clustering is conducted on a set of keywords for each document to identify multiple subjects included in the document. Finally, a Multi-vector is generated from vectors of keywords constituting each cluster. The experiments for 3.147 academic papers revealed that the single vector-based traditional approach cannot properly map complex documents because of interference among subjects in each vector. With the proposed multi-vector based method, we ascertained that complex documents can be vectorized more accurately by eliminating the interference among subjects.

An Improvement of LVQ3 Learning Using SVM (SVM을 이용한 LVQ3 학습의 성능개선)

  • 김상운
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.9-12
    • /
    • 2001
  • Learning vector quantization (LVQ) is a supervised learning technique that uses class information to move the vector quantizer slightly, so as to improve the quality of the classifier decision regions. In this paper we propose a selection method of initial codebook vectors for a teaming vector quantization (LVQ3) using support vector machines (SVM). The method is experimented with artificial and real design data sets and compared with conventional methods of the condensed nearest neighbor (CNN) and its modifications (mCNN). From the experiments, it is discovered that the proposed method produces higher performance than the conventional ones and then it could be used efficiently for designing nonparametric classifiers.

  • PDF

Vibration Filter Using Vector Channel Periodic Lattice

  • Hwang, Won-Gul;Im, Hyung-Eun
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.12
    • /
    • pp.2043-2051
    • /
    • 2006
  • This paper considered identification of vibration characteristics of flexible structure with vector channel periodic lattice filter. We present an algorithm for AR coefficients for the vector-channel lattice filters, and characteristic equation and transfer function are derived from these coefficients. Vibration lattice filter is then constructed from the vector channel lattice filter, and performance of this vibration filter is tested with a test signal which is a combination of many sine waves to compare the performance of scalar and vector channel lattice. Also it is applied to the cantilever data to identify properties of the system, such as natural frequencies and damping ratios, to show its performance.

Competitive Learning Neural Network with Dynamic Output Neuron Generation (동적으로 출력 뉴런을 생성하는 경쟁 학습 신경회로망)

  • 김종완;안제성;김종상;이흥호;조성원
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.9
    • /
    • pp.133-141
    • /
    • 1994
  • Conventional competitive learning algorithms compute the Euclidien distance to determine the winner neuron out of all predetermined output neurons. In such cases, there is a drawback that the performence of the learning algorithm depends on the initial reference(=weight) vectors. In this paper, we propose a new competitive learning algorithm that dynamically generates output neurons. The proposed method generates output neurons by dynamically changing the class thresholds for all output neurons. We compute the similarity between the input vector and the reference vector of each output neuron generated. If the two are similar, the reference vector is adjusted to make it still more like the input vector. Otherwise, the input vector is designated as the reference vector of a new outputneuron. Since the reference vectors of output neurons are dynamically assigned according to input pattern distribution, the proposed method gets around the phenomenon that learning is early determined due to redundant output neurons. Experiments using speech data have shown the proposed method to be superior to existint methods.

  • PDF

ON NONLINEARITY AND GLOBAL AVALANCHE CHARACTERISTICS OF VECTOR BOOLEAN FUNCTIONS

  • Kim, Wan-Soon;Hwang, Hee-Sung
    • Journal of applied mathematics & informatics
    • /
    • v.16 no.1_2
    • /
    • pp.407-417
    • /
    • 2004
  • It is well known that the nonlinearity of vector Boolean functions F on n-dimensional vector space $GF(2)^n$ to $GF(2)^m$ is bounded above by $2^{n-1} - 2 ^{\frac{n}{2}-1}$. In this paper we derive upper bounds and a lower bound on the nonlinearity of vector Boolean functions in terms of auto-correlations. Strengths and weaknesses of each bounds are examined. Also, we modify the notions of the sum-of-square indicator and absolute indicator for Boolean functions to the case of vector Boolean functions to measure global avalanche characteristics of vector Boolean functions. Using those indicators we compare the global avalanche characteristics of DES (Data Encryption System) and Rijndael.

Fuzzy c-Regression Using Weighted LS-SVM

  • Hwang, Chang-Ha
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.161-169
    • /
    • 2005
  • In this paper we propose a fuzzy c-regression model based on weighted least squares support vector machine(LS-SVM), which can be used to detect outliers in the switching regression model while preserving simultaneous yielding the estimates of outputs together with a fuzzy c-partitions of data. It can be applied to the nonlinear regression which does not have an explicit form of the regression function. We illustrate the new algorithm with examples which indicate how it can be used to detect outliers and fit the mixed data to the nonlinear regression models.

  • PDF