• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.64-69
• /
• 2000

This paper proposes a novel fractal coding method for fast encoding and high compression to shorten time to take on fractal encoding by using limited search area. First. the original image is contracted respectively by half and by quarter with the scaling method and bit-plane method. And then, the corresponding domain block of the quarter-sized image which is most similar with one range block of the half-sized image is searched within the limited area in order to reduce the encoding time extremely. As the result of the evaluation, the proposed algorithm provided much shorter encoding time and better compression ratio with a little degradation of the decoded image qualify than Jacquin's method.

• ETRI Journal
• /
• v.38 no.5
• /
• pp.807-817
• /
• 2016

A novel fast algorithm is suggested for a coding unit (CU) mode decision using pseudo rate-distortion based on a separated encoding structure in High Efficiency Video Coding (HEVC). A conventional HEVC encoder requires a large computational time for a CU mode prediction because prediction and transformation procedures are applied to obtain a rate-distortion cost. Hence, for the practical application of HEVC encoding, it is necessary to significantly reduce the computational time of CU mode prediction. As described in this paper, under the proposed separated encoder structure, it is possible to decide the CU prediction mode without a full processing of the prediction and transformation to obtain a rate-distortion cost based on a suitable condition. Furthermore, to construct a suitable condition to improve the encoding speed, we employ a pseudo rate-distortion estimation based on a Hadamard transformation and a simple quantization. The experimental results show that the proposed method achieves a 38.68% reduction in the total encoding time with a similar coding performance to that of the HEVC reference model.

• Journal of Information Management
• /
• v.36 no.3
• /
• pp.27-49
• /
• 2005

The encoding schemes of special characters in science & technology information services are always serious matters. Therefore, this paper draw up a general plan for encoding scheme of special characters related in some way. For this work, I have made an investigation into encoding cases of KISTI'S YesKisti service. And I have reviewed the important issues and standardization trends. Finally, this study proposes some requisites and problems for encoding scheme standard of special characters in science & technology information services.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.141-150
• /
• 2007

This paper proposes new Steganographic model for VoIP that has very effective method using low bit encoding. Most of Steganographic models using Low bit Encoding have two disadvantages; one is that the existence of hidden secret message can be easily detected by auditory, the other is that the capacity of stego data is low. To solve these problems, this method embed more than one bit in inaudible range, so this method can improve the capacity of the hidden message in cover data. The embedding bit position is determined by using a pseudo random number generator which has seed with remaining message length, so it is hard to detect the stego data produced by the proposed method. This proposed model is able to use not only to communicate wave file with hidden message in VoIP environment but also to hide vary information which is user basic information, authentication system, etc.

• Journal of Korea Spatial Information System Society
• /
• v.5 no.1 s.9
• /
• pp.27-38
• /
• 2003

Recently, because of the extensive use of geographic information in the various fields, the requirement for the easy circulation and utilization of the various geographic information among the individuals, organizations, societies and countries is raised. In order to support the interoperability of the heterogeneous geographic information in the various fields, OGC(Open GIS Consortium) proposed the GML(Geography Markup Language) specification that defines the XML encoding rule about the heterogeneous geographic information. In addition, ISO/TC 211 adopted the GML specification to make it as the international standard. Therefore, in this paper we first analyzed the GML 3.0 specification in detail that can support the interoperability of the heterogeneous geographic information. And then we suggested and applied the mapping rule that define the encoding method to improve the encoding process easily and efficiently. Finally we designed and implemented the GML 3.0 encoding system using the mapping rule to encode the geographic information that was constructed in spatial databases into the GML 3.0 document. Especially, we used ZEUS as a spatial database system to test our encoding system in this paper.

• Journal of Microbiology and Biotechnology
• /
• v.20 no.4
• /
• pp.789-797
• /
• 2010

