• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1214-1221
• /
• 2005

In this paper, we propose a digital watermarking method for still images, in which the human visual system (HVS) is used in the discrete cosine transform (DCT) domain. The modulation transfer function (MTF) of the HVS model is employed to increase the invisibility of the inserted watermark in images. The proposed watermarking method is shown to be robust to several common image processing techniques, including lowpass filtering and cropping. Also, using the energy relationship of the DCT, we derive the equation that directly computes the watermark weighting factor in the DCT domain for the specified peak signal to noise ratio (PSNR) of the still image and the length of watermark to be inserted. The difference between desired PSNR and PSNR in spatial domain is within 0.07dB for the 7 test images.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.1
• /
• pp.41-46
• /
• 2006

Ubiquitous location based services, offer helpful services anytime and anywhere by using real-time location information of objects based on ubiquitous network. Particularly, autonomous mobile robots can be a solution for various applications related to ubiquitous location based services, e.g. in hospitals, for cleaning, at airports or railway stations. However, a meaningful and still unsolved problem for most applications is to develop a robust and cheap positioning system. A typical example of position measurements is dead reckoning that is well known for providing a good short-term accuracy, being inexpensive and allowing very high sampling rates. However, the measurement always has some accumulated errors because the fundamental idea of dead reckoning is the integration of incremental motion information over time. The other hand, a localization system using RFID offers absolute position of robots regardless of elapsed time. We construct an absolute positioning system based on RFID and investigate how localization technique can be enhanced by RFID through experiment to measure the location of a mobile robot. Tags are placed on the floor at 5cm intervals in the shape of square in an arbitrary space and the accuracy of position measurement is investigated . To reduce the error and the variation of error, a weighting function based on Gaussian function is used. Different weighting values are applied to position data of tags since weighting values follow Gaussian function.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.2
• /
• pp.608-616
• /
• 2018

If a general nonlinear system is linearized by the successive multiplication of the 1st and 2nd order systems, then there are four types of poles in this linearized system: the pole of the 1st order system and the equal poles, two distinct real poles, and complex conjugate pair of poles of the 2nd order system. Linear Quadratic (LQ) control is a method of designing a control law that minimizes the quadratic performance index. It has the advantage of ensuring the stability of the system and the pole placement of the root of the system by weighted matrix adjustment. LQ control by the weighted matrix can move the position of the pole of the system arbitrarily, but it is difficult to set the weighting matrix by the trial and error method. This problem can be solved using the characteristic equations of the Hamiltonian system, and if the control weighting matrix is a symmetric matrix of constants, it is possible to move several poles of the system to the desired closed loop poles by applying the control law repeatedly. The paper presents a method of calculating the state weighting matrix and the control law for moving the equal poles with Jordan blocks to two real poles using the characteristic equation of the Hamiltonian system. We express this characteristic equation with a state weighting matrix by means of a trigonometric function, and we derive the relation function (${\rho},\;{\theta}$) between the equal poles and the state weighting matrix under the condition that the two real poles are the roots of the characteristic equation. Then, we obtain the moving-range of the two real poles under the condition that the state weighting matrix becomes a positive semi-finite matrix. We calculate the state weighting matrix and the control law by substituting the two real roots selected in the moving-range into the relational function. As an example, we apply the proposed method to a simple example 3rd order system.

• Journal of Korea Multimedia Society
• /
• v.9 no.6
• /
• pp.762-772
• /
• 2006

Instance based learning algorithm is the best known lazy learner and has been successfully used in many areas such as pattern analysis, medical analysis, bioinformatics and internet applications. However, its feature weighting scheme is too naive that many other extensions are proposed. Our version of IB3 named as eXtended IBL (XIBL) improves feature weighting scheme by backward stepwise regression and its distance function by VDM family that avoids overestimating discrete valued attributes. Also, XIBL adopts leave-one-out as its noise filtering scheme. Experiments with common artificial domains show that XIBL is better than the original IBL in terms of accuracy and noise tolerance. XIBL is applied to two important applications - intrusion detection and spam mail filtering and the results are promising.

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.4
• /
• pp.88-98
• /
• 1994

