• ETRI Journal
• /
• v.32 no.5
• /
• pp.795-800
• /
• 2010

Embedding a large vocabulary speech recognition system in mobile devices requires a reduced acoustic model obtained by eliminating redundant model parameters. In conventional optimization methods based on the minimum description length (MDL) criterion, a binary Gaussian tree is built at each state of a hidden Markov model by iteratively finding and merging similar mixture components. An optimal subset of the tree nodes is then selected to generate a downsized acoustic model. To obtain a better binary Gaussian tree by improving the process of finding the most similar Gaussian components, this paper proposes a new distance measure that exploits the difference in likelihood values for cases before and after two components are combined. The mixture weight of Gaussian components is also introduced in the component merging step. Experimental results show that the proposed method outperforms MDL-based optimization using either a Kullback-Leibler (KL) divergence or weighted KL divergence measure. The proposed method could also reduce the acoustic model size by 50% with less than a 1.5% increase in error rate compared to a baseline system.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.577-580
• /
• 1999

Padding is a technique that enables applying conventional discrete cosine transform to encode boundary blocks of arbitrarily shaped objects by assigning imaginary values to the pixels that are not included in the object. Padding prevents the increase of high frequency DCT coefficients. However, in some boundary blocks, too many padded pixels are coded due to a small portion of object pixels. To reduce the number of padded pixels and to improve coding efficiency, we propose a block merging method for texture coding. The proposed mothed searches the shape information of boundary blocks and excludes the 4$\times$4 pixels of 8$\times$8 blocks if all the 4$\times$4 pixels are in the background region, and merges the remained 4$\times$4 pixels into new 8$\times$8 blocks. Experimental results show that our proposed method yields a rate-distortion gain about 0.5~1.6㏈ compared to conventional padding method, LPE

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.313-314
• /
• 2006

Obtained disparity map from the stereo camera by using the several stereo matching algorithms carries lots of noise because of various causes. In our approach, mode filtering and noise elimination technique using the histogram and projection-based region merging methods are adopted for improving the quality of disparity map and image segmentation. The proposed algorithms are implemented in VHDL and the real-time experimentation shows the accurately divided objects.

• Journal of Korea Water Resources Association
• /
• v.49 no.3
• /
• pp.263-273
• /
• 2016

This study applied conditional merging (CM) spatial interpolation technique to obtain the satellite and in-situ composite soil moisture data. For the analysis, 24 gages of hourly in-situ data sets from the Rural Development Administration (RDA) of Korea and the satellite soil moisture data retrieved from Advanced Microwave Scanning Radiometer-Earth observing system (AMSR-E) were used. In order to verify the performance of the CM method, leave-one-out cross validation was used. The cross validation result was spatially interpolated to figure out spatial correlation of the CM method. The results derived from this study are as follow: (1) The CM method produced better soil moisture map over Korean Peninsula than AMSR-E did for the over 100 days out of total 113 days considered for the analysis. (2) The method of CM showed high correlation with gage density and better performance on the western side of Korean peninsula due to high spatial gauge density. (3) The performance of CM is not affected by the non-rainy season unlike to AMSR-E data is. Overall, the result of this study indicates that the CM method can be applied for predicting soil moisture at ungaged locations.

• Korean Journal of Remote Sensing
• /
• v.20 no.3
• /
• pp.215-225
• /
• 2004

A multistage hierarchical clustering technique, which is an unsupervised technique, was suggested in this paper for classifying large remotely-sensed imagery. The multistage algorithm consists of two stages. The 'local' segmentor of the first stage performs region-growing segmentation by employing the hierarchical clustering procedure of CN-chain with the restriction that pixels in a cluster must be spatially contiguous. The 'global' segmentor of the second stage, which has not spatial constraints for merging, clusters the segments resulting from the previous stage, using the conventional agglomerative approach. Using simulation data, the proposed method was compared with another hierarchical clustering technique based on 'mutual closest neighbor.' The experimental results show that the new approach proposed in this study considerably increases in computational efficiency for larger images with a low number of bands. The technique was then applied to classify the land-cover types using the remotely-sensed data acquired from the Korean peninsula.

• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.238-249
• /
• 2010

Flash memory has been studied as a storage medium in order to improve the performance of the system using its high computing speed in the DBMS field where frequent data access is needed. The most difficulty using the flash memory is the performance degradation and the life span shortening of flash memory coming from inefficient in-place update. Log based approaches have been studied to solve inefficient in-place update problem in the DBMS where write operations occur in smaller size of data than page frequently. However the existing log based approaches suffer from the frequent merging operations, which are the principal cause of performance deterioration. Thus is because their fixed log area management can not guarantee a sufficient space for logs. In this paper, we propose non-fixed log area management technique that can minimize the occurrence of the merging operations by promising an enough space for logs. We also suggest the cost calculation model of the optimal log sector number minimizing the system operation cost in a block. In experiment, we show that our non-fixed log area management technique can have the improved performance compared to existing approaches.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.20-32
• /
• 1996

The boundary evaluation technique for Boolean operation on non-manifold models which is regarded as the most popular and powerful method to create and modify 3-D CAD models has been developed. This technique adopted the concept of Merge and Selection in which the CSG tree for Boolean operation can be edited quickly and easily. In this method, the merged set which contains complete information about primitive models involved is created by merging primitives one by one, then the alive entities are selected following the given CSG tree. This technique can support the hybrid representation of B-rep(Boundary Representation) and CSG(Constructive Solid Geometry) tree in a unified non-manifold model data structure, and expected to be used as a basic method for many modeling problems such as data representation of form features, and the interference between them, and data representation of conceptual models in design process, etc.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.571-574
• /
• 2005

In this paper, we propose an efficient image segmentation technique for large-sized monochrome images using a hybrid approach which combines threshold and region-based techniques. First, an image is partitioned into fixed-size blocks and for each block the representative intensity is determined by averaging pixel intensities within the block. Next, the neighborhood blocks that have similar characteristics with respect to a specific threshold are merged in order to form candidate regions. Finally, those candidate regions are refined to get final target object regions by merging regions considering the spatial locality and certain criteria. We have performed experiments on images selected from various domains and showed that our technique was able to extract target object regions appropriately from most images.

• Journal of Korean Society for Geospatial Information Science
• /
• v.14 no.1 s.35
• /
• pp.21-27
• /
• 2006

Among various image fusion methods, intensity-hue-saturation(IHS) technique is capable of quickly merging the massive volumes of data. For IKONOS imagery, IHS can yield satisfactory 'spatial' enhancement but may introduce 'spectral' distortion, appearing as a change in colors between compositions of resampled and fused multispectral bands. To solve this problem a fast IHS fusion technique with spectral adjustment is presented. The experimental results demonstrate that the proposed approach can provide better performance than the conventional IHS method, in both processing speed and image quality.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.8
• /
• pp.1031-1036
• /
• 1999

A Hierarchical vector Quantization scheme is implemented and an optimal thresholding technique of quadtree segmentation for performing high quality low bit rate image compression is proposes. A mathematical model is constructed under the assumption that the standard deviations of sub-blocks are larger than or equal to the standard deviation of the upper level block which is generated by merging of sub-blocks. This thresholding technique based on the mathematical modeling allows producing about 1 dB improved performance in terms of PSNR at most ranges of bit rates over the quadtree coder, which is based on MSE for quadtree segmentation.