• Title/Summary/Keyword: implicit representation

Search Result 57, Processing Time 0.028 seconds

The Implicit Representation of the May 18 Gwangju Democratic Movement (광주·전남 출신 대학생이 5·18민주화운동에 대해 지니는 암묵적 표상)

  • Jaechang Bae
    • Korean Journal of Culture and Social Issue
    • /
    • v.23 no.4
    • /
    • pp.497-525
    • /
    • 2017
  • This study verified whether university students of Gwangju and Jeollanam-do recall negative information like violence and death faster than positive information like democratic community about the May 18 Gwangju democratic movement in implicit dimension. University students of Gwangju responded faster when the May 18 combined with the pictures of negative content. However, university students of Jeollanam-do responded marginally faster when the May 18 combined with the pictures of positive content. In addition, the students performed implicit evaluation test towards the May 18. The students of Gwangju showed a slightly negative attitude towards the May 18, while the students of Jeollanam-do showed a positive attitude towards the May 18. This study acquires significance because it confirmed that university students of Gwangju have an implicit representation similar to trauma and a terrible feeling about the May 18.

Implicit Surface Representation of Three-Dimensional Face from Kinect Sensor

  • Wibowo, Suryo Adhi;Kim, Eun-Kyeong;Kim, Sungshin
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.4
    • /
    • pp.412-417
    • /
    • 2015
  • Kinect sensor has two output data which are produced from red green blue (RGB) sensor and depth sensor, it is called color image and depth map, respectively. Although this device's prices are cheapest than the other devices for three-dimensional (3D) reconstruction, we need extra work for reconstruct a smooth 3D data and also have semantic meaning. It happened because the depth map, which has been produced from depth sensor usually have a coarse and empty value. Consequently, it can be make artifact and holes on the surface, when we reconstruct it to 3D directly. In this paper, we present a method for solving this problem by using implicit surface representation. The key idea for represent implicit surface is by using radial basis function (RBF) and to avoid the trivial solution that the implicit function is zero everywhere, we need to defined on-surface point and off-surface point. Based on our simulation results using captured face as an input, we can produce smooth 3D face and fill the holes on the 3D face surface, since RBF is good for interpolation and holes filling. Modified anisotropic diffusion is used to produced smoothed surface.

8-heap* : A fast 8-ary implicit Priority queue (8-힢*: 빠른 8-원 묵시 우선순위 큐)

  • Jung, Hae-jae
    • The KIPS Transactions:PartA
    • /
    • v.11A no.3
    • /
    • pp.213-216
    • /
    • 2004
  • Proirity queues(PQ) can be used in applications such as scheduling or sorting. The data structures for PQ can be constructed with or without pointers. The implicit representation without pointers uses less memory space than pointer-based representation. It if shown that a 2-heap, a traditional Implicit PQ based on a binary tree, is slower than an f-heap based on a 8-ary tree. This is because 8-heap utilizes cache memory more efficiently This paper presents a novel fast implicit heap called 8-heap* which is easier to implement. Experimental results show that the 8-heap* is faster than 8-heap as well as 2-heap.

4-Deap✽ : A Fast 4-ary Deap using Cache (4-딥✽ : 캐쉬를 이용한 빠른 4-원 딥)

  • Jung Haejae
    • The KIPS Transactions:PartA
    • /
    • v.11A no.7 s.91
    • /
    • pp.577-582
    • /
    • 2004
  • Double-ended Proirity queues(DEPQ) can be used in applications such as scheduling or sorting. The data structures for DEPQ can be con-structed with or without pointers. The implicit representation without pointers uses less memory space than pointer-based representation. This paper presents a novel fast implicit heap called 4-deapr$\ast$ which utilizes cache memory efficiently. Experimental results show that the 4-deap$\ast$ is faster than symmetric min-max heap as well as deap.

Multiscale Implicit Functions for Unified Data Representation

  • Yun, Seong-Min;Park, Sang-Hun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.12
    • /
    • pp.2374-2391
    • /
    • 2011
  • A variety of reconstruction methods has been developed to convert a set of scattered points generated from real models into explicit forms, such as polygonal meshes, parametric or implicit surfaces. In this paper, we present a method to construct multi-scale implicit surfaces from scattered points using multiscale kernels based on kernel and multi-resolution analysis theories. Our approach differs from other methods in that multi-scale reconstruction can be done without additional manipulation on input data, calculated functions support level of detail representation, and it can be naturally expanded for n-dimensional data. The method also works well with point-sets that are noisy or not uniformly distributed. We show features and performances of the proposed method via experimental results for various data sets.

