• Journal of Multimedia Information System
• /
• v.4 no.2
• /
• pp.73-78
• /
• 2017

The Future Video Coding (FVC) is a new state of the art video compression standard that is going to standardize, as the next generation of High Efficiency Video Coding (HEVC) standard. The FVC standard applies newly designed block structure, which is called quadtree plus binary tree (QTBT) to improve the coding efficiency. Also, intra and inter prediction parts were changed to improve the coding performance when comparing to the previous coding standard such as HEVC and H.264/AVC. Experimental results shows that we are able to achieve the average BD-rate reduction of 25.46%, 38.00% and 35.78% for Y, U and V, respectively. In terms of complexity, the FVC takes about 14 times longer than the consumed time of HEVC encoder.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.3
• /
• pp.250-254
• /
• 2010

As the number of input and fuzzy set of a fuzzy system increase, the size of the rule base increases exponentially and becomes unmanageable (curse of dimensionality). In this paper, tree architectures of fuzzy controller (TAFC) is proposed to overcome the curse of dimensionality problem occurring in the design of fuzzy controller. TAFC is constructed with the aid of AND and OR fuzzy neurons. TAFC can guarantee reduced size of rule base with reasonable performance. For the development of TAFC, genetic algorithm constructs the binary tree structure by optimally selecting the nodes and leaves, and then random signal-based learning further refines the binary connections (two-step optimization). An inverted pendulum system is considered to verify the effectiveness of the proposed method by simulation.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.11a
• /
• pp.145-149
• /
• 1997

In this paper, a hierarchical spatio-temporal image segmentation method based on binary split algorithm is proposed. Intensity and displacement vector at each pixel are used for image segmentation. The displacement vectors between two image frames which skip over one or several frames can be approximated by accumulating of the velocity vectors calculated from optical flow between two successive frames when the time interval between the two image frames is short enough or the motion is slow. The pixels whose displacement vector and intensity are ambiguous are precisely decided by the modified watershed algorithm using the proposed priority measure. In the experiment, the region of moving object is precisely segmented.

• Elastomers and Composites
• /
• v.25 no.3
• /
• pp.203-210
• /
• 1990

The structure and properties of blends of ethylene-propylene-diene terpolymer(EPDM) and polyolefin blends have been investigated. The rheology and tensile properties of the EPDM/HDPE(high density polyethylene), EPDM/PP(polypropylene) binary and EPDM/PP/HDPE ternary blends were studied along with morphological analyses. Those properties were affected by preferential interaction of EPDM on HDPE, compared to that of EPDM on PP, for the binary blends. The preferetial interaction may stem from the molecular characteristics of EPDM to possess more ethylene units than propylene units in the elastomer. The EPDM played a role as compatibilizer for HDPE and PP in the EPDM/PP/HDPE ternary blends.

• Nuclear Engineering and Technology
• /
• v.40 no.7
• /
• pp.571-580
• /
• 2008

A Binary Decision Diagram (BDD) is a graph-based data structure that calculates an exact top event probability (TEP). It has been a very difficult task to develop an efficient BDD algorithm that can solve a large problem since it is highly memory consuming. In order to solve a large reliability problem within limited computational resources, many attempts have been made, such as static and dynamic variable ordering schemes, to minimize BDD size. Additional effort was the development of a ZBDD (Zero-suppressed BDD) algorithm to calculate an approximate TEP. The present method is the first successful application of a BDD truncation. The new method is an efficient method to maintain a small BDD size by a BDD truncation during a BDD calculation. The benchmark tests demonstrate the efficiency of the developed method. The TEP rapidly converges to an exact value according to a lowered truncation limit.

• Polymer(Korea)
• /
• v.26 no.6
• /
• pp.752-758
• /
• 2002

FTIR, FT-Raman, and X-ray diffraction techniques were used to determine chain segregations and lamellar structures of the mixed binary n-paraffins with different chain lengths. The results of three different techniques, infrared spectroscopic studies of crystal field splitting, the Raman longitudinal acoustic mode, and the SAXS long period measurements were compared one another to understand the crystallization mechanism of separated or mixed n- paraffin lamellae.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.14 no.2
• /
• pp.1-9
• /
• 1977

The waveform, power spectrum and optimal receiver structure for fast FSK are analysed. It is shown and verified experimentally that for the observation interval of two bit periods, the bit error rate is as good as that of PSK. At the same time, it is shown to have the advantage of narrower band width than PSK. In experiment, the FFSK signal is generated by using a binary transversal filter and a low pass filter.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.3-4
• /
• 2006

Fast IP address lookup in routers is essential to achieve packet forwarding in wire-speed. The longest prefix matching for IP address lookup is more complex than exact matching because of its dual dimensions, length and value. By thoroughly studying the current proposals for IP address lookup, we find out that the binary search could be a low-cost solution while providing high performance. Most of the existing binary search algorithms based on trie have simple data structures which can be easily implemented, but they have some problems because of empty internal nodes. The proposed algorithm is based on trie structure, but empty internal nodes are replaced by priority prefixes. The best-matching-prefix search in the proposed algorithm is more efficiently performed since search can be finished earlier when input is matched with a priority prefix. The performance evaluation results show that the constructed priority-trie has very good performance in the lookup speed and the scalability.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.369-370
• /
• 2006

This paper presents a new method for Huffman decoding specially designed for the MPEG-2 AAC audio. The method significantly enhances the processing efficiency of the conventional Huffman decoding realized with the ordinary binary tree search method. A data structure is newly designed based on the numerical interpretation of the incoming bit stream and its utilization for the offset oriented nodes allocation. The experimental results show the average performance enhancement of 54% and 665%, compared to those of the conventional binary tree search method and the sequential search method, respectively.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.3
• /
• pp.363-371
• /
• 1994

This thesis investigates an expert system(ES) to propose fault restoration plan by utilizing tree search strategies. In order to cope with an extensive amount of data and frequent breaker switching operations in distribution systems, the database of system configuration is constructed by using binary trees. This remarkably enhances the efficiency of search algorithm and makes the proposed ES easily adaptable to system changes due to switching operations. The rule-base is established to fully utilize the meris of tree-structured database. The inferring strategy is developed mainly based on the best-first search algorithm to increase computation efficiency. The proposed ES has been implemented to efficiently deal with large distribution systems by reducing computational burden remarkably compared with the conventional ES's.