• Journal of IKEEE
• /
• v.28 no.2
• /
• pp.180-186
• /
• 2024

This paper proposes an efficient fault diagnosis method for ITSC(Inter-Turn Short Circuit) in three-phase induction motors using CNN. By utilizing only the D-axis component of the D-Q synchronous coordinate system, it compares SWM(Slide Window Method) and GAF(Gramian Angular Field) methods for image encoding. Results show GAF achieving ~74% accuracy, while SWM achieves ~65%, indicating GAF's superiority by 9%. Learning time (~14.74s) remains consistent, particularly with epochs ≤ 100, showcasing faster learning.

• Journal of Microbiology and Biotechnology
• /
• v.11 no.4
• /
• pp.668-676
• /
• 2001

Pseudomonas sp. strain SY5 is a PCB-degrading bacterium [24] that includes two different enzymes (BphC1 and BphC2) encoding 2,3-dihdroxybiphenyl 1,2-dioxygenase and BphD encoding 2-hydroxy-6-oxo-6-phenylhexa-2,4-dienoate hydrolase. The bphC1 and bphC2 genes were found to consist of 897 based encoding 299 amino acids and 882 bases encoding 294 amino acids, respectively, whereas the bphD gene consisted of 861 bases encoding 287 amino acids. According to a homology search, a 50% and 39% similarity between the bphC1 and bphC2 genes at the nucleotide and amino acid level was shown, respectively. The bphC1 gene showed a 38% and 45% similarity at the amino acid level to Alcaligenes eutrophus A5 and Rhodococcus rhodochrous, respectively, whereas, bphC2 showed a 95% and 43% similarity, respectively. A comparison of the deduced amino acid sequence of the bphD product of Pseudomonas sp. SY5 with that of A. eutrophus A5, Pseudomons sp. KKS102, and LB400 showed a sequence identity of 92, 92, and 79%, respectively. Strain SY5 was originally isolated from municipal sewage containing recalcitrant organic compounds an found to have a high degradability of various aromatic compounds [23]. The current study found that strain SY5 had two extradiol-type dioxygenases, which did not hybridize with each other as they had a low similarity, yet a similar structure of evolutionarily conserved amino acids residues for catalytic activity between BphC1 and BphC2 was observed.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.8
• /
• pp.104-113
• /
• 2014

The existing rough mode decision (RMD) algorithm, used in HEVC standard loses the coding efficiency and wastes encoding time when encoding using transform skip mode (TSM) because the RMD algorithm in HEVC uses a selection method that is designed for DCT, not for TSM. This paper proposes a new RMD algorithm for TSM in HEVC. Our proposed RMD algorithm enhances the coding efficiency by employing a new cost function to increase the probability of selecting the best intra prediction mode for TSM. In addition, it reduces the encoding time by skipping the encoding process of least feasible TSM based on a newly proposed threshold value. The experiment results show that the proposed method achieves coding gains of -0.3% for screen contents with a 10% reduction in encoding time compared to those of the HEVC standard.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.4
• /
• pp.245-252
• /
• 2008

In this paper, we propose a new method for improving the H 264 encoding process and motion estimation part. Our approach is a method to reduce the encoding running time through the omission of reference frame in the mode selection process of H 264 and an improvement of SAD computing process. To evaluate the proposed method, we used the H 264 standard image of QCIF size and TIN 4:2:0 format. Experimental results show that proposed SAD algorithm 1 can improve the speed of encoding runnung time by an average of 4.7% with a negligible degradation of PSNR. However, SAD algorithm 2 can improve the speed of encoding runnung time by an average of 9.6% with 0.98dB degradation of PSNR.

• Journal of the Korea Convergence Society
• /
• v.8 no.8
• /
• pp.225-230
• /
• 2017

The Sijo provides dynamic rated therapeutic activities in our life. This study aims to search for the literary therapeutic function secreted from the Sijo that ends with a noun. As a result, the noun used at the final sentence secretes a predicative function. This kind of Sijo functions as twelve sound steps, even though it is condensed of just eleven sound steps with one sound step omitted. This functional secretion of Sijo is therapeutic predicate concerned with encoding of literary therapy. Thus it become possible to activate the therapeutic encoding in Sijo or a language by uttering only noun, instead of the predicate. That's because the noun in the last sentence of Sijo permeated in the human body and is done subject, and neuron of the body becomes a predicate, so that the Sijo's subject and the neuron's predicate are fused into a sentence. During the course the human body seems to recognize that the neuron's nucleus analyzes the information of the noun and makes a new sentence. This recognition might also be regarded as a process of encoding that has therapeutic functions secreted from the human body.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1034-1044
• /
• 2017

