• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.269-272
• /
• 2010

In this paper, we propose the computation reduction methods of delta pitch search that is used in G.723.1 vocoder. In order to decrease the computational amount in delta pitch search the characteristic of proposed algorithms is as the following. First, scheme to reduce the computation amount in delta pitch search uses NAMDF. Developed the second scheme is the skipping technique of lags in pitch searching by using the threshold value. By doing so, we can reduce the computational amount of pitch searching more than 64% with negligible quality degradation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.7
• /
• pp.70-82
• /
• 1993

In this paper, employing the 3-dimensional discrete cosine transform (DCT) for the utilization of the temporal correlation, an adaptive motion sequence coding technique is proposed. The energy distribution in a 3-D DCT block, due to the nonstationary nature of the image data, varies along the veritical, horizontal and temporal directions. Thus, aiming an adaptive system to local variations, adaptive procedures, such as the 3-D classification, the classified linear scanning technique and the VLC table selection scheme, have been implemented in our approach. Also, a hybrid structure which adaptively combines inter-frame coding is presented, and it is found that the adaptive hybrid frame coding technique shows a significant performance gain for a moving sequence which contains a relatively small moving area. Through an intensive computer simulation, it is demonstrated that, the performance of the proposed 3-D transform coding technique shows a close relation with the temporal variation of the sequence to be code. And the proposed technique has the advantages of skipping the computationally complex motion compensation procedure and improving the performance over the 2-D motion compensated transform coding technique for rates in the range of 0.5 ~ 1.0 bpp.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7C
• /
• pp.548-553
• /
• 2008

To reduce the bit-rate requirements imposed by a network or satisfy processing limitations imposed by a terminal, Conversion the temporal resolution of a video bit stream is a technique that may be used. This paper discusses the problem of reduced resolution transcoding of compressed video bit streams, and discussed the technique for temporal transcoding. To speed up this operation, a video transcoder usually reuses the coded motion vectors from the input video bit stream. In this paper we propose an enhanced motion re-estimation technique to maintain higher quality of coded frames. The performance of experimental results can be improved while maintaining low computational complexity for a reduced frame rate video transcoder.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.582-587
• /
• 2008

Structural join is one of the most typical techniques for evaluating XML path queries. Recent researches for structural joins focus on techniques of skipping unnecessary elements using the horizontal distribution information of elements that is indexed on a structure like B+ tree. However, those techniques make the structural join complicated and cannot guarantee efficient join processing due to the overhead of an index structure. In this paper, we propose a new structural join technique that exploits the level information of XML elements. Our technique can skip unnecessary elements using level information, which is vertical distribution information of elements. Through the experimental results, we show that our technique can evaluate structural joins efficiently.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.245-254
• /
• 2006

In this work, a new rate control algorithm for transmission of H.264/AVC video bit stream through CBR(constant bit rate) channel is proposed. The proposed algorithm predicts target bit rate and MAD(mean of absolute difference) for current frame considering image complexity variance between neighboring backward and current images. In details, respective linear regression analysis for MAD and encoded bit rate against image complexity variance produce correlation parameters. Additionally, it uses frame skip technique to maintain bit stream within a manageable range and protect buffer from overflow or underflow. Implementation and experimental results show that the proposed algorithm can provide accurate bit allocation, and can effectively visual degradation after scene changes. Also our proposed algorithm encodes the video sequences with less frame skipping compared to the existing rate control for H.264/AVC.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.214-217
• /
• 1994

The major drawback in the Code Excited Linear Prediction type vocoders is their large computational requirements. In this paper, a simple method is proposed to reduce the pitch searching time in the pitch filter almost without degradation of quality. On the basis of the observational regularity of the correlation function of speech, only the limited numbers of pitch lags are considered to be an optimum pitch. This is done by skipping the negative envelope side of the correlation function and limiting the maximum number of lags to be considered preliminarily. By doing so, we can reduce the computational time of pitch searching more than 51% with negligible quality degradation. In addition to that, by combining that method with the conventional delta search technique, we can reduce the computational time requirements more than 60% without serious lowering the speech quality in segmental SNR measure compared to the conventional full search method.

• Selected Papers of The Society of Naval Architects of Korea
• /
• v.1 no.1
• /
• pp.37-44
• /
• 1993

Deck wetness phenomenon has long been considered as one of the factors that degrade the performance of a ship In waves. In rough weather, the frequent skipping of water may give rise to the capsizing of the ship. Therefore an appropriate above water bow shape design is an important asset to a ship of which successful performance in rough weather is a prerequisite such as a warship. In this paper an experimental technique for estimation of deck-wetness frequency is presented. The results of the model tests are compared with those of computations using Ochi's formula. Finally the applicability of Ochi's formula is discussed.

• International Journal of Computer Science & Network Security
• /
• v.24 no.4
• /
• pp.211-221
• /
• 2024

Pakistan is a top producer and exporter of high-quality rice, but traditional methods are still being used for detecting rice diseases. This research project developed an automated rice blast disease diagnosis technique based on deep learning, image processing, and transfer learning with pre-trained models such as Inception V3, VGG16, VGG19, and ResNet50. The modified connection skipping ResNet 50 had the highest accuracy of 99.16%, while the other models achieved 98.16%, 98.47%, and 98.56%, respectively. In addition, CNN and an ensemble model K-nearest neighbor were explored for disease prediction, and the study demonstrated superior performance and disease prediction using recommended web-app approaches.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.342-352
• /
• 2006

Current studies on storing XML data are focused on either mapping XML data to existing RDBMS efficiently or developing a native XML storage. Some native XML storages store each XML node with parsed object form. Clustering, the physical arrangement of each object, can be an important factor to increase the performance with this storing method. In this paper, we propose re-clustering techniques that can store an XML document efficiently. Proposed clustering technique uses path similarities among data nodes, which can reduce page I/Os when returning query results. And proposed technique can process a path query only using small number of clusters as possible instead of using all clusters. This enables efficient processing of path query because we can reduce search space by skipping unnecessary data. Finally, we apply existing clustering techniques to store XML data and compare the performance with proposed technique. Our results show that the performance of XML storage can be improved by using a proper clustering technique.

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.4
• /
• pp.17-26
• /
• 2020

We present a real-time GPU(Graphic Processing Unit) marching tetrahedra technique that extracts isosurfaces in the indexed mesh format from BCC(Body Centered Cubic) volume datasets. Compared to classical marching tetrahedra, our method shows better performance with little memory overhead. Our technique is composed of five stages. In the first stage, which needs to be done only once, we build min/max blocks that is to be used for empty space skipping to boost the performance. Next, we extract active blocks that contain the current isovalue. In the next two stages, we extract the edges and cells that contain the isosurface and then the final triangular mesh is generated in the last stage. When applied 512³ or higher resolution volume dataset, our technique shows up to 5 times speed improvement compared to the classical marching tetrahedra algorithm.