• Title/Summary/Keyword: Implicit data

Search Result 362, Processing Time 0.029 seconds

Generating a Rectangular Net from Unorganized Point Cloud Data Using an Implicit Surface Scheme (음 함수 곡면기법을 이용한 임의의 점 군 데이터로부터의 사각망 생성)

  • Yoo, D.J.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.4
    • /
    • pp.274-282
    • /
    • 2007
  • In this paper, a method of constructing a rectangular net from unorganized point cloud data is presented. In the method an implicit surface that fits the given point data is generated by using principal component analysis(PCA) and adaptive domain decomposition method(ADDM). Then a complete and quality rectangular net can be obtained by extracting voxel data from the implicit surface and projecting exterior faces of extracted voxels onto the implicit surface. The main advantage of the proposed method is that a quality rectangular net can be extracted from randomly scattered 3D points only without any further information. Furthermore the results of this works can be used to obtain many useful information including a slicing data, a solid STL model and a NURBS surface model in many areas involved in treatment of large amount of point data by proper processing of implicit surface and rectangular net generated previously.

Improving the Subject Independent Classification of Implicit Intention By Generating Additional Training Data with PCA and ICA

  • Oh, Sang-Hoon
    • International Journal of Contents
    • /
    • v.14 no.4
    • /
    • pp.24-29
    • /
    • 2018
  • EEG-based brain-computer interfaces has focused on explicitly expressed intentions to assist physically impaired patients. For EEG-based-computer interfaces to function effectively, it should be able to understand users' implicit information. Since it is hard to gather EEG signals of human brains, we do not have enough training data which are essential for proper classification performance of implicit intention. In this paper, we improve the subject independent classification of implicit intention through the generation of additional training data. In the first stage, we perform the PCA (principal component analysis) of training data in a bid to remove redundant components in the components within the input data. After the dimension reduction by PCA, we train ICA (independent component analysis) network whose outputs are statistically independent. We can get additional training data by adding Gaussian noises to ICA outputs and projecting them to input data domain. Through simulations with EEG data provided by CNSL, KAIST, we improve the classification performance from 65.05% to 66.69% with Gamma components. The proposed sample generation method can be applied to any machine learning problem with fewer samples.

Automatic Generation of the Input Data for Rapid Prototyping from Unorganized Point Cloud Data (임의의 점 군 데이터로부터 쾌속조형을 위한 입력데이터의 자동생성)

  • Yoo, Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.24 no.11
    • /
    • pp.144-153
    • /
    • 2007
  • In order to generate the input data for rapid prototyping, a new approach which is based on the implicit surface interpolation method is presented. In the method a surface is reconstructed by creating smooth implicit surface from unorganized cloud of points through which the surface should pass. In the method an implicit surface is defined by the adaptive local shape functions including quadratic polynomial function, cubic polynomial function and RBF(Radial Basis Function). By the reconstruction of a surface, various types of error in raw STL file including degenerated triangles, undesirable holes with complex shapes and overlaps between triangles can be eliminated automatically. In order to get the slicing data for rapid prototyping an efficient intersection algorithm between implicit surface and plane is developed. For the direct usage for rapid prototyping, a robust transformation algorithm for the generation of complete STL data of solid type is also suggested.

Automatic NURBS Surface Generation from Unorganized Point Cloud Data (임의의 점 군 데이터로부터 NURBS 곡면의 자동생성)

  • Yoo, Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.23 no.9 s.186
    • /
    • pp.200-207
    • /
    • 2006
  • In this paper a new approach which combines implicit surface scheme and NURBS surface interpolation method is proposed in order to generate a complete surface model from unorganized point cloud data. In the method a base surface was generated by creating smooth implicit surface from the input point cloud data through which the actual surface would pass. The implicit surface was defined by a combination of shape functions including quadratic polynomial function, cubic polynomial functions and radial basis function using adaptive domain decomposition method. In this paper voxel data which can be extracted easily from the base implicit surface were used in order to generate rectangular net with good quality using the normal projection and smoothing scheme. After generating the interior points and tangential vectors in each rectangular region considering the required accuracy, the NURBS surface were constructed by interpolating the rectangular array of points using boundary tangential vectors which assure C$^1$ continuity between rectangular patches. The validity and effectiveness of this new approach was demonstrated by performing numerical experiments for the various types of point cloud data.

