• Title/Summary/Keyword: vector-matrix method

Search Result 417, Processing Time 0.035 seconds

Optimal supervised LSA method using selective feature dimension reduction (선택적 자질 차원 축소를 이용한 최적의 지도적 LSA 방법)

  • Kim, Jung-Ho;Kim, Myung-Kyu;Cha, Myung-Hoon;In, Joo-Ho;Chae, Soo-Hoan
    • Science of Emotion and Sensibility
    • /
    • v.13 no.1
    • /
    • pp.47-60
    • /
    • 2010
  • Most of the researches about classification usually have used kNN(k-Nearest Neighbor), SVM(Support Vector Machine), which are known as learn-based model, and Bayesian classifier, NNA(Neural Network Algorithm), which are known as statistics-based methods. However, there are some limitations of space and time when classifying so many web pages in recent internet. Moreover, most studies of classification are using uni-gram feature representation which is not good to represent real meaning of words. In case of Korean web page classification, there are some problems because of korean words property that the words have multiple meanings(polysemy). For these reasons, LSA(Latent Semantic Analysis) is proposed to classify well in these environment(large data set and words' polysemy). LSA uses SVD(Singular Value Decomposition) which decomposes the original term-document matrix to three different matrices and reduces their dimension. From this SVD's work, it is possible to create new low-level semantic space for representing vectors, which can make classification efficient and analyze latent meaning of words or document(or web pages). Although LSA is good at classification, it has some drawbacks in classification. As SVD reduces dimensions of matrix and creates new semantic space, it doesn't consider which dimensions discriminate vectors well but it does consider which dimensions represent vectors well. It is a reason why LSA doesn't improve performance of classification as expectation. In this paper, we propose new LSA which selects optimal dimensions to discriminate and represent vectors well as minimizing drawbacks and improving performance. This method that we propose shows better and more stable performance than other LSAs' in low-dimension space. In addition, we derive more improvement in classification as creating and selecting features by reducing stopwords and weighting specific values to them statistically.

  • PDF

Realtime Facial Expression Control and Projection of Facial Motion Data using Locally Linear Embedding (LLE 알고리즘을 사용한 얼굴 모션 데이터의 투영 및 실시간 표정제어)

  • Kim, Sung-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.2
    • /
    • pp.117-124
    • /
    • 2007
  • This paper describes methodology that enables animators to create the facial expression animations and to control the facial expressions in real-time by reusing motion capture datas. In order to achieve this, we fix a facial expression state expression method to express facial states based on facial motion data. In addition, by distributing facial expressions into intuitive space using LLE algorithm, it is possible to create the animations or to control the expressions in real-time from facial expression space using user interface. In this paper, approximately 2400 facial expression frames are used to generate facial expression space. In addition, by navigating facial expression space projected on the 2-dimensional plane, it is possible to create the animations or to control the expressions of 3-dimensional avatars in real-time by selecting a series of expressions from facial expression space. In order to distribute approximately 2400 facial expression data into intuitional space, there is need to represents the state of each expressions from facial expression frames. In order to achieve this, the distance matrix that presents the distances between pairs of feature points on the faces, is used. In order to distribute this datas, LLE algorithm is used for visualization in 2-dimensional plane. Animators are told to control facial expressions or to create animations when using the user interface of this system. This paper evaluates the results of the experiment.

Deisgn of adaptive array antenna for tracking the source of maximum power and its application to CDMA mobile communication (최대 고유치 문제의 해를 이용한 적응 안테나 어레이와 CDMA 이동통신에의 응용)

  • 오정호;윤동운;최승원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.11
    • /
    • pp.2594-2603
    • /
    • 1997
  • A novel method of adaptive beam forming is presented in this paper. The proposed technique provides for a suboptimal beam pattern that increases the Signal to Noise/Interference Ratio (SNR/SIR), thus, eventually increases the capacity of the communication channel, under an assumption that the desired signal is dominant compared to each component of interferences at the receiver, which is precoditionally achieved in Code Division Multiple Access (CDMA) mobile communications by the chip correlator. The main advantages of the new technique are:(1)The procedure requires neither reference signals nor training period, (2)The signal interchoerency does not affect the performance or complexity of the entire procedure, (3)The number of antennas does not have to be greater than that of the signals of distinct arrival angles, (4)The entire procedure is iterative such that a new suboptimal beam pattern be generated upon the arrival of each new data of which the arrival angle keeps changing due tot he mobility of the signal source, (5)The total amount of computation is tremendously reduced compared to that of most conventional beam forming techniques such that the suboptimal beam pattern be produced at vevery snapshot on a real-time basis. The total computational load for generating a new set of weitht including the update of an N-by-N(N is the number of antenna elements) autocovariance matrix is $0(3N^2 + 12N)$. It can further be reduced down to O(11N) by approximating the matrix with the instantaneous signal vector.

  • PDF

Disease Recognition on Medical Images Using Neural Network (신경회로망에 의한 의료영상 질환인식)

  • Lee, Jun-Haeng;Lee, Heung-Man;Kim, Tae-Sik;Lee, Sang-Bock
    • Journal of the Korean Society of Radiology
    • /
    • v.3 no.1
    • /
    • pp.29-39
    • /
    • 2009
  • In this paper has proposed to the recognition of the disease on medical images using neural network. The neural network is constructed as three-layers of the input-layer, the hidden-layer and the output-layer. The training method applied for the recognition of disease region is adaptive error back-propagation. The low-frequency region analyzed by DWT are expressed by matrix. The coefficient-values of the characteristic polynomial applied are n+1. The normalized maximum value +1 and minimum value -1 in the range of tangent-sigmoid transfer function are applied to be use as the input vector of the neural network. To prove the validity of the proposed methods used in the experiment with a simulation experiment, the input medical image recognition rate the evaluation of areas of disease. As a result of the experiment, the characteristic polynomial coefficient of low-frequency area matrix, conversed to 4 level DWT, was proved to be optimum to be applied to the feature parameter. As for the number of training, it was marked fewest in 0.01 of learning coefficient and 0.95 of momentum, when the adaptive error back-propagation was learned by inputting standardized feature parameter into organized neural network. As to the training result when the learning coefficient was 0.01, and momentum was 0.95, it was 100% recognized in fifty-five times of the stomach image, fifty-five times of the chest image, forty-six times of the CT image, fifty-five times of ultrasonogram, and one hundred fifty-seven times of angiogram.

  • PDF

A Study on the Improvement of UAV based 3D Point Cloud Spatial Object Location Accuracy using Road Information (도로정보를 활용한 UAV 기반 3D 포인트 클라우드 공간객체의 위치정확도 향상 방안)

  • Lee, Jaehee;Kang, Jihun;Lee, Sewon
    • Korean Journal of Remote Sensing
    • /
    • v.35 no.5_1
    • /
    • pp.705-714
    • /
    • 2019
  • Precision positioning is necessary for various use of high-resolution UAV images. Basically, GCP is used for this purpose, but in case of emergency situations or difficulty in selecting GCPs, the data shall be obtained without GCPs. This study proposed a method of improving positional accuracy for x, y coordinate of UAV based 3 dimensional point cloud data generated without GCPs. Road vector file by the public data (Open Data Portal) was used as reference data for improving location accuracy. The geometric correction of the 2 dimensional ortho-mosaic image was first performed and the transform matrix produced in this process was adopted to apply to the 3 dimensional point cloud data. The straight distance difference of 34.54 m before the correction was reduced to 1.21 m after the correction. By confirming that it is possible to improve the location accuracy of UAV images acquired without GCPs, it is expected to expand the scope of use of 3 dimensional spatial objects generated from point cloud by enabling connection and compatibility with other spatial information data.

Gauss-Newton Based Estimation for Moving Emitter Location Using TDOA/FDOA Measurements and Its Analysis (TDOA/FDOA 정보를 이용한 Gauss-Newton 기법 기반의 이동 신호원 위치 및 속도 추정 방법과 성능 분석)

  • Kim, Yong-Hee;Kim, Dong-Gyu;Han, Jin-Woo;Song, Kyu-Ha;Kim, Hyoung-Nam
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.6
    • /
    • pp.62-71
    • /
    • 2013
  • The passive emitter location method using TDOA and FDOA measurements has higher accuracy comparing to the single TDOA or FDOA based method. Moreover, it is able to estimate the velocity vector of a moving platform. Recently, several non-iterative methods were suggested using the nuisance parameter but the common reference sensor is needed for each pair of sensors. They show also relatively low performance in the case of a long range between the sensor groups and the emitter. To solve this, we derive the estimation method of the position and velocity of a moving platform based on the Gauss-Newton method. In addition, to analyze the estimation performance of the position and velocity, respectively, we decompose the CRLB matrix into each subspace. Simulation results show the estimation performance of the derived method and the CEP planes according to the given geometry of the sensors.

Filter-Bank Based Regularized Common Spatial Pattern for Classification of Motor Imagery EEG (동작 상상 EEG 분류를 위한 필터 뱅크 기반 정규화 공통 공간 패턴)

  • Park, Sang-Hoon;Kim, Ha-Young;Lee, David;Lee, Sang-Goog
    • Journal of KIISE
    • /
    • v.44 no.6
    • /
    • pp.587-594
    • /
    • 2017
  • Recently, motor imagery electroencephalogram(EEG) based Brain-Computer Interface(BCI) systems have received a significant amount of attention in various fields, including medicine and engineering. The Common Spatial Pattern(CSP) algorithm is the most commonly-used method to extract the features from motor imagery EEG. However, the CSP algorithm has limited applicability in Small-Sample Setting(SSS) situations because these situations rely on a covariance matrix. In addition, large differences in performance depend on the frequency bands that are being used. To address these problems, 4-40Hz band EEG signals are divided using nine filter-banks and Regularized CSP(R-CSP) is applied to individual frequency bands. Then, the Mutual Information-Based Individual Feature(MIBIF) algorithm is applied to the features of R-CSP for selecting discriminative features. Thereafter, selected features are used as inputs of the classifier Least Square Support Vector Machine(LS-SVM). The proposed method yielded a classification accuracy of 87.5%, 100%, 63.78%, 82.14%, and 86.11% in five subjects("aa", "al", "av", "aw", and "ay", respectively) for BCI competition III dataset IVa by using 18 channels in the vicinity of the motor area of the cerebral cortex. The proposed method improved the mean classification accuracy by 16.21%, 10.77% and 3.32% compared to the CSP, R-CSP and FBCSP, respectively The proposed method shows a particularly excellent performance in the SSS situation.

A Study on Shape Optimization of Distributed Actuators using Time Domain Finite Element Method (시간유한요소법을 이용한 분포형 구동기의 형상최적화에 관한 연구)

  • Suk, Jin-Young;Kim, You-Dan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.33 no.9
    • /
    • pp.56-65
    • /
    • 2005
  • A dynamic analysis method that freezes a time domain by discretization and solves the spatial propagation equation has a unique feature that provides a degree of freedom on spatial domain compared with the space discretization or space-time discretization finite element method. Using this feature, the time finite element analysis can be effectively applied to optimize the spatial characteristics of distributed type actuators. In this research, the time domain finite element method was used to discretize the model. A state variable vector was used in the discretization to include arbitrary initial conditions. A performance index was proposed on spatial domain to consider both potential and vibrational energy, so that the resulting shape of the distributed actuator was optimized for dynamic control of the structure. It is assumed that the structure satisfies the final rest condition using the realizable control scheme although the initial disturbance can affect the system response. Both equations on states and costates were derived based on the selected performance index and structural model. Ricatti matrix differential equations on state and costate variables were derived by the reconfiguration of the sub-matrices and application of time/space boundary conditions, and finally optimal actuator distribution was obtained. Numerical simulation results validated the proposed actuator shape optimization scheme.

Extracting Typical Group Preferences through User-Item Optimization and User Profiles in Collaborative Filtering System (사용자-상품 행렬의 최적화와 협력적 사용자 프로파일을 이용한 그룹의 대표 선호도 추출)

  • Ko Su-Jeong
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.7
    • /
    • pp.581-591
    • /
    • 2005
  • Collaborative filtering systems have problems involving sparsity and the provision of recommendations by making correlations between only two users' preferences. These systems recommend items based only on the preferences without taking in to account the contents of the items. As a result, the accuracy of recommendations depends on the data from user-rated items. When users rate items, it can be expected that not all users ran do so earnestly. This brings down the accuracy of recommendations. This paper proposes a collaborative recommendation method for extracting typical group preferences using user-item matrix optimization and user profiles in collaborative tittering systems. The method excludes unproven users by using entropy based on data from user-rated items and groups users into clusters after generating user profiles, and then extracts typical group preferences. The proposed method generates collaborative user profiles by using association word mining to reflect contents as well as preferences of items and groups users into clusters based on the profiles by using the vector space model and the K-means algorithm. To compensate for the shortcoming of providing recommendations using correlations between only two user preferences, the proposed method extracts typical preferences of groups using the entropy theory The typical preferences are extracted by combining user entropies with item preferences. The recommender system using typical group preferences solves the problem caused by recommendations based on preferences rated incorrectly by users and reduces time for retrieving the most similar users in groups.

Comparative study of flood detection methodologies using Sentinel-1 satellite imagery (Sentinel-1 위성 영상을 활용한 침수 탐지 기법 방법론 비교 연구)

  • Lee, Sungwoo;Kim, Wanyub;Lee, Seulchan;Jeong, Hagyu;Park, Jongsoo;Choi, Minha
    • Journal of Korea Water Resources Association
    • /
    • v.57 no.3
    • /
    • pp.181-193
    • /
    • 2024
  • The increasing atmospheric imbalance caused by climate change leads to an elevation in precipitation, resulting in a heightened frequency of flooding. Consequently, there is a growing need for technology to detect and monitor these occurrences, especially as the frequency of flooding events rises. To minimize flood damage, continuous monitoring is essential, and flood areas can be detected by the Synthetic Aperture Radar (SAR) imagery, which is not affected by climate conditions. The observed data undergoes a preprocessing step, utilizing a median filter to reduce noise. Classification techniques were employed to classify water bodies and non-water bodies, with the aim of evaluating the effectiveness of each method in flood detection. In this study, the Otsu method and Support Vector Machine (SVM) technique were utilized for the classification of water bodies and non-water bodies. The overall performance of the models was assessed using a Confusion Matrix. The suitability of flood detection was evaluated by comparing the Otsu method, an optimal threshold-based classifier, with SVM, a machine learning technique that minimizes misclassifications through training. The Otsu method demonstrated suitability in delineating boundaries between water and non-water bodies but exhibited a higher rate of misclassifications due to the influence of mixed substances. Conversely, the use of SVM resulted in a lower false positive rate and proved less sensitive to mixed substances. Consequently, SVM exhibited higher accuracy under conditions excluding flooding. While the Otsu method showed slightly higher accuracy in flood conditions compared to SVM, the difference in accuracy was less than 5% (Otsu: 0.93, SVM: 0.90). However, in pre-flooding and post-flooding conditions, the accuracy difference was more than 15%, indicating that SVM is more suitable for water body and flood detection (Otsu: 0.77, SVM: 0.92). Based on the findings of this study, it is anticipated that more accurate detection of water bodies and floods could contribute to minimizing flood-related damages and losses.