• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.527-530
• /
• 2003

In this paper, we implemented the voxel coloring method to reconstruct 3D object from synthetic input Images. Then compare the result between using standard voxel coloring and using coarse-to-fine method. We compared using different voxel space site to see the difference of time processing and the result of 3D object. Photorealistic 3D object reconstruction is a challenging problem in computer graphics. Vexel coloring considered the reconstruction problem as a color reconstruction problem, instead of shape reconstruction problem. This method works by discretizing scene space into yokels, then traversed and colored those in special order. Also there is an extension of voxel coloring method far decreasing the amount of processing time called coarse-to-fine method. This. method works using low resolution instead of high resolution as input and after processing finish, apply some kind of search strategy.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1695-1700
• /
• 2005

In this paper, 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 surface voxel of photo-consistency with inside voxel on the optic ray of the center camera. As iterating the process of the voxels, the threshold value 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 cut as compare with conventional algorithms.

• 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 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.

• 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.

• 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의 효과를 최소로 하여 형상이 복원되는 것을 실험을 통해 검증한다.