• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.701-706
• /
• 2002

A set of color features has been efficiently used to measure the similarity of given images. However, the size of the color features is too large to implement an indexing scheme effectively. In this paper a new method is proposed to retrieve similar images using an interpolated color histogram. The idea is similar to the already reported methods that use the distributions of color histograms. The new method is different in that simplified color histograms decide the similarity between a query image and target images. In order to represent the distribution of the color histograms, the best order of interpolated polynomial has been simulated. After a histogram distribution is represented in a polynomial form, only a few number of polynomial coefficients are indexed and stored in a database as a color descriptor. The new method has been applied to real images and achieved satisfactory results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.49-58
• /
• 2006

In this paper, a curve-fitting channel estimation method is proposed for orthogonal frequency division multiplexing (OFDM) system in a time-varying frequency-selective fading channel. The method can greatly improve channel state information (CSI) estimation accuracy by performing smoothing and interpolation through consecutive curve-fitting processes in both time domain and frequency domain. It first evaluates least-squares (LS) estimates using pilot symbols and then the estimates are approximated to a polynomial with proper degree in the LS error sense, starting from one preferred domain in which pilots we densely distributed. Smoothing, interpolation, and prediction are performed subsequently to obtain CSI estimates for data transmission. The channel estimation processes are completed by smoothing and interpolating CSI estimates in the other domain once again using the channel estimates obtained in one domain. The performance of proposed method is influenced heavily on the time variation and frequency selectivity of channel and pilot arrangement. Hence, a proper degree of polynomial and an optimum approximation interval according to various system and channel conditions are required for curve-fitting. From extensive simulation results in various channel environments, we see that the proposed method performs better than the conventional methods including the optimal Wiener filtering method, in terms of the mean square error (MSE) and bit error rate (BER).

• Journal of applied mathematics & informatics
• /
• v.34 no.3_4
• /
• pp.207-220
• /
• 2016

Our goal is to construct a two-frequency-dependent formula $I_N$ which interpolates a product f of two functions with different frequencies at some N points. In the beginning, it is not clear to us that the formula $I_N$ satisfies $I_N=f$ at the points. However, it is later shown that $I_N$ satisfies the above equation. For this theoretical development, a one-frequency-dependent formula is introduced, and some of its characteristics are explained. Finally, our newly constructed formula $I_N$ is compared to the classical Lagrange interpolating polynomial and the one-frequency-dependent formula in order to show the advantage that is obtained by generating the formula depending on two frequencies.

• International Journal of Aeronautical and Space Sciences
• /
• v.18 no.2
• /
• pp.300-314
• /
• 2017

This paper examines finite rotation angle (FRA) applications for spacecraft attitude control. The coordinate transformation matrix and the attitude kinematics represented by FRAs are introduced. The interpolation techniques for the angular orientations are thoroughly investigated using the FRAs and the results are compared to those using traditional methods. The paper proposes trajectory description techniques by using extremely smooth polynomial functions of time, which can describe point-to-point attitude maneuvers in a realizable and accurate manner with the help of unique FRA features. In addition, new controller design techniques using the FRAs are developed by combining the proposed interpolation techniques with a model predictive control framework. The proposed techniques are validated through their attitude control applications for an aggressive point-to-point maneuver. Conclusively, the FRAs provide much more flexibility than quaternions and Euler angles when describing kinematics, generating trajectories, and designing attitude controllers for spacecraft.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1016-1026
• /
• 1994

In this paper, we have studied load balancing problems in distributed systems. The nodes of distributed systems exchange periodically system state information each other. The information is stored in history. Based on the information, we compute an expected load index(ELI) using a five-degree interpolation polynomial in Newton`s backward difference interpolation formula. A new location policy of dynamic load balancing systems makes use of the ELI. We show that its performance is better than that of the existing load balancing algorithm through a simulation study.

• Kyungpook Mathematical Journal
• /
• v.57 no.2
• /
• pp.287-299
• /
• 2017

In this paper, we develop an enhanced Chebyshev collocation method based on an integration scheme of the generalized Chebyshev interpolations for solving stiff initial value problems. Unlike the former error embedded Chebyshev collocation method (CCM), the enhanced scheme calculates the solution and its truncation error based on the interpolation of the derivative of the true solution and its integration. In terms of concrete convergence and stability analysis, the constructed algorithm turns out to have the $7^{th}$ convergence order and the A-stability without any loss of advantages for CCM. Throughout a numerical result, we assess the proposed method is numerically more efficient compared to existing methods.

• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2528-2530
• /
• 2004

Neural network minimization problems are often conditioned and in this contribution way to handle this will be discussed. It is shown that a better conditioned minimization problem can be obtained if the problem is separated with respect to the linear parameters. This will increase the convergence speed of the minimization. One of the most powerful uses of neural networks is in function approximation(curve fitting)[1]. A main characteristic of this solution is that function (f) to be approximated is given not explicitly but implicitly through a set of input-output pairs, named as training set, that can be easily obtained from calibration data of the measurement system. In this context, the usage of Neural Network(NN) techniques for modeling the systems behavior can provide lower interpolation errors when compared with classical methods like polynomial interpolation. This paper solve of single-variable minimization using neural network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4680-4700
• /
• 2015

Broadcast encryption is an efficient way to distribute confidential information to a set of receivers using broadcast channel. It allows the broadcaster to dynamically choose the receiver set during each encryption. However, most broadcast encryption schemes in the literature haven't taken into consideration the receiver's privacy protection, and the scanty privacy preserving solutions are often less efficient, which are not suitable for practical scenarios. In this paper, we propose an efficient dynamic anonymous broadcast encryption scheme that has the shortest ciphertext length. The scheme is constructed over the composite order bilinear groups, and adopts the Lagrange interpolation polynomial to hide the receivers' identities, which yields efficient decryption algorithm. Security proofs show that, the proposed scheme is both secure and anonymous under the threat of adaptive adversaries in standard model.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.425-426
• /
• 2006

Overdriving schemes are used to improve the response time of liquid crystal display. Typically they are implemented by using LUTs (look-up table) within an image processor. However, the size of LUT is limited by the physical memory size and system cost. In this paper, we present an improved method for LUT implementation using linear interpolation and piecewise least-square polynomial regression. Using the proposed method, the performance of LUT can be improved and memory size of that can be reduced.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.86-89
• /
• 2000

In this paper, we consider a fuzzy system representation for polynomials of two variables. The representation we use is an exact transformation of the corresponding cubic spline interpolation function. We examine some of the properties of their fuzzy rule tables md prove that the rule table is symmetric or antisymmetric depending on whether the polynomial is symmetric or antisymmetric. A few examples are included to verify our proof. These results not only provide some insights on properties of the cubic spline interpolation coefficients but also provide some help in setting up fuzzy rule tables for functions of two variables.