• Title/Summary/Keyword: vector data

Search Result 3,288, Processing Time 0.028 seconds

Development of a Standard Vector Data Model for Interoperability of River-Geospatial Information (하천공간정보의 상호운용성을 위한 표준벡터데이터 모델 개발)

  • Shin, Hyung-Jin;Chae, Hyo-Sok;Lee, Eul-Rae
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.17 no.2
    • /
    • pp.44-58
    • /
    • 2014
  • In this study, a standard vector data model was developed for interoperability of river-geospatial information and for verification purpose the applicability of the standard vector model was evaluated using a model to RIMGIS vector data at Changnyeong-Hapcheon & Gangjung-Goryeong irrigation watershed. The standards from ISO and OGC were analyzed and the river geospatial data model standard was established by applying the standards. The ERD was designed based on the analysis information on data characteristics and relationship. The verification of RIMGIS vector data included points, lines and polygon to develope GDM was carried out by comparing with the data by layer. This conducting comparison of basic spatial data and attribute data to each record and spatial information vertex. The error in the process of conversion was 0 %, indicating no problem with model. Our Geospatial Data Model presented in this study provides a new and consistent format for the storage and retrieval of river geospatial data from connected database. It is designed to facilitators integrated analysis of large data sets collected by multiple institutes.

A Study on the Validation of Vector Data Model for River-Geospatial Information and Building Its Portal System (하천공간정보의 벡터데이터 모델 검증 및 포털 구축에 관한 연구)

  • Shin, Hyung-Jin;Chae, Hyo-Sok;Hwang, Eui-Ho
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.17 no.2
    • /
    • pp.95-106
    • /
    • 2014
  • In this study, the applicability of a standard vector model was evaluated using RIMGIS vector data and a portal based river-geospatial information web service system was developed using XML and JSON based data linkage between the server and the client. The RIMGIS vector data including points, lines, and polygons were converted to the Geospatial Data Model(GDM) developed in this study and were validated by layers. After the conversion, it was identified that the attribute data of a shape file remained without loss. The GeoServer GDB(GeoDataBase) that manages a DB in the portal was developed as a management module. The XML-based Geography Markup Language(GML) standards of OGC was used for accessing to and managing vector layers and encoding spatial data. The separation of data content and expression in the GML allowed the different expressions of the same data, convenient data revision and update, and enhancing the expandability. In the future, it is necessary to improve the access, exchange, and storage of river-geospatial information through the user's customized services and Internet accessibility.

Electricity Demand Forecasting based on Support Vector Regression (Support Vector Regression에 기반한 전력 수요 예측)

  • Lee, Hyoung-Ro;Shin, Hyun-Jung
    • IE interfaces
    • /
    • v.24 no.4
    • /
    • pp.351-361
    • /
    • 2011
  • Forecasting of electricity demand have difficulty in adapting to abrupt weather changes along with a radical shift in major regional and global climates. This has lead to increasing attention to research on the immediate and accurate forecasting model. Technically, this implies that a model requires only a few input variables all of which are easily obtainable, and its predictive performance is comparable with other competing models. To meet the ends, this paper presents an energy demand forecasting model that uses the variable selection or extraction methods of data mining to select only relevant input variables, and employs support vector regression method for accurate prediction. Also, it proposes a novel performance measure for time-series prediction, shift index, followed by description on preprocessing procedure. A comparative evaluation of the proposed method with other representative data mining models such as an auto-regression model, an artificial neural network model, an ordinary support vector regression model was carried out for obtaining the forecast of monthly electricity demand from 2000 to 2008 based on data provided by Korea Energy Economics Institute. Among the models tested, the proposed method was shown promising results than others.

The sparse vector autoregressive model for PM10 in Korea (희박 벡터자기상관회귀 모형을 이용한 한국의 미세먼지 분석)

  • Lee, Wonseok;Baek, Changryong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.4
    • /
    • pp.807-817
    • /
    • 2014
  • This paper considers multivariate time series modelling of PM10 data in Korea collected from 2008 to 2011. We consider both temporal and spatial dependencies of PM10 by applying the sparse vector autoregressive (sVAR) modelling proposed by Davis et al. (2013). It utilizes the partial spectral coherence to measure cross correlation between different regions, in turn provides the sparsity in the model while balancing the parsimony of model and the goodness of fit. It is also shown that sVAR performs better than usual vector autoregressive model (VAR) in forecasting.

