• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.191-199
• /
• 2009

In this paper we present a light weighted robust Korean morphological analyzer for mobile devices such as mobile phones, smart phones, and PDA phones. Such mobile devices are not suitable for natural language interfaces for their low CPU performance and memory restriction. In order to overcome the difficulties we propose 1) an online analysis by using Key Event Handler mechanism, 2) and a robust analysis of the Korean sentences with spacing errors without its correction pre-processing. We adapt the proposed Korean analyzer to a Korean-English mobile translator, which shows 5.8% memory usage reduction and 19.0% enhancement of average response time.

• The Journal of Korean Association of Computer Education
• /
• v.17 no.5
• /
• pp.99-106
• /
• 2014

The first purpose of the present study is to investigate the way of displaying English words to facilitate phonological loops on the digital screen, and the second purpose is to test whether or not the more effective display type can increase learning rates equally in both low and high foreign language motivation group. To achieve these aims, two experiments were conducted. Experiment 1 showed that 3 times display condition generated higher performances in recall and recognition test than 1 time display condition did. In Experiment 2, we recruited high motivated group and low motivated group in foreign language learning, and assigned each member into 3 times display condition and self-pace condition. The results of Experiment 2 showed that the performance in the low motivated group was higher in the self-pace condition than in 3 times display condition, while this difference was not found in high motivated group. The present results suggest the display type increasing usage of phonological loops in digital screen environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.1987-2001
• /
• 2017

Low-density parity-check (LDPC) codes have attracted a great attention because of their excellent error correction capability with reasonably low decoding complexity. Among decoding algorithms for LDPC codes, the min-sum (MS) algorithm and its modified versions have been widely adopted due to their high efficiency in hardware implementation. In this paper, a self-adaptive MS algorithm using the difference of the first two minima is proposed for faster decoding speed and lower power consumption. Finding the first two minima is an important operation when MS-based LDPC decoders are implemented in hardware, and the found minima are often compressed using the difference of the two values to reduce interconnection complexity and memory usage. It is found that, when these difference values are bounded, decoding is not successfully terminated. Thus, the proposed method dynamically decides whether the termination-checking step will be carried out based on the difference in the two found minima. The simulation results show that the decoding speed is improved by 7%, and the power consumption is reduced by 16.34% by skipping unnecessary steps in the unsuccessful iteration without any loss in error correction performance. In addition, the synthesis results show that the hardware overhead for the proposed method is negligible.

• Journal of Institute of Convergence Technology
• /
• v.10 no.1
• /
• pp.7-12
• /
• 2020

We describe a efficient surface reconstruction method that reconstructs a 3D manifold polygonal mesh approximately passing through a set of 3D oriented points. Our algorithm includes 3D convex hull, octree data structure, signed distance function (SDF), and marching cubes. The 3D convex hull provides us with a fast computation of SDF, octree structure allows us to compute a minimal distance for SDF, and marching cubes lead to iso-surface generation with SDF. Our approach gives us flexibility in the choice of the resolution of the reconstructed surface, and it also enables to use on low-level PCs with minimal peak memory usage. Experimenting with publicly available scan data shows that we can reconstruct a polygonal mesh from point cloud of sizes varying from 10,000 ~ 1,000,000 in about 1~60 seconds.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.335-338
• /
• 2005

In this paper, we proposed a new MCTF (Motion Compensated Temporal Filtering) technique and its hardware (H/W) architecture for SVC (Scalable Video Coding). Since the proposed MCTF Kernel has a extensible architecture, it executes temporal filtering using (5,3) and (3,1) lifting operation. Also it has the same output data rate as the input, and it can continuously produce filtered frames after some latency time. Since the proposed architecture has simpler architecture than previous ones, it is easily mapped into H/W and has optimized memory usage rate and low cost.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.1814_1816
• /
• 2009

ZigBee is a technology that is being rapidly developed since its power consumption is low and the stability of its communication is high. However, documented data which is coded using conventional programming languages such as C or assembly programming language would not be able to fulfill the various requirements upon application development by ZigBee. Unified Modelling Languge (UML) could be one of the alternatives to solve this problem. UML provides a variety of diagrams by which the results of the software development can be presented visually and by which the developers can communicate more spontaneously. This paper shows the results of an ongoing study into the application of model-driven methods for ZigBee Application. Also, this paper shows that this approach is feasible by comparing memory usage, latency, and power consumption of UML modelling code with those of handwritten code.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.397-404
• /
• 2003

Dedicated-purpose embedded Java system usually takes such model that all class files are converted into a single ROM Image by the ROMizer in the host computer, and then the Java virtual machine in the embedded system executes the image. Defining the ROM Image is a very important issue for embedded system with limited memory resource and low-performance processor since the format directly influences on the memory usage and effectiveness of accessing entries in classes. In this paper we have analyzed the ROMizer and especially the format of the ROM image implemented in the simpleRTJ embedded Jana virtual machine. The analysis says that memory space can be saved up to 50% compared to the original class file and access speed exceeds up to six times with the use of the ROMizer. The result of this study will be applied to develop a more efficient ROMizer for a ROM-based embedded Java system.

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

Generally, dynamic hand gesture recognition is formed through preprocessing step, hand tracking step and hand shape detection step. In this paper, we present advanced dynamic hand gesture recognizing method that improves performance in preprocessing step and hand shape detection step. In preprocessing step, we remove noise fast by using dynamic table and detect skin color exactly on complex background for controling skin color range in skin color detection method using YCbCr color space. Especially, we increase recognizing speed in hand shape detection step through detecting Start Image and Stop Image, that are elements of dynamic hand gesture recognizing, using Guideline. Guideline is edge of input hand image and hand shape for comparing. We perform various experiments with nine web-cam video clips that are separated to complex background and simple background for dynamic hand gesture recognition method in the paper. The result of experiment shows similar recognition ratio but high recognition speed, low cpu usage, low memory usage than recognition method using learning exercise.

• The Journal of the Acoustical Society of Korea
• /
• v.41 no.1
• /
• pp.64-69
• /
• 2022

Background music is presented simultaneously with target messages. The main content should be kept intact for some time to aid decision making process. The maintenance of this information requires auditory working memory. The temporal compression of background music may often adopted due to the limitation of the presentation time. In this study, auditory working memory and decision making proces were analyzed in terms of temporal compression ratios of the background music. A total of 37 subjects of early twenties joined the study. Selected products were categorized based on eigen values of multi-dimensional scaling. Four presentation conditions were cases with no background music, background music with no compression, background music with low compression, and background music high compression. Matched reponses were analyzed through repeated ANOVA. Results showed that the high involvement product required more working memory resources. However, the increased level of usage did not always lead to the corresponding changes in decision making process. This approach may be useful in analyzing the role of time compression and working memory in consumer behaviors.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.311-317
• /
• 2011

In this paper, we proposed realtime image enhancing method on the three noise types of input images, such as haze, low contrast and back light images. Some conventional de-hazing algorithms have good performance but need large memories and high computational burdens. We proposed the efficient algorithm which not only removes the haze but also reduces memory usage and computational complexity. We implemented the realtime system by using DM6446 DSP chip, and it showed the excellent result in these three problems; haze, low contrast and back light. We implemented the system with the processing speed at 15 frames/sec.