• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.499-501
• /
• 2000

음함수 곡면 모델의 대표적인 구조 요소인 메타볼은 다양한 형태의 곡면을 모델링하는데 뛰어난 성능을 갖는다[1]. 그러나 복잡한 형태의 물체는 곡면 뿐 아니라 평면적인 요소를 포함하기 때문에 메타볼만으로 부정형 물체를 모델링하는 데에는 많은 어려움이 따른다. 메타큐브는 메타볼의 장점을 수용하면서 적은 수의 데이터로 평면 형태의 물체가지 모델링할 수 있는 메타볼의 확장 형태로서, 두 개의 매개변수만으로 구에서 정육면체까지 자유로운 확장이 가능하다[2]. 본 논문은 메타큐브를 이용하여 볼륨 데이터로부터 3차원 물체를 자동 모델링하는 방법을 제안한다. 제안 방법은 볼륨 데이터의 형태에 기반하여 분할된 볼륨 트리를 이용하여 비교적 빠른 시간에 볼륨 데이터로부터 비슷한 형태의 3차원 물체를 재구성하는 메타큐브 집합을 추출한다. 다양한 볼륨데이타에 대한 실험 결과를 제시함으로써 제안 방법의 효용성을 증명한다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1081-1089
• /
• 1999

Volume data modeling is concerned with finding a mathematical function which represents the relationship implied by the 3D data. Modeling a volume data geometrically can visualize a volume data using surface graphics without voxelization. It has many merits in that it is fast and requires little memory. We proposes, a method based on wavelet transformation and tetrahedrization. we implement a prototype system based on the proposed method. Last, we evaluated the proposed method comparing it with marching cube algorithm. the evaluation results show that though the proposed method uses only 13% of the volume data, the images generated is as good as the images generated by the marching cubes algorithm.

• The KIPS Transactions:PartA
• /
• v.10A no.2
• /
• pp.157-164
• /
• 2003

Volume graphics have received a lot of attention as a medical image analysis tool nowadays. In the visualization based on volume graphics, there is a process called voxelization which transforms the geometrically defined objects into the volumetric objects. It enables us to volume render the geometrically defined data with sampling data. This paper suggests a voxeliration method using the cutting surfaces of cubes, implements the method on a PC, and evaluates it with simple geometric modeling data to explore propriety of the method. This method features the ability of calculating the exact normal vector from a voxel, having no hole among voxels, having multi-resolution representation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.733-735
• /
• 2005

모델링$\cdot$시뮬레이션 또는 첨단 센서 장비 기술의 발전으로 최근에 매우 높은 해상도를 갖는 방대한 크기의 볼륨 데이터들이 생성되고 있으며, 이러한 데이터를 효과적으로 가시화하기 위한 다양한 연구 결과들이 과학적 가시화 분야에서 발표되고 있다. 지금까지 연구된 대부분의 가시화 소프트웨어들은 워크스테이션과 PC를 기반으로 개발되었으며, 모바일 환경에서 가시화를 수행하는 소프트웨어는 아직까지 발표된 바가 없다. 본 논문에서는 PDA상에서 구현된 클라이언트와 대용량$\cdot$고성능 서버를 이용한 모바일 볼륨 가시화 시스템의 설계에 관해 설명한다. 이 시스템은 자세한 관찰이 필요한 특정 영역을 점진적으로 높은 해상도로 관찰할 수 있는 기능을 지원하여, 설정한 파라미터를 이용한 고화질 볼륨 가시화 영상의 렌더링을 요청하는 기능을 제공한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.230-233
• /
• 2009

본 논문은 볼륨 데이터를 입력받아 계층성을 지원하는 등밀도 표면을 재구성하는 방법을 제안한다. 제안된 방법은 먼저 입력 볼륨 데이터에서 볼륨 피라미드를 구성하고 해상도가 최저인 피라미드의 최상단 볼륨에서부터 셀경계표현 방법을 이용하여 조악한 초기 메쉬를 생성하며, 이 메쉬를 표면축소기법을 사용하여 반복적으로 변형하여 O(3)-인접성 조건하에서 추출한 등밀도점을 잘 근사할 수 있도록 한다. 제안된 방법은 생성되는 표면이 압축이나 점진적인 전송 등과 같은 다중 해상도 알고리즘에 활용될 수 있다는 장점이 있다.

