• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.2
• /
• pp.60-69
• /
• 1998

This paper proposes a speech synthesis method using Fuzzy VQ, and then study how to make choice of fuzziness value which optimizes (controls) the performance of FVQ in order to obtain the synthesized speech which is closer to the original speech. When FVQ is used to synthesize a speech, analysis stage generates membership function values which represents the degree to which an input speech pattern matches each speech patterns in codebook, and synthesis stage reproduces a synthesized speech, using membership function values which is obtained in analysis stage, fuzziness value, and fuzzy-c-means operation. By comparsion of the performance of the FVQ and VQ synthesizer with simmulation, we show that, although the FVQ codebook size is half of a VQ codebook size, the performance of FVQ is almost equal to that of VQ. This results imply that, when Fuzzy VQ is used to obtain the same performance with that of VQ in speech synthesis, we can reduce by half of memory size at a codebook storage. And then we have found that, for the optimized FVQ with maximum SQNR in synthesized speech, the fuzziness value should be small when the variance of analysis frame is relatively large, while fuzziness value should be large, when it is small. As a results of comparsion of the speeches synthesized by VQ and FVQ in their spectrogram of frequency domain, we have found that spectrum bands(formant frequency and pitch frequency) of FVQ synthesized speech are closer to the original speech than those using VQ.

• The KIPS Transactions:PartB
• /
• v.17B no.6
• /
• pp.421-428
• /
• 2010

It takes a long time for the users to view a whole image from the image server under the low-bandwidth internet environments or in case of a big sized image. In this case, as there needs a technique that preferentially transfers a part of image, JPEG2000 offers a ROI(Region-of-Interest) coding. In ROI coding, the users see the thumbnail of image from the server and specifies some regions that they want to see first. And then if an information about the regions are informed to the server, the server preferentially transfers the regions of the image. The existing methods requested a huge time to compute the mask information, but this thesis approximately computes the regions and reduces the creating time of the ROI masks. If each code block is a mixed block which ROI and background are mixed, the proper boundary points should be acquired. Searching the edges of the block, getting the two points on the edge, to get the boundary point inside the code block, the method searches a mid point between the two edge points. The proposed method doesn't have a big difference compared to the existing methods in quality, but the processing time is more speedy than the ones.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.6
• /
• pp.1462-1470
• /
• 2015

The container BIC-code is a transport protocol for convenience in international shipping and combined transport environment. It is an identification code of a marine transport container which displays a wide variety of information including country's code. Recently, transportation through aircrafts and ships continues to rise. Thus fast and accurate processes are required in the ports to manage transportation. Accordingly, in this paper, we propose a BIC-code region extraction and recognition method using multiple thresholds. In the code recognition, applying a fixed threshold is not reasonable due to a variety of illumination conditions caused by change of weather, lightening, camera position, color of the container and so on. Thus, the proposed method selects the best recognition result at the final stage after applying multiple thresholds to recognition. For each threshold, we performs binarization, labeling, BIC-code pattern decision (horizontal or vertical pattern) by morphological close operation, and character separation from the BIC-code. Then, each characters is recognized by template matching. Finally we measure recognition confidence scores for all the thresholds and choose the best one. Experimental results show that the proposed method yields accurate recognition for the container BIC-code with robustness to illumination change.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.71-75
• /
• 2008

Many sensor operating systems have memory limitation constraint; therefore, stack memory areas of threads resides in a single memory space. Because most target platforms do not have hardware MMY (Memory Management Unit), it is difficult to protect each stack area. The method to solve this problem is to exchange original stack handling instructions in binary code for wrapper routines to protect stack area. In this exchanging phase, instruction corruption problem occurs due to difference of each instruction length between stack handling instructions and branch instructions. In this paper, we propose the algorithm to call a target routine without instruction corruption problem. This algorithm can reach a target routine by repeating branch instructions to have a short range. Our solution makes it easy to apply security patch and maintain upgrade of software of sensor node.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.36 no.10
• /
• pp.971-977
• /
• 2012

