• Title/Summary/Keyword: Matrix Classes

Search Result 148, Processing Time 0.025 seconds

Classification of Forest Type Using High Resolution Imagery of Satellite IKONOS (고해상도 IKONOS 위성영상을 이용한 임상분류)

  • 정기현;이우균;이준학;김권혁;이승호
    • Korean Journal of Remote Sensing
    • /
    • v.17 no.3
    • /
    • pp.275-284
    • /
    • 2001
  • This study was carried out to evaluate high resolution satellite imagery of IKONOS for classifying the land cover, especially forest type. The IKONOS imagery of 11km$\times$11km size was taken on April 24, 2000 in Bong-pyoung Myun Pyungchang-Gun, Kangwon Province. Land cover classes were water, coniferous evergreen, Larix leptolepis, broad-leaved tree, bare land, farm land, grassland, sandy soil and asphalted area. Supervised classification method with algorithm of maximum likelihood was applied for classification. The terrestrial survey was also carried out to collect the reference data in this area. The accuracy of the classification was analyzed with the items of overall accuracy, producer's accuracy, user's accuracy and k for test area through the error matrix. In the accuracy analysis of the test area, overall accuracy was 94.3%, producer's accuracy was 77.0-99.9%, user's accuracy was 71.9-100% and k and 0.93. Classes of bare land, sandy soil and farm land were less clear than other classes, whereas classification result of IKONOS in forest area showed higher performance than that of other resolution(5-30m) satellite data.