Although traversal strategies are important for the performance of model checking, many studies have ignored the impact of traversal strategies in model checking with a block-encoded abstract reachability graph. Studies have considered traversal strategies only for an abstract reachability graph without block-encoding. Block encoding plays a crucial role in the model checking performance. This paper therefore describes Dual-traversal strategy, a simple and novel technique to control traversal strategies in a block-encoded abstract reachability graph. This method uses two traversal strategies for a model checking, one for effective block-encoding, and the other for traversal in an encoded abstract reachability graph. Dual-traversal strategy is very simple and can be implemented without overhead compared to the existing single-traversal strategy. We implemented the Dual-traversal strategy in an open source model checking tool and compare the performances of different traversal strategies. The results show that the model checking performance varies from the traversal strategies for the encoded abstract reachability graph.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.117-122
• /
• 2000

The fractal image compression is based on the self-similarity that some area in an image is very similar to others. This compression method offers high compression ratio and fast decompression, but it has very long encoding time. To cut-off the encoding time, most researches give a restriction on domain blocks to be compared with a range block or make an effective search sequence of the domain blocks for a range block. However, most of them take much encoding time yet. In this research, we propose an algorithm that greatly reduces the encoding time by considering the coherence between range blocks. This algorithm first classifies all range blocks into some groups using the coherence between range blocks, and then searches corresponding domain blocks only for the key block of each group. If this scheme is joined in a prior work of the other fractal compression algorithm, it will give a great effectiveness to encoding time.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.3
• /
• pp.559-566
• /
• 2012

In this paper, we propose a fast fractal image coding algorithm to shorten long time to take on fractal image encoding. For its performance evaluation, the algorithm compares with other traditional fractal coding methods. In the traditional fractal image coding methods, an original image is contracted by a factor in order to make the corresponding image to be compared with. Then, the whole area of the contracted image is searched in order to find the fixed point of contractive transformation of the original image corresponding to the contracted image. It needs a lot of searching time on encoding. However, the proposed algorithm considerably reduces encoding time by using scaling method and limited search area method. On comparison of the proposed algorithm with Jacquin's method, the proposed algorithm is dozens of times as fast as that of Jacquin's method on encoding time with a little degradation of the decoded image quality and a little increase of the compression rate. Therefore, it is found that the proposed algorithm largely improves the performance in the aspect of encoding time when compared with other fractal image coding methods.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1317-1328
• /
• 1996

In this paper, we propose a fast image coding algorithm to shorten long time to take on fractal image encoding. For its Performance evaluation, the algorithm compares with other traditional fractal coding methods. In the traditional fractal image coding methods, an original image is contracted by a factor in order to make the corresponding image to be compared with. Them, the whole area of the contracted image is searched in order to find the fixed point of contractive transformation of the orignal image corresponding to the contracted image. It needs a lot of searching time on encoding However, the proposed algorithm considerable reduces encoding time by using scaling method and limited search area method. On comparison of the proposed algorithm with Joaquin's method, the proposed algorithm is at least 180 times as fast as that of Jacquin's method on encoding time with a little degradation of the decoded image quality and a little increase of the compression rate. There-for, it is found that the proposed algorithm largely improves the performance in the aspect of encoding time when compared with other fractal image coding methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1195-1211
• /
• 2016

The emerging video coding standard High Efficiency Video Coding (HEVC) has shown almost 40% bit-rate reduction over the state-of-the-art Advanced Video Coding (AVC) standard but at about 40% computational complexity overhead. The main reason for HEVC computational complexity is the inter prediction that accounts for 60%-70% of the whole encoding time. In this paper, we propose several fast coding unit (CU) encoding schemes based on the Merge mode and motion estimation information to reduce the computational complexity caused by the HEVC inter prediction. Firstly, an early Merge mode decision method based on motion estimation (EMD) is proposed for each CU size. Then, a Merge mode based early termination method (MET) is developed to determine the CU size at an early stage. To provide a better balance between computational complexity and coding efficiency, several fast CU encoding schemes are surveyed according to the rate-distortion-complexity characteristics of EMD and MET methods as a function of CU sizes. These fast CU encoding schemes can be seamlessly incorporated in the existing control structures of the HEVC encoder without limiting its potential parallelization and hardware acceleration. Experimental results demonstrate that the proposed schemes achieve 19%-46% computational complexity reduction over the HEVC test model reference software, HM 16.4, at a cost of 0.2%-2.4% bit-rate increases under the random access coding configuration. The respective values under the low-delay B coding configuration are 17%-43% and 0.1%-1.2%.