• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3C
• /
• pp.255-261
• /
• 2008

Conventional look-up table(LT) has gained a lot of speed increase in generation of digital holograms for 3D objects, but it has required an enormous memory size of the LT. In this paper, a novel approach to dramatically reduce the size of the conventional LT, still keeping its advantage of fast computational speed is proposed, which is called here a N-LT(novel look-up table) method. In the proposed method, only the fringe patterns of the center points on each image plane are pre-calculated, called elemental fringe patterns and stored in the look-up table. Then, the fringe patterns for other object points on each image plane can be obtained by simply shifting this pre-calculated elemental fringe pattern according to the displaced values from the center to those points and adding them together. Some experimental results revealed that the computational speed and the required memory size of the proposed approach are found to be 48.7 times faster than that of the ray-tracing method and 217 times smaller than that of the conventional LT method, respectively.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.1
• /
• pp.17-26
• /
• 2014

This paper presents a dynamic crack propagation algorithm based on the Moving Least Squares(MLS) difference method. The derivative approximation for the MLS difference method is derived by Taylor expansion and moving least squares procedure. The method can analyze dynamic crack problems using only node model, which is completely free from the constraint of grid or mesh structure. The dynamic equilibrium equation is integrated by the Newmark method. When a crack propagates, the MLS difference method does not need the reconstruction of mode model at every time step, instead, partial revision of nodal arrangement near the new crack tip is carried out. A crack is modeled by the visibility criterion and dynamic energy release rate is evaluated to decide the onset of crack growth together with the corresponding growth angle. Mode I and mixed mode crack propagation problems are numerically simulated and the accuracy and stability of the proposed algorithm are successfully verified through the comparison with the analytical solutions and the Element-Free Galerkin method results.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.250-255
• /
• 2003

The position of a 3-dimensional(3D) point can be measured by using calibrated stereo camera. To obtain more accurate measurement ,more accurate camera calibration is required. There are many existing methods to calibrate camera. The simple linear methods are usually not accurate due to nonlinear lens distortion. The nonlinear methods are accurate more than linear method, but it increase computational cost and good initial guess is needed. The multi step methods need to know some camera parameters of used camera. Recent years, these explicit model based camera calibration work with the development of more precise camera models involving correction of lens distortion. But these explicit model based camera calibration have disadvantages. So implicit camera calibration methods have been derived. One of the popular implicit camera calibration method is to use neural network. In this paper, we propose implicit stereo camera calibration method for 3D reconstruction using support vector machine. SVM can learn the relationship between 3D coordinate and image coordinate, and it shows the robust property with the presence of noise and lens distortion, results of simulation are shown in section 4.

• International Journal of CAD/CAM
• /
• v.5 no.1
• /
• pp.19-27
• /
• 2005

As three-dimensional range scanners make large point clouds a more common initial representation of real world objects, a need arises for algorithms that can efficiently process point sets. In this paper, we present a method for extracting smooth surfaces from dense point clouds. Given an unorganized set of points in space as input, our algorithm first uses principal component analysis to estimate the surface variation at each point. After defining conditions for determining the geometric compatibility of a point and a surface, we examine the points in order of increasing surface variation to find points whose neighborhoods can be closely approximated by a single surface. These neighborhoods become seed regions for region growing. The region growing step clusters points that are geometrically compatible with the approximating surface and refines the surface as the region grows to obtain the best approximation of the largest number of points. When no more points can be added to a region, the algorithm stores the extracted surface. Our algorithm works quickly with little user interaction and requires a fraction of the memory needed for a standard mesh data structure. To demonstrate its usefulness, we show results on large point clouds acquired from real-world objects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.855-870
• /
• 2020

Windows are key components of building facades. Detecting windows, crucial to 3D semantic reconstruction and scene parsing, is a challenging task in computer vision. Early methods try to solve window detection by using hand-crafted features and traditional classifiers. However, these methods are unable to handle the diversity of window instances in real scenes and suffer from heavy computational costs. Recently, convolutional neural networks based object detection algorithms attract much attention due to their good performances. Unfortunately, directly training them for challenging window detection cannot achieve satisfying results. In this paper, we propose an approach for window detection. It involves an improved Faster R-CNN architecture for window detection, featuring in a window region proposal network, an RoI feature fusion and a context enhancement module. Besides, a post optimization process is designed by the regular distribution of windows to refine detection results obtained by the improved deep architecture. Furthermore, we present a newly collected dataset which is the largest one for window detection in real street scenes to date. Experimental results on both existing datasets and the new dataset show that the proposed method has outstanding performance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.4
• /
• pp.91-98
• /
• 2017

