• Journal of Multimedia Information System
• /
• v.8 no.3
• /
• pp.147-158
• /
• 2021

Versatile Video Coding (VVC) is the latest video coding standard developed by Joint Video Exploration Team (JVET). In VVC, the quadtree plus multi-type tree (QT+MTT) structure of coding unit (CU) partition is adopted, and its computational complexity is considerably high due to the brute-force search for recursive rate-distortion (RD) optimization. In this paper, we aim to reduce the time complexity of inter-picture prediction mode since the inter prediction accounts for a large portion of the total encoding time. The problem can be defined as classifying the split mode of each CU. To classify the split mode effectively, a novel convolutional neural network (CNN) called multi-level tree (MLT-CNN) architecture is introduced. For boosting classification performance, we utilize additional information including inter-picture information while training the CNN. The overall algorithm including the MLT-CNN inference process is implemented on VVC Test Model (VTM) 11.0. The CUs of size 128×128 can be the inputs of the CNN. The sequences are encoded at the random access (RA) configuration with five QP values {22, 27, 32, 37, 42}. The experimental results show that the proposed algorithm can reduce the computational complexity by 11.53% on average, and 26.14% for the maximum with an average 1.01% of the increase in Bjøntegaard delta bit rate (BDBR). Especially, the proposed method shows higher performance on the sequences of the A and B classes, reducing 9.81%~26.14% of encoding time with 0.95%~3.28% of the BDBR increase.

• Journal of the Korean Society of Earth Science Education
• /
• v.5 no.2
• /
• pp.197-203
• /
• 2012

The main purpose of this research is to search the effect of different types of advance organizers in elementary science classes, to the students in acquiring scientific concepts and its retentions. In order to proceed with the research, We have chosen 93 students of three different classes of fifth graders, studying in M elementary school in U metropolitan city. We have randomly chosen two classes as an experimental group and one class as a comparative group. In the first experimental group (Group1), advance organizer was put in a form of a sentence., and the second experimental group (Group2), advance organizer was put in a form of a picture. For the comparative group, We have not put any advance organizer, and the method of class was proceeded as it was before. The result of this research are as follows. Firstly, the result of 'One-way analysis of variance' on scientific concept grade, right after the experiment on three groups, has shown a meaningful difference that, the shape of advance organizer does affect the acquisition of elementary school students' scientific concept. Secondly, even though Group1, who was given with a sentence as an advance organizer, got higher scientific concept scores after the experiment than that of comparative group, However, there was not a meaningful difference between Group1 and comparative group. Thirdly, Group2, who was given with a picture as an advance organizer, has shown a meaningful difference from comparative group. Judging from the facts above, utilizing an advance organizer of a picture in elementary science class, will be very affective on students' acquiring scientific concept.

• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.05
• /
• pp.235-238
• /
• 1995

In this paper, we propose an effective coding method of the angiography by using the scalable structure in the frequency domain for MPACS(Medical Picture Archiving and Communication System). We employed the subband decomposition method and MPEG-2 system which is the international standard coding method of the general moving picture. After the subband decomposition is applied to split an input image into 4 bands in the spatial frequency domain, the motion compensated DPCM coding method of MPEG-2 is carried out for each subband. As a result, an easily controllable coding Structure is accomplished by composing the compound hit stream for each subband group. Follows are the simulation results of the proposed sheme for the angiography. A scalable structure which can be easily controlled for a loss of transmission or the band limit can be accomplisbed in the MPEG-2 stucture by the subband decomposition minimizing the side information. And by reducing the search area of the motion vector between -4 and 3, the processing speed of a codec is enhanced by more than two times without a loss of the picture quality compare with the conventional DCT coefficients decompositon method. And the processing speed is considerably improved in the case of the parallel construction of each subband in the hardware.

• Journal of the Korea Computer Graphics Society
• /
• v.9 no.3
• /
• pp.23-29
• /
• 2003

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of the previous block. If we can obtain useful and enough information from the motion vector of the same coordinate block of the previous frame, the total number of search points used to find the motion vector of the current block may be reduced significantly. In this paper, we propose the block-matching motion estimation using an adaptive initial search point by the predicted motion information from the same block of the previous frame. And the first search point of the proposed algorithm is moved an initial point on the location of being possibility and the searching process after moving the first search point is processed according to the fast search pattern. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved UP to the 1.05dB as depend on the image sequences and improved about 0.33~0.37dB on an average. Search times are reduced about 29~97% than the other fast search algorithms. Simulation results also show that the performance of the proposed scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS(Full Search) algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.49-55
• /
• 2007

