• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.19 no.3
• /
• pp.38-51
• /
• 2020

A bottleneck and congestion occur when a freeway is closed due to maintenance and construction activities on the freeway. Although various traffic managements have been developed to improve the traffic efficiency at freeway work zones, such as merge control, there is a limit to those controls with human drivers. On the other hand, the wireless communication of connected and automated vehicles (CAVs) enables the operation of advanced traffic management. This study developed a traffic control strategy that integrates Dynamic Merge Control (DMC) and Lane Change Control (LCC) in a CAV environment. DMC operates as an either early or late merge based on the occupancy rate of upstream of the work zone. The LCC algorithm determines the number of vehicles that need to change their lane to balance the traffic volume on open lanes. The simulation results showed that integrated control improves the cumulative vehicle count, average speed upstream, and average network travel time.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.509-520
• /
• 2015

A design for the merge mode of three dimensional High Efficiency Video Coding (3D-HEVC) is proposed in this paper. The proposed design can reduce the implementation complexity by removing the duplicated modules of the HEVC. For the extension codec, the implementation complexity is as crucial as coding efficiency, meaning if possible, extension codec needs to be easily implemented through by reusing the design of the legacy codec as-is. However, the existing merging process of 3D-HEVC had been built-in integrated in the inside of the HEVC merging process. Thus the duplicated merging process of HEVC had to be fully re-implemented in the 3D-HEVC. Consequently the implementation complexity of the extension codec was very high. The proposed 3D-HEVC merge mode is divided into following two stages; the process to reuse the HEVC modules without any modification; and the reprocessing process for newly added and modified merging modules in 3D-HEVC. By applying the proposed method, the re-implemented HEVC modules, which accounted for 51.4% of 3D-HEVC merge mode confirmed through the operational analysis of algorithm, can be eliminated, while maintaining the same coding efficiency and computational complexity.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1463-1466
• /
• 1987

The problem of generating minimal area CMOS functional cell layout can be converted to that of decomposing the transistor connection graph into a minimum number of subgraphs, each having a pair of Euler paths with the same sequence of input labels on the N-graph and P-graph, which are portions of the graph corresponding to NMOS and PMOS parts respectively. This paper proposes a heuristic algorithm which yields a nearly minimal number of Euler paths from the path representation formula which represents the give a logic function. Subpath merging is done through a list processing scheme where the pair of paths which results in the lowest cost is successively merged from all candidate merge pairs until no further path merging and further reduction of number of subgraphs are possible. Two examples were shown where we were able to further reduce the number of interlaces, i.e., the number of non-butting diffusion islands, from 3 to 2, and from 2 to 1, compared to the earlier work [1].

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.100.5-100
• /
• 2002

A core technology for implementation of Augmented Reality is to develop a merging algorithm between interesting 3-D objects and real images. In this paper, we present a 3-D object recognition method to decide viewing direction toward the object from camera. This process is the starting point to merge with real image and 3-D objects. Perspective projection between a camera and 3-dimentional objects defines a plane in 3-D space that is from a line in an image and the focal point of the camera. If no errors with perfect 3-D models were introduced in during image feature extraction, then model lines in 3-D space projecting onto this line in the image would exactly lie in this plane. This observa...

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.23-26
• /
• 2003

In this work. we propose an algorithm for detecting and compensating dynamic false contours in plasma display panels (PDPs). First, we detect the candidate pixels, which are likely to be corrupted by false contours, and merge those pixels into several regions. Second, we estimate the motion vectors of the selected regions. Finally, based on the motion information. we modify the luminance values of the pixels in the regions to alleviate the effects of false contours. Simulation results demonstrate that the proposed algorithm efficiently reduces dynamic false contours at low computational complexity.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.4
• /
• pp.243-253
• /
• 2003

This paper presents a new geometric morphing algorithm for polygons based on a simple geometric structure called direction map, which is mainly composed of a circular list of direction vectors defined by two neighboring vertices of a polygon. To generate a sequence of intermediate morphing shapes, first we merge direction maps of given control shapes based on a certain ordering rule of direction vectors, and scale the length of each direction vectors using Bezier or blossom controls. We show that the proposed algorithm is an improvement of the previous methods based on Minkowski sum (or convolution) in th aspects of computational efficiency and geometric properties.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.106-114
• /
• 1994

A new merging technique is adopted for combining rectangular parallelepipes produced by 2-D rectangular code into more intuitive 30D volume elements. Rectangular parallelepiped codes (RP codes) can be used in volume-based representation of a three-dimensional object. We proposed more regularity-conserving 2-D rectangular coding scheme to merge rectangular cells represented by RP codes in three-dimensional space. After being constructed from modified 2-D rectangular code, 3-D RP codes are merged in the two orthogonal directions using new merging algorithm. The shape of merged 3-D object reconstructed by proposed algorithm is shown to be much closer to the original object shape than that of conventional RP codes. The storage requirement of merged object can be also reduced.

• MALSORI
• /
• no.45
• /
• pp.47-61
• /
• 2003

In this paper, we consider the implementation of connected digit recognition system and the several approaches to improve its performance. To implement efficiently the fixed or variable length digit recognition system, finite state network (FSN) is required. We merge the word network algorithm that implements the FSN with one pass dynamic programming search algorithm that is used for general speech recognition system for fast search. To find the efficient modeling of digit recognition system, we perform some experiments along the various conditions to affect the performance and summarize the results.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1415-1423
• /
• 2016

Interference in device-to-device (D2D) communication underlaying cellular network needs to be elaborately investigated because of channel sharing. The objective is to improve the quality of D2D communications while maintaining high performance for cellular users. In this paper, we solve the above problem by jointly considering channel allocation and power control using coalition formation game. Our cooperative game theoric approach allows to enhance network-wide performance. We design a merge-and-split algorithm to deal with the complexity of the combinatorial structure in coalition formation problem. The analytical and numerical results show that our algorithm converges to a stable point which achieves high network performance.