Limits on the efficiency of event-based algorithms for Monte Carlo neutron transport

  • Romano, Paul K.;Siegel, Andrew R.
    • Nuclear Engineering and Technology
    • /
    • v.49 no.6
    • /
    • pp.1165-1171
    • /
    • 2017
  • The traditional form of parallelism in Monte Carlo particle transport simulations, wherein each individual particle history is considered a unit of work, does not lend itself well to data-level parallelism. Event-based algorithms, which were originally used for simulations on vector processors, may offer a path toward better utilizing data-level parallelism in modern computer architectures. In this study, a simple model is developed for estimating the efficiency of the event-based particle transport algorithm under two sets of assumptions. Data collected from simulations of four reactor problems using OpenMC was then used in conjunction with the models to calculate the speedup due to vectorization as a function of the size of the particle bank and the vector width. When each event type is assumed to have constant execution time, the achievable speedup is directly related to the particle bank size. We observed that the bank size generally needs to be at least 20 times greater than vector size to achieve vector efficiency greater than 90%. When the execution times for events are allowed to vary, the vector speedup is also limited by differences in the execution time for events being carried out in a single event-iteration.

Visualization of Vector Fields from Density Data Using Moving Least Squares Based on Monte Carlo Method (몬테카를로 방법 기반의 이동최소제곱을 이용한 밀도 데이터의 벡터장 시각화)

  • Jong-Hyun Kim
    • Journal of the Korea Computer Graphics Society
    • /
    • v.30 no.2
    • /
    • pp.1-9
    • /
    • 2024
  • In this paper, we propose a new method to visualize different vector field patterns from density data. We use moving least squares (MLS), which is used in physics-based simulations and geometric processing. However, typical MLS does not take into account the nature of density, as it is interpolated to a higher order through vector-based constraints. In this paper, we design an algorithm that incorporates Monte Carlo-based weights into the MLS to efficiently account for the density characteristics implicit in the input data, allowing the algorithm to represent different forms of white noise. As a result, we experimentally demonstrate detailed vector fields that are difficult to represent using existing techniques such as naive MLS and divergence-constrained MLS.

Variance function estimation with LS-SVM for replicated data

  • Shim, Joo-Yong;Park, Hye-Jung;Seok, Kyung-Ha
    • Journal of the Korean Data and Information Science Society
    • /
    • v.20 no.5
    • /
    • pp.925-931
    • /
    • 2009
  • In this paper we propose a variance function estimation method for replicated data based on averages of squared residuals obtained from estimated mean function by the least squares support vector machine. Newton-Raphson method is used to obtain associated parameter vector for the variance function estimation. Furthermore, the cross validation functions are introduced to select the hyper-parameters which affect the performance of the proposed estimation method. Experimental results are then presented which illustrate the performance of the proposed procedure.

  • PDF

Rubber O-ring defect detection system using K-fold cross validation and support vector machine (K-겹 교차 검증과 서포트 벡터 머신을 이용한 고무 오링결함 검출 시스템)

  • Lee, Yong Eun;Choi, Nak Joon;Byun, Young Hoo;Kim, Dae Won;Kim, Kyung Chun
    • Journal of the Korean Society of Visualization
    • /
    • v.19 no.1
    • /
    • pp.68-73
    • /
    • 2021
  • In this study, the detection of rubber o-ring defects was carried out using k-fold cross validation and Support Vector Machine (SVM) algorithm. The data process was carried out in 3 steps. First, we proceeded with a frame alignment to eliminate unnecessary regions in the learning and secondly, we applied gray-scale changes for computational reduction. Finally, data processing was carried out using image augmentation to prevent data overfitting. After processing data, SVM algorithm was used to obtain normal and defect detection accuracy. In addition, we applied the SVM algorithm through the k-fold cross validation method to compare the classification accuracy. As a result, we obtain results that show better performance by applying the k-fold cross validation method.

Import Vector Voting Model for Multi-pattern Classification (다중 패턴 분류를 위한 Import Vector Voting 모델)

  • Choi, Jun-Hyeog;Kim, Dae-Su;Rim, Kee-Wook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.6
    • /
    • pp.655-660
    • /
    • 2003
  • In general, Support Vector Machine has a good performance in binary classification, but it has the limitation on multi-pattern classification. So, we proposed an Import Vector Voting model for two or more labels classification. This model applied kernel bagging strategy to Import Vector Machine by Zhu. The proposed model used a voting strategy which averaged optimal kernel function from many kernel functions. In experiments, not only binary but multi-pattern classification problems, our proposed Import Vector Voting model showed good performance for given machine learning data.

On Approximate Prediction Intervals for Support Vector Machine Regression

  • Seok, Kyung-Ha;Hwang, Chang-Ha;Cho, Dae-Hyeon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.13 no.2
    • /
    • pp.65-75
    • /
    • 2002
  • The support vector machine (SVM), first developed by Vapnik and his group at AT &T Bell Laboratories, is being used as a new technique for regression and classification problems. In this paper we present an approach to estimating approximate prediction intervals for SVM regression based on posterior predictive densities. Furthermore, the method is illustrated with a data example.

  • PDF