• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.11
• /
• pp.866-875
• /
• 1991

In this paper, multi pulse excited-linear predictive coding (MPE-LPC), where the correlation eliminated residual signal is modeled by a few pules, is shown to be effective for the compression of electrocardiogram (ECG) data, and a more efficient scheme for a faithful reconstruction of ECG is proposed. The reconstruction charateristic of QRS's and P.T waves is improved using the adaptive pulse allocation (APA), and the compression ratio (CR) can be changed by controlling the mumber of modeling pulses. The performance of the proposed method was evaluated using 10 normal and 10 abnormal ECG data. The proposed method had a better performance than the variable threshold amplitude zone time epoch coding (AZTEC) algorithm and the scan-along polygonal approximation (SAPA) algorithm with the same CR. With the CR in kthe range of 8:1 to 14:1, we could compress ECG data efficiently.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.773-775
• /
• 2003

From the view point of data fusion, we integrate LIDAR data and digital aerial images to perform 3D building modeling in this study. The proposed scheme comprises two major parts: (1) building block extraction and (2) building model reconstruction. In the first step, height differences are analyzed to detect the above ground areas. Color analysis is then performed for the exclusion of tree areas. Potential building blocks are selected first followed by the refinement of building areas. In the second step, through edge detection and extracting the height information from LIDAR data, accurate 3D edges in object space is calculated. The accurate 3D edges are combined with the already developed SMS method for building modeling. LIDAR data acquired by Leica ALS 40 in Hsin-Chu Science-based Industrial Park of north Taiwan will be used in the test.

• Journal of computational fluids engineering
• /
• v.19 no.2
• /
• pp.49-57
• /
• 2014

In the present study, 2-D gas-kinetic flow solver on unstructured meshes was developed for flows from continuum to transitional regimes. The gas-kinetic BGK scheme is based on numerical solutions of the BGK simplification of the Boltzmann transport equation. In the initial reconstruction, the unstructured version of the linear interpolation is applied to compute left and right states along a cell interface. In the gas evolution step, the numerical fluxes are computed from the evaluation of the time-dependent gas distribution function around a cell interface. Two-dimensional compressible flow calculations were performed to verify the accuracy and robustness of the current gas-kinetic approach. Gas-kinetic BGK scheme was successfully applied to two-dimensional steady and unsteady flow simulations with strong contact discontinuities. Exemplary hypersonic viscous simulations have been conducted to analyze the performances of the gas-kinetic scheme. The computed results show fair agreement with other standard particle-based approaches for both continuum part and transitional part.

• Journal of information and communication convergence engineering
• /
• v.11 no.3
• /
• pp.185-189
• /
• 2013

A digital hologram generated by a computer calculation (computer-generated hologram or capture using charge-coupled device [CCD] camera) is one of the most expensive types of content, and its usage is expanding. Thus, it is highly necessary to protect the ownership of digital holograms. This paper presents an efficient visual security scheme for holographic image reconstruction with a low scrambling cost. Most recent studies on optical security concentrate their focus on security authentication using optical characteristics. However, in this paper, we propose an efficient scrambling method to protect a digital hologram. Therefore, we introduce in this paper several scrambling attempts in both the spatial domain and frequency domain on the basis of the results of analyzing the properties of the coefficients in each domain. To effectively hide the image information, 1/4, 1/256, and 1/16,384 of the original digital hologram needs to be scrambled for the spatial-domain scheme, Fresnel-domain scheme, and discrete cosine transform-domain scheme, respectively. The encryption schemes and the analyses in this paper can be expected to be useful in the research on encryption and other works on digital holograms.

• Journal of Korea Multimedia Society
• /
• v.20 no.5
• /
• pp.731-739
• /
• 2017

Distributed compressed video sensing (DCVS) is a framework that integrates both compressed sensing and distributed video coding characteristics to achieve a low complexity video sampling. In DCVS schemes, motion estimation & motion compensation is employed at the decoder side, similarly to distributed video coding (DVC), for a low-complex encoder. However, since a simple BCS-SPL algorithm is applied to a residual arising from motion estimation and compensation in conventional MC-BCS-SPL (motion compensated block compressed sensing with smoothed projected Landweber) scheme, the reconstructed visual qualities are severly degraded in Wyner-Ziv (WZ) frames. Furthermore, the scheme takes lots of iteration to reconstruct WZ frames. In this paper, the conventional MC-BCS-SPL algorithm is improved to be operated in more effective way in WZ frames. That is, first, the proposed algorithm calculates a correlation coefficient between two reference key frames and, then, by selecting adaptively the reference frame, the residual reconstruction in pixel domain is performed to the conventional BCS-SPL scheme. Experimental results show that the proposed algorithm achieves significantly better visual qualities than conventional MC-BCS-SPL algorithm, while resulting in the significant reduction of the decoding time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.25-36
• /
• 2004