Robust Control of Linear Systems Under Structured Nonlinear Time-Varying Perturbations II : Synthesis via Convex Optimazation

  • Bambang, Riyanto-T.;Shimemura, Etsujiro
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10b
    • /
    • pp.100-104
    • /
    • 1993
  • In Part 1, we derived robust stability conditions for an LTI interconnected to time-varying nonlinear perturbations belonging to several classes of nonlinearities. These conditions were presented in terms of positive definite solutions to LMI. In this paper we address a problem of synthesizing feedback controllers for linear time-invariant systems under structured time-varying uncertainties, combined with a worst-case H$_{2}$ performance. This problem is introduced in [7, 8, 15, 35] in case of time-invariant uncertainties, where the necessary conditions involve highly coupled linear and nonlinear matrix equations. Such coupled equations are in general difficult to solve. A convex optimization approach will be employed in this synthesis problem in order to avoid solving highly coupled nonlinear matrix equations that commonly arises in multiobjective synthesis problem. Using LMI formulation, this convex optimization problem can in turn be cast as generalized eigenvalue minimization problem, where an attractive algorithm based on the method of centers has been recently introduced to find its solution [30, 361. In the present paper we will restrict our discussion to state feedback case with Popov multipliers. A more general case of output feedback and other types of multipliers will be addressed in a future paper.

  • PDF

Relevance-Weighted $(2D)^2$LDA Image Projection Technique for Face Recognition

  • Sanayha, Waiyawut;Rangsanseri, Yuttapong
    • ETRI Journal
    • /
    • v.31 no.4
    • /
    • pp.438-447
    • /
    • 2009
  • In this paper, a novel image projection technique for face recognition application is proposed which is based on linear discriminant analysis (LDA) combined with the relevance-weighted (RW) method. The projection is performed through 2-directional and 2-dimensional LDA, or $(2D)^2$LDA, which simultaneously works in row and column directions to solve the small sample size problem. Moreover, a weighted discriminant hyperplane is used in the between-class scatter matrix, and an RW method is used in the within-class scatter matrix to weigh the information to resolve confusable data in these classes. This technique is called the relevance-weighted $(2D)^2$LDA, or RW$(2D)^2$LDA, which is used for a more accurate discriminant decision than that produced by the conventional LDA or 2DLDA. The proposed technique has been successfully tested on four face databases. Experimental results indicate that the proposed RW$(2D)^2$LDA algorithm is more computationally efficient than the conventional algorithms because it has fewer features and faster times. It can also improve performance and has a maximum recognition rate of over 97%.

Basic Research on the Quantitative Estimation of Yellow Sand (黃砂의 量的推定을 위한 基礎硏究)

  • 김동술
    • Journal of Korean Society for Atmospheric Environment
    • /
    • v.6 no.1
    • /
    • pp.11-21
    • /
    • 1990
  • To quantitatively estimate the effect of yellow sand(loess) fromt he Northern China, various soil sources having similar chemical compositions to yellow sands should be separated and identified. After that, mass contribution for yellow sand can be calculated. The study showed that it was impossible to solve this problem by the traditional bulk analyses. However, particle-by-particle analysis by a CCSEM (computer controlled scanning electron microscope) gave enormous potentials to solve it. To perform this study, seven soil source data analyzed by CCSEM were obtained from Texas, U.S.A. Initially, each soil date was classified into two groups, coarse and fine particle groups since the particle number distribution showed a minimum occurring at 5.2$\mu$m of aerodynamic diameter. Particles in each group were then classified into one of the 283 homogeneous particle classes by the universal classification rule which had been built by an expert system in the early study. Further, mass fractions and their uncertainties for each class in each source were calculated by the Jackknife method, and then source profile matrix for the 7 soil sources was created. To use the profile matrix in the study of source contribution, it is necessary to test the degree of collinearity among sources. The profiles were tested by the singular value decomposition method. As a result, each soil source characterized by artificially created variables was totally independent each other and is ready to use in source contribution studies as a receptor model.

  • PDF

Strength reduction factor spectra based on adaptive damping of SDOF systems

  • Feng Wang;Kexin Yao;Wanzhe Zhang
    • Structural Monitoring and Maintenance
    • /
    • v.11 no.3
    • /
    • pp.219-234
    • /
    • 2024
  • The strength reduction factor spectrum is traditionally obtained from a single-degree-of-freedom (SDOF) system with a constant damping coefficient. However, according to the principle of Rayleigh damping, the damping coefficient matrix of a system changes with the stiffness matrix, and the damping coefficient of an equivalent SDOF system changes with the tangent stiffness coefficient. In view of that, this study proposes an equivalent SDOF system with an adaptive damping coefficient and derives a standardized reaction balance equation. By iteratively adjusting the strength reduction factor, the corresponding spectrum with an equivalent ductility factor is obtained. In addition, the ratio between the strength reduction factor that considers adaptive damping and the traditional strength reduction factor, denoted by η, is determined, and the η-μ-T relationship is obtained. Seismic records of Classes C, D, and E sites are selected as excitations. Moreover, a nonlinear response time-history analysis is performed to establish the relationship between the η and T values for the equivalent ductility factor μ. Further, by exploring the effects of the site class, ductility factor, second-order stiffness coefficient, and period T on the mean value of η, a simplified calculation equation of mean η is derived, and η is used as a modified value for the traditional strength reduction factor R spectrum.

Conditional Generative Adversarial Network based Collaborative Filtering Recommendation System (Conditional Generative Adversarial Network(CGAN) 기반 협업 필터링 추천 시스템)

  • Kang, Soyi;Shin, Kyung-shik
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.3
    • /
    • pp.157-173
    • /
    • 2021
  • With the development of information technology, the amount of available information increases daily. However, having access to so much information makes it difficult for users to easily find the information they seek. Users want a visualized system that reduces information retrieval and learning time, saving them from personally reading and judging all available information. As a result, recommendation systems are an increasingly important technologies that are essential to the business. Collaborative filtering is used in various fields with excellent performance because recommendations are made based on similar user interests and preferences. However, limitations do exist. Sparsity occurs when user-item preference information is insufficient, and is the main limitation of collaborative filtering. The evaluation value of the user item matrix may be distorted by the data depending on the popularity of the product, or there may be new users who have not yet evaluated the value. The lack of historical data to identify consumer preferences is referred to as data sparsity, and various methods have been studied to address these problems. However, most attempts to solve the sparsity problem are not optimal because they can only be applied when additional data such as users' personal information, social networks, or characteristics of items are included. Another problem is that real-world score data are mostly biased to high scores, resulting in severe imbalances. One cause of this imbalance distribution is the purchasing bias, in which only users with high product ratings purchase products, so those with low ratings are less likely to purchase products and thus do not leave negative product reviews. Due to these characteristics, unlike most users' actual preferences, reviews by users who purchase products are more likely to be positive. Therefore, the actual rating data is over-learned in many classes with high incidence due to its biased characteristics, distorting the market. Applying collaborative filtering to these imbalanced data leads to poor recommendation performance due to excessive learning of biased classes. Traditional oversampling techniques to address this problem are likely to cause overfitting because they repeat the same data, which acts as noise in learning, reducing recommendation performance. In addition, pre-processing methods for most existing data imbalance problems are designed and used for binary classes. Binary class imbalance techniques are difficult to apply to multi-class problems because they cannot model multi-class problems, such as objects at cross-class boundaries or objects overlapping multiple classes. To solve this problem, research has been conducted to convert and apply multi-class problems to binary class problems. However, simplification of multi-class problems can cause potential classification errors when combined with the results of classifiers learned from other sub-problems, resulting in loss of important information about relationships beyond the selected items. Therefore, it is necessary to develop more effective methods to address multi-class imbalance problems. We propose a collaborative filtering model using CGAN to generate realistic virtual data to populate the empty user-item matrix. Conditional vector y identify distributions for minority classes and generate data reflecting their characteristics. Collaborative filtering then maximizes the performance of the recommendation system via hyperparameter tuning. This process should improve the accuracy of the model by addressing the sparsity problem of collaborative filtering implementations while mitigating data imbalances arising from real data. Our model has superior recommendation performance over existing oversampling techniques and existing real-world data with data sparsity. SMOTE, Borderline SMOTE, SVM-SMOTE, ADASYN, and GAN were used as comparative models and we demonstrate the highest prediction accuracy on the RMSE and MAE evaluation scales. Through this study, oversampling based on deep learning will be able to further refine the performance of recommendation systems using actual data and be used to build business recommendation systems.

Analysis of Land Cover Characteristics with Object-Based Classification Method - Focusing on the DMZ in Inje-gun, Gangwon-do - (객체기반 분류기법을 이용한 토지피복 특성분석 - 강원도 인제군의 DMZ지역 일원을 대상으로 -)

  • Na, Hyun-Sup;Lee, Jung-Soo
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.17 no.2
    • /
    • pp.121-135
    • /
    • 2014
  • Object-based classification methods provide a valid alternative to traditional pixel-based methods. This study reports the results of an object-based classification to examine land cover in the demilitarized zones(DMZs) of Inje-gun. We used land cover classes(7 classes for main category and 13 classes for sub-category) selected from the criteria by Korea Ministry of Environment. The average and standard deviation of the spectrum values, and homogeneity of GLCM were chosen to map land cover types in an hierarchical approach using the nearest neighborhood method. We then identified the distributional characteristics of land cover by considering 3 topographic characteristics (altitude, slope gradient, distance from the Southern Limited Line(SLL)) within the DMZs. The results showed that scale 72, shape 0.2, color 0.8, compactness 0.5 and smoothness 0.5 were the optimum weight values while scale, shape and color were most influenced parameters in image segmentation. The forests (92%) were main land cover type in the DMZs; the grassland(5%), the urban area (2%) and the forests (broadleaf forest: 44%, mixed forest: 42%, coniferous forest: 6%) also occupied mostly in land cover classes for sub-category. The results also showed that facilities and roads had higher density within 2 km from the SLL, while paddy, field and bare land were distributed largely outside 6 km from the SLL. In addition, there was apparent distinction in land cover by topographic characteristics. The forest had higher density at above altitude 600m and above slope gradient $30^{\circ}$ while agriculture, bare land and grass land were distributed mainly at below altitude 600m and below slope gradient $30^{\circ}$.

On Optimizing LDA-extentions Using a Pre-Clustering (사전 클러스터링을 이용한 LDA-확장법들의 최적화)

  • Kim, Sang-Woon;Koo, Byum-Yong;Choi, Woo-Young
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.3
    • /
    • pp.98-107
    • /
    • 2007
  • For high-dimensional pattern recognition, such as face classification, the small number of training samples leads to the Small Sample Size problem when the number of pattern samples is smaller than the number of dimensionality. Recently, various LDA-extensions have been developed, including LDA, PCA+LDA, and Direct-LDA, to address the problem. This paper proposes a method of improving the classification efficiency by increasing the number of (sub)-classes through pre-clustering a training set prior to the execution of Direct-LDA. In LDA (or Direct-LDA), since the number of classes of the training set puts a limit to the dimensionality to be reduced, it is increased to the number of sub-classes that is obtained through clustering so that the classification performance of LDA-extensions can be improved. In other words, the eigen space of the training set consists of the range space and the null space, and the dimensionality of the range space increases as the number of classes increases. Therefore, when constructing the transformation matrix, through minimizing the null space, the loss of discriminatve information resulted from this space can be minimized. Experimental results for the artificial data of X-OR samples as well as the bench mark face databases of AT&T and Yale demonstrate that the classification efficiency of the proposed method could be improved.

Land Cover Classification with High Spatial Resolution Using Orthoimage and DSM Based on Fixed-Wing UAV

  • Kim, Gu Hyeok;Choi, Jae Wan
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.35 no.1
    • /
    • pp.1-10
    • /
    • 2017
  • An UAV (Unmanned Aerial Vehicle) is a flight system that is designed to conduct missions without a pilot. Compared to traditional airborne-based photogrammetry, UAV-based photogrammetry is inexpensive and can obtain high-spatial resolution data quickly. In this study, we aimed to classify the land cover using high-spatial resolution images obtained using a UAV. An RGB camera was used to obtain high-spatial resolution orthoimage. For accurate classification, multispectral image about same areas were obtained using a multispectral sensor. A DSM (Digital Surface Model) and a modified NDVI (Normalized Difference Vegetation Index) were generated using images obtained using the RGB camera and multispectral sensor. Pixel-based classification was performed for twelve classes by using the RF (Random Forest) method. The classification accuracy was evaluated based on the error matrix, and it was confirmed that the proposed method effectively classified the area compared to supervised classification using only the RGB image.

Restructuring of Object-Oriented Designs using Cohesion and Coupling of Class (클래스의 응집도와 결합도를 이용한 객체 지향 설계 재구조화)

  • 이종석;천은홍
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.7 no.5
    • /
    • pp.83-90
    • /
    • 2002
  • Recent commercial systems are too large and too complex to restructure their design by hand without tools and cost too much time and effort. This thesis presents a restructuring approach using cohesion and coupling of classes to change object-oriented designs automatically. The matrix which represents the relation between methods is defined by distance between methods using cohesion and coupling, Class restructuring starts to isolate to dividing class, selects the class to have the lowest cohesion and combines the selected class with the closest class.

  • PDF