• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.1102-1110
• /
• 2005

In this paper, we proposed a advanced approach to resolve the trade-off problem for the threshold value determining the photo-consistency in the previous algorithms. The threshold value for the surface voxel is substituted the photo-consistency value of the inside voxel. As iterating the voxel coloring process, the threshold is approached to the optimal value for the individual surface voxel. we present an energy minimization formulation of the binary labeling problem that surface voxels classify into opacity or transparency. The energy formula consists of the data term and the smoothness term. As considering neighboring voxels in the labeling problem, the unevenness of reconstructed surface is reduced. The labeling whose energy is the global minimum can be computed using a graph cut.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.550-552
• /
• 2001

본 논문은 3차원 그래픽스 시스템이 기본적으로 제공하는 프리미티브인 면(surface), 솔리드(solid)의 복셀화 및 이들을 결합한 CSG 표현의 복셀화에 대하여 고찰한다. 복셀화는 서피스로 표현된 물체의 빈 내부를 복셀로 표현하여 내부를 태우는 과정이다. 본 방법의 특징은 PC 플랫폼이 제공하는 그래픽스 API인 OpenGL을 이용하여 면, 솔리드 등을 고속으로 복셀화하여 이들을 기본 물체로 하여 불리언연산에 의해서 간단히 새로운 물체를 만들고 볼륨 환경에서 이들을 단일화된 방법으로 렌더링할 수 있는 것이다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.6
• /
• pp.93-100
• /
• 2005

We propose an optimal thresholding method for the voxel coloring in the reconstruction of a 3D shape. Our purposed method is a new approach to resolve the trade-off error of the threshold value on determining the photo-consistency in the conventional method. Optimal thresholding value is decided to compare the photo-consistency of a surface with inside voxel on the optic ray of the center camera. As iterating the process of the vokels, the threshold is approached to the optimal value for the individual surface voxel. And also, graph cut method is reduced to the surface noise on eliminating neighboring voxel. To verify the proposed algorithm, we simulated in the virtual and real environment. It is advantaged to speed up and accuracy of a 3D face reconstruction by applying the methods of optimal threshold and graph as compare with conventional algorithms.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.541-546
• /
• 2006

3차원 관상동맥을 분석하기 위해서는 혈관의 분기점, 극단점, 혈관의 계층적 구조 관계를 함축적으로 표현하는 것이 매우 중요하다. 본 논문에서는3차원 CT 혈관 조영 영상으로부터 관상동맥의 3차원 골격을 자동으로 추출하는 방법을 개발하였다. 먼저, CT혈관 조영술에 의해 획득된 슬라이스 이미지로부터 3차원 조작 및 수술 시뮬레이션 등을 위하여 혈관의 3차원 표면에 대한 메쉬 모델을 생성한다. 생성된 메쉬 모델이 임의로 변형된 후에도 자동으로 골격을 쉽게 추출할 수 있도록 메쉬 모델을 복셀화하는 단계를 거친다. 이렇게 얻어진 복셀 모델로부터 표면복셀을 결정하고 표면 복셀로부터 객체 복셀까지의 유클리드 거리값를 계산하여 유클리드 거리맵(EDM)을 계산한다. 계산된 EDM 으로부터 객체 복셀이 가지게 되는 최대 내접 구를 계산하여 Discrete Medial Surface을 생성하게 되는데 이것은 골격의 후보가 된다. 골격의 후보집합 복셀에 대하여 Dijkstra 최단 경로 결정 알고리즘을 적용하여 골격을 자동으로 추출하게 된다. 이렇게 추출된 3차원 골격은 관상동맥 수술 시뮬레이션 등의 다양한 형상 분석에 유용하게 사용될 수 있다.

• 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 Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.622-626
• /
• 2005

Voxel Coloring is one of the well known methods to reconstruct three dimensional shape from calibrated two dimensional multiple-view images. This paper proposes an advanced Voxel Coloring to complement drawbacks of previous color consistency tests. We propose an adaptive threshold using double threshold and an weight component to test color consistency. From the reconstruction experiment, we have verified that our proposed method outperforms the previous one.

• Investigative Magnetic Resonance Imaging
• /
• v.4 no.2
• /
• pp.120-127
• /
• 2000

Adaptive template filtering has been proposed recently for enhancement of signal-to-noise ratio without loss of resolution. In the adaptive template filtering, an optimal template among multiple templates is selected, then linear least square error filtering based on the template is applied in vowel by vowel basis. In some magnetic resonance imaging, where the distribution of gray level has relatively small dynamic range, e.g., $T_1$ imaging, however, artificial stair-like artifact is observed at near edges. This is partially due to the edge enhancement effect in such yokels that contain multiple compounds at the boundaries of tissues. The gray levels of these yokels become similar gray levels of near dominant vowels that contain single compound by the adaptive filtering, which enlarges edge discontinuities. In this paper, we propose a technique to eliminate such artifact by identifying those yokels that contain multiple compounds and assigning the largest template for them. Filtered images with the proposed technique show substantial visual enhancement at the edges without degradation of peak signal-to-noise ratio compared to the original adaptive template filtering for both magnetic resonance images and phantom images.

• Journal of the Korea Computer Graphics Society
• /
• v.18 no.3
• /
• pp.1-7
• /
• 2012

In this paper, we propose a method to compute the interface between protein molecules. When a molecules is represented as a set of spheres with van der Waals radii, the distance from a spatial point p to the molecule corresponds to the distance from p to the closet sphere. The molecular interface is composed of equi-distant points from two molecules. Our algorithm decomposes the space into a set of voxels, and then constructs a voxel map by storing the information of spheres intersecting each voxel. By using the voxel map, we compute the distance between a point and the molecule. We also use GPU for the parallel processing, and efficiently approximate the interface of a pair of molecules.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.655-662
• /
• 2003

In some volume visualization fields such as medical imaging, anisotropic volume data are more common than isotropic ones. In this paper, we propose an efficient rendering method for anisotropic volume data, which directly computes the intensity of intermediate samples by interpolating the intensity of two corresponding voxels on consecutive slices. Unlike density interpolation method, it does not require a preprocessing step for generating intermediate slices or additional memory for storing them. Additionally, we propose an adaptive intermediate voxel insertion method that avoids overblurring on object surfaces. This may occur when we render high frequency areas using the intensity interpolation method. Using these methods, we can improve the rendering speed without sacrificing image quality.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.705-708
• /
• 2001

여러 장의 입력 영상으로부터 3차원 형상 정보를 복원하는 기법은 크게 스테레오(stereo) 기법과 각선 기반 방법으로 나누어져 있다. 특히 복셀 기반 방법은 스테레오 기법에서의 대응점 문제를 극복하고 가리어짐 현상이나 컬러의 변화가 적은 영역에서의 현상 복원 능력이 우수한 것으로 알려져 있지만 광학적 외피(photo hull) 이라는 근본적인 복원 한계성을 가진다. Photo hull은 바라보는 카메라의 위치에 크게 의존하는 성질을 보인다. 조건에 맞는 최적의 카메라 위치를 결정하는 것을 시점 계획(view planning)이라 고 하고 거리 영상(range images)로부터 형상을 복원하는 기법에 활발히 연구되어져 왔다. 본 논문에서는 복셀 기반 방법에서의 단점인 photo hull을 줄이기 위해 최적의 시점을 선택하는 시점 계획(view planning)에 대한 알고리듬을 제안하고 photo hull의 효과를 최소로 하여 형상이 복원되는 것을 실험을 통해 검증한다.