• ETRI Journal
• /
• v.39 no.4
• /
• pp.480-492
• /
• 2017

A holographic display based on a viewing window enables the converging of a reconstruction wave into a viewing window by means of an optical system. Accordingly, a user can observe a reconstructed hologram image, even with a small diffraction angle. It is very difficult to manufacture an optical system with no aberrations; thus, it is inevitable that a certain amount of wave aberrations will exist. A viewing-window-based holographic display, therefore, always includes distortions in an image reconstructed from a hologram pattern. Compensating the distortions of a reconstructed image is a very important technical issue because it can dramatically improve the performance when reconstructing a digital three-dimensional content image from a hologram pattern. We therefore propose a method for suppressing image distortion by measuring and compensating the wave aberration calculated from a Zernike polynomial, which can represent arbitrary wave aberrations. Through our experimental configuration using only numerical calculations, our proposed method decreased the reconstructed image distortion by more than 28%.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.6
• /
• pp.89-96
• /
• 1989

An improved method on texture coding, which is a part of the region growing based image coding, is presented in this paper. An image is segmented into stochastic regions which can be described as a stochastic random field, and non-stochastic ones in order to efficiently represent texture. In the texture coding and reconstruction, an autoregressive model is used for the stochastic regions, while a two-dimensional polynomial approximation is used for the non-stochastic ones. This proposed method leads to a better subjective quality, relatively higher compression ratio and shorter processing time for coding and reconstructing than the conventional method which uses only two-dimensional polynomial approximation.

• 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 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.

• 한국전산유체공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.131-134
• /
• 2005

Conventional high order interpolation schemes are limitative in several aspects mainly because they need data of neighboring cells at the reconstruction step. However, discontinuous Galerkin method and spectral volume method, two high order flux schemes which will be analyzed and compared in this paper, have an important benefit that they are not necessary to determine the flow gradients from data of neighboring cells or elements. These two schemes construct polynomial of variables within a cell so that even near wall or discontinuity, the high order does not deteriorate.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.8
• /
• pp.1418-1423
• /
• 2016

The purpose of this research is to investigate the effect of sampling frequency on the photoplethysmography (PPG) and to evaluate the performance of interpolation methods for under-sampled PPG. We generated down-sampled PPG using 10 kHz-sampled PPG then evaluated waveshape changes with correlation coefficient. Correlation coefficient was significantly decreased at 50 Hz or below sampling frequency. We interpolated the down-sampled PPG using four interpolation method-linear, nearest, cubic spline and piecewise cubic Hermitt interpolation polynomial - then evaluated interpolation performance. As a result, it was shown that PPG waveform that was sampled over 20 Hz could be reconstructed by interpolation. Among interpolation methods, cubic spline interpolation showed the highest performance. However, every interpolation method has no or less effect on 5 Hz sampled PPG.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.182-185
• /
• 2005

Satellite cameras are calibrated before launch in detail and in general, but it cannot be guaranteed that the geometry is not changing during launch and caused by thermal influence of the sun in the orbit. Modem satellite imaging systems are based on CCD-line sensors. Because of the required high sampling rate the length of used CCD-lines is limited. For reaching a sufficient swath width, some CCD-lines are combined to a longer virtual CCD-line. The images generated by the individual CCD-lines do overlap slightly and so they can be shifted in x- and y-direction in relation to a chosen reference image just based on tie points. For the alignment and difference in scale, control points are required. The resulting virtual image has only negligible errors in areas with very large difference in height caused by the difference in the location of the projection centers. Color images can be related to the joint panchromatic scenes just based on tie points. Pan-sharpened images may show only small color shifts in very mountainous areas and for moving objects. The direct sensor orientation has to be calibrated based on control points. Discrepancies in horizontal shift can only be separated from attitude discrepancies with a good three-dimensional control point distribution. For such a calibration a program based on geometric reconstruction of the sensor orientation is required. The approximations by 3D-affine transformation or direct linear transformation (DL n cannot be used. These methods do have also disadvantages for standard sensor orientation. The image orientation by geometric reconstruction can be improved by self calibration with additional parameters for the analysis and compensation of remaining systematic effects for example caused by a not linear CCD-line. The determined sensor geometry can be used for the generation? of rational polynomial coefficients, describing the sensor geometry by relations of polynomials of the ground coordinates X, Y and Z.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.50-61
• /
• 2000

Recently the stereo vision based on conics has received much attention by many authors. Conics have many features such as their matrix expression, efficient correspondence checking, abundance of conical shapes in real world. Extensions to higher algebraic curves met with limited success. Although irreducible algebraic curves are rather rare in the real world, lines and conics are abundant whose products provide good examples of higher algebraic curves. We consider plane algebraic curves of an arbitrary degree $n{\geq}2$ with a fully calibrated stereo system. We present closed form solutions to both correspondence and reconstruction problems. Let $f_1,\;f_2,\;{\pi}$ be image curves and plane and $VC_P(g)$ the cone with generator (plane) curve g and vertex P. Then the relation $VC_{O1}(f_1)\;=\;VC_{O1}(VC_{O2}(f_2)\;∩\;{\pi})$ gives polynomial equations in the coefficient $d_1,\;d_2,\;d_3$ of the plane ${\pi}$. After some manipulations, we get an extremely simple polynomial equation in a single variable whose unique real positive root plays the key role. It is then followed by evaluating $O(n^2)$ polynomials of a single variable at the root. It is in contrast to the past works which usually involve a simultaneous system of multivariate polynomial equations. We checked our algorithm using synthetic as well as real world images.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.17 no.1
• /
• pp.1-10
• /
• 2004

Adaptive finite element analysis, in which its solution error meets with the user defined allowable error, is recently used to improve the reliability of finite element analysis results. This adaptive analysis is composed of two procedures; one is the error estimation of an analysis result and the other is the reconstruction of finite elements. In the (p-method, an element size is controlled by relocating of nodal positions (r-method) and the order of an element shape function is determined by the hierarchical polynomial (p-method) corresponding to the clement solution error by the enhanced SPR. In order to show the effectiveness and the accuracy of the suggested rp-method, various numerical examples were analyzed and these analysis results were examined by comparing with those obtained by the existed methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.4
• /
• pp.379-386
• /
• 2016

Puncturing is the most common way of increasing the rate of convolutional codes. The puncturing process is done to the original code called the mother code by a specific puncturing pattern. In this article, we investigate into the question whether any convolutional code is obtainable by puncturing some (n, 1) mother codes. We present two sufficient conditions for the mother code and the puncturing pattern to satisfy in order that the punctured code is equivalent to the given (N, K) convolutional code.