• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.560-567
• /
• 1998

This paper concerned about a imputed color printed material image in camera to decrease noise and distortion by processing median filtering with input image to identical condition. Also this paper proposed the way of compares a normal printed material with an abnormal printed material color tone with trained a learning of the error back-propagation to block classification by extracting five place from identical block(3${\times}$3) of color printed material R, G, B value. As a representative algorithm of multi-layer perceptron the error Back-propagation technique used to solve complex problems. However, the Error Back-propagation is algorithm which basically used a gradient descent method which can be converged to local minimum and the Back Propagation train include problems, and that may converge in a local minimum rather than get a global minimum. The network structure appropriate for a given problem. In this paper, a good result is obtained by improve initial condition and adjust th number of hidden layer to solve the problem of real time process, learning and train.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.114-121
• /
• 2013

BTC image compression is a simple and easy hardware implementation, is widely used in a video compression techniques required for LCD overdrive. In this paper, methods for reducing compression loss, a multi-level quantization BTC (MLQ-BTC) algorithm is proposed. The process of the MLQ-BTC algorithm is, a input image is compressed and decompressed by Quasi 8-level method and Advanced 2-level BTC method, and select the algorithm with the smallest compression loss. Simulation results show that the proposed algorithm is efficient as compared with PSNR and compression ratio of the existing BTC methods.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.535-542
• /
• 1995

In this paper we present two preconditioners for solving large sparse linear systems arising from elliptic partial differential equations on massively parallel machines, such as the CM-5. Most massively parallel machines do heavily rely on the message-passing for the interprocessor communications. but according to the current manufacturing standards the cost of communications is very high compared to that of floating point arithmetic computations. Due to this we need an algorithm which minimizes the amount of interprocessor communication on the massively parallel machines. We will show that Block SOR(Successive Over Relaxation) method coupled with the multi-coloring technique is one of such preconditioner on the massively parallel machines, by conducting experiments in the CM-5. Also, we implemented the ADI(Alternation Direction Implicit) method in the CM-5, which has been conventionally one of the most powerful parallel preconditioner. Our experiment shows that Block SOR method coupled with the multi-coloring technique could yield a speedup with 50% efficiency with the range of number of processors form 16 to 512 for a matrix with dimension 512x512. On the other hand, the ADI method shows a very poor performance.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.77-87
• /
• 2015

Parallel lines are often used to increase production rate in many manufacturing systems where the main line splits into several lines in parallel, and after some operations, they merge into a main line again. Queueing networks with finite buffers have been widely used for modeling and analyzing manufacturing systems. This paper provides an approximation technique for multi-server two-stage networks with merge configuration and blocking which will be a building block for analysis of general manufacturing systems with parallel lines and merge configuration. The main idea of the method is to decompose the original system into subsystems that have two service stations with multiple servers, two buffers and external arrivals to the second stage are allowed. The subsystems are modeled by level dependent quasi-birth-and-death (LDQBD) process.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.42 no.2
• /
• pp.71-77
• /
• 2000

A multi-region model for solute transport through saturated soils has been developed to describe preferential flow. The model consists of numerous discrete pore groups, which are characterized by a discrete dispersion coefficient, flow velocity, and porosity . The hydraulic properties for each pore group are derived from a soil's hydraluic conductivity and soil water characteristic functions . Flow in pore group is described by the classical advection-disersion equation (ADE). An implict finite difference scheme was applied to the governing equation that results in a block-tridiagonal system of equations that is very efficient and allows the soil to be divided into any number of pore groups. The numerical technique is derived from methods used to solve coupled equations in fluid dynamics problems and can also be applied to the transport of interacting solutes. The results of the model are compared to the experimental data from published papers. This paper contributes on the characteristics of the method when applied to the parallel porosity model to describe preferential flow of solutes in soil.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.10 s.340
• /
• pp.25-30
• /
• 2005