A new local path planning algorithm for free-ranging robots is proposed. Considering that a laser range finder has the excellent resolution with respect to angular and distance measurements, a simple local path planning algorithm is achieved by a directional weighting method for obtaining a heading direction of nobile robot. The directional weighting method decides the heading direction of the mobile robot by estimating the attractive resultant force which is obtained by directional weighting function times range data, and testing whether the collision-free path and the copen parthway conditions are satisfied. Also, the effectiveness of the established local path planning algorithm is estimated by computer simulation in complex environment.

• Communications for Statistical Applications and Methods
• /
• v.16 no.1
• /
• pp.137-141
• /
• 2009

We study on selecting the kernel weighting function in smoothing moment conditions for dependent processes. For hypothesis testing in Generalized Method of Moments or Generalized Empirical Likelihood context, we find that smoothing moment conditions by Bartlett kernel delivers smallest size distortions based on empirical Edgeworth expansions of the long-run variance estimator.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.4
• /
• pp.78-83
• /
• 1999

This paper concerns a least square method for pattern optimization of a thinned sensor array in which the squared error between a desired pattern and a synthesized one is minimized. A weighting function is applied in the function with respect to the array visual range for a symmetric and asymmetric configuration for sensor spacing. An exponential weighting function is proposed to control the sidelobes efficiently around the mainbeam and to generate a uniform sidelobe. The resulting pattern may be employed to eliminate incoming interferences distributed uniformly around the array visual range.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.65-71
• /
• 1997

In this paper, we propose a new .mu.-controller design method using an equivalent weighting function $W_{\mu}$(s). The proposed mehtod is not guaranteed to converge to the minimum as D-K and .mu.-K iteration method. However, the robust performance problem can be converted into an equivalent $H^{\infty}$ optimization problem of unstructured uncertainty by using an equivalent weightng function $W_{\mu}$(s). Also we can find a .mu.-optimal controller iteratively using an error index $d_{\epsilon}$ of differnce between maximum singular value and .mu.-norm. And under the condition of the same order of scaling functions, the proposed method provides the .mu.-optimal controller with the degree less than that obtained by D-K iteration..

• 전자공학회논문지 IE
• /
• v.49 no.2
• /
• pp.40-45
• /
• 2012

In this paper, cooling system of power transformers is proposed for temperature optimized control. We predict the peak temperature of power transformer coils using load factors and construct a cooling system using weighting function. For the optimized temperature control for power transformer, a correlation function based on the load factor of a load current and the each temperatures for winding coils, for air and for oil is presented to predict the winding-coil peak temperature. Also, the results controlled by applying the power transformer is presented.

• Journal of information and communication convergence engineering
• /
• v.20 no.1
• /
• pp.22-30
• /
• 2022

The reinforcement learning algorithm has proven its potential in solving sequential decision-making problems under uncertainties, such as finding paths to route data packets in wireless sensor networks. With reinforcement learning, the computation of the optimum path requires careful definition of the so-called reward function, which is defined as a linear function that aggregates multiple objective functions into a single objective to compute a numerical value (reward) to be maximized. In a typical defined linear reward function, the multiple objectives to be optimized are integrated in the form of a weighted sum with fixed weighting factors for all learning agents. This study proposes a reinforcement learning -based routing protocol for wireless sensor network, where different learning agents prioritize different objective goals by assigning weighting factors to the aggregated objectives of the reward function. We assign appropriate weighting factors to the objectives in the reward function of a sensor node according to its hop-count distance to the sink node. We expect this approach to enhance the effectiveness of multi-objective reinforcement learning for wireless sensor networks with a balanced trade-off among competing parameters. Furthermore, we propose SDN (Software Defined Networks) architecture with multiple controllers for constant network monitoring to allow learning agents to adapt according to the dynamics of the network conditions. Simulation results show that our proposed scheme enhances the performance of wireless sensor network under varied conditions, such as the node density and traffic intensity, with a good trade-off among competing performance metrics.