• Smart Media Journal
• /
• v.11 no.1
• /
• pp.31-37
• /
• 2022

This paper proposes a study on applying signal processing and deep learning for sound recognition that detects sounds commonly heard in daily life (Screaming, Clapping, Crowd_clapping, Car_passing_by and Back_ground, etc.). In the proposed sound recognition, several techniques related to the spectrum of sound waves, augmentation of sound data, ensemble learning for various predictions, convolutional neural networks (CNN) deep learning, and two-dimensional (2-D) data are used for improving the recognition accuracy. The proposed sound recognition technology shows that it can accurately recognize various sounds through experiments.

• Journal of IKEEE
• /
• v.26 no.2
• /
• pp.292-298
• /
• 2022

There is a limit to improving the image quality through global processing of images taken under backlighting because too bright and dark parts are mixed in one scene. This paper introduces a method to improve the quality of a photo by making two virtual images that improve the dark and bright areas of a backlit photo, and fusing them with the original image into a Laplacian pyramid. The proposed method reduces the computational burden by using histogram stretching and gamma transformation that can be simplified with LUT when creating the two virtual images. In addition, in order to obtain a color-enhanced image, contrast conversion was performed only on the luminance using the HSV coordinate system. The proposed technique showed its effectiveness by calculating several NIQA indicators using standard image data sets.

• Korean Journal of Cognitive Science
• /
• v.27 no.4
• /
• pp.501-539
• /
• 2016

The human mind is a self-evolving system that develops along a multidimensional hierarchical pathway in response to traumatic stimulus. In absence of trauma, a mind integrated in conflict-free state is called monistic. When the monistic mind responses to a traumatic stimulus, a response polarity forms toward stimulus polarity within the mind, turning it into a bipartite structure. Dialectical interaction between the two opposites, originating from their incompatibility, creates a new third polarity in the upper dimension. Thereby, the mind turns into a trinity structure. When the interaction among the three polarities becomes optimized, the plasticity of the mind gets maximized into the "far-from-equilibrium state," and the function of three polarities is synchronized. Through this recalibration, the mind returns back to its monistic structure. If the mind with the recurred monistic structure responds to another traumatic stimulus, this cycle of hierarchical transformation repeats itself in this cyclical and fractal growth process through synchronization of basic trinity system. Applying this concept to the process of post-traumatic growth (PTG), this paper explores how the mind transforms traumatic experiences into PTG and proposes a 'PTG Clock' that shows a fundamental sequence in the development of the human mind. The PTG Clock consists of seven hierarchical phases, and each of the first six phases has two opposite sub-phases: shocked/numbed, feared/intrusive, paranoid/avoidant, obsessional/explosive, dependent/depressive, and meaningless/searching for meaning. The seventh, the synchronization phase, completes one cycle of the mind's transformation, realizing a grand trinity system, where the mind synchronizes its biological, social, and existential dimensions. At that point, the mind becomes more susceptible to not only the stimulus of its own traumatic experience but also the pain of others. Thereby, the PTG Clock sets out on a journey to another cycle of transformation in higher dimensions. The validity of this transformational process for the PTG Clock will be examined by comparing it to Horowitz's theory of stress response syndrome.

• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.109-114
• /
• 2011

We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. As is well known, IR (Intermediate Representation) optimization is an important step in a compiler backend. But unfortunately, it is difficult to detect and debug the IR optimization errors for compiler developers. So, we introduce a C level error check system for detecting the correctness of these IR transformation techniques. In our system, we first create an IR-to-C converter to translate IR to C code before and after each compiler optimization phase, respectively, since our technique is based on the Memory Comparison-based Clone(MeCC) detector which is a tool of detecting semantic equivalency in C level. MeCC accepts only C codes as its input and it uses a path-sensitive semantic-based static analyzer to estimate the memory states at exit point of each procedure, and compares memory states to determine whether the procedures are equal or not. But MeCC cannot guarantee two semantic-equivalency codes always have 100% similarity or two codes with different semantics does not get the result of 100% similarity. To increase the reliability of the results, we describe a technique which comprises how to generate C codes in IR-to-C transformation phase and how to send the optimization information to MeCC to avoid the occurrence of these unexpected problems. Our methodology is illustrated by three familiar optimizations, dead code elimination, instruction scheduling and common sub-expression elimination and our experimental results show that the C level error check system is highly reliable.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2008.05a
• /
• pp.694-698
• /
• 2008