It is well known that the performance of a diesel injector is directly related to the power, emission, and fuel consumption of the diesel combustion engine. In this study, the injection response characteristics of CRDi injectors driven by a solenoid coil and a piezoceramic were investigated by using the AMESim simulation code. Some analytical parameters such as the fuel pressure and hole diameter were considered. From this study, it was shown that the piezo-driven injector had a faster response and had better control capability than the solenoid-driven injector. In addition, it was found that the piezo-driven injector can be utilized more effectively in a multiple injection scheme than a solenoid-driven injector.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.3
• /
• pp.220-228
• /
• 2008

In this study the aerodynamic characteristics of a canard-controlled missile with freely spinning tailfins were investigated by using a semi-empirical method and a CFD code. The mean aerodynamic coefficients for the rolling and roll damping moments were first calculated and then used to predict the roll-rate of freely spinning tailfins. The calculation of roll-rate in the CFD code was carried out by combining a Chimera overset grid system and 6-DOF analysis module. The predicted roll-rate was in good agreement with the experimental data for the roll and yaw canard control inputs. It was also shown that the results are in good agreement with the prediction by a CFD code. This indicates that the semi-empirical method can be used to predict the roll-rate of a canard-controlled missile with freely spinning tailfins.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.10-18
• /
• 2004

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The operations of unaligned linear quadtrees, which are operations among the linear quadtrees with different origin, are able to perform the translated or rotated images efficiently. And this operations requires alignment of the linear quadtrees. In this paper, we present an efficient algorithm to perform alignment of unaligned linear quadtrees, using three-dimensional $n{\pm}n{\pm}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\pm}n{\pm}n$ RMESH.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.36-44
• /
• 2012

We had introduced the backgrounds, history and physical meanings of Jong Nang in "Jeju Jong Nang Channel Code I". In this paper, we introduce practical the root of digital human binary coded Jong Nang communications as the wooden gate in Korea Jeju Island custom. We investigate Jong Nang gatemodels as an approximation of the AWGN model. The objective is to find a deterministic model, which is accessible to capacity analysis. Furthermore, this analysis should provide insights on the capacity of the AWGN model. Motivated by backhaul cooperation in cellular networks where cooperation is among base stations, we term the interference channel with conferencing transmitters. Jong Nang communicationsis normal 3 rafters placed on two vertical stones with three holes to convey the family's whereabouts that is deterministic signal, nowadays it is applied to backhaul in mobile base station and traffic signal.

• Journal of KIISE:Software and Applications
• /
• v.35 no.7
• /
• pp.452-461
• /
• 2008

Binary diffing is a method to find differences in similar binary executables such as two different versions of security patches. Previous diffing methods using flow information can detect control flow changes, but they cannot track constant value changes. Biffing methods using assembly instructions can detect constant value changes, but they give false positives which are due to compiling methods such as instruction reordering. We present a binary diffing method and its implementation named SCV which utilizes both structure and value information. SCV summarizes structure and constant value information from disassembled code, and matches the summaries to find differences. By analyzing a Microsoft Windows security patches, we showed that SCV found necessary differences caused by constant value changes which the state-of-the-art binary diffing tool BinDiff failed to find.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.382-390
• /
• 2005

Huffman codes are widely used for image and video data transmission. As the increase of real-time data, a lot of studies on effective decoding algorithms and architectures have been done. In this paper, we proposed a balanced binary search tree for Huffman decoding and compared the performance of the proposed architecture with that of previous works. Based on definitions of the comparison of codewords with different lengths, the proposed architecture constructs a balanced binary tree which does not include empty internal nodes, and hence it is very efficient in the memory requirement. Performance evaluation results using actual image data show that the proposed architecture requires small number of table entries, and the decoding time is 1, 5, and 2.41 memory accesses in minimum, maximum, and average, respectively.