• IEMEK Journal of Embedded Systems and Applications
• /
• v.3 no.3
• /
• pp.158-166
• /
• 2008

These days, mobile embedded systems adopt flash memory capable of XIP feature since they can reduce memory usage, power consumption, and software load time. XIP provides direct access to ROM and flash memory for processors. However, using XIP incurs unnecessary degradation of applications' performance because direct access to ROM and flash memory shows more delay than that to main memory. In this paper, we propose a memory management framework, dynamic XIP, which can resolve the performance degradation of using XIP. Using a constrained RAM cache, dynamic XIP can dynamically change XIP region according to page access pattern to reduce performance degradation in execution time or energy consumption resulting from native XIP problem. The proposed framework consists of a page profiler gathering applications' memory access pattern using PMU and an XIP manager deciding that a page is accessed whether in main memory or in flash memory. The proposed framework is implemented and evaluated in Linux kernel. Our evaluation shows that our framework can reduce execution time at most 25% and energy consumption at most 22% compared with using XIP-only case adopted in general mobile embedded systems. Moreover, the evaluation shows that in execution time and energy consumption, our modified LRU algorithm with code page filters can reduce more than at most 90% and 80% respectively compared with applying just existing LRU algorithm to dynamic XIP.

• Journal of Korea Multimedia Society
• /
• v.25 no.10
• /
• pp.1395-1403
• /
• 2022

Lately, over 4K high definition and high dynamic range (HDR) display devices are popularized, various interpolation and HDR methods have been researched to expand the size and the dynamic range. Since most of the legacy low resolution (LR) images require both an interpolation and a HDR tone mapping methods, the two processes should be subsequently applied. Therefore, the proposed algorithm presents a HDR up-scaling algorithm using undecimated wavelet transform and Retinex method, which transfers a LR image of low dynamic range (LDR) into the high resolution (HR) with HDR. The proposed algorithm consists of an up-scaling scheme increasing the image size and a tone mapping scheme expanding the dynamic range. The up-scaling scheme uses the undecimated version of the simplest Haar wavelet analysis for the 8-directional interpolation and the change region is extracted during the analysis. This region information is utilized in controlling the surround functions' size of the proposed tone mapping using MSRCR, to enhance the pixels of around the edges that are dominant feature of the subjective image quality. As the results, the proposed algorithm can apply an up-scaling and tone mapping processes in accordance with the type of pixel.

• Journal of Internet Computing and Services
• /
• v.16 no.3
• /
• pp.21-32
• /
• 2015

Since spatio-temporal local features for video representation have become an important issue of modeless bottom-up approaches in action recognition, various methods for feature extraction and description have been proposed in many papers. In particular, BoF(bag of features) has been promised coherent recognition results. The most important part for BoF is how to represent dynamic information of actions in videos. Most of existing BoF methods consider the video as a spatio-temporal volume and describe neighboring 3D interest points as complex volumetric patches. To simplify these complex 3D methods, this paper proposes a novel method that builds BoF representation as a way to learn 2D interest points directly from video data. The basic idea of proposed method is to gather feature points not only from 2D xy spatial planes of traditional frames, but from the 2D time axis called spatio-temporal frame as well. Such spatial-temporal features are able to capture dynamic information from the action videos and are well-suited to recognize human actions without need of 3D extensions for the feature descriptors. The spatio-temporal BoF approach using SIFT and SURF feature descriptors obtains good recognition rates on a well-known actions recognition dataset. Compared with more sophisticated scheme of 3D based HoG/HoF descriptors, proposed method is easier to compute and simpler to understand.

• Journal of KIISE:Software and Applications
• /
• v.31 no.12
• /
• pp.1684-1690
• /
• 2004

This paper presents a method for classifier selection that uses distribution information of the training samples in a small region surrounding a sample. The conventional DCS-LA(Dynamic Classifier Selection - Local Accuracy) selects a classifier dynamically by comparing the local accuracy of each classifier at the test time, which inevitably requires long classification time. On the other hand, in the proposed approach, the best classifier in a local region is stored in the FSA(Feature Space Attribute) table during the training time, and the test is done by just referring to the table. Therefore, this approach enables fast classification because classification is not needed during test. Two feature space attributes are used entropy and density of k training samples around each sample. Each sample in the feature space is mapped into a point in the attribute space made by two attributes. The attribute space is divided into regular rectangular cells in which the local accuracy of each classifier is appended. The cells with associated local accuracy comprise the FSA table. During test, when a test sample is applied, the cell to which the test sample belongs is determined first by calculating the two attributes, and then, the most accurate classifier is chosen from the FSA table. To show the effectiveness of the proposed algorithm, it is compared with the conventional DCS -LA using the Elena database. The experiments show that the accuracy of the proposed algorithm is almost same as DCS-LA, but the classification time is about four times faster than that.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.10
• /
• pp.855-868
• /
• 2004