To improved the multi-resolution fast hierarchical motion estimation by using de-interlacing algorithm that is effective in term of both performance and VLSI implementation, is proposed so as to cover large search area field-based as well as frame based image processing in SoC design. In this paper, we have simulated a various picture mode M=2 or M=3. As a results, the proposed algorithm achieved the motion estimation performance PSNR compare with the full search block matching algorithm, the average performance degradation reached to -0.7dB, which did not affect on the subjective quality of reconstructed images at all. And acquiring the more desirable to adopt design SoC for the fast hierarchical motion estimation, we exploit foreground and background search algorithm (FBSA) base on the dual arithmetic processor element(DAPE). It is possible to estimate the large search area motion displacement using a half of number PE in general operation methods. And the proposed architecture of MHME improve the VLSI design hardware through the proposed FBSA structure with DAPE to remove the local memory. The proposed FBSA which use bit array processing in search area can improve structure as like multiple processor array unit(MPAU).

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.726-730
• /
• 2009

The proliferation of the web and digital photography has drastically increased multimedia data and has resulted in the need of the high quality internet service based on the moving picture like user generated contents(UGC). The keyword-based search on large scale images and video collections is too expensive and requires much manual intervention. Therefore the web search engine may provide the content-based retrieval on the multimedia data for search accuracy and customer satisfaction. In this paper, we propose a novel distributed index structure based on multiple length signature files according to data distribution. In addition, we describe how our scalable index technique can be used to find the nearest neighbors in the cluster environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.69-77
• /
• 2002

Sine digital signal processing for motion pictures requires huge amount of data computation to store, manipulate and transmit, more effective data compression is necessary. Therefore, the ITU-T recommended H.26x as data compression standards for digital motion pictures. The data compression method that eliminates time redundancies by motion estimation using relationship between picture frames has been widely used. Most video conding systems employ block matching algorithm for the motion estimation and compensation, and the algorithm is based on the minimun value of cast functions. Therefore, fast search algorithm rather than full search algorithm is more effective in real time low data rates encodings such as H.26x. In this paper, motion estimation employing the Nearest-Neighbors algorithm is designed to reduce search time using FPGA, coded in VHDL, and simulated and verified using Xilink Foundation.

• Archives of design research
• /
• v.15 no.1
• /
• pp.93-100
• /
• 2002

The University's web library is a form of library that enables to deal with information about searching loaning, returning of books or data housed in it through web. With the advent of the network and multimedia following the entrance to an information-oriented society, we are experiencing a big change in how to communicate and acquire information. Massive multimedia information transmitted by image and moving picture through the network, made it possible to overstep the limit of the physical gap between information suppliers and users. Despite this important role, it is accompanied by problems such as copyright, scarcity of recognition, paralysis of infra, technical matters and reliability which demand development. In this thesis, according to the State University Evaluation Standards, search node and user interface by system used in 20 different universities possessing web-based library sites were compared are analysed. On the basis of this, an experimental user interface for web-based University libraries was produced, and various questionnaires and data leer this produced interface were collected, classified and analyzed. With the application of the results for the work above to the general search system interface of the web-based library, we proposed a new user interface that contains the following functions, such as location and loan condition of books, search frequency and steps for purchasing books inside the web library.

• Korean Journal of Oriental Medicine
• /
• v.17 no.2
• /
• pp.73-83
• /
• 2011

The first medical text in which detailed treatments of diseases by combinations of materia medica are mentioned is the "Shanghanzabinglun(傷寒雜病論)". True meaning of the combinations of materia medica used in this text lies in the fact that the efficacy of a prescription transcends that of the linear sum of each materia medica. This kind of concept regarding the composition of a prescription has come to contribute to the formation of theories in prescriptionology; However, it is difficult to analyze and interpret the meaning of each prescription separately because of differences in interpreting methods, points of view, and terminologies used by members of different academical branches. Therefore, it is desirable that one should understand a prescription as having been modified from a basic prescription, and then bring the interactions of ingredients into the picture, finally understanding the efficacy and chief virtues of the targeted prescription. Nevertheless, with the massive information of prescriptions, which exist in the format of texts, it is impossible to efficiently take advantage of prescription analyzing methods, and therefore the range of analysis extremely restricted. In order to overcomes these weaknesses, this paper suggests that object-oriented prescription database be constructed and that a search program for education and research that could facilitate an efficient access to the database be developed as well.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.1
• /
• pp.45-55
• /
• 1993

In this paper, a two-stage block matching algorithm (BMA), which can reduce greatly the computational complexity of the conventional BMAs, is proposed, in which the onedimensional distortion measure based on the integral projection is introduced to determine the candidate motion vectors and then among them a final motion vector is detected based on the conventional two-dimensional distortion measure. Due to the one-dimensional calculation of a distortion measure, the proposed algorithm can reduce the computational complexity of the conventional BMA (full search method with a 16$\times$16 block) by a factor of 4, with its performance comparable to those of the conventional ones. Simulation results based on the original and noisy image sequences are shown. Also the simulation of the proposed method combined with the MPEG (Moving Picture Experts Group) SM3 (Simulation Model Three) is presented. Computer simulation shows that the proposed algorithm is fast with its performance comparable to those of the conventional ones.