• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.183-186
• /
• 2000

Motion estimation technique has been used to increase video compression rates in motion video applications. One of the important algorithms to implement the motion estimation technique is search algorithm. Among many search algorithms, the H.263 adopted the Nearest Neighbors algorithm for fast search. In this paper, motion estimation block for the Nearest Neighbors algorithm is designed on FPGA and coded using VHDL and simulated under the Xilinx foundation environments. In the experiment results, we verified that the algorithm was properly designed and performed on the Xilinx FPGA(XCV300Q240)

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.1-20
• /
• 2003

A modified ABS algorithm for solving a class of singular non-linear systems, $F(x) = 0, $F\;\in \;R^n$, constructed by combining the discreted ABS algorithm and a method of Hoy and Schwetlick (1990), is presented. The second differential operation of F at a point is not required to be calculated directly in this algorithm. Q-quadratic convergence of this algorithm is given.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.167-183
• /
• 2002

A modified discretization ABS algorithm for solving a class of singular nonlinear systems, F($\chi$)=0, where $\chi$, F $\in$ $R^n$, is presented, constructed by combining a discretization ABS algorithm arid a method of Hoy and Schwetlick (1990). The second order differential operation of F at a point is not required to be calculated directly in this algorithm. Q-quadratic convergence of this algorithm is given.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.271-286
• /
• 2011

In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net $RDN^k$(B) for k > 0 has $(2n_o)^{2K}/2$ nodes and $d_0$ + k links per node, where $n_0$ and $d_0$ are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on $RDN^k$(B), k > 0, are $2^{k+1}-2+2^kT_{comm}(0)$ and $2^{k+1}-2+2^kT_{comp}(0)$, respectively, where $T_{comm}(0)$ and $T_{comp}(0)$ are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on $RDN^k$(B) is restricted on B = $Q_m$ where $Q_m$ is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in $O((m2^k)^2)$ computation steps and $O((km2^k)^2)$ communication steps, respectively.

• Journal of Korean Association for Spatial Structures
• /
• v.22 no.2
• /
• pp.39-46
• /
• 2022

Recently, machine learning is widely used to solve optimization problems in various engineering fields. In this study, machine learning is applied to development of a control algorithm for a smart control device for reduction of seismic responses. For this purpose, Deep Q-network (DQN) out of reinforcement learning algorithms was employed to develop control algorithm. A single degree of freedom (SDOF) structure with a smart tuned mass damper (TMD) was used as an example structure. A smart TMD system was composed of MR (magnetorheological) damper instead of passive damper. Reward design of reinforcement learning mainly affects the control performance of the smart TMD. Various hyper-parameters were investigated to optimize the control performance of DQN-based control algorithm. Usually, decrease of the time step for numerical simulation is desirable to increase the accuracy of simulation results. However, the numerical simulation results presented that decrease of the time step for reward calculation might decrease the control performance of DQN-based control algorithm. Therefore, a proper time step for reward calculation should be selected in a DQN training process.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.635-642
• /
• 2003

Reinforcement learning got successful results in a lot of applications such as control and scheduling. Various function approximation methods have been studied in order to improve the learning speed and to solve the shortage of storage in the standard reinforcement learning algorithm of Q-Learning. Most function approximation methods remove some special quality of reinforcement learning and need prior knowledge and preprocessing. Fuzzy Q-Learning needs preprocessing to define fuzzy variables and Local Weighted Regression uses training examples. In this paper, we propose a function approximation method, Fuzzy Q-Map that is based on on-line fuzzy clustering. Fuzzy Q-Map classifies a query state and predicts a suitable action according to the membership degree. We applied the Fuzzy Q-Map, CMAC and LWR to the mountain car problem. Fuzzy Q-Map reached the optimal prediction rate faster than CMAC and the lower prediction rate was seen than LWR that uses training example.

• Journal of Korea Multimedia Society
• /
• v.21 no.2
• /
• pp.188-198
• /
• 2018

With recent development of high-speed wide-area wireless networks and wide spread of highperformance wireless devices, the demand on seamless video streaming services in Long Term Evolution (LTE) network environments is ever increasing. To meet the demand and provide enhanced Quality of Experience (QoE) with mobile users, the Dynamic Adaptive Streaming over HTTP (DASH) has been actively studied to achieve QoE enhanced video streaming service in dynamic network environments. However, the existing DASH algorithm to select the quality of requesting video segments is based on a procedural algorithm so that it reveals a limitation to adapt its performance to dynamic network situations. To overcome this limitation this paper proposes a novel quality selection mechanism based on a Deep Q-Network (DQN) model, the DQN-based DASH ABR($DQN_{ABR}$) mechanism. The $DQN_{ABR}$ mechanism replaces the existing DASH ABR algorithm with an intelligent deep learning model which optimizes service quality to mobile users through reinforcement learning. Compared to the existing approaches, the experimental analysis shows that the proposed solution outperforms in terms of adapting to dynamic wireless network situations and improving QoE experience of end users.

• Journal of Broadcast Engineering
• /
• v.21 no.1
• /
• pp.60-65
• /
• 2016

This paper introduces the non-local means (NLM) algorithm for image denoising, and also introduces an improved algorithm which is based on the principal component analysis (PCA). To do the PCA, a covariance matrix of a given image should be evaluated first. If we let the size of neighborhood patches of the NLM S × S², and let the number of pixels Q, a matrix multiplication of the size S² × Q is required to compute a covariance matrix. According to the characteristic of images, such computation is inefficient. Therefore, this paper proposes an efficient method to compute the covariance matrix by sampling the pixels. After sampling, the covariance matrix can be computed with matrices of the size S² × floor (Width/l) × (Height/l).

• Korean Journal of Remote Sensing
• /
• v.15 no.3
• /
• pp.195-208
• /
• 1999

In the classification of satellite images, the representative of training of classes is very important factor that affects the classification accuracy. Hence, in order to improve the classification accuracy, it is required to optimize pre-classification stage which determines classification parameters rather than to develop classifiers alone. In this study, the normality of training are calculated at the preclassification stage using SPOT XS and LANDSAT TM. A correlation coefficient of multivariate Q-Q plot with 5% significance level and a variance of initial training are considered as an object function of genetic algorithm in the training normalization process. As a result of normalization of training using the genetic algorithm, it was proved that, for the study area, the mean and variance of each class shifted to the population, and the result showed the possibility of prediction of the distribution of each class.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.692-700
• /
• 2012

The WiMedia Alliance has specified a Distributed Medium Access Control (D-MAC) protocol based on UWB for high speed wireless home networks and Wireless USB. In this paper, firstly, the fair SoQ-based Distributed Reservation Protocol (DRP) for D-MAC is analyzed. And a novel SoQ-based relay transmission protocol is proposed to overcome DRP conflicts fast. In the proposed protocol, each device executes the Satisfaction of QoS (SoQ) time slot allocation algorithm independently. And, in order to give the loser device due to DRP conflicts another chance to maintain QoS resources, the proposed relay transmission protocol helps the device reserve another indirect link maintaining the required QoS resources via a relay node.