• Title/Summary/Keyword: approximate model

Search Result 1,137, Processing Time 0.027 seconds

GPU-accelerated Global Illumination for Point Set Rendering (GPU 가속을 이용한 점집합 렌더링을 위한 전역 조명기법)

  • Min, Heajung;Kim, Young J.
    • Journal of the Korea Computer Graphics Society
    • /
    • v.26 no.1
    • /
    • pp.7-15
    • /
    • 2020
  • In the process of visualizing a point set representing a smooth manifold surface, global illumination techniques can be used to render a realistic scene with various effects of lighting. Thanks to the continuous demand for ray tracing and the development of graphics hardware, dedicated GPUs and programmable pipeline for ray tracing have been introduced in recent years. In this paper, real-time global illumination rendering is studied for a point-set model using ray-tracing GPUs. We apply the moving least-squares (MLS) method to approximate the point set to a smooth implicit surface and render it using global illumination by performing massive ray-intersection tests with the surface and generating shading effects at the intersection point. As a result, a complicated point-set scene consisting of more than 0.5M points can be generated in real-time.

Automatic Selection of Similar Sentences for Teaching Writing in Elementary School (초등 글쓰기 교육을 위한 유사 문장 자동 선별)

  • Park, Youngki
    • Journal of The Korean Association of Information Education
    • /
    • v.20 no.4
    • /
    • pp.333-340
    • /
    • 2016
  • When elementary students write their own sentences, it is often educationally beneficial to compare them with other people's similar sentences. However, it is impractical for use in most classrooms, because it is burdensome for teachers to look up all of the sentences written by students. To cope with this problem, we propose a novel approach for automatic selection of similar sentences based on a three-step process: 1) extracting the subword units from the word-level sentences, 2) training the model with the encoder-decoder architecture, and 3) using the approximate k-nearest neighbor search algorithm to find the similar sentences. Experimental results show that the proposed approach achieves the accuracy of 75% for our test data.

Virtual Make-up System Using Light and Normal Map Approximation (조명 및 법선벡터 지도 추정을 이용한 사실적인 가상 화장 시스템)

  • Yang, Myung Hyun;Shin, Hyun Joon
    • Journal of the Korea Computer Graphics Society
    • /
    • v.21 no.3
    • /
    • pp.55-61
    • /
    • 2015
  • In this paper, we introduce a method to synthesize realistic make-up effects on input images efficiently. In particular, we focus on shading on the make-up effects due to the lighting and face curvature. By doing this, we can synthesize a wider range of effects realistically than the previous methods. To do this, the information about lighting information together with the normal vectors on all pixels over the face region in the input image. Since the previous methods that compute lighting information and normal vectors require relatively heavy computation cost, we introduce an approach to approximate lighting information using cascade pose regression process and normal vectors by transforming, rendering, and warping a standard 3D face model. The proposed method consumes much less computation time than the previous methods. In our experiment, we show the proposed approximation technique can produce naturally looking virtual make-up effects.

3D Object Restoration and Data Compression Based on Adaptive Simplex-Mesh Technique (적응 Simplex-Mesh 기술에 기반한 3차원 물체 복원과 자료 압축)

  • 조용군
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.9 no.4
    • /
    • pp.436-443
    • /
    • 1999
  • Most of the 3D object reconstruction techniques divide the object into multiplane and approximate the surfaces of the object. The Marching Cubes Algorithm which initializes the mesh structure using a given isovalue. and Delaunay Tetrahedrisation are widely used. Deformable models are well-suited for general object reconstruction because they make little assumptions about the shape to recover and they can reconstruct objects *om various types of datasets. Now, many researchers are studying the reconstruction systems based on a deformable model. In this paper, we propose a novel method for reconstruction of 3D objects. This method, for a 3D object composed of curved planes, compresses the 3D object based on the adaptive simplexmesh technique. It changes the pre-defined mesh structure, so that it may approach to the original object. Also, we redefine the geometric characteristics such as curvatures. As results of simulations, we show reconstruction of the original object with high compression and concentration of vertices towards parts of high curvature in order to optimize the shape description.

  • PDF

Free Torsional Vibration of Linearly Tapered I-Beams (선형(線形) 변단면(變斷面) I-형(型) 보의 비틂진동(振動))

  • Lee, Yong Woo;Min, Kyung Ju
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.14 no.5
    • /
    • pp.1013-1021
    • /
    • 1994
  • The stiffness and mass matrices are developed for free torsional vibration analysis in linearly tapered thin-walled I-beams that takes into account the effect of warping torsion. The approximate shape functions are used for formulating stiffness and mass matrices. Significant improvements of accuracy and efficiency of free vibration analysis are achieved by using the stiffness and mass matrices developed in this study. Frequencies of free vibration of tapered members are compared with solutions based upon stepped representation of beam element and also are verified with model tests. The stiffness and mass matrices presented in this study can be used for the free vibration analysis of tapered and prismatic thin walled I-beams and space structures involving warping torsion.

  • PDF

Two-step Boundary Extraction Algorithm with Model (모델 정보를 이용한 2단계 윤곽선 추출 기법)

  • Choe, Hae-Cheol;Lee, Jin-Seong;Jo, Ju-Hyeon;Sin, Ho-Cheol;Kim, Seung-Dae
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.1
    • /
    • pp.49-60
    • /
    • 2002
  • We propose an algorithm for extracting the boundary of a desired object with shape information obtained from sample images. Considering global shape obtained from sample images and edge orientation as well as edge magnitude, the Proposed method composed of two steps finds the boundary of an object. The first step is the approximate segmentation that extracts a rough boundary with a probability map and an edge map. And the second step is the detailed segmentation for finding more accurate boundary based on the SEEL (seed-point extraction and edge linking) algorithm. The experiment results using IR images show robustness to low-quality image and better performance than conventional segmentation methods.