• The KIPS Transactions:PartA
• /
• v.10A no.1
• /
• pp.59-68
• /
• 2003

3-D data modeling of a volumetric scattered data is highly demanded for geological structure inspection, environment visualization and supersonic testing. The data used in these area are generally irregularly scattered in a volume data space, which are much different from the structured points data (cuberille data) used in Marching cube algorithm. In this paper, first we explore a volume modeling method for the scattered data based on tetrahedral domain. Next we propose a method for solving the ambiguity of tetrahedral domain decision using asymptotic decider criterion. Last we implement a simple visualization system based on the proposed asymptotic decider criterion and compare it with a system based on sphere criterion. In deciding tetrahedral domain, sphere criterion considers only positional values but asymptotic decider criterion considers not only positional values but also functional values, so asymptotic decider criterion is more accurate on deciding tetrahedral domain than sphere criterion.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.267-274
• /
• 2006

This paper describes a method to achieve different level of detail for the given volumetric data by assigning weight for the given data points. The relation between wavelet transformation and alpha shape was investigated to define the different level of resolution. Scattered data are defined as a collection of data that have little specified connectivity between data points. The quality of interpolant in volumetric trivariate space depends not only on the distribution of the data points in ${\Re}^3$, but also on the data value (intensity). We can improve the quality of an approximation by using wavelet coefficient as weight for the corresponding data points.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.5
• /
• pp.286-299
• /
• 2006

Due to the continuing technical progress in the capabilities of modeling, simulation, and sensor devices, huge volume data with very high resolution are common. In scientific visualization, various interactive real-time techniques on high performance parallel computers to effectively render such large scale volume data sets have been proposed. In this paper, we present a mobile volume visualization system that consists of mobile clients, gateways, and parallel rendering servers. The mobile clients allow to explore the regions of interests adaptively in higher resolution level as well as specify rendering / viewing parameters interactively which are sent to parallel rendering server. The gateways play a role in managing requests / responses between mobile clients and parallel rendering servers for stable services. The parallel rendering servers visualize the specified sub-volume with rendering contexts from clients and then transfer the high quality final images back. This proposed system lets multi-users with PDA simultaneously share commonly interesting parts of huge volume, rendering contexts, and final images through CSCW(Computer Supported Cooperative Work) mode.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.1
• /
• pp.127-135
• /
• 2006

The image-based 3D modeling is the technique of generating a 3D graphic model from images acquired using cameras. It is being researched as an alternative technique for the expensive 3D scanner. In this paper, I propose the image-based 3D modeling system using calibrated camera. The proposed algorithm for rendering 3D model is consisted of three steps, camera calibration, 3D shape reconstruction and 3D surface generation step. In the camera calibration step, I estimate the camera matrix for the image aquisition camera. In the 3D shape reconstruction step, I calculate 3D volume data from silhouette using pyramidal volume intersection. In the 3D surface generation step, the reconstructed volume data is converted to 3D mesh surface. As shown the result, I generated relatively accurate 3D model.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.235-244
• /
• 2000

This paper addresses a new method for constructing surface representation of 3D structures from a sequence of tomographic cross-sectional images, Firstly, we propose cell-boundary representation by transforming the cuberille space into cell space. A cell-boundary representation consists of a set of boundary cells with their 1-voxel configurations, and can compactly describe binary volumetric data. Secondly, to produce external surface from the cell-boundary representation, we define 19 modeling primitives (MP) including volumetric, planar and linear groups. Surface polygons are created from those modeling primitives using a simple table look-up operation. Comparing with previous method such as Marching Cube or PVP algorithm, our method is robust and does not make any crack in resulting surface model. Hardware implementation is expected to be easy because our algorithm is simple(scan-line), efficient and guarantees data locality in computation time.