In hydrology, it is a difficult task to deal with multivariate time series such as modeling streamflows of an entire complex river system. Normal distribution based model such as MARMA (Multivariate Autorgressive Moving average) has been a major approach for modeling the multivariate time series. There are some limitations for the normal based models. One of them might be the unfavorable data-transformation forcing that the data follow the normal distribution. Furthermore, the high dimension multivariate model requires the very large parameter matrix. As an alternative, one might be decomposing the multivariate data into independent components and modeling it individually. In 1985, Lins used Principal Component Analysis (PCA). The five scores, the decomposed data from the original data, were taken and were formulated individually. The one of the five scores were modeled with AR-2 while the others are modeled with AR-1 model. From the time series analysis using the scores of the five components, he noted "principal component time series might provide a relatively simple and meaningful alternative to conventional large MARMA models". This study is inspired from the researcher's quote to develop a multivariate simulation model. The multivariate simulation model is suggested here using Principal Component Analysis (PCA) and Independent Component Analysis (ICA). Three modeling step is applied for simulation. (1) PCA is used to decompose the correlated multivariate data into the uncorrelated data while ICA decomposes the data into independent components. Here, the autocorrelation structure of the decomposed data is still dominant, which is inherited from the data of the original domain. (2) Each component is resampled by block bootstrapping or K-nearest neighbor. (3) The resampled components bring back to original domain. From using the suggested approach one might expect that a) the simulated data are different with the historical data, b) no data transformation is required (in case of ICA), c) a complex system can be decomposed into independent component and modeled individually. The model with PCA and ICA are compared with the various statistics such as the basic statistics (mean, standard deviation, skewness, autocorrelation), and reservoir-related statistics, kernel density estimate.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.13-38
• /
• 2006

Range query is one of the most important operations for spatial objects, it retrieves all spatial objects that overlap a given query region in multi-dimensional space. The DOT(DOuble Transformation) is known as an efficient indexing methods, it transforms the MBR of a spatial object into a single numeric value using a space filling curve, and stores the value in a $B^+$-tree. The DOT index is possible to be employed as a primary index for spatial objects. However, the range query processing based on the DOT index requires much overhead for spatial transformations to get the query region in the final space. Also, the detailed range query processing method for 2-dimensional spatial objects has not been studied yet in this paper, we propose an efficient multi-dimensional range query processing technique based on the DOT index. The proposed technique exploits the regularities in the moving patterns of space filling curves to divide a query region into a set of maximal sub-legions within which space filling curves traverse without interruption. Such division reduces the number of spatial transformations required to perform the range query and thus improves the performance of range query processing. A visual simulator is developed to show the evaluation method and the performance of our technique.

• Korean Journal of Applied Biomechanics
• /
• v.19 no.4
• /
• pp.671-680
• /
• 2009

We performed a study to obtain kinematic data on the characteristics of spike serving techniques used by volleyball players, including other basic data that will be useful for in-field applications. We used three-dimensional videography to compare good tough serves and serve errors. The subjects were 3 left attackers whose spike serves were videographed (60 fileds/s). The three-dimensional coordinates were calculated using the direct linear transformation method and then analyzed using the Kwon 3D software program version 3.1. There was no difference in time elapsed. However, the vertical displacement of the center of body mass(CM) differed between the 2 types of serves: in successful serves, the CM tended to be lower, as did the maximum ball height at the time of hitting. Further, the higher the level of the hitting hand was at the moment of impact, the higher was the likelihood of scoring points. In good serves, the players tended to accelerate their CM movement just before jumping to hit the ball and descend rapidly at the moment of hitting. The hand speed along with ball velocity during the impact was proven to be higher in successful serves. Moreover, in successful serves, the shoulder angles increased to a greater extent while the elbow angles were maintained constant. This possibly resulted in faster and more precise serves. An important observation was that the angle of trunk inclination during the jump did not increase with the swing of the shoulders, muscle tendon complex.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.420-436
• /
• 2007