Multicut high dimensional model representation for reliability analysis

  • Chowdhury, Rajib;Rao, B.N.
    • Structural Engineering and Mechanics
    • /
    • v.38 no.5
    • /
    • pp.651-674
    • /
    • 2011
  • This paper presents a novel method for predicting the failure probability of structural or mechanical systems subjected to random loads and material properties involving multiple design points. The method involves Multicut High Dimensional Model Representation (Multicut-HDMR) technique in conjunction with moving least squares to approximate the original implicit limit state/performance function with an explicit function. Depending on the order chosen sometimes truncated Cut-HDMR expansion is unable to approximate the original implicit limit state/performance function when multiple design points exist on the limit state/performance function or when the problem domain is large. Multicut-HDMR addresses this problem by using multiple reference points to improve accuracy of the approximate limit state/performance function. Numerical examples show the accuracy and efficiency of the proposed approach in estimating the failure probability.

DEVELOPMENT OF AN HIGH-ORDER IMPLICIT DISCONTINUOUS GALERKIN METHOD ON UNSTRUCTURED MESHES (비정렬 격자계에서 고차 정확도의 내재적 불연속 갤러킨 기법의 개발)

  • Lee, H.D.;Kwon, O.J.
    • Journal of computational fluids engineering
    • /
    • v.12 no.3
    • /
    • pp.29-40
    • /
    • 2007
  • An implicit discontinuous Galerkin method for the two-dimensional Euler equations was developed on unstructured triangular meshes. The method can achieve high-order spatial accuracy by using hierachical basis functions based on Legendre polynomials. Numerical tests were conducted to estimate the convergence order of numerical solutions to the Ringleb flow and the supersonic vortex flow for which analytic solutions are available. Also, the flows around a 2-D circular cylinder and an NACA0012 airfoil were numerically simulated. The numerical results showed that the implicit discontinuous Galerkin methods couples with a high-order representation of curved solid boundaries can be an efficient method to obtain very accurate numerical solutions on unstructured meshes.

DEVELOPMENT OF IMPLICIT DISCONTINUOUS GALERKIN METHOD ON UNSTRUCTURED MESHES (비정렬 격자계에서 내재적 불연속 갤러킨 기법의 개발)

  • Lee, H.D.;Kwon, O.J.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2007.04a
    • /
    • pp.30-40
    • /
    • 2007
  • The implicit discontinuous Galerkin method for the two-dimensional Euler equations was developed on unstructured triangular meshes, which can achieve higher-order accuracy by wing hierachical basis functions based on Legendre polynomials. Numerical tests were conducted to estimate the convergence order of numerical solutions to the Ringleb flow and the supersonic vortex flow for which analytic solutions are available. And, the flows around a circle and a NACA0012 airfoil was also numerically simulated. Numerical results show that the implicit discontinuous Galerkin methods with higher-order representation of curved solid boundaries can be an efficient higher-order method to obtain very accurate numerical solutions on unstructured meshes.

  • PDF

Implicit Representation of Gender Stereotype: Priming Effects of Attribute Typicality and Gender Congruency (성별 고정관념의 암묵적 표상: 성별의 속성 전형성과 집단 일치성의 점화효과)

  • 이재호;방희정
    • Korean Journal of Cognitive Science
    • /
    • v.14 no.2
    • /
    • pp.37-46
    • /
    • 2003
  • Two experiments were conducted to explore the implicit representation of gender-stereotype using primed naming task for prime-target pairs. In Experiment 1, Participants were presented gender's attributes as primes at SOA 250ms and were asked to pronounce person's names which differed in typicality and preference of gender's attributes. The results showed that gender congruent effects was not found, but typicality effects and interactions were found. In Experiment 2, Participants were presented gender's attributes as primes at SOA 250ms and were asked to pronounce gender's attributes which differed in typicality of gender's attributes. The results showed that woman's attributes superiority effects were found, but typicality effects were not. These results were discussed from a point of view of graded representation of gender stereotype and asymmetrical processing of gender stereotype to priming conditions in the implicit level.

  • PDF

Geometric Implicit Function Modeling and Analysis Using R-functions (R-function을 이용한 형상의 음함수 모델링 및 해석)

  • Shin, Heon-Ju;Sheen, Dong-Woo;Kim, Tae-Wan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.3
    • /
    • pp.220-232
    • /
    • 2007
  • Current geometric modeling and analysis are commonly based on B-Rep modeling and a finite elements method respectively. Furthermore, it is difficult to represent an object whose material property is heterogeneous using the B-Rep method because the B-Rep is basically used for homogeneous models. In addition, meshes are required to analyze a property of a model when the finite elements method is applied. However, the process of generating meshes from B-Rep is cumbersome and sometimes difficult especially when the model is deformed as time goes by because the topology of deforming meshes are changed. To overcome those problems in modeling and analysis including homogeneous and heterogeneous materials, we suggest a unified modeling and analysis method based on implicit representation of the model using R-function which is suggested by Rvachev. For implicit modeling of an object a distance field is approximated and blended for a complex object. Using the implicit function mesh-free analysis is possible where meshes are not necessary. Generally mesh-free analysis requires heavy computational cost compared to a finite elements method. To improve the computing time of function evaluation, we utilize GPU programming. Finally, we give an example of a simple pipe design problem and show modeling and analysis process using our unified modeling and analysis method.