This paper generalizes the concept of the signal space detection to construct a fixed delay tree search (FDTS) detector which estimates a block of n channel symbols at a time. This technique is applicable to high speed implementation. Two approaches are discussed both of which are based on efficient signal space partitioning. In the first approach, symbol detection is performed based on a multi-class partitioning of the signal space. This approach is a generalization of binary symbol detection based on a two-class pattern classification. In the second approach, binary signal detection is combined with a look-ahead technique, resulting in a highly parallel detector architecture.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.75-88
• /
• 2008

This paper presents a spatial-level nonparametric multi-focus image fusion technique based on kernel estimates of input image blocks' underlying class-conditional probability density functions. Image fusion is approached as a classification task whose posterior class probabilities, P($wi{\mid}Bikl$), are calculated with likelihood density functions that are estimated from the training patterns. For each of the C input images Ii, the proposed method defines i classes wi and forms the fused image Z(k,l) from a decision map represented by a set of $P{\times}Q$ blocks Bikl whose features maximize the discriminant function based on the Bayesian decision principle. Performance of the proposed technique is evaluated in terms of RMSE and Mutual Information (MI) as the output quality measures. The width of the kernel functions, ${\sigma}$, were made to vary, and different kernels and block sizes were applied in performance evaluation. The proposed scheme is tested with C=2 and C=3 input images and results exhibited good performance.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.13-20
• /
• 2013

A combined DWT and DCT based watermarking technique of low frequency watermarking with weighted correction is proposed. The DWT has excellent spatial localization, frequency spread and multi-resolution characteristics, which are similar to the theoretical models of the human visual system (HVS). The DCT based watermarking techniques offer compression while DWT based watermarking techniques offer scalability. These desirable properties are used in this combined watermarking technique. In the proposed method watermark bits are embedded in the low frequency band of each DCT block of selected DWT sub-band. The weighted correction is also used to improve the imperceptibility. The extracting procedure reverses the embedding operations without the reference of the original image. Compared with the similar approach by DCT based approach and DWT based approach, the experimental results show that the proposed algorithm apparently preserves superiori mage quality and robustness under various attacks such as JPEG compression, cropping, sharping, contrast adjustments and so on.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.1-8
• /
• 2009

Cooperative diversity is a novel technique to improve diversity gains, capacity gains, and energy saving. This technique involves multiple terminals sharing resources in order to build a virtual antenna array in a distributed fashion. In this paper, we propose a multi-user cooperative diversity protocol called Relay-assisted Multiple Access Channel(R-MAC) that allows multiple source terminals to transmit their signals simultaneously and the relay terminal forwards the aggregated signal received from the source terminals to the destination terminal. The proposed protocol converts the distributed antenna channels into an effective MIMO channel by exploiting a relay, increasing both diversity gain and system throughput. We investigate the performance of the proposed protocol in terms of outage probability and diversity-multiplexing tradeoff where we assume block fading channel environment. Our simulation results show that the proposed protocol outperforms direct transmission in the high spectral efficiency regime where the conventional cooperative diversity protocols cannot outperform direct transmission.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.329-334
• /
• 2014

This paper proposes the hardware architecture of high performance multi-mode 2D forward transform for HEVC which has same number of cycles for processing any type of four TUs and yield high throughput. In order to make the original image which has high pixel and high resolution into highly compressed image effectively, the transform technique of HEVC supports 4 kinds of pixel units, TUs and it finds the optimal mode after performs each transform computation. As the proposed transform engine uses the common computation operator which is produced by analyzing the relationship among transform matrix coefficients, it can process every 4 kinds of TU mode matrix operation with 35cycles equally. The proposed transform block was designed by Verilog HDL and synthesized by using TSMC 0.18um CMOS processing technology. From the results of logic synthesis, the maximum operating frequency was 400MHz and total gate count was 214k gates which has the throughput of 10-Gpels/cycle with the $4k(3840{\times}2160)@30fps$ image.