• Current Optics and Photonics
• /
• v.2 no.4
• /
• pp.315-323
• /
• 2018

A new multiple-image encryption scheme that is based on a compressive ghost imaging concept along with a Fourier transform sampling principle has been proposed. This further improves the security of the scheme. The scheme adopts a Fourier transform to sample the original multiple-image information respectively, utilizing the centrosymmetric conjugation property of the spatial spectrum of the images to obtain each Fourier coefficient in the most abundant spatial frequency band. Based on this sampling principle, the multiple images to be encrypted are grouped into a combined image, and then the compressive ghost imaging algorithm is used to improve the security, which reduces the amount of information transmission and improves the information transmission rate. Due to the presence of the compressive sensing algorithm, the scheme improves the accuracy of image reconstruction.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.931-934
• /
• 2013

The weight calculation in an iterative algorithm is the most computationally costly task in computed tomography image reconstruction. In this letter, a fast algorithm to speed up the weight calculation is proposed. The classic square pixel rotation approximate calculation method for computing the weights in the iterative algorithm is first analyzed and then improved by replacing the square pixel model with a circular pixel model and the square rotation approximation with a segmentation method of a circular area. Software simulation and hardware implementation results show that our proposed scheme can not only improve the definition of the reconstructed image but also accelerate the reconstruction.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.188-190
• /
• 2012

Compressed Sensing (CS) has been developed for several years. Among many CS algorithms for image, the Block-based Compressed Sensing with Smoothed Projected Landweber (BCS-SPL) demonstrates its excellent performance in low-complexity and near-optimal reconstruction. Several noise filtering algorithms of image reconstruction have been introduced such as the Wiener or the median filters, etc. In general, each filter has its own advantages and disadvantages depending on specific coding scheme. In this paper, we show that reconstruction performance can be varied according to the choice of filter. When a sub-rate value is changed, different filter causes different effect as well. Concerning the sub-rate, an inner filter can be chosen to improve the reconstructed image quality.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.1
• /
• pp.31-38
• /
• 2019

We present an explicit numerical algorithm for surface reconstruction from unorganized points using the Gaussian filter. We construct a surface from unorganized points and solve the modified heat equation coupled with a fidelity term which keeps the given points. We apply the operator splitting method. First, instead of solving the diffusion term, we use the Gaussian filter which has the effect of diffusion. Next, we solve the fidelity term by using the fully implicit scheme. To investigate the proposed algorithm, we perform computational experiments and observe good results.

• 한국전산유체공학회:학술대회논문집
• /
• 2002.05a
• /
• pp.59-64
• /
• 2002

In this paper, the preconditioned multistage time stepping methods which are popular multigrid smoothers is implemented for the compressible Navier-Stokes calculation with full-coarsening multigrid method. The convergence characteristic of the point-Jacobi and Alternating direction line Jacobi(DDADI) preconditioners are studied. The performance of 2nd order upwind numerical fluxes such as 2nd order upwind TVD scheme and MUSCL-type linear reconstruction scheme are compared in the inviscid and viscous turbulent flow caculations.

• Nuclear Engineering and Technology
• /
• v.53 no.10
• /
• pp.3171-3181
• /
• 2021

This research serves to advance the development of engineering computational fluid dynamics (CFD) computing efficiency for the analysis of pressurized water reactor (PWR) core using rod-type fuel assemblies with mixing vanes (one kind of typical PWR core). In this research, a CFD scheme based on the reconstruction of the initial fine flow field (RIF CFD scheme) is proposed and analyzed. The RIF scheme is based on the quantitative regulation of flow velocities in the rod-type PWR core and the principle that the CFD computing efficiency can be improved greatly by a perfect initialization. In this paper, it is discovered that the RIF scheme can significantly improve the computing efficiency of the CFD computation for the rod-type PWR core. Furthermore, the RIF scheme also can reduce the computing resources needed for effective data storage of the large fluid domain in a rod-type PWR core. Moreover, a flow-ranking RIF CFD scheme is also designed based on the ranking of the flow rate, which enhances the utilization of the flow field with a closed flow rate to reconstruct the fine flow field. The flow-ranking RIF CFD scheme also proved to be very effective in improving the CFD efficiency for the rod-type PWR core.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.953-960
• /
• 2014

In Shamir's (t,n)-threshold based secret image sharing schemes, there exists a problem that the secret image can be reconstructed when an arbitrary attacker becomes aware of t secret image pieces, or t participants are malicious collusion. It is because that utilizes linear combination polynomial arithmetic operation. In order to overcome the problem, we propose a secret image sharing scheme using matrix decomposition and adversary structure. In the proposed scheme, there is no reconstruction of the secret image even when an arbitrary attacker become aware of t secret image pieces. Also, we utilize a simple matrix decomposition operation in order to improve the security of the secret image. In experiments, we show that performances of embedding capacity and image distortion ratio of the proposed scheme are superior to previous schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.2862-2878
• /
• 2020

Data Security is the most challenging area in Internet communication, where most of the secret sharing schemes are proposed for binary images. But still it lacks in providing security for data communication, especially in image transmission. Traditional visual cryptography scheme generate meaningless diwies and the reconstruction phase leads to quality degradation over the secret image. In this work, an intelligent two dimensional secret share construction scheme is proposed. A secret image is expanded into n diwies with the choice of scheme selection. By Stacking all the qualified diwies to revert the secret image without content loss and less than s^* - 1 shares could not reveal any information about the secret image. The experimental results emphasize that the proposed secret share scheme is highly secured for image transmission.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.9
• /
• pp.1317-1321
• /
• 1989

The nonuniqueness of solutions to inverse scattering problems for the reconstruction of cross sectional permitivity distributions on dielectric cylinder is illustrated in view of numerical analysis based on the spectral inverse scattering scheme with the moment-method procedures. It is also shown that some additional treatmenents such as multiple measurements, various incidences, etc. are not effective to assure the uniqueness.

• Journal of IKEEE
• /
• v.4 no.2 s.7
• /
• pp.249-256
• /
• 2000

In EIT(electrical impedance tomography), the internal resistivity(or conductivity) distribution of the unknown object is estimated using the boundary voltage data induced by different current patterns using various reconstruction algorithms. In this paper, we present a regularized modified Newton-Raphson(mNR) scheme which employs additional a priori information in the cost functional as soft constraint and the weighting matrices in the cost functional are selected based on the exponentially weighted least square criterion. The computer simulation for the 32 channels synthetic data shows that the reconstruction performance of the proposed scheme is improved compared to that of the conventional regularized mNR at the expense of slightly increased computational burden.