• Title/Summary/Keyword: 수퍼샘플링

Search Result 6, Processing Time 0.02 seconds

Efficient Supersampling in Volume Rendering using Multiple Templates (복수 원형을 이용한 볼륨 렌더링에서의 효율적인 수퍼샘플링)

  • Gu, Yun-Mo;Lee, Cheol-Hui;Sin, Yeong-Gil
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.1
    • /
    • pp.1-8
    • /
    • 1999
  • 본 논문에서는 볼륨 렌더링에서 화상영역 수퍼샘플링을 효율적으로 수행시키는 방법을 제시한다. 이 알고리즘은 부화소에서 나오는 평행 광선들 간의 규칙성을 이용하여 각 화소로부터 상대 위치가 같은 부화소에서 나오는 광선마다 한 개씩의 원형을 만들어 둠으로써 수퍼샘플링을 효율적으로 수행한다. 또한 본 알고리즘은 객체순서 알고리즘에 기반을 두고 있으므로 화상순서 알고리즘에서도 수퍼샘플링을 하는 것보다 매우 빠르게 처리하게 된다. 또한 본 논문에서는 적응 수퍼샘플링 방법도 제안한다. 이는 에일리어싱이 생길 가능성이 많은 부분에서만 수퍼샘플링을 하며, 이러한 영역은 분류화 전처리 단게에서 미리 결정해둔다.

High-quality Shear-warp Volume Rendering Using Efficient Supersampling and Pre-integration Technique (효율적인 수퍼샘플링과 선-적분을 이용한 고화질 쉬어-왑 분해 볼륨 렌더링)

  • Kye, Hee-Won;Kim, Tae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.8
    • /
    • pp.971-981
    • /
    • 2006
  • As shear-warp volume rendering is the fastest rendering method among the software based approaches, image quality is not good as that of other high-quality rendering methods. In this paper, we propose two methods to improve the image quality of shear-warp volume rendering without sacrificing computational efficiency. First, supersampling is performed in intermediate image space. We propose an efficient method to transform between volume and image coordinates at the arbitrary ratio. Second, we utilize pre-integrated rendering technique for shear-warp rendering. We propose new data structure called overlapped min-max map. Using this structure, empty space leaping can be performed so that we can maintain the rendering speed even though pre-integrated rendering is applied. Consequently, shear-warp rendering can generate high-qualify images comparable to those generated by the ray-casting without degrading speed.

  • PDF

Development of the cutting simulation system with decomposition Algorithm. (분해 모델링 기법을 이용한 절삭 시뮬레이션 시스템 개발)

  • 김용현;고성림
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.422-425
    • /
    • 2004
  • This paper develops an octree-based algorithm for machining simulation. Most commercial machining simulators are based on the Z map model, which has several limitations in terms of achieving a high level of precision in five-axis machining simulation. Octree representation being a three-dimensional (3D) decomposition method, an octree-based algorithm is expected to be able to overcome such limitations. With the octree model, storage requirement is reduced. Moreover, recursive subdivision is processed in the boundaries, which reduces useless computations. The supersampling method is the most common form of antialiasing and is typically used with polygon mesh rendering in computer graphics. The supersampling technique is being used to advance the efficiency of the octree algorithm..

  • PDF

Development of a Cutting Simulation System using Octree Algorithm (옥트리 알고리즘을 이용한 절삭 시뮬레이션 시스템의 개발)

  • Kim Y-H.;Ko S.-L.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.10 no.2
    • /
    • pp.107-113
    • /
    • 2005
  • Octree-based algorithm is developed for machining simulation. Most of commercial machining simulators are based on Z map model, which have several limitations to get a high precision in 5 axis machining simulation. Octree representation is three dimensional decomposition method. So it is expected that these limitations be overcome by using octree based algorithm. By using the octree model, storage requirement is reduced. And also recursive subdivision was processed in the boundaries, which reduces useless computation. The supersampling method is the most common form of the anti-aliasing and usually used with polygon mesh rendering in computer graphics. Supersampling technique is applied for advancing its efficiency of the octree algorithm.

Research for the 5 axis machining simulation system with Octree Algorithm (옥트리에 기반한 5 축 가공 시뮬레이션을 위한 연구)

  • Kim Y.H.;Ko S.L.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2005.06a
    • /
    • pp.956-959
    • /
    • 2005
  • The overall goal of this thesis is to develop a new algorithm based on the octree model for geometric and mechanistic milling operation at the same time. Most commercial machining simulators are based on the Z map model, which has several limitations in terms of achieving a high level of precision in five-axis machining simulation. Octree representation being a three-dimensional (3D) decomposition method, an octree-based algorithm is expected to be able to overcome such limitations. With the octree model, storage requirement is reduced. Moreover, recursive subdivision is processed in the boundaries, which reduces useless computations. To achieve a high level of accuracy, fast computation time and less memory consumption, the advanced octree model is suggested. By adopting the supersampling technique of computer graphics, the accuracy can be significantly improved at approximately equal computation time. The proposed algorithm can verify the NC machining process and estimate the material removal volume at the same time.

  • PDF

Area Measurement of Organism Image using Super Sampling and Interpolation (수퍼 샘플링과 보간을 이용한 생물조직 영상의 면적 측정)

  • Choi, Sun-Wan;Yu, Suk-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.10
    • /
    • pp.1150-1159
    • /
    • 2014
  • This paper proposes a method for extracting tissue cells from an organism image by an electron microscope and getting the whole cell number and the area from the cell. In general, the difference between the cell color and the background is used to extract tissue cell. However, there may be a problem when overlapped cells are seen as a single cell. To solve the problem, we split them by using cell size and curvature. This method has a 99% accuracy rate. To measure the cell area, we compute two areas, the inside and boundary of the cell. The inside is simply calculated by the number of pixels. The cell boundary is obtained by applying super sampling, linear interpolation, and cubic spline interpolation. It improves the error rate, 18%, 19%, and 120% respectively, in comparison to the counting method that counts a pixel area as 1.