This paper proposes and measures the performance of a distributed EIT (Electrical Impedance Tomography) image reconstruction algorithm which has a master-slave structure. The image construction is a computation based application of which the execute time is proportional to the cube of the unknowns. After receiving a specific frame from the master, each computing node extracts the basic elements by executing the first iteration of Kalman Filter in parallel. Then the master merges the basic element lists into one group and then performs the sequential iterations with the reduced number of unknowns. Every computing node has MATLAB functions as well as extended library implemented for the exchange of MATLAB data structure. The master implements another libraries such as threaded multiplication, partitioned inverse, and fast Jacobian to improve the speed of the serial execution part. The parallel library reduces the reconstruction time of image visualization about by half, while the distributed grouping scheme further reduces by about 12 times for the given target object when there are 4 computing nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.632-641
• /
• 2004

In this paper, a new intermediate view reconstruction method employing a stereo image rectification algorithm by which an uncalibrated input stereo image can be transformed into the calibrated one is suggested and its performance is analyzed. In the proposed method, feature point are extracted from the stereo image pair though detection of the corners and similarities between each pixel of the stereo image. And then, using these detected feature points, the moving vectors between stereo image and the epipolar line is extracted. Finally, the input stereo image is rectified by matching the extracted epipolar line between the stereo image in the horizontal direction and intermediate views are reconstructed by using these rectified stereo images. From some experiments on synthesis of the intermediate views by using three kinds of stereo image; a CCETT's stereo image of 'Man' and two stereo images of 'Face' ＆ 'Car' captured by real camera, it is analyzed that PSNRs of the intermediate views reconstructed from the calibrated image by using the proposed rectification algorithm are improved by 2.5㏈ for 'Man', 4.26㏈ for 'Pace' and 3.85㏈ for 'Car' than !hose of the uncalibrated ones. This good experimental result suggests a possibility of practical application of the unposed stereo image rectification algorithm-based intermediate view reconstruction view to the uncalibrated stereo images.

• The KIPS Transactions:PartA
• /
• v.14A no.3 s.107
• /
• pp.133-140
• /
• 2007

The SWBF(shrink-wrapped boundary face) algorithm is a recent mesh reconstruction method for constructing a surface model from a set of unorganized 3D points. In this paper, we point out the surface duplication problem of SWBF and propose an improved mesh reconstruction scheme. Our method tries to classify the non-boundary cells as the inner cell or the outer cell, and makes an initial mesh without surface duplication by adopting the improved boundary face definition. To handle the directional unbalance of surface sampling density arise in typical 3D scanners, two dimensional connectivity in the cell image is introduced and utilized. According to experiments, our method is proved to be very useful to overcome the surface duplication problem of the SWBF algorithm.

• Korean Journal of Construction Engineering and Management
• /
• v.23 no.5
• /
• pp.108-116
• /
• 2022

Started in 1989 as Public Permanent Rental Housing scheme, public rental housing lease policy is increasing target residents and supply in each government by introducing new supply types. However, public housing business entities have difficulties in expanding the supply due to cumulated deficit. The research suggested long-term public rental housing reconstruction business as a method to preserve the cumulated deficit from the previous. Minimum floor area ratio mathematical model was suggested by defining the floor area ratio of reconstruction business as minimum, since housing sales profit after reconstruction could preserve aggregated deficit, and mathematically approached by considering the traits of long-term public rental housing reconstruction. The determinant for minimum floor area ratio mathematical model comprise cumulated deficit of the existing long-term public rental housing, land size of reconstructed sale housing, housing sales price per unit area, and business cost per unit area. Minimum floor area ratio mathematical model is expected to be the milestone for supporting decision making regarding the economic part of old long-term public lease housings' reconstruction scale, and expanding housing supply within urban area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4552-4567
• /
• 2014

A (n,t,n) secret sharing scheme is to share a secret among n group members, where each member also plays a role of a dealer,and any t shares can be used to recover the secret. In this paper, we propose a strong (k,t,n) verifiable multi-secret sharing scheme, where any k out of n participants operate as dealers. The scheme realizes both threshold structure and adversary structure simultaneously, and removes a trusted third party. The secret reconstruction phase is performed using an additive homomorphism for decreasing the storage cost. Meanwhile, the scheme achieves the pre-verification property in the sense that any participant doesn't need to reveal any information about real master shares in the verification phase. We compare our proposal with the previous (n,t,n) secret sharing schemes from the perspectives of what kinds of access structures they achieve, what kinds of functionalities they support and whether heavy storage cost for secret share is required. Then it shows that our scheme takes the following advantages: (a) realizing the adversary structure, (b) allowing any k out of n participants to operate as dealers, (c) small sized secret share. Moreover, our proposed scheme is a favorable candidate to be used in many applications, such as secure multi-party computation and privacy preserving data mining, etc.