• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.240-249
• /
• 2014

According to the compressive sensing theory, it is possible to perfectly reconstruct a signal only with a fewer number of measurements than the Nyquist sampling rate if the signal is a sparse signal which satisfies a few related conditions. From practical viewpoint for image applications, it is important to reduce its computational complexity and memory burden required in reconstruction. In this regard, a Block-based Compressive Sensing (BCS) scheme with Smooth Projected Landweber (BCS-SPL) has been already introduced. However, it still has the computational complexity problem in reconstruction. In this paper, we propose a method which modifies its stopping criterion, tolerance, and convergence control to make it converge faster. Experimental results show that the proposed method requires less iterations but achieves better quality of reconstructed image than the conventional BCS-SPL.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.10
• /
• pp.593-602
• /
• 2004

A new surface reconstruction scheme for approximating the surface from a set of unorganized 3D points is proposed. Our method, called shrink-wrapped boundary face (SWBF) algorithm, produces the final surface by iteratively shrinking the initial mesh generated from the definition of the boundary faces. Proposed method surmounts the genus-0 spherical topology restriction of previous shrink-wrapping based mesh generation technique, and can be applicable to any kind of surface topology. Furthermore, SWBF is much faster than the previous one since it requires only local nearest-point-search in the shrinking process. According to experiments, it is proved to be very robust and efficient for mesh generation from unorganized points cloud.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.118-128
• /
• 2015

Compressive sensing (CS) has to face with two challenges of computational complexity reconstruction and low coding efficiency. As a solution, this paper presents a novel spatially scalable Kronecker two layer compressive sensing framework which facilitates reconstruction up to three spatial resolutions as well as much improved CS coding performance. We propose a dual-resolution sensing matrix based on the quincunx sampling grid which is applied to the base layer. This sensing matrix can provide a fast-preview of low resolution image at encoder side which is utilized for predictive coding. The enhancement layer is encoded as the residual measurement between the acquired measurement and predicted measurement data. The low resolution reconstruction is obtained from the base layer only while the high resolution image is jointly reconstructed using both two layers. Experimental results validate that the proposed scheme outperforms both conventional single layer and previous multi-resolution schemes especially at high bitrate like 2.0 bpp by 5.75dB and 5.05dB PSNR gain on average, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6A
• /
• pp.610-617
• /
• 2002

In this paper, a new intermediate view reconstruction technique by using a disparity estimation method based-on the adaptive matching window size is proposed. In the proposed method, once the feature values are extracted from the input stereo image, then the matching window size for the intermediate view reconstruction is adaptively selected in accordance with the magnitude of this feature values. That is, coarse matching is performed in the region having smaller feature values while accurate matching is carried out in the region having larger feature values by comparing with the predetermined threshold value. Accordingly, this new approach is not only able to reduce the mismatching probability of the disparity vector mostly happened in the accurate disparity estimation with a small matching window size, but is also able to reduce the blocking effect occurred in the disparity estimation with a large matching window size. Some experimental results on the 'Parts' and 'Piano' images show that the proposed method improves the PSNR about 2.32∼4.16dB and reduces the execution time to about 39.34∼65.58% than those of the conventional matching methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.2
• /
• pp.117-123
• /
• 2018

In this study, we suggest a fast image reconstruction scheme using Poisson equation from image gradient domain. In this approach, using the Poisson equation, a guided vector field is created by employing source and target images within a selected region at the first step. Next, the guided vector is used in generating the result image. We analyze the problem of reconstructing a two-dimensional function that approximates a set of desired gradients and a data term. The joined data and gradients are able to work like modifying the image gradients while staying close to the original image. Starting with this formulation, we have a screened Poisson equation known in physics. This equation leads to an efficient solution to the problem in FFT domain. It represents the spatial filters that solve the two-dimensional screened Poisson model and shows gradient scaling to be a well-defined sharpen filter that generalizes Laplace sharpening. We demonstrate the results using a discrete cosine transformation based this Poisson model.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.5
• /
• pp.1-16
• /
• 2016

In this paper, we propose and efficient curve reconstruction method based on the classical least-square fitting scheme. Specifically, given planar sample points equipped with normals, we reconstruct the objective curve as the zero set of a hierarchical implicit ZP(Zwart-Powell)-spline that can recover large holes of dataset without loosing the fine details. As regularizers, we adopted two: a Tikhonov regularizer to reduce the singularity of the linear system and a discrete Laplacian operator to smooth out the isocurves. Benchmark tests with quantitative measurements are done and our method shows much better quality than polynomial methods. Compared with the hierarchical bi-quadratic spline for datasets with holes, our method results in compatible quality but with less than 90% computational overhead.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.4
• /
• pp.36-44
• /
• 2012