Formulation of the Neural Network for Implicit Constitutive Model (I) : Application to Implicit Vioscoplastic Model

  • Lee, Joon-Seong;Lee, Ho-Jeong;Furukawa, Tomonari
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.9 no.3
    • /
    • pp.191-197
    • /
    • 2009
  • Up to now, a number of models have been proposed and discussed to describe a wide range of inelastic behaviors of materials. The fatal problem of using such models is however the existence of model errors, and the problem remains inevitably as far as a material model is written explicitly. In this paper, the authors define the implicit constitutive model and propose an implicit viscoplastic constitutive model using neural networks. In their modeling, inelastic material behaviors are generalized in a state space representation and the state space form is constructed by a neural network using input-output data sets. A technique to extract the input-output data from experimental data is also described. The proposed model was first generated from pseudo-experimental data created by one of the widely used constitutive models and was found to replace the model well. Then, having been tested with the actual experimental data, the proposed model resulted in a negligible amount of model errors indicating its superiority to all the existing explicit models in accuracy.

Development of a Concurrency Control Technique for Multiple Inheritance in Object-Oriented Databases (객체지향 데이터베이스의 다중계승을 위한 동시성 제어 기법 개발)

  • Jun, Woochun;Hong, Suk-Ki
    • Journal of Internet Computing and Services
    • /
    • v.15 no.1
    • /
    • pp.63-71
    • /
    • 2014
  • Currently many non-traditional application areas such as artificial intelligence and web databases require advanced modeling power than the existing relational data model. In those application areas, object-oriented database (OODB) is better data model since an OODB can providemodeling power as grouping similar objects into class, and organizing all classes into a hierarchy where a subclass inherits all definitions from its superclasses. The purpose of this paper is to develop an OODB concurrency control scheme dealing with multiple inheritance. The proposed scheme, called Multiple Inheritance Implicit Locking (MIIL), is based on so-called implicit locking. In the proposed scheme, we eliminate redundant locks that are necessary in the existing implicit locking scheme. Intention locks are required as the existing implicit locking scheme. In this paper, it is shown that MIIL has less locking overhead than implicit locking does. We use only OODB inheritance hierarchies, single inheritance and multiple inheritance so that no additional overhead is necessary for reducing locking overhead.

Developing a Graph Convolutional Network-based Recommender System Using Explicit and Implicit Feedback (명시적 및 암시적 피드백을 활용한 그래프 컨볼루션 네트워크 기반 추천 시스템 개발)

  • Xinzhe Li;Dongeon Kim;Qinglong Li;Jaekyeong Kim
    • Journal of Information Technology Services
    • /
    • v.22 no.1
    • /
    • pp.43-56
    • /
    • 2023
  • With the development of the e-commerce market, various types of products continue to be released. However, customers face an information overload problem in purchasing decision-making. Therefore, personalized recommendations have become an essential service in providing personalized products to customers. Recently, many studies on GCN-based recommender systems have been actively conducted. Such a methodology can address the limitation in disabling to effectively reflect the interaction between customer and product in the embedding process. However, previous studies mainly use implicit feedback data to conduct experiments. Although implicit feedback data improves the data scarcity problem, it cannot represent customers' preferences for specific products. Therefore, this study proposed a novel model combining explicit and implicit feedback to address such a limitation. This study treats the average ratings of customers and products as the features of customers and products and converts them into a high-dimensional feature vector. Then, this study combines ID embedding vectors and feature vectors in the embedding layer to learn the customer-product interaction effectively. To evaluate recommendation performance, this study used the MovieLens dataset to conduct various experiments. Experimental results showed the proposed model outperforms the state-of-the-art. Therefore, the proposed model in this study can provide an enhanced recommendation service for customers to address the information overload problem.

