• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.585-589
• /
• 2018

Consumer demand for high quality image/video services led to growing trend in image quality enhancement study. Therefore, recent years was a period of substantial progress in this research field. Through careful observation of the image quality after processing by image enhancement algorithms, we perceived that the dark region in the image usually suffered loss of contrast to a certain extent. In this paper, the low-light stretch preprocessing algorithm is, hence, proposed to resolve the aforementioned issue. The proposed approach is evaluated qualitatively and quantitatively against the well-known histogram equalization and Photoshop curve adjustment. The evaluation results validate the efficiency and superiority of the low-light stretch over the benchmarking methods. In addition, we also propose the 255MHz-capable hardware implementation to ease the process of incorporating low-light stretch into real-time imaging systems, such as aerial surveillance and monitoring with drones and driving aiding systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.6
• /
• pp.455-466
• /
• 1990

Enalish character recognition with the neural networl algorithm has been performed. Character recognition technition techniques which are processed by software, have the limit of the recognition speed. To overcome this limit, we realize this system to hardware by using the neural network algorithm. We have designed preprocessing chip using the neural nework model, that is single layer perceptorn, in the noise elimination, smoothing, thinning and feature point extraction. These chips are implemented as a CMOS double metal 2um design rule.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1238-1243
• /
• 2007

The computational complexity for the zero-forcing (ZF)-based multiuser (MU) multiple-input multiple-output(MIMO) preprocessing matrices can be immoderately large as the number of transmit antennas or users increases. In this paper, we show that the span of singular vector space of a matrix can be obtained from the singular vectors of the parted rows of that matrix with computational saving and propose a computationally efficient recursive-algorithm for achieving the ZF-based preprocessing matrices. Analysis about the complexities shows that a new recursive-algorithm can lighten the computational load.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1998.10a
• /
• pp.69-76
• /
• 1998

Due to the drastic improvement of computer hardware and operating system, it is easy to break through the main defects of limited computer memory and processing time, etc. To keep up with this situation, this paper is focused on developing the preprocessor program with the input method based on vector graphic editor and the preprocessing technique including automatic node generation algorithm for the $\rho$-version finite element program. To develop this preprocessor program, the special data structure and the OOP(Object Oriented Programming) have been used by the Visual Basic 4.0. The Special data structure is proposed to describe the geometric data of node numberings and coordinates suitable for the $\rho$-version finite element program, which are quite different from the comvential h-version finite element program.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.5
• /
• pp.522-527
• /
• 2010

In the connected environment by network, clients shared resources as that requested the file that a server had, but P2P system is alternative because of the overload of servers. To improve the performance of this P2P system, we are studying about that. In this study, we can improve a usability for users using P2P search system, and suggest a group search algorithm based on a preprocessing search.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.27-37
• /
• 1991

A recognition algorithm for Hangul is developed by structural analysis to Hangul in this theses. Four major procedures are proposed : preprocessing, type classification, separation of consonant and vowel, recognition. In the preprocessing procedure, the thinning algorithm proposed by CHEN & HSU is applied. In the type classification procedure, thinned Hangul image is classified into one of six formal types. In the separation of consonant and vowel procedure, starting from branch-points which are existed in a vowel, character elements are separated by means of tracing branch-point pixel by pixel and comparison with proposed templates. In the same time, the vowels are recognized. In the recognition procedure, consonants are extracted from the separated Hangul character and recognized by modified Crossing method. Recognized characters are converted into KS-5601-1989 codes. The experiments show that correct recognition rate is about 80%-90% and recognition speed is about 2-3 character persecond in three types of different input data on computer with 80386 microprocessor.

• Journal of the Semiconductor & Display Technology
• /
• v.16 no.2
• /
• pp.106-109
• /
• 2017

Recently, ancient documents are actively studied and discussed. However, ancient documents has a few problems on interpretation. The antique documents are too fragile to hand over. So, some studies have been carried out using terahertz to read ancient documents without damaging them. Three techniques are necessary to read letters using terahertz. First, PPEX algorithm, which distinguishes pages. Second, TGSI technique, which distinguishes text from paper on a page. Third, CCSC algorithm, which transforms signals to letters. In this paper, we will describe the preprocessing process to facilitate the recognition of letters before applying the post processing as we mentioned above. Histogram equalization, Histogram stretching and the Sobel filter were applied to the preprocessing.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.911-917
• /
• 2017

There are generally three folds when developing neural network classifiers. They are as follows: 1) discriminant function; 2) lots of parameters in the design of classifier; and 3) high dimensional training data. Along with this viewpoint, we propose space search optimized polynomial neural network classifier (PNNC) with the aid of data preprocessing technique and simultaneous tuning strategy, which is a balance optimization strategy used in the design of PNNC when running space search optimization. Unlike the conventional probabilistic neural network classifier, the proposed neural network classifier adopts two type of polynomials for developing discriminant functions. The overall optimization of PNNC is realized with the aid of so-called structure optimization and parameter optimization with the use of simultaneous tuning strategy. Space search optimization algorithm is considered as a optimize vehicle to help the implement both structure and parameter optimization in the construction of PNNC. Furthermore, principal component analysis and linear discriminate analysis are selected as the data preprocessing techniques for PNNC. Experimental results show that the proposed neural network classifier obtains better performance in comparison with some other well-known classifiers in terms of accuracy classification rate.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.1
• /
• pp.173-180
• /
• 2009

It is difficult to predict non-stationary or chaotic time series which includes the drift and/or the non-linearity as well as uncertainty. To solve it, we propose an effective prediction method which adopts data preprocessing and multiple model TS fuzzy predictors combined with model selection mechanism. In data preprocessing procedure, the candidates of the optimal difference interval are determined based on the correlation analysis, and corresponding difference data sets are generated in order to use them as predictor input instead of the original ones because the difference data can stabilize the statistical characteristics of those time series and better reveals their implicit properties. Then, TS fuzzy predictors are constructed for multiple model bank, where k-means clustering algorithm is used for fuzzy partition of input space, and the least squares method is applied to parameter identification of fuzzy rules. Among the predictors in the model bank, the one which best minimizes the performance index is selected, and it is used for prediction thereafter. Finally, the error compensation procedure based on correlation analysis is added to improve the prediction accuracy. Some computer simulations are performed to verify the effectiveness of the proposed method.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.487-501
• /
• 2007

To achieve high resource utilization for multi-issue DSPs, production compiler commonly includes variants of iterative modulo scheduling algorithm. However, excessive cyclic data dependences, which exist in communication and media processing loops, unduly restrict modulo scheduling freedom. As a result, replicated functional units in multi-issue DSPs are often under-utilized. To address this resource under-utilization problem, our paper describes a novel compiler preprocessing strategy for effective modulo scheduling. The preprocessing strategy proposed capitalizes on two new transformations, which are referred to as cloning and dismantling. Our preprocessing strategy has been validated by an implementation for StarCore SC140 DSP compiler.