• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.191-194
• /
• 2003

The recovery of 3D scene structure from multiple views has been long one of the central problems in computer vision. This paper presents a new projective reconstruction method based on factorization for un-calibrated image sequences. The proposed algorithm provides an effective measure to construct frame groups by using various information between frames. The experimental results show that the proposed method can reconstruct a more precise 3D structure than the precious methods such as the merging method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.281-288
• /
• 2016

The natural moving objects are the most non-rigid shapes with randomly time-varying deformation, and its types also very diverse. Methods of non-rigid shape reconstruction have widely applied in field of movie or game industry in recent years. However, a realistic approach requires moving object to stick many beacon sets. To resolve this drawback, non-rigid shape reconstruction researches from input video without beacon sets are investigated in multimedia application fields. In this regard, our paper propose novel CPSRF(Chained Partial Stereo Rigid Factorization) algorithm that can reconstruct a non-rigid 3D shape. Our method is focused on the real-time reconstruction of non-rigid 3D shape and motion from stereo 2D video sequences per frame. And we do not constrain that the deformation of the time-varying non-rigid shape is limited by a Gaussian distribution. The experimental results show that the 3D reconstruction performance of the proposed CPSRF method is superior to that of the previous method which does not consider the random deformation of shape.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.226-234
• /
• 2004

A rapid Prototyping system that laser-cuts and laminates thick layers can fabricate 3D objects promptly with a variety of materials. Building such a system must consider the surface distortions due to both vertical-cut layers and triangular surfaces. We developed a tangential layer-cutting algorithm by rearranging tangential lines such that they reconstruct 3D surfaces more closely and also constitute smoother laser trajectories. An energy function that reflects the surface-closeness with the tangential lines was formulated and then the energy was minimized by a gradient descent method. Since this simple method tends to cause many local minima for complex 3D objects, we tried to solve this problem by adding a simulated annealing process to the proposed method. To view and manipulate 3D objects, we also implemented a 3D visual environment. Under this environment, experiments on various 3D objects showed that our algorithm effectively approximates 3D surfaces and makes laser-trajectory feasibly smooth.

• Current Optics and Photonics
• /
• v.8 no.3
• /
• pp.246-258
• /
• 2024

In aerospace and energy engineering, the reconstruction of three-dimensional (3D) temperature distributions is crucial. Traditional methods like algebraic iterative reconstruction and filtered back-projection depend on voxel division for resolution. Our algorithm, blending deep learning with computer graphics rendering, converts 2D projections into light rays for uniform sampling, using a fully connected neural network to depict the 3D temperature field. Although effective in capturing internal details, it demands multiple cameras for varied angle projections, increasing cost and computational needs. We assess the impact of camera number on reconstruction accuracy and efficiency, conducting butane-flame simulations with different camera setups (6 to 18 cameras). The results show improved accuracy with more cameras, with 12 cameras achieving optimal computational efficiency (1.263) and low error rates. Verification experiments with 9, 12, and 15 cameras, using thermocouples, confirm that the 12-camera setup as the best, balancing efficiency and accuracy. This offers a feasible, cost-effective solution for real-world applications like engine testing and environmental monitoring, improving accuracy and resource management in temperature measurement.

• Nuclear Engineering and Technology
• /
• v.53 no.9
• /
• pp.2968-2976
• /
• 2021

This paper introduces a method to reconstruct the three-dimensional (3D) microstructure of two-phase materials, e.g., porous materials such as highly irradiated nuclear fuel, from two-dimensional (2D) sections via a multi-objective optimization genetic algorithm. The optimization is based on the comparison between the reference and reconstructed 2D sections on specific target properties, i.e., 2D pore number, and mean value and standard deviation of the pore-size distribution. This represents a multi-objective fitness function subject to weaker hypotheses compared to state-of-the-art methods based on n-points correlations, allowing for a broader range of application. The effectiveness of the proposed method is demonstrated on synthetic data and compared with state-of-the-art methods adopting a fitness based on 2D correlations. The method here developed can be used as a cost-effective tool to reconstruct the pore structure in highly irradiated materials using 2D experimental data.