The Study of Implicit Self-Esteem and Depression and Fashion Competency (암묵적 자존감 및 우울감과 패션능숙성에 관한 연구)

  • Lee, Sae Eun;Son, Hyungjin;Lee, Yuri;Ha, Jisoo
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.41 no.4
    • /
    • pp.575-584
    • /
    • 2017
  • Previous research has investigated the influence of explicit self-esteem and depression. These studies did not examine the implicit self-esteem and depression that exist in the internal unconscious of humans that are not influenced by prejudice and social desirability. This study identifies that fashion competency (FC) encourages the implicit self-esteem and relieves the implicit depression. Implicit self-esteem and depression were measured by Implicit Association Test (IAT) utilizing reaction; FC was surveyed based on questionnaires. The data collected were analyzed using factor analysis. FC was then composed of three factors of fashion involvement, fashion innovativeness and self-confidence in fashion coordination. The results of comparing the index values that indicate IA SE (implicit association self-esteem) and IA DE (implicit association depression) of each FC group indicated that a higher FC results in a higher IA SE and lower IA DE; therefore, individuals with a higher fashion competence have a higher implicit self-esteem and a sense of well-being. The findings support previous studies in that the FC tends to be positively related to quality of life in young people.

Partitioned coupling strategies for fluid-structure interaction with large displacement: Explicit, implicit and semi-implicit schemes

  • He, Tao
    • Wind and Structures
    • /
    • v.20 no.3
    • /
    • pp.423-448
    • /
    • 2015
  • In this paper the unsteady fluid-structure interaction (FSI) problems with large structural displacement are solved by partitioned solution approaches in the arbitrary Lagrangian-Eulerian finite element framework. The incompressible Navier-Stokes equations are solved by the characteristic-based split (CBS) scheme. Both a rigid body and a geometrically nonlinear solid are considered as the structural models. The latter is solved by Newton-Raphson procedure. The equation governing the structural motion is advanced by Newmark-${\beta}$ method in time. The dynamic mesh is updated by using moving submesh approach that cooperates with the ortho-semi-torsional spring analogy method. A mass source term (MST) is introduced into the CBS scheme to satisfy geometric conservation law. Three partitioned coupling strategies are developed to take FSI into account, involving the explicit, implicit and semi-implicit schemes. The semi-implicit scheme is a mixture of the explicit and implicit coupling schemes due to the fluid projection splitting. In this scheme MST is renewed for interfacial elements. Fixed-point algorithm with Aitken's ${\Delta}^2$ method is carried out to couple different solvers within the implicit and semi-implicit schemes. Flow-induced vibrations of a bridge deck and a flexible cantilever behind an obstacle are analyzed to test the performance of the proposed methods. The overall numerical results agree well with the existing data, demonstrating the validity and applicability of the present approaches.

Modified Bayesian personalized ranking for non-binary implicit feedback (비이진 내재적 피드백 자료를 위한 변형된 베이지안 개인화 순위 방법)

  • Kim, Dongwoo;Lee, Eun Ryung
    • The Korean Journal of Applied Statistics
    • /
    • v.30 no.6
    • /
    • pp.1015-1025
    • /
    • 2017
  • Bayesian personalized ranking (BPR) is a state-of-the-art recommendation system techniques for implicit feedback data. Unfortunately, there might be a loss of information because the BPR model considers only the binary transformation of implicit feedback that is non-binary data in most cases. We propose a modified BPR method using a level of confidence based on the size or strength of implicit feedback to overcome this limitation. The proposed method is useful because it still has a structure of interpretable models for underlying personalized ranking i.e., personal pairwise preferences as in the BPR and that it is capable to reflect a numerical size or the strength of implicit feedback. We propose a computation algorithm based on stochastic gradient descent for the numerical implementation of our proposal. Furthermore, we also show the usefulness of our proposed method compared to ordinary BPR via an analysis of steam video games data.