• Journal of KIISE:Software and Applications
• /
• v.33 no.2
• /
• pp.220-230
• /
• 2006

As the computing technique and mobile devices get developed, the demand of multimedia contents for mobile environment has been increased. The multimedia contents provided on PDA has so far been limited to the materials such as video and audio. MPEG-4 is the international standard used for supporting to properly save, communicate multimedia in formation such as video, audio, image, text and two-dimensional object, which can present various, multimedia contents by using adaptation techniques. However, since most MPEG-4 contents are not used for PDA but desktop, it seems not to be played on PDA where needs low power consumption, limited memory capability and GUI, and so on. In this paper, we propose the adaptation techniques, which can present the MPEG-4 contents on PDA, using scene composition with MPEG-4. The proposed scheme consists of three subparts: physical adaptation, variation adaptation and resource adaptation. Physical adaptation adjusts the physical difference of between the authoring environment and playback environment. Event adaptation part transforms events used for desktop to the events used for playback on PDA. The resource adaptation enables efficiency of playback to promote by using the essential information table on BIFS parser. As the proposed scheme is applied to MPEG-4 player, we see that the MPEG-4 contents are efficiently played on PDA.

• The Journal of Society for e-Business Studies
• /
• v.8 no.4
• /
• pp.69-88
• /
• 2003

In high dimensional data, most of clustering algorithms tend to degrade the performance rapidly because of nature of sparsity and amount of noise. Recently, partial dimensional clustering algorithms have been studied, which have good performance in clustering. These algorithms select the dimensional data closely related to clustering but discard the dimensional data which are not directly related to clustering in entire dimensional data. However, the traditional algorithms have some problems. At first, the algorithms employ grid based techniques but the large amount of grids make worse the performance of algorithm in terms of computational time and memory space. Secondly, the algorithms explore dimensions related to clustering using k-medoid but it is very difficult to determine the best quality of k-medoids in large amount of high dimensional data. In this paper, we propose an efficient partial dimensional clustering algorithm which is called CLIP. CLIP explores dense regions for cluster on a certain dimension. Then, the algorithm probes dense regions on a next dimension. dependent on the dense regions of the explored dimension using incremental projection. CLIP repeats these probing work in all dimensions. Clustering by Incremental projection can prune the search space largely and reduce the computational time considerably. We evaluate the performance(efficiency, effectiveness and accuracy, etc.) of the proposed algorithm compared with other algorithms using common synthetic data.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.30 no.5
• /
• pp.389-396
• /
• 2017

Peridynamics has been widely used in the dynamic fracture analysis of brittle materials. Recently, various crack patterns(compact region, floret, Hertz-type crack, etc.) of multilayered glass structures in experiments(Bless et al. 2010) were implemented with a bond-based peridynamic simulation(Bobaru et al.. 2012). The actual glass layers are bound with thin elastic interlayer material while the interlayer is missing from the peridynamic model used in the previous numerical study. In this study, the peridynamic interlayer modeling for the multilayered structures is proposed. It requires enormous computational time and memory to explicitly model very thin interlayer materials. Instead of explicit modeling, fictitious peridynamic particles are introduced for modeling interlayer materials. The computational efficiency and accuracy of the proposed peridynamic interlayer model are verified through numerical tests. Furthermore, preventing penetration scheme based on short-range interaction force is employed for the multilayered structure under compression and verified through parametric tests.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.1
• /
• pp.1-10
• /
• 2002

A space-time concatenated convolutional and differential coding scheme is employed in a multiuser direct-sequence code-division multiple-access(DS-CDMA) system. The system consists of single-user detectors (SUD), which are used to suppress multiple-access interference(MAI) with no requirement of other users' spreading codes, timing, or phase information. The space-time differential code, treated as a convolutional code of code rate 1 and memory 1, does not sacrifice the coding efficiency and has the least number of states. In addition, it brings a diversity gain through the space-time processing with a simple decoding process. The iterative process exchanges information between the differential decoder and the convolutional decoder. Numerical results show that this space-time concatenated coding scheme provides better performance and more flexibility than conventional convolutional codes in DS-CDMA systems, even in the sense of similar complexity Further study shows that the performance of this coding scheme applying to DS-CDMA systems with SUDs improves by increasing the processing gain or the number of taps of the interference suppression filter, and degrades for higher near-far interfering power or additional near-far interfering users.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.74-86
• /
• 2006

This paper proposes a robust and computationally efficient algorithm for automatic video object segmentation. For implementing the spatio-temporal segmentation, which aims for efficient combination of the motion segmentation and the color segmentation, an SOM-based hierarchical clustering method in which the segmentation process is regarded as clustering of feature vectors is employed. As results, problems of high computational complexity which required for obtaining exact segmentation results in conventional video object segmentation methods, and the performance degradation due to noise are significantly reduced. A measure of motion vector reliability which employs MRF-based MAP estimation scheme has been introduced to minimize the influence from the motion estimation error. In addition, a noise elimination scheme based on the motion reliability histogram and a clustering validity index for automatically identifying the number of objects in the scene have been applied. A cross projection method for effective object tracking and a dynamic memory to maintain temporal coherency have been introduced as well. A set of experiments has been conducted over several video sequences to evaluate the proposed algorithm, and the efficiency in terms of computational complexity, robustness from noise, and higher segmentation accuracy of the proposed algorithm have been proved.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.2
• /
• pp.29-39
• /
• 2017

