• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.219-224
• /
• 2017

This paper is to introduce an application of face recognition algorithm in parallel. We have experiments of 25 images with different motions and simulated the image recognitions; grouping of the image vectors, image normalization, calculating average image vectors, etc. We also discuss an analysis of the related eigen-image vectors and a parallel algorithm. To develop the parallel algorithm, we propose a new type of initial matrices for eigenvalue problem. If A is a symmetric matrix, initial matrices for eigen value problem are investigated: the "optimal" one, which minimize ${\parallel}C-A{\parallel}_F$ and the "super optimal", which minimize ${\parallel}I-C^{-1}A{\parallel}_F$. In this paper, we present a general new approach to the design of an initial matrices to solving eigenvalue problem based on the new optimal investigating C with preserving the characteristic of the given matrix A. Fast all resulting can be inverted via fast transform algorithms with O(N log N) operations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.11
• /
• pp.55-65
• /
• 2015

Contrast enhancement methods for a single image applied to videos may cause flickering artifacts because these methods do not consider continuity of videos. On the other hands, methods considering the continuity of videos can reduce flickering artifacts but it may cause unnecessary fade-in/out artifacts when the intensity of videos changes abruptly. In this paper, we propose a robust method of video contrast enhancement for sudden illumination changes. The proposed method enhances each frame by Fast Gray-Level Grouping(FGLG) and considers the continuity of videos by an exponential smoothing filter. The proposed method calculates the smoothing factor of an exponential smoothing filter using a sigmoid function and applies to each frame to reduce unnecessary fade-in/out effects. In the experiment, 6 measurements are used for the performance analysis of the proposed method and traditional methods. Through the experiment. it has been shown that the proposed method demonstrates the best quantitative performance of MSSIM and Flickering score and show the adaptive enhancement under sudden illumination change through the visual quality comparison.

• Nuclear Engineering and Technology
• /
• v.46 no.1
• /
• pp.109-116
• /
• 2014

An electrical resistance tomography (ERT) technique combining the particle swarm optimization (PSO) algorithm with the Gauss-Newton method is applied to the visualization of two-phase flows. In the ERT, the electrical conductivity distribution, namely the conductivity values of pixels (numerical meshes) comprising the domain in the context of a numerical image reconstruction algorithm, is estimated with the known injected currents through the electrodes attached on the domain boundary and the measured potentials on those electrodes. In spite of many favorable characteristics of ERT such as no radiation, low cost, and high temporal resolution compared to other tomography techniques, one of the major drawbacks of ERT is low spatial resolution due to the inherent ill-posedness of conventional image reconstruction algorithms. In fact, the number of known data is much less than that of the unknowns (meshes). Recalling that binary mixtures like two-phase flows consist of only two substances with distinct electrical conductivities, this work adopts the PSO algorithm for mesh grouping to reduce the number of unknowns. In order to verify the enhanced performance of the proposed method, several numerical tests are performed. The comparison between the proposed algorithm and conventional Gauss-Newton method shows significant improvements in the quality of reconstructed images.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.671-676
• /
• 2006

A convolution with HRTF DB and the original sound is generally used to make the method of sound image localization for virtual speaker realization. But it can decline localization by the confusion between up and down or front and back directions due to the non-individual HRTF depending on each listener. In this paper, we study a virtual speaker using a new HRTF, which is grouping the HRTF around the virtual speaker to improve localization between up and down or front and back directions. To effective HRTF grouping, we decide the location and number of HRTF using informal listening test. A performance test result of virtual speaker using the grouped HRTF shows that the proposed method improves the front-back and up-down sound localization characteristics much better than the conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.757-772
• /
• 1993

This paper describes the knowledge extraction for image understanding in knowledge based system. The current set of low level processes operate on the numerical pixel arrays, to segment the image into region and to convert the image into directional image, and to calculate feature for these regions. The current set of intermedate level processes operate on the results of earlier knowledge source to build more complex representations of the data. We have grouped into thee categories : feature based classification, geometric token relation, perceptual organization and grouping.

• Journal of IKEEE
• /
• v.12 no.1
• /
• pp.51-58
• /
• 2008

This paper presents a new method for building detection and reconstruction from aerial images. In our approach, we extract the useful building location information from the generated disparity map to obtain the segmentation of interested objects and thus reduce significantly unnecessary line segment extracted in low level feature extraction step. Hypothesis selection is carried out by using undirected graph in which close cycles represent complete rooftops hypotheses, and hypothesis are finally tested to contruct building model. We test the proposed method with synthetic images generated from Avenches dataset of Ascona aerial images. The experiment result shows that the extracted 3D line segments of the buildings can be efficiently used for the task of building detection and reconstruction from aerial images.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.310-314
• /
• 2000

This paper proposes a new parallel architecture for extracting the object from binarized images using recurrent linear threshold neural networks. Binary functions are initially obtained from the existing iterative thinning algorithms, and the linear threshold neural threshold neural networks are then synthesized using the MSP term grouping algorithm. Experimental results show that the proposed architectures can be implemented easier than with other existing methods.

• Korean Institute of Interior Design Journal
• /
• v.14 no.3 s.50
• /
• pp.208-215
• /
• 2005

The purpose of this study is to analyze the relationship between the personality type and the residential evaluation & remodeling preference. The subjects of this investigation were collected through questionnaire from two hundred and twelve adult residents who live in Seoul, Korea. The collected cases are analyzed by using statistics software spss-win. The personality is classified eight types; E(extraversion), I(introversion), S(sensing), N(intuition), T(thinking), F(feeling), J(judging) and P(perceiving) in MBTI (Myers Briggs Type Indicator). By using the rotated component matrix of varimax method, the satisfaction of the actual residential conditions is classified into seven grouping factors. The preference of interior image is classified into thirteen factors. The important living patterns - activity, interest, and opinion - are classified into ten factors. And the important needs of residential remodeling are classified into twelve factors. By using the one way anova method, between these forty two grouping factors and personality type MBTI, there are analyzed several significances that will be useful in residential design and remodeling design & planning

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.7
• /
• pp.340-353
• /
• 2008

A computational color palette extraction model is introduced to describe paint brush objectively and efficiently. In this model, a color palette is defined as a minimum set of colors in which a painting can be displayed within error allowance and extracted by the two step processing of color grouping and major color extraction. The color grouping controls the resolution of colors adaptively and produces a basic color set of given painting images. The final palette is obtained from the basic color set by applying weighted k-means clustering algorithm. The extracted palettes from several famous painters are displayed in a 3-D color space to show the distinctive palette styles using RGB and CIE LAB color models individually. And the two experiments of painter classification and color transform of photographic image has been done to check the performance of the proposed method. The results shows the possibility that the proposed palette model can be a computational color analysis metric to describe the paint brush, and can be a color transform tool for computer graphics.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.6
• /
• pp.111-118
• /
• 1996

A content-based image retrieval system is designed and implemetned using the color featurees which are histogram intersection and color pairs. The preprocessor for the image retrieval manage linearly the existing HSI(hue, saturation, saturation, intensity). Hue and intensity histogram thresholding for each color attribute is performed to split the chromatic and achromatic regions respectively. Grouping te indexes produced by the histogram intersection is used to save the retrieval times. Each image is divided into the cells of 32$\times$32 pixels, and color pairs are used to represent the query during retrievals. The recall/precision of histogram intersection is 0.621/0.663 and recall/precision of color pairs is 0.438/0.536. And recall/precision of proposed method is 0.765/0.775/. It is shown that the proposed method using histogram intersection and color pairs improves the retrieval rates.