Electrical impedance tomography is a nondestructive imaging technique to reconstruct unknown conductivity distribution based on applied current data and measured voltage data through an array of electrodes attached on the periphery of a domain. In this paper, an inverse method based on truncated singular value decomposition is proposed to solve the inverse problem with the generalized Tikhonov regularization and to reconstruct the conductivity distribution. In order to reduce the inverse computational time, truncated singular value decomposition is applied to the inverse term after the generalized regularization matrix is taken out from the inverse matrix term. Numerical experiments and phantom experiments have been performed to verify the performance of the proposed method.

• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.1
• /
• pp.8-16
• /
• 2012

An image obtained from a low light environment results in a low-exposure problem caused by non-ideal camera settings, i.e. aperture size and shutter speed. Of particular note, the multiple color-filter aperture (MCA) system inherently suffers from low-exposure problems and performance degradation in its image classification and registration processes due to its finite size of the apertures. In this context, this paper presents a novel method for the color enhancement of low-exposure images and its application to color shift model-based MCA system for image refocusing. Although various histogram equalization (HE) approaches have been proposed, they tend to distort the color information of the processed image due to the range limits of the histogram. The proposed color enhancement algorithm enhances the global brightness by analyzing the basic cause of the low-exposure phenomenon, and then compensates for the contrast degradation artifacts by using an adaptive histogram specification. We also apply the proposed algorithm to the preprocessing step of the refocusing technique in the MCA system to enhance the color image. The experimental results confirm that the proposed method can enhance the contrast of any low-exposure color image acquired by a conventional camera, and is suitable for commercial low-cost, high-quality imaging devices, such as consumer-grade camcorders, real-time 3D reconstruction systems, digital, and computational cameras.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.221-228
• /
• 2003

This paper presents a novel method that can identify the individual's haplotype from the given genotypes. Because of the limitation of the conventional single-locus analysis, haplotypes have gained increasing attention in the mapping of complex-disease genes. Conventionally there are two approaches which resolve the individual's haplotypes. One is the molecular haplotypings which have many potential limitations in cost and convenience. The other is the in-silico haplotypings which phase the haplotypes from the diploid genotyped populations, and are cost effective and high-throughput method. In-silico haplotyping is divided into two sub-categories - statistical and computational method. The former computes the frequencies of the common haplotypes, and then resolves the individual's haplotypes. The latter directly resolves the individual's haplotypes using the perfect phylogeny model first proposed by Dan Gusfield [7]. Our method combines two approaches in order to increase the accuracy and the running time. The individuals' haplotypes are resolved by considering the MLE (Maximum Likelihood Estimation) in the process of computing the frequencies of the common haplotypes.

• Journal of Biomedical Engineering Research
• /
• v.30 no.4
• /
• pp.279-287
• /
• 2009

Magnetic resonance electrical impedance tomography (MREIT) is a new medical imaging modality providing cross-sectional images of a conductivity distribution inside an electrically conducting object. MREIT has rapidly progressed in its theory, algorithm and experimental technique and now reached the stage of in vivo animal and human experiments. Conductivity image reconstructions in MREIT require various steps of carefully implemented numerical computations. To facilitate MREIT research, there is a pressing need for an MREIT software package with an efficient user interface. In this paper, we present an example of such a software, called CoReHA which stands for conductivity reconstructor using harmonic algorithms. It offers various computational tools including preprocessing of MREIT data, identification of boundary geometry, electrode modeling, meshing and implementation of the finite element method. Conductivity image reconstruction methods based on the harmonic $B_z$ algorithm are used to produce cross-sectional conductivity images. After summarizing basics of MREIT theory and experimental method, we describe technical details of each data processing task for conductivity image reconstructions. We pay attention to pitfalls and cautions in their numerical implementations. The presented software will be useful to researchers in the field of MREIT for simulation as well as experimental studies.

• 한국전산유체공학회:학술대회논문집
• /
• 2010.05a
• /
• pp.380-388
• /
• 2010

A thermal-hydraulic code, named CUPID, has been developed for the analysis of transient two-phase flows in nuclear reactor components. A two-fluid three-field model was used for steam-water two-phase flows. To obtain numerical solutions, the finite volume method was applied over unstructured cell-centered meshes. In steam-water two-phase flows, a phase change, i.e., evaporation of condensation, results in a great change in the flow field because of substantial density difference between liquid and vapor phases. Thus, two-phase flows are very sensitive to the local pressure that determines the phase change. This in turn puts emphasis on the accurate evaluation of local pressure gradient. This paper presents a new numerical scheme to evaluate the pressure gradient at cell centers on unstructured meshes. The results of the new scheme for a simple test function a gravity-driven cavity, and a wall boiling two-phase flow are compared with those of the previous schemes in the cupid code.