The choice of an effective indexing method is crucial to guarantee the performance of the spatial join operator which is heavily used in geographical information systems. The $R^*$-tree based method is renowned as one of the most representative indexing methods. In this paper, we propose an efficient spatial join technique based on the DOT(Double Transformation) index, and compare it with the spatial Join technique based on the $R^*$-tree index. The DOT index transforms the MBR of an spatial object into a single numeric value using a space filling curve, and builds the $B^+$-tree from a set of numeric values transformed as such. The DOT index is possible to be employed as a primary index for spatial objects. The proposed spatial join technique exploits the regularities in the moving patterns of space filling curves to divide a query region into a set of maximal sub-regions within which space filling curves traverse without interruption. Such division reduces the number of spatial transformations required to perform the spatial join and thus improves the performance of join processing. The experiments with the data sets of various distributions and sizes revealed that the proposed join technique is up to three times faster than the spatial join method based on the $R^*$-tree index.

• Journal of the Daesoon Academy of Sciences
• /
• v.36
• /
• pp.267-298
• /
• 2020

The purpose of the paper is to analyze the developmental background and practical approaches to the arts of the Dao (道術 dosul) in Daesoon Jinrihoe (大巡真理會) by tracing this concept back to its source and comparing and contrasting Daesoon Jinrihoe's usage of 'arts of the Dao' with the usage found in traditional Daoism. The paper is divided into a preface, conclusion, and two body sections. Especially significant discoveries appear in the second and third sections. In the second section, the Daoist concept of Alterable and Unalterable Degree Numbers (運度定數 yundudingshu, 'degree numbers' suggesting 'fate' or 'destiny') allows for a comparison between the Reordering Works of Heaven and Earth (天地公事 cheonjigongsa) from Daesoon Jinrihoe's The Canonical Scripture (典經 jeon-gyeong) and the Opening of Calamities to Save Humanity (開劫度人 kaijieduren) in Daoism. Here discourse can be provided regarding the cause of calamities (劫 'jie' in Chinese and 'geop' in Sino-Korean). Additionally examined are the deep grievances between divine beings and humans and the cosmic cycles of growth and decay as both of these relate to the reason for calamities. As for the resolving of calamities, there are two differing perspectives proposed by Daesoon Jinrihoe and traditional Daoism. Daesoon Jinrihoe believes that Kang Jeungsan (姜甑山) led changes and renewal through the Reordering Works of Heaven and Earth. In this context, clergy and laity play roles as assistants. However, Daoism emphasizes gaining merit from the recitation of scriptures and the collective participation of immortals rather than relying completely upon divine intervention from the Celestial Worthy of the Primordial State (元始天尊 yuanshi tianzun). In the third section, 'The Origin and Application of the Arts of the Dao (道術 daoshu),' analysis is provided regarding the origin and connotation of five directional generals (五方將 wufangjiang), the twenty-four generals (二十四將 ershijiang), the twenty-eight generals (二十八將 ershibajiang), and the forty-eight generals (四十八將 sishibajiang). Likewise examined is the relationship between the arts of the Dao in The Canonical Scripture and Thunder Rites in the Shen Xiao Lineage (道教神霄雷法 daojiao shenxiao leifa) of Daoism. Lastly, some points are made about the operation of two ceremonies: The Ceremony of Transformation and Pacing (遁甲步罡儀式 dunjiabugangyishi) and Divination through the Formula Disc of the Six Ren Gods (六壬式盤占卜 liuren shipanzhanbu).

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.8
• /
• pp.321-328
• /
• 2014

In this paper, we present a MapReduce-based mobility pattern mining system which can predict efficiently the next place of mobile users. It learns the mobility pattern model of each user, represented by Hidden Markov Models(HMM), from a large-scale trajectory dataset, and then predicts the next place for the user to visit by applying the learned models to the current trajectory. Our system consists of two parts: the back-end part, in which the mobility pattern models are learned for individual users, and the front-end part, where the next place for a certain user to visit is predicted based on the mobility pattern models. While the back-end part comprises of three distinct MapReduce modules for POI extraction, trajectory transformation, and mobility pattern model learning, the front-end part has two different modules for candidate route generation and next place prediction. Map and reduce functions of each module in our system were designed to utilize the underlying Hadoop infrastructure enough to maximize the parallel processing. We performed experiments to evaluate the performance of the proposed system by using a large-scale open benchmark dataset, GeoLife, and then could make sure of high performance of our system as results of the experiments.