• Title/Summary/Keyword: 근사 기법

Search Result 1,035, Processing Time 0.028 seconds

Real-Time Motion Blur using Approximated Motion Trails (이동궤적 근사 다면체를 이용한 실시간 모션블러 기법)

  • Hong, MinhPhuoc;Choi, Jinhyung;Oh, Kyoungsu
    • Journal of Korea Game Society
    • /
    • v.17 no.1
    • /
    • pp.17-26
    • /
    • 2017
  • Several algorithms have been introduced to render motion blur in real time by solving the visibility problem in the spatio-temporal domains. However, some algorithms render at interactive frame rates but have artifacts or noise. Therefore, we propose a new algorithm that renders real-time motion blur using extruded triangles. Our method uses two triangles in the previous and the current frame to make an extruded triangle then send it to the rasterization. To solve the occlusion between extruded triangles for a given pixel, we introduce a combining solution using a sorting in front to back order and bitwise operations in the spatio-temporal dimensions.

Rate-Distortion Based Image Segmentation Using Recursive Merging and Texture Approximation (질감 근사화 및 반복적 병합을 이용한 율왜곡 기반 영상 분할)

  • 정춘식;임채환;김남철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1B
    • /
    • pp.156-166
    • /
    • 2000
  • A rate-distortion based segmentation using recursive merging is presented, which considers texture as a homogeneity by adopting the procedure of a generalized texture approximation. The texture in a region is approximated by SA-DCT and a set of two uniform quantizers with fixed step sizes, one for DC and another for AC. Using the approximated texture, we calculated the rate-distortion based cost. The segmentation using recursive merging is performed by using the rate-distortion based cost. Experimental results for 256$\times$256 Lena show that the region-based coding using the proposed segmentation yields the PSNR improvements of 0.8~ 1.0 dB and 1.2~1.5 dB over that using the rate-distortion based segmentation with DC approximation only and JPEG, respectively.

  • PDF

Numerical Analysis of Dam-Break Flow in an Experimental Channel using Cut-Cell Method (분할격자기법을 이용한 실험수조 댐붕괴파의 수치모의)

  • Kim, Hyung-Jun;Kim, Jung-Min;Cho, Yong-Sik
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.29 no.2B
    • /
    • pp.121-129
    • /
    • 2009
  • In this study, dam-break flows are simulated numerically by using an efficient and accurate Cartesian cut-cell mesh system. In the system, most of the computational domain is discretized by the Cartesian mesh, while peculiar grids are done by a cutcell mesh system. The governing equations are then solved by the finite volume method. An HLLC approximate Riemann solver and TVD-WAF method are employed to calculation of advection flux of the shallow-water equations. To validate the numerical model, the model is applied to some problems such as a steady flow convergence on an ideal bed, a steady flow over an irregular bathymetry, and a rectangular tank problem. The present model is finally applied to a simulation of dam-break flow on an experimental channel. The predicted water surface elevations are compared with available laboratory measurements. A very reasonable agreement is observed.

Rule Generation and Approximate Inference Algorithms for Efficient Information Retrieval within a Fuzzy Knowledge Base (퍼지지식베이스에서의 효율적인 정보검색을 위한 규칙생성 및 근사추론 알고리듬 설계)

  • Kim Hyung-Soo
    • Journal of Digital Contents Society
    • /
    • v.2 no.2
    • /
    • pp.103-115
    • /
    • 2001
  • This paper proposes the two algorithms which generate a minimal decision rule and approximate inference operation, adapted the rough set and the factor space theory in fuzzy knowledge base. The generation of the minimal decision rule is executed by the data classification technique and reduct applying the correlation analysis and the Bayesian theorem related attribute factors. To retrieve the specific object, this paper proposes the approximate inference method defining the membership function and the combination operation of t-norm in the minimal knowledge base composed of decision rule. We compare the suggested algorithms with the other retrieval theories such as possibility theory, factor space theory, Max-Min, Max-product and Max-average composition operations through the simulation generating the object numbers and the attribute values randomly as the memory size grows. With the result of the comparison, we prove that the suggested algorithm technique is faster than the previous ones to retrieve the object in access time.

  • PDF

Layer Interface and Approximated Nonlinear Analysis Method for Consolidation Prediction (압밀현상 예측을 위한 경계면 및 근사 비선형 해석기법)

  • Lee, Kyuhwan;Jeon, Jesung;Kim, Kiyoung;Jung, Daeesuk
    • Journal of the Korean GEO-environmental Society
    • /
    • v.8 no.6
    • /
    • pp.37-43
    • /
    • 2007
  • The interface layer having different consolidation properties and nonlinear material function with permeability needs to be considered to predict consolidation behavior. In this study, interface equation between different layers has been derived and then applied to existing finite difference scheme for conducting consolidation analysis. These results have been compared with those by conventional method in which different layers are converted to single layer having conversion value of properties. Also, although the conventional consoilidation analysis is used to consider non-linearity of the permeability with effective stress, an approximated nonlinear method as a function of consoilidation coefficient with effective stress have been developed and applied to the consoilidation analysis for various cases.

  • PDF

Proposing the Methods for Accelerating Computational Time of Large-Scale Commute Time Embedding (대용량 컴뮤트 타임 임베딩을 위한 연산 속도 개선 방식 제안)

  • Hahn, Hee-Il
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.2
    • /
    • pp.162-170
    • /
    • 2015
  • Commute time embedding involves computing the spectral decomposition of the graph Laplacian. It requires the computational burden proportional to $o(n^3)$, not suitable for large scale dataset. Many methods have been proposed to accelerate the computational time, which usually employ the Nystr${\ddot{o}}$m methods to approximate the spectral decomposition of the reduced graph Laplacian. They suffer from the lost of information by dint of sampling process. This paper proposes to reduce the errors by approximating the spectral decomposition of the graph Laplacian using that of the affinity matrix. However, this can not be applied as the data size increases, because it also requires spectral decomposition. Another method called approximate commute time embedding is implemented, which does not require spectral decomposition. The performance of the proposed algorithms is analyzed by computing the commute time on the patch graph.

Reduction of Computing Time in Aircraft Control by Delta Operating Singular Perturbation Technique (델타연산자 섭동방법에 의한 항공기 동력학의 연산시간 감소)

  • Sim, Gyu Hong;Sa, Wan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.31 no.3
    • /
    • pp.39-49
    • /
    • 2003
  • The delta operator approach and the singular perturbation technique are introduced. The former reduces the round-off error in the numerical computation. The latter reduces computing time by decoupling the original system into the fast and slow sub-systems. The aircraft dynamics consists of the Phugoid and short-period motions whether its model is longitudinal or lateral. In this paper, an approximated solutions of lateral dynamic model of Beaver obtained by using those two methods in compared with the exact solution. For open-loop system and closed-loop system, and approximated solution gets identical to the exact solution with only one iteration and without iteration, respectively. Therefore, it is shown that implementing those approaches is very effective in the flight dynamic and control.