• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.75-87
• /
• 2009

We propose in this paper a novel approach to image fusion in which the fusion rule is guided by optimizing an image clarity function. A Genetic Algorithm is used to stochastically select, comparative to the clarity function, the optimum block from among the source images. A novel nested Genetic Algorithm with gifted individuals found through bombardment of genes by the mutation operator is designed and implemented. Convergence of the algorithm is analytically and empirically examined and statistically compared (MANOVA) with the canonical GA using 3 test functions commonly used in the GA literature. The resulting GA is invariant to parameters and population size, and a minimal size of 20 individuals is found to be sufficient in the tests. In the fusion application, each individual in the population is a finite sequence of discrete values that represent input blocks. Performance of the proposed technique applied to image fusion experiments, is characterized in terms of Mutual Information (MI) as the output quality measure. The method is tested with C=2 input images. The results of the proposed scheme indicate a practical and attractive alternative to current multi-focus image fusion techniques.

• Journal of KIISE
• /
• v.43 no.6
• /
• pp.621-626
• /
• 2016

Recursive query algorithm is used in many social network services, e.g., reachability queries in social networks. Recently, the size of social network data has increased as social network services evolve. As a result, it is almost impossible to use the recursive query algorithm on a single machine. In this paper, we implement recursive query on two popular in-memory distributed platforms, Spark and Twister, to solve this problem. We evaluate the performance of two implementations using 50 machines on Amazon EC2, and real-world data sets: LiveJournal and ClueWeb. The result shows that recursive query algorithm shows better performance on Spark for the Livejournal input data set with relatively high average degree, but smaller vertices. However, recursive query on Twister is superior to Spark for the ClueWeb input data set with relatively low average degree, but many vertices.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.596-600
• /
• 2010

This paper proposes hough transform-based semi-automatic vertex detection algorithm for object modeling on a mobile phone supporting touch-screens. The proposed algorithm shows fast processing time by searching the limited range of parameters for computing hough transform with a small range of ROI image. Moreover, the proposed algorithm removes bad candidates among the detected lines by selecting the two closest candidate lines from the position of user's input. After that, it accurately detects an interesting vertex without additionally required interactions by detecting an intersection point of the two lines. As a result, we believe that the proposed algorithm shows a 1.4 pixel distance error on average as a vertex detection accuracy under such conditions as a 5.7 pixel distance error on average as an inaccurate input.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.152-159
• /
• 2010

Existing character recognition algorithm recognize characters in simple conditional. It has the disadvantage that recognition rates often drop drastically when input document image has low quality, rotated text, various font or size text because of external noise or data loss. In this paper, proposes the optical character recognition algorithm which using bicubic interpolation method for the catalog retrieval when the input image has rotated text, blurred, various font and size. In this paper, applied optical character recognition algorithm consist of detection and recognition part. Detection part applied roberts and hausdorff distance algorithm for correct detection the catalog of book. Recognition part applied bicubic interpolation to interpolate data loss due to low quality, various font and size text. By the next time, applied rotation for the bicubic interpolation result image to slant proofreading. Experimental results show that proposal method can effectively improve recognition rate 6% and search-time 1.077s process result.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.583-592
• /
• 1998

In this paper, the cell loss rate is analyzed in terms of the input traffic stream of different speed in ATM network. The cell loss rate is calculated by birth-death process of Leaky-Bucket mechanism as the representative algorithm of usage parameter control. The cell loss rate assumed 2-state MMPP input process to be birth-death process by considering the character of token pool about finite capacity queue. The results from numerical analysis show that the cell loss rate decreases abruptly according to the buffer size increase. The computer simulation by SIMSCRIPT II.5 has been done and compared with on/off input source case to verify the analysis results.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.87-91
• /
• 2003

In this paper, a rotation invariant fingerprint identification system is implemented using the circular harmonic filter and phase only correlator. We extracted the phase component from input fingerprint image and correlate it with the circular harmonic filter of the reference fingerprint image by POC. The input image is obtained using a prism operating in the internal full reflection mode. Then the input image is transformed to two dimensional Fourier spectrum in optical way and the phase component is extracted using a digital system from the spectrum. Because composed of the optical system and digital algorithm, the proposed system has the advantages of the two technologies such as realtime parallel processing property of the optics and the flexibility of the digital system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1205-1223
• /
• 2018

Image enhancement is an emerging method for analyzing the images clearer for interpretation and analysis in the spatial domain. The goal of image enhancement is to serve an input image so that the resultant image is more suited to the particular application. In this paper, a novel method is proposed based on Mamdani fuzzy inference system (FIS) using multiple fuzzy membership functions. It is observed that the shape of membership function while converting the input image into the fuzzy domain is the essential important selection. Then, a set of fuzzy If-Then rule base in fuzzy domain gives the best result in image contrast enhancement. Based on a different combination of membership function shapes, a best predictive solution can be determined which can be suitable for different types of the input image as per application requirements. Our result analysis shows that the quality attributes such as PSNR, Index of Fuzziness (IOF) parameters give different performances with a selection of numbers and different sized membership function in the fuzzy domain. To get more insight, an optimization algorithm is proposed to identify the best combination of the fuzzy membership function for best image contrast enhancement.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.1
• /
• pp.51-54
• /
• 2003

The z-transform method is a basic mathematical tool in analyzing and designing digital signal processing systems for discrete input and output signals. There are may cases where the output signal is in the form of a discrete convolution sum of an input function and a designed digital processing algorithm function. It is well known that the z-transform of the convolution sum becomes the product of the two z-transforms of the input function and the digital processing function, whose proofs require the causality of the digital signal processing function in the almost all the available references. However, not all of the convolution sum functions are based on the causality. Many digital signal processing systems such as image processing system may depend not on the time information but on the spatial information, which has nothing to do with causality requirement. Thus, the application of the causality-based z-transform theorem on the convolution sum cannot be used without difficulty in this case. This paper proves the z-transform theorem on the discrete convolution sum without causality requirement, and make it possible for the theorem to be used in analysis and desing for any cases.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.3
• /
• pp.94-99
• /
• 2003

In this paper, a rotation invariant fingerprint identification system is implemented using the circular harmonic filter and phase only correlator. We extracted the phase component from input fingerprint image and correlate it with the circular harmonic filter of the reference fingerprint image by POC. The input image is obtained using a prism operating in the internal full reflection mode. Then the input image is transformed to two dimensional Fourier spectrum in optical way and the phase component is extracted using a digital system from the spectrum. Because composed of the optical system and digital algorithm, the proposed system has the advantages of the two technologies such as realtime parallel processing property of the optics and the flexibility of the digital system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.781-791
• /
• 1999

DD(Decision Diagrams) is an efficient operational data structure for an optimal expression of boolean functions. In a graph-based synthesis using DD, the goal of optimization decreases representation space for boolean functions. This paper represents boolean functions using OPKFDD(Ordered Pseudo-Kronecker Functional Decision Diagrams) for a graph-based synthesis and is based on the number of nodes as the criterion of DD size. For a property of OPKFDD that is able to select one of different decomposition types for each node, OPKFDD is variable in its size by the decomposition types selection of each node and input variable order. This paper proposes a method for generating OPKFDD efficiently from the current BDD(Binary Decision Diagram) Data structure and an algorithm for minimizing one. In the multiple output functions, the relations of each function affect the number of nodes of OPKFDD. Therefore this paper proposes a method to decide the input variable order considering the above cases. Experimental results of comparing with the current representation methods and the reordering methods for deciding input variable order are shown.