Elastic Horizontal Response of a Structure to Bedrock Earthquake Considering the Nonlinearity of the Soil Layer (지반의 비선형성을 고려한 암반지진에 의한 구조물의 수평방향 탄성거동)

  • Kim, Yong-Seok
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.6 no.3
    • /
    • pp.53-62
    • /
    • 2002
  • Site soil condition affects significantly on the seismic response of a structure and is a critical factor for the performance based seismic design of a structure. In this paper, the effects of nonlinear soil properties on the elastic response spectra of a structure including the nonlinearity of a soil due to the earthquake excitation is investigated using one step finite element approach for the entire soil structure system and approximate linear iterative procedure to simulate the nonlinear soil behavior with the Ramberg-Osgood soil model. Studies were carried out for a linear SDOF system of a variable period with and without a pile group for the 1940 CI Centro earthquake recorded on ground rather than rock. The study results showed clearly that the effect of the nonlinear behavior of soft soil is very important on the elastic seismic response of a structure suggesting the necessity of the performance based seismic design.

Load-Balancing Rendezvous Approach for Mobility-Enabled Adaptive Energy-Efficient Data Collection in WSNs

  • Zhang, Jian;Tang, Jian;Wang, Zhonghui;Wang, Feng;Yu, Gang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1204-1227
    • /
    • 2020
  • The tradeoff between energy conservation and traffic balancing is a dilemma problem in Wireless Sensor Networks (WSNs). By analyzing the intrinsic relationship between cluster properties and long distance transmission energy consumption, we characterize three node sets of the cluster as a theoretical foundation to enhance high performance of WSNs, and propose optimal solutions by introducing rendezvous and Mobile Elements (MEs) to optimize energy consumption for prolonging the lifetime of WSNs. First, we exploit an approximate method based on the transmission distance from the different node to an ME to select suboptimal Rendezvous Point (RP) on the trajectory for ME to collect data. Then, we define data transmission routing sequence and model rendezvous planning for the cluster. In order to achieve optimization of energy consumption, we specifically apply the economic theory called Diminishing Marginal Utility Rule (DMUR) and create the utility function with regard to energy to develop an adaptive energy consumption optimization framework to achieve energy efficiency for data collection. At last, Rendezvous Transmission Algorithm (RTA) is proposed to better tradeoff between energy conservation and traffic balancing. Furthermore, via collaborations among multiple MEs, we design Two-Orbit Back-Propagation Algorithm (TOBPA) which concurrently handles load imbalance phenomenon to improve the efficiency of data collection. The simulation results show that our solutions can improve energy efficiency of the whole network and reduce the energy consumption of sensor nodes, which in turn prolong the lifetime of WSNs.

Statistical Properties of Random Sparse Arrays with Application to Array Design (어레이 설계 응용을 위한 랜덤어레이의 통계적 성질)

  • Kook, Hyung-Seok;Davies, Patricia;Bolton, J.Stuart
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2000.06a
    • /
    • pp.1493-1510
    • /
    • 2000
  • Theoretical models that can be used to predict the range of main lobe widths and the probability distribution of the peak sidelobe levels of two-dimensionally sparse arrays are presented here. The arrays are considered to comprise microphones that are randomly positioned on a segmented grid of a given size. First, approximate expressions for the expected squared magnitude of the aperture smoothing function and the variance of the squared magnitude of the aperture smoothing function about this mean are formulated for the random arrays considered in the present study. By using the variance function, the mean value and the lower end of the range i.e., the first I percent of the mainlobe distribution can be predicted with reasonable accuracy. To predict the probability distribution of the peak sidelobe levels, distributions of levels are modeled by a Weibull distribution at each peak in the sidelobe region of the expected squared magnitude of the aperture smoothing function. The two parameters of the Weibull distribution are estimated from the means and variances of the levels at the corresponding locations. Next, the probability distribution of the peak sidelobe levels are assumed to be determined by a procedure in which the peak sidelobe level is determined as the maximum among a finite number of independent random sidelobe levels. It is found that the model obtained from the above approach predicts the probability density function of the peak sidelobe level distribution reasonably well for the various combinations of two different numbers of microphones and grid sizes tested in the present study. The application of these models to the design of random, sparse arrays having specified performance levels is also discussed.

  • PDF

Semi-automatic Building Area Extraction based on Improved Snake Model (개선된 스네이크 모텔에 기반한 반자동 건물 영역 추출)

  • Park, Hyun-Ju;Gwun, Ou-Bong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.1
    • /
    • pp.1-7
    • /
    • 2011
  • Terrain, building location and area, and building shape information is in need of implementing 3D map. This paper proposes a method of extracting a building area by an improved semi-automatic snake algorithm. The method consists of 3-stage: pre-processing, initializing control points, and applying an improved snake algorithm. In the first stage, after transforming a satellite image to a gray image and detecting the approximate edge of the gray image, the method combines the gray image and the edge. In the second stage, the user looks for the center point of a building and the system sets the circular or rectangular initial control points by an procedural method. In the third stage, the enhanced snake algorithm extracts the building area. In particular, this paper sets the one tenn of the snake in a new way in order to use the proposed method for specializing building area extraction. Finally, this paper evaluated the performance of the proposed method using sky view satellite image and it showed that the matching percentage to the exact building area is 75%.