The limited information on differential gene expression in the different serotypes of Actinobacillus pleuropneumoniae has significantly hampered the research on the pathogenic mechanisms of this organism and the development of multivalent vaccines against A. pleuropneumoniae infection. To compare the gene expressions in the A. pleuropneumoniae strains CVCC259 (serotype 1) and CVCC261 (serotype 3), we screened the differentially expressed genes in the two strains by performing representational difference analysis (RDA). Northern blot analyses were used to confirm the results of RDA. We identified 22 differentially expressed genes in the CVCC259 strain and 20 differentially expressed genes in the CVCC261 strain, and these genes were classified into 11 groups: (1) genes encoding APX toxins; (2) genes encoding transferrin-binding protein; (3) genes involved in lipopolysaccharide (LPS) biosynthesis; (4) genes encoding autotransporter adhesin; (5) genes involved in metabolism; (6) genes involved in the ATP-binding cassette (ABC) transporter system; (7) genes encoding molecular chaperones; (8) genes involved in bacterial transcription and nucleic acid metabolism; (9) a gene encoding protease; (10) genes encoding lipoprotein/membrane protein; and (11) genes encoding various hypothetical proteins. This is the first report on the systematic application of RDA for the analysis of differential gene expression in A. pleuropneumoniae serotypes 1 and 3. The determination of these differentially expressed genes will serve as an indicator for future research on the pathogenic mechanisms of A. pleuropneumoniae and the development of a multivalent vaccine against A. pleuropneumoniae infection.

• KIISE Transactions on Computing Practices
• /
• v.22 no.4
• /
• pp.170-177
• /
• 2016

Character encoding is a method for changing a document to a binary document file using the code table for storage in a computer. When people decode a binary document file in a computer to be read, they must know the code table applied to the file at the encoding stage in order to get the original document. Identifying the code table used for encoding the file is thus an essential part of decoding. In this paper, we propose a method for detecting the character code of the given binary document file automatically. The method uses many techniques to increase the detection rate, such as a character code range detection, escape character detection, character code characteristic detection, and commonly used word detection. The commonly used word detection method uses multiple word database, which means this method can achieve a much higher detection rate for multi-language files as compared with other methods. If the proportion of language is 20% less than in the document, the conventional method has about 50% encoding recognition. In the case of the proposed method, regardless of the proportion of language, there is up to 96% encoding recognition.

• KIISE Transactions on Computing Practices
• /
• v.24 no.3
• /
• pp.113-121
• /
• 2018

Position encoding is a method of applying weights according to position of words that appear in a sentence. Pointer networks is a deep learning model that outputs corresponding index with an input sequence. This model can be applied to coreference resolution using attribute. However, the pointer networks has a problem in that its performance is degraded when the length of input sequence is long. To solve this problem, we proposed two contributions to resolve the coreference. First, we applied position encoding and dynamic position encoding to pointer networks. Second, we stack deeply layers of encoder to make high-level abstraction. As results, the position encoding based stacked pointer networks model proposed in this paper had a CoNLL F1 performance of 71.78%, which was improved by 6.01% compared to vanilla pointer networks.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.578-591
• /
• 2016

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.19 no.2
• /
• pp.409-416
• /
• 2024

With the expansion of floating-point operation requirements for fast high-speed data signal processing and logic operations, the speed of the floating-point operation unit is the key to affect system operation. This paper studies the performance characteristics of different floating-point multiplier schemes, completes partial product compression in the form of carry and sum, and then uses a carry look-ahead adder to obtain the result. Intel Quartus II CAD tool is used for describing Verilog HDL and evaluating performance results of the floating point multipliers. Floating point multipliers are analyzed and compared based on area, speed, and power consumption. The FMAX of modified Booth encoding with Wallace tree is 33.96 Mhz, which is 2.04 times faster than the booth encoding, 1.62 times faster than the modified booth encoding, 1.04 times faster than the booth encoding with wallace tree. Furthermore, compared to modified booth encoding, the area of modified booth encoding with wallace tree is reduced by 24.88%, and power consumption of that is reduced by 2.5%.