There are several types of singularities in controlling robotic manipulators: kinematic singularity, algorithmic singularity, semi-kinematic singularity, semi-algorithmic singularity, and representation singularity. The kinematic and algorithmic singularities have been investigated intensively because they are not predictable or difficult to avoid. The problem with these singularities is an unnecessary performance reduction in non-singular region and the difficulty in performance tuning. Tn this paper, we propose a method of avoiding kinematic and algorithmic singularities by applying a task reconstruction approach while maximizing the task performance by calculating singularity measures. The proposed method is implemented by removing the component approaching the singularity calculated by using singularity measure in real time. The outstanding feature of the proposed task reconstruction method (TR-method) is that it is based on a local task reconstruction as opposed to the local joint reconstruction of many other approaches. And, this method has dynamic task priority assignment feature which ensures the system stability under singular regions owing to the change of task priority. The TR-method enables us to increase the task controller gain to improve the task performance whereas this increase can destabilize the system for the conventional algorithms in real experiments. In addition, the physical meaning of tuning parameters is very straightforward. Hence, we can maximize task performance even near the singular region while simultaneously obtaining the singularity-free motion. The advantage of the proposed method is experimentally tested by using the 7-dof spatial manipulator, and the result shows that the new method improves the performance several times over the existing algorithms.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.6 no.4
• /
• pp.1130-1147
• /
• 2014

Large size ships have a very flexible construction resulting in low resonance frequencies of the structural eigen-modes. This feature increases the dynamic response of the structure on short period waves (springing) and on impulsive wave loads (whipping). This dynamic response in its turn increases both the fatigue damage and the ultimate load on the structure; these aspects illustrate the importance of including the dynamic response into the design loads for these ship types. Experiments have been carried out using a segmented scaled model of a container ship in a Seakeeping Basin. This paper describes the development of the model for these experiments; the choice was made to divide the hull into six rigid segments connected with a flexible beam. In order to model the typical feature of the open structure of the containership that the shear center is well below the keel line of the vessel, the beam was built into the model as low as possible. The model was instrumented with accelerometers and rotation rate gyroscopes on each segment, relative wave height meters and pressure gauges in the bow area. The beam was instrumented with strain gauges to measure the internal loads at the position of each of the cuts. Experiments have been carried out in regular waves at different amplitudes for the same wave period and in long crested irregular waves for a matrix of wave heights and periods. The results of the experiments are compared to results of calculations with a linear model based on potential flow theory that includes the effects of the flexural modes. Some of the tests were repeated with additional links between the segments to increase the model rigidity by several orders of magnitude, in order to compare the loads between a rigid and a flexible model.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.41-50
• /
• 2004

Since the MPEG-4 visual standard enables content-based functionalities, it is necessary to extract video objects from video sequences. Segmentation algorithms can largely be classified into two different categories: automatic segmentation and user-assisted segmentation. In this paper, we propose a new user-assisted image segmentation method based on the active contour. If we define a shape space as a set of all possible variations from the initial curve and we assume that the shape space is linear, it can be decomposed into the column space and the left null space of the shape matrix. In the proposed method, the shape space vector in the column space describes changes from the initial curve to the imaginary feature curve, and a dynamic graph search algorithm describes the detailed shape of the object in the left null space. Since we employ the shape matrix and the SUSAN operator to outline object boundaries, the proposed algorithm can ignore unwanted feature points generated by low-level image processing operations and is, therefore, applicable to images of complex background. We can also compensate for limitations of the shape matrix with a dynamic graph search algorithm.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.10
• /
• pp.503-510
• /
• 2016

FsGr model, which has been proposed recently, is an approach of accelerometer-based gesture recognition by applying DTW algorithm in two steps, which improved recognition success rate. In FsGr model, sets of similar gestures will be produced through training phase, in order to define the notion of a set of similar gestures. At the 1st attempt of gesture recognition, if the result turns out to belong to a set of similar gestures, it makes the 2nd recognition attempt to feature-strengthened parts extracted from the set of similar gestures. However, since a same gesture show drastically different characteristics according to physical traits such as body size, age, and sex, FsGr model may not be good enough to apply to multi-user environments. In this paper, we propose FsGrM model that extends FsGr model for multi-user environment and present a program which controls channel and volume of smart TV using FsGrM model.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2477-2484
• /
• 1997

Best-first heuristic search algorithm, such as $A^{\ast}$ algorithm, are one of the most important techniques used to solve many problems in artificial intelligence. A common feature of heuristic search is its high computational complexity, which prevents the search from being applied to problems is practical domains such as route-finding in road map with significantly many nodes. In this paper, several heuristic search algorithms are concerned. A new dynamic weighting heuristic method called the pat-sensitive heuristic is proposed. It is based on a dynamic weighting heuristic, which is used to improve search effort in practical domain such as admissible heuristic is not available or heuristic accuracy is poor. It's distinctive feature compared with other dynamic weighting heuristic algorithms is path-sensitive, which means that ${\omega}$(weight) is adjusted dynamically during search process in state-space search domain. For finding an optimal path, randomly scattered road-map is used as an application area.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.3
• /
• pp.395-400
• /
• 2011

In this paper, we propose an study of the facial emotion recognition considering the dynamical variation of emotional state in facial image sequences. The proposed system consists of two main step: facial image based emotional feature extraction and emotional state classification/recognition. At first, we propose a method for extracting and analyzing the emotional feature region using a combination of Active Shape Model (ASM) and Facial Action Units (FAUs). And then, it is proposed that emotional state classification and recognition method based on Hidden Markov Model (HMM) type of dynamic Bayesian network. Also, we adopt a Harmony Search (HS) algorithm based heuristic optimization procedure in a parameter learning of HMM in order to classify the emotional state more accurately. By using all these methods, we construct the emotion recognition system based on variations of the dynamic facial image sequence and make an attempt at improvement of the recognition performance.