• Journal of the Optical Society of Korea
• /
• v.18 no.4
• /
• pp.388-394
• /
• 2014

In this paper, we propose a three-dimensional (3D) image correlator by use of computational integral imaging reconstruction based on the modified convolution property of periodic functions (CPPF) for recognition of partially occluded objects. In the proposed correlator, elemental images of the reference and target objects are picked up by a lenslet array, and subsequently are transformed to a sub-image array which contains different perspectives according to the viewing direction. The modified version of the CPPF is applied to the sub-images. This enables us to produce the plane sub-image arrays without the magnification and superimposition processes used in the conventional methods. With the modified CPPF and the sub-image arrays, we reconstruct the reference and target plane sub-image arrays according to the reconstruction plane. 3D object recognition is performed through cross-correlations between the reference and the target plane sub-image arrays. To show the feasibility of the proposed method, some preliminary experiments on the target objects are carried out and the results are presented. Experimental results reveal that the use of plane sub-image arrays enables us to improve the correlation performance, compared to the conventional method using the computational integral imaging reconstruction algorithm.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.248-254
• /
• 2001

This paper presents a progressive algorithm for reconstructing a 3D structure from a given 2D sketch drawing (edge-vertex graph without hidden line removal) according to the user's sketch order. While previous methods reconstruct a 3D structure at once, the proposed method progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.11
• /
• pp.73-82
• /
• 2014

The LM algorithm is used in solving the least square problem in a non linear system, and is used in various fields. However, in cases the applied field's target functionis complicated and high-dimensional, it takes a lot of time solving the inner matrix and vector operations. In such cases, the LM algorithm is unsuitable in embedded environment and requires a hardware accelerator. In this paper, we implemented the LM algorithm in hardware. In the implementation, we used pipeline stages to divide the target function operation, and reduced the period of data input of the matrix and vector operations in order to accelerate the speed. To measure the performance of the implemented hardware, we applied the refining fundamental matrix(RFM), which is a part of 3D reconstruction application. As a result, the implemented system showed similar performance compared to software, and the execution speed increased in a product of 74.3.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.4
• /
• pp.173-180
• /
• 2006

A key component of autonomous navigation of intelligent home robot is localization and map building with recognized features from the environment. To validate this, accurate measurement of relative location between robot and features is essential. In this paper, we proposed relative localization algorithm based on 3D reconstruction of scale invariant features of two images which are captured from two parallel cameras. We captured two images from parallel cameras which are attached in front of robot and detect scale invariant features in each image using SIFT(scale invariant feature transform). Then, we performed matching for the two image's feature points and got the relative location using 3D reconstruction for the matched points. Stereo camera needs high precision of two camera's extrinsic and matching pixels in two camera image. Because we used two cameras which are different from stereo camera and scale invariant feature point and it's easy to setup the extrinsic parameter. Furthermore, 3D reconstruction does not need any other sensor. And the results can be simultaneously used by obstacle avoidance, map building and localization. We set 20cm the distance between two camera and capture the 3frames per second. The experimental results show :t6cm maximum error in the range of less than 2m and ${\pm}15cm$ maximum error in the range of between 2m and 4m.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.2
• /
• pp.151-159
• /
• 2002

The method of accumulating a sequence of focused images is usually used for reconstruction of 3D object\\`s shape. To acquire a focused image, the conventional methods must calculate the focus measures of all pixels resulting in a long measurement time. This paper proposes a new method of reducing the computation time spent for deciding the focused pixels in the input image, which predicts the area in the image to calculate the focus measure based on a priori information on the object to be measured. The proposed algorithm estimates the area to consider in the next measurement based on the focused area in the present measurement. As the focus measure, Laplacian measure was used in this paper and the experiments have shown that the preposed algorithm may significantly reduce the calculation time. Although, as implied, this algorithm can be applied to only simple objects at this stage, advanced representation schemes will eliminate the restrictions on application domain.