• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.317-320
• /
• 2002

In this paper, an automatic histogram specification method is proposed for image enhancement, Fuzzy membership value is adopted for the representation of image histogram. The desired PDF is automatically constructed by the fuzzy membership value. Fuzzy membership value is extracted from dark membership, bright membership function and original histogram. The effectual results are demonstrated by desired PDF which meet the image enhancement requirements. The performance and effectiveness are shown by the analysis and the resultant image in comparison with histogram equalization method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.81-90
• /
• 2010

This paper presents H.264 coding schemes for multi-view video using the concept of layered depth image(LDI) representation and efficient compression technique for LDI. After converting those data to the proposed representation, we encode color, depth, and auxiliary data representing the hierarchical structure, respectively, Two kinds of preprocessing approaches are proposed for multiple color and depth components. In order to compress auxiliary data, we have employed a near lossless coding method. Finally, we have reconstructed the original viewpoints successfully from the decoded approach that is useful for dealing with multiple color and depth data simultaneously.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.7
• /
• pp.498-509
• /
• 1988

A BF(breadth-first) linear quadtree as a new data structure for image data is suggested, which enables us to compress the image data efficiently and to make operations of the compressed data easily. It is a list of path names for black nodes as the linear quadtree is. The path name for each black node of a BF linear quadtree is represented as a sequence of path codes from the root node to itself, whereas that of linear quadtree as a sequence of path codes from the root node to itself and fill characters for cut-offed path from it to any n-level node which corresponds to a pixel of an image. The BF linear quadtree provides a more efficent compression ratio than the linear quadtree does, because the former does not require redundant characters, fill characters, for the cut-offed paths. Several operations for image processing can be also implemented on this hierarchical structure efficiently, because it is composed of only the black nodes ad the linear quadtree is . In this paper, algorithms for several operations on the BF linear quadtree are defined and analyzed. Experimental results for forur image data are also given and discussed.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.10
• /
• pp.1291-1300
• /
• 2001

This article come to study the visualization representation technique of eye brain of person, basing on the ground of the dynamic graphics which is able to change the real time, manipulating the image as graphic factors of the multi-data. And the important thought in such realization is as follows ; corresponding the character points of human face and the parameter control value which obtains basing on the existing image recognition algorithm to the multi-dimensional data, synthesizing the image, it is to create the virtual image from the emotional expression according to the changing contraction expression. The proposed DyFIG system is realized that it as the completing module and we suggest the module of human face graphics which is able to express the emotional expression by manipulating and experimenting, resulting in realizing the emotional data expression description and technology.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.2931-2946
• /
• 1997

In multimedia information retrieval applications, content-based image retrieval is essential for retrieving relevant multimedia documents. The purpose of our paper is to provide effective representation and efficient retrieval of images when a pixel-level original image is automatically or manually transformaed into its iconic image containing meaningful graphic descriptions, called icon objects. For this, we first propose new spatial match representationschemes to describe spatial relationships between icon objects accurately by expressing them as rectangles, rather than as points. In order to accelerate image searching, we also design an efficient retrieval method using a two-dimensional signature file organization. Finally, we show from our experiment that the proposed representation schemes achieve better retrieval effectiveness than the 9-DLT (Direction Lower Triangular) scheme.

• Korean Journal of Child Studies
• /
• v.26 no.5
• /
• pp.297-309
• /
• 2005

This study investigated the relationship between young children's narrative representation of mother and their self-concept. Subjects were 120 children of 5 years 01d(60 boys and 60 girls) at three nursery centers located in Daejon city. The children's narrative representation of their mother was examined using the tool of Ryu & Lee(200l) based upon MSSB made by Bretherton et al(1990). And the children's self-concept was examined using the tool of Lim(1995) based upon 'I feel${\cdots}$Me feel' made by Bently & Yeatts(1974). The data were analysed by frequency, two independent t-test and Pearson's correlation with SPSS program. The young children's narrative representation of mother was positive. And there were significant correlations between the young children's narrative representations of mothers and their self-concept.

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.186-197
• /
• 2012

The purpose of the thesis is to answer the question on how the visual image content, being the original content, should be adapted to and represented as a spatial content. The thesis focuses on adaptation as the key in the conversion process of visual image content to a themed space. There are many published studies dealing with storytelling, adaptation from books to movies and TV shows, or from movies to games and vice versa. On the contrary, when it comes to adaptation from visual image content to spatial content, noticeably few studies were done on the method, and fewer studies view adaptation as the prior step of storytelling. This study first defines adaptation, and then applies the methods of Gianetty and Dudley which is further incorporated into the conversion of visual image content into a themed space. It then turns the attention to the characteristics of themed spaces. A case study highlights that a themed space is a spatial representation of the story, image and action in the visual image content, and analyze the type of adaptation made. The study results draws two conclusions; adaptation must be carried out prior to the storytelling of the spatial content; and opposed to a third-person view of the visual image content, the main factor in a themed space is first-hand experience. Thus, the thesis suggests that conversion from visual image content to themed spaces are not merely imitative but is a full range of recreation of a new content. It is expected that more detailed analyses on the particulars will lead to feasible outcome on implementing various methods of adaptation and bring about effective conversions between the visual image contents and themed spaces.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.7
• /
• pp.2390-2406
• /
• 2022

Scene text recognition has important application value and attracted the interest of plenty of researchers. At present, many methods have achieved good results, but most of the existing approaches attempt to improve the performance of scene text recognition from the image level. They have a good effect on reading regular scene texts. However, there are still many obstacles to recognizing text on low-quality images such as curved, occlusion, and blur. This exacerbates the difficulty of feature extraction because the image quality is uneven. In addition, the results of model testing are highly dependent on training data, so there is still room for improvement in scene text recognition methods. In this work, we present a natural scene text recognizer to improve the recognition performance from the feature level, which contains feature representation and feature enhancement. In terms of feature representation, we propose an efficient feature extractor combined with Representative Batch Normalization and ResNet. It reduces the dependence of the model on training data and improves the feature representation ability of different instances. In terms of feature enhancement, we use a feature enhancement network to expand the receptive field of feature maps, so that feature maps contain rich feature information. Enhanced feature representation capability helps to improve the recognition performance of the model. We conducted experiments on 7 benchmarks, which shows that this method is highly competitive in recognizing both regular and irregular texts. The method achieved top1 recognition accuracy on four benchmarks of IC03, IC13, IC15, and SVTP.

• Communications for Statistical Applications and Methods
• /
• v.8 no.2
• /
• pp.573-579
• /
• 2001

Wavelet thresholding is a method for he reduction of noise in image. Wavelet coefficients of image are correlated in local characterization. Thee correlations also appear in he original pixel representation of the image, and they do not follow from the characterizations of the wavelet transform. In this paper, we compare noise-free distributions of Bayes approach to improve the classical threshold algorithm.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.585-588
• /
• 1999

This paper concentrates on an experimental results on visual only recognition tasks using an image transform approach and HMM based recognition system. There are two approaches for extracting features of lipreading, a lip contour based approach and an image transform based one. The latter obtains a compressed representation of the image pixel values that contain the speaker's mouth results in superior lipreading performance. In addition, PCA(Principal component analysis) is used for fast algorithm. Finally, HMM recognition tasks are compared with the another.