• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.222-225
• /
• 2000

Human frequently communicate non-linguistic information with gesture. So, we must develop efficient and fast gesture recognition algorithms for more natural human-computer interaction. However, it is difficult to recognize gesture automatically because human's body is three dimensional object with very complex structure. In this paper, we suggest a method which is able to detect key frames and frame changes, and to classify image sequence into some gesture groups. Gesture is classifiable according to moving part of body. First, we detect some frames that motion areas are changed abruptly and save those frames as key frames, and then use the frames to classify sequences. We symbolize each image of classified sequence using Principal Component Analysis(PCA) and clustering algorithm since it is better to use fewer components for representation of gestures. Symbols are used as the input symbols for the Hidden Markov Model(HMM) and recognized as a gesture with probability calculation.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.177-188
• /
• 2020

The Muslim population is growing significantly in Asian countries. By conducting an experiment, this study examines the cultural differences between South Korean and Indonesian female, young adults, and their perception of hijabis who are represented in the media. The main goal of this study is to compare the perception towards hijabis in a homogenous country new to Muslims against a Muslim-majority country. Results showed that non-hijabis were deemed more physically attractive, empathetic, and enjoyable among Koreans when compared to Indonesians. Through this study, we provide a theoretical explanation using cultivation theory and (parasocial) contact hypothesisto clarify the differences between South Korea and Indonesia. Thisstudy provides a baseline of understanding to determine where both cultures are at in perceiving hijabis. Our results suggest that it will be compelling to correct media representation in order to reduce stereotypes and lead to a successful understanding of both cultures.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.3
• /
• pp.176-185
• /
• 1996

Transformin the huge size of drawings into a suitable format for CAD system and recognizng the contents of drawings are the major concerans in the automated analysis of engineering drawings. This paper proposes some methods for text/graphics separation, symbol extraction, vectorization and symbol recognition with the object of applying them to electronic cirucit drawings. We use MBR (Minimum bounding rectangle) and size of isolated region on the drawings for separating text and graphic regions. Characteristics parameters such as the number of pixels, the length of circular constant and the degree of round shape are used for extracting loop symbols and geometric structures for non-loop symbols. To recognize symbols, nearest netighbor between FD (foruier descriptor) of extractd symbols and these of classification reference symbols is used. Experimental results show that the proposed method can generate compact vector representation of extracted symbols and perform the scale change and rotation of extracted symbol using symbol vectorization. Also we achieve an efficient searching of circuit drawings.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.514-517
• /
• 2014

In this paper, alternative dynamic features for speech recognition are proposed. The goal of this work is to improve speech recognition accuracy by deriving the representation of distinctive dynamic characteristics from a speech spectrum. This work was inspired by two temporal dynamics of a speech signal. One is the highly non-stationary nature of speech, and the other is the inter-frame change of a speech spectrum. We adopt the use of a sub-frame spectrum analyzer to capture very rapid spectral changes within a speech analysis frame. In addition, we attempt to measure spectral fluctuations of a more complex manner as opposed to traditional dynamic features such as delta or double-delta. To evaluate the proposed features, speech recognition tests over smartphone environments were conducted. The experimental results show that the feature streams simply combined with the proposed features are effective for an improvement in the recognition accuracy of a hidden Markov model-based speech recognizer.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.4.2-4
• /
• 2003

In this paper, we describe how to approximate the solutions of partial differential equations by bicubic spline functions whose interpolation errors at non-grid points are smaller in general than those by linear interpolations of the original solution at grid points. We show that the bicubic spline function can be represented exactly or approximately by a fuzzy system, and that the resulting fuzzy rule table shows the contours of the solution function. Thus, the fuzzy rule table is identified as a digital image and the contours in the rule table provide approximate contours of the solution of partial differential equations. Several illustrative examples are included.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2941-2956
• /
• 2013

In this paper, we propose an effective fragile image watermarking scheme for tampering detection and content recovery. Cover image is divided into a series of non-overlapping blocks and a block mapping relationship is constructed by the secret key. Several DCT coefficients with direct current and lower frequencies of the MSBs for each block are used to generate the reference bits, and different coefficients are assigned with different bit numbers for representation according to their importance. To enhance recovery performance, authentication bits are generated by the MSBs and the reference bits, respectively. After LSB substitution hiding, the embedded watermark bits in each block consist of the information of itself and its mapping blocks. On the receiver side, all blocks with tampered MSBs can be detected and recovered using the valid extracted reference bits. Experimental results demonstrate the effectiveness of the proposed scheme.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.135-146
• /
• 2002

The so-called overapplication of Coda Neutralization in Korean, the occurrence of a neutralized consonant in a non-neutralizing environment, is often considered as evidence for serial derivation. In this paper I propose that the neutralization effect at surface is not a result of a phonological process at an intermediate level in serial derivation, but due to a constraint requiring the integrity of the morphological constituent: EDGE-INTEGRITY. It is argued that this is not reducible to an alignment constraint, but a genuine faithfulness constraint on the edge of a morphological constituent. The putative opacity related with the coda neutralization is shown to be an epiphenomenon arising from the ambisyllabic representation of a consonant at a morphological juncture, satisfying both EDGE-INTEGRITY arid Syllabic Conditions. Consonant Copy in the Jeju dialect provides further evidence for EDGE-INTEGRITY, the Only difference being that the conflict between Syllabic Conditions and EDGE-INTEGRITY is resolved by insertion of a copied consonant.

• Journal of the Korea Computer Graphics Society
• /
• v.14 no.1
• /
• pp.17-25
• /
• 2008

We proposed the method for photomosaic generation using a programmable GPU. We design vertices to generate a photomosaic through a graphics pipeline and suggest a texture representation of an image database whice is used for tile. Both the source image and the tiles are stored to texture, which are matched by a vertex shader and drawn by a fragment shader. This is much faster than several techniques which achieve the best match for each tile.

• Journal of the Korean Mathematical Society
• /
• v.42 no.2
• /
• pp.305-334
• /
• 2005

The objective of this study is to analyze the decay characteristics of the hat interpolation wavelet coefficients of some smooth functions defined in a two-dimensional space. The motivation of this research is to establish some fundamental mathematical foundations needed in justifying the adaptive multiresolution analysis of the hat-interpolation wavelet-Galerkin method. Though the hat-interpolation wavelet-Galerkin method has been successful in some classes of problems, no complete error analysis has been given yet. As an effort towards this direction, we give estimates on the decaying ratios of the wavelet coefficients at children interpolation points to the wavelet coefficient at the parent interpolation point. We also give an estimate for the difference between non-adaptively and adaptively interpolated representations.

• MALSORI
• /
• no.66
• /
• pp.105-116
• /
• 2008

In this research, we propose a speaker identification system using a kernel method which is expected to model the non-linearity of speech features well. We have been using principal component analysis (PCA) successfully, and extended to kernel PCA, which is used for many pattern recognition tasks such as face recognition. However, we cannot use kernel PCA for speaker identification directly because the storage required for the kernel matrix grows quadratically, and the computational cost grows linearly (computing eigenvector of $l{\times}l$ matrix) with the number of training vectors I. Therefore, we use greedy kernel PCA which can approximate kernel PCA with small representation error. In the experiments, we compare the accuracy of the greedy kernel PCA with the baseline Gaussian mixture models using MFCCs and PCA. As the results with limited enrollment data show, the greedy kernel PCA outperforms conventional methods.