Electrical impedance tomography is a relatively new imaging modality in which the internal conductivity (or resistivity) distribution of a object is reconstructed based on the injected currents and measured voltages through the electrodes placed on the surface of the object. In this paper, it is assumed that the relationship between the resistivity distribution and the resistance of electrodes is linear. From this linear relation, the weighting matrix can be obtained and modified iterative Landweber method is applied to estimate the internal resistivity distribution. Additionally, to accelerate the convergence rate and improve the spatial resolution of the reconstructed image, optimal step lengths for the iterative Landweber method are computed from the objective function in the least-square sense. The numerical experiments have been performed to illustrate the superior reconstruction performance of the proposed scheme.

• Nuclear Engineering and Technology
• /
• v.55 no.6
• /
• pp.2230-2245
• /
• 2023

KANT (KAIST Advanced Nuclear Tachygraphy) is a PWR core simulator recently developed at Korea Advance Institute of Science and Technology, which solves three-dimensional steady-state and transient multigroup neutron diffusion equations under Cartesian geometries alongside the incorporation of thermal-hydraulics feedback effect for multi-physics calculation. It utilizes the standard Nodal Expansion Method (NEM) accelerated with various Coarse Mesh Finite Difference (CMFD) methods for neutronics calculation. For thermal-hydraulics (TH) calculation, a single-phase flow model and a one-dimensional cylindrical fuel rod heat conduction model are employed. The time-dependent neutronics and TH calculations are numerically solved through an implicit Euler scheme, where a detailed coupling strategy is presented in this paper alongside a description of nodal equivalence, macroscopic depletion, and pin power reconstruction. For validation of the steady, transient, and depletion calculation with pin power reconstruction capacity of KANT, solutions for various benchmark problems are presented. The IAEA 3-D PWR and 4-group KOEBERG problems were considered for the steady-state reactor benchmark problem. For transient calculations, LMW (Lagenbuch, Maurer and Werner) LWR and NEACRP 3-D PWR benchmarks were solved, where the latter problem includes thermal-hydraulics feedback. For macroscopic depletion with pin power reconstruction, a small PWR problem modified with KAIST benchmark model was solved. For validation of the multi-physics analysis capability of KANT concerning large-sized PWRs, the BEAVRS Cycle1 benchmark has been considered. It was found that KANT solutions are accurate and consistent compared to other published works.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.2
• /
• pp.78-87
• /
• 2006

In this paper. we propose an effective mask estimation scheme for missing-feature reconstruction in order to achieve robust speech recognition under unknown noise environments. In the previous work. colored noise is used for training the mask classifer, which is generated from the entire frequency Partitioned signals. However it gives a limited performance under the restricted number of training database. To reflect the spectral events of more various background noise and improve the performance simultaneously. a new Bayesian classifier for mask estimation is proposed, which works independent of other frequency bands. In the proposed method, we employ the colored noise which is obtained by combining colored noises generated from each frequency band in order to reflect more various noise environments and mitigate the 'sparse' database problem. Combined with the cluster-based missing-feature reconstruction. the performance of the proposed method is evaluated on a task of noisy speech recognition. The results show that the proposed method has improved performance compared to the Previous method under white noise. car noise and background music conditions.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.5
• /
• pp.11-20
• /
• 2023

In this paper, we propose a novel deep learning-based motion reconstruction approach that facilitates the generation of full-body motions, including finger motions, while also enabling the online adjustment of motion generation delays. The proposed method combines the Vive Tracker with a deep learning method to achieve more accurate motion reconstruction while effectively mitigating foot skating issues through the use of an Inverse Kinematics (IK) solver. The proposed method utilizes a trained AutoEncoder to reconstruct character body motions using tracker data in real-time while offering the flexibility to adjust motion generation delays as needed. To generate hand motions suitable for the reconstructed body motion, we employ a Fully Connected Network (FCN). By combining the reconstructed body motion from the AutoEncoder with the hand motions generated by the FCN, we can generate full-body motions of characters that include hand movements. In order to alleviate foot skating issues in motions generated by deep learning-based methods, we use an IK solver. By setting the trackers located near the character's feet as end-effectors for the IK solver, our method precisely controls and corrects the character's foot movements, thereby enhancing the overall accuracy of the generated motions. Through experiments, we validate the accuracy of motion generation in the proposed deep learning-based motion reconstruction scheme, as well as the ability to adjust latency based on user input. Additionally, we assess the correction performance by comparing motions with the IK solver applied to those without it, focusing particularly on how it addresses the foot skating issue in the generated full-body motions.