This paper presents a unified framework to efficiently and realistically simulate surface and wave foams. The framework is designed to first project 3D water particles from an underlying water solver onto 2D screen space in order to reduce the computational complexity of determining where foam particles should be generated. Because foam effects are often created primarily in fast and complicated water flows, we analyze the acceleration and curvature values to identify the areas exhibiting such flow patterns. Foam particles are emitted from the identified areas in 3D space, and each foam particle is advected according to its type, which is classified on the basis of velocity, thereby capturing the essential characteristics of foam wave motions. We improve the realism of the resulting foam by classifying it into two types: surface foam and wave foam. Wave foam is characterized by the sharp wave patterns of torrential flow s, and surface foam is characterized by a cloudy foam shape even in water with reduced motion. Based on these features, we propose a technique to correct the velocity and position of a foam particle. In addition, we propose a kernel technique using the screen space density to efficiently reduce redundant foam particles, resulting in improved overall memory efficiency without loss of visual detail in terms of foam effects. Experiments convincingly demonstrate that the proposed approach is efficient and easy to use while delivering high-quality results.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.16 no.4
• /
• pp.439-450
• /
• 2003

Flat plate system has been adopted in many buildings constructed recently because of the advantage of reduced floor heights to meet the economical and architectural demands. Structural engineers commonly use the effective beam width model(EBWM) in practical engineering for the analysis of flat plate structures. However, in many cases, when it is difficult to use the EBWM, it is necessary to use a refined finite element model for an accurate analysis. But it would take significant amount of computational time and memory if the entire building structure was subdivided with finer meshes. An efficient analytical method is proposed in this study to obtain accurate results in significantly reduced computational time. The proposed method employs super elements developed using the matrix condensation technique and fictitious beams are used in the development of super elements to enforce the compatibility at the interfaces of super elements. The stiffness degradation of flat plate system considered in the EBWM was taken into account by reducing the elastic modulus of floor slabs in this study. Static and dynamic analyses of example structures were performed and the efficiency and accuracy of the proposed method were verified by comparing the results with those of the refined finite element model and the EBWM.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.13-21
• /
• 2010

One of the most distinguished features of the DHP association rules mining algorithm is that it counts the support of hash key combinations composed of k items at phase k-1, and uses the counted support for pruning candidate large itemsets to improve performance. At this time, it is desirable for each hash key combination to have a separate count variable, where it is impossible to allocate the variables owing to memory shortage. So, the algorithm uses a direct hashing mechanism in which several hash key combinations conflict and are counted in a same hash bucket. But the direct hashing mechanism is not efficient because the distribution of hash key combinations is unvalanced by the characteristics sourced from the mining process. This paper proposes a mapped perfect hashing function which maps the region of hash key combinations into a continuous integer space for phase 3 and maximizes the efficiency of direct hashing mechanism. The results of a performance test experimented on 42 test data sets shows that the average performance improvement of the proposed hashing mechanism is 7.3% compared to the existing method, and the highest performance improvement is 16.9%. Also, it shows that the proposed method is more efficient in case the length of transactions or large itemsets are long or the number of total items is large.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.9-18
• /
• 2005

This paper proposes the color decomposition method for multi-primary display (MPD) using a 3-dimensional look-up-table (3D-LUT) in a linearized LAB space. The proposed method decomposes conventional three-primary colors into the multi-primary control values of a display device under constraints of tristimulus match. To reproduce images on the MPD, the color signals should be estimated from a device-independent color space, such as CIEXYZ and CIELAB. In this paper, the linearized LAB space is used due to its linearity and additivity in color conversion. The proposed method constructs the 3-D LUT, which contain gamut boundary information to calculate color signals of the MPD. For the image reproduction, standard RGB or CIEXYZ is transformed to the linearized LAB and then hue and chroma are computed to refer to the 3D-LUT. In the linearlized LAB space, the color signals of a gamut boundary point with the same lightness and hue of an input point are calculated. Also, color signals of a point on gray axis are calculated with the same lightness of an input. With gamut boundary points and input point, color signals of the input points are obtained with the chroma ratio divided by the chroma of the gamut boundary point. Specially, for the hue change, neighboring boundary points are employed. As a result the proposed method guarantees the continuity of color signals and computational efficiency, and requires less amount of memory.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.1
• /
• pp.9-18
• /
• 2004

This paper presents an efficient image compression method for memory reduction in multimedia processor which can be simply implemented in hardware and provides high performance. The multimedia processor, which includes processing of high-resolution images and videos, requires large memories: they are external frame memories to store frames and internal line memories for implementing some linear filters. If we can reduce those memories by adopting a simple compression method in multimedia processor, it will strengthen its cost competitiveness. There exist many standards for efficiently compressing images and videos. However, those standards are too complex for our purpose and most of them are 2-D block-based methods, which do not support raster scanned input and output. In this paper, we propose a low-complexity compression method which has good performance, can be implemented with simple hardware logic, and supports raster scan. We have adopted 1${\times}$8 Hadamard transform for simple implementation in hardware and compression efficiency. After analyzing the coefficients, we applied an adaptive thresholding and quantization. We provide some simulation results to analyze its performance and compare with the existing methods. We also provide its hardware implementation results and discuss about cost reduction effects when applied in implementing a multimedia processor.