• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1689-1703
• /
• 2020

When data is transmitted over an unreliable channel, the error of the data packet may result in serious degradation. The multiple description coding (MDC) can solve this problem and save transmission costs. In this paper, we propose a deep multiple description coding network (MDCN) to realize efficient image compression. Firstly, our network framework is based on convolutional auto-encoder (CAE), which include multiple description encoder network (MDEN) and multiple description decoder network (MDDN). Secondly, in order to obtain high-quality reconstructed images at low bit rates, the encoding network and decoding network are integrated into an end-to-end compression framework. Thirdly, the multiple description decoder network includes side decoder network and central decoder network. When the decoder receives only one of the two multiple description code streams, side decoder network is used to obtain side reconstructed image of acceptable quality. When two descriptions are received, the high quality reconstructed image is obtained. In addition, instead of quantization with additive uniform noise, and SSIM loss and distance loss combine to train multiple description encoder networks to ensure that they can share structural information. Experimental results show that the proposed framework performs better than traditional multiple description coding methods.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.3
• /
• pp.329-340
• /
• 2001

Video server which stores video streams should serve more users with the requested streams rapidly, satisfying their time constraints. For this objective, the storage system of the video server needs large disk bandwidth and buffer capacity. But, because given disk bandwidth and buffer capacity are limited, technologies that utilize effectively the given disk bandwidth and buffer capacity without waste might be needed. In this paper, we propose the policies that not only reduce the startup latency but also, support more users by utilizing the disk bandwidth and buffer efficiently, which also considering time constraint characteristics of video stream. In order to reduce the startup latency of the service requests, it inducts the effect of random access of disk head by moving asynchronously disk heads in multiple disk environments. Also, there are two technologies to support more users. First, the proposed policy reduces the seek latency by moving the disk head sequentially so that it saves the disk bandwidth. Second, it determines the segment size through considering both given buffer capacity and given disk bandwidth by heuristic approach in order to overcome the constraints of the number of streams supported due to limitation of buffer capacity. The segment size makes it utilize given buffer optimally with given disk bandwidth. The correctness of the proposed policies is not only analyzed theoretically but also evaluated through simulations.

• Journal of Digital Convergence
• /
• v.12 no.7
• /
• pp.37-47
• /
• 2014

This study applies Policy Streams and Expert Group Standing Change Framework (PSECF) proposed by SangJung Park and Chan KOH to analyze the Roh's Participatory government's decision making process on the wartime Operational Control (OPCON) transition. PSECF case study's results are as follows: Strong commitments of the former president Roh Moohyun and the progressive National Security Committee (NSC) were primary drivers in the policy developing process. But military expert groups such as the Ministry of National Defense (MND) and the Joint Chiefs of Staffs (JCS) were thoroughly excluded due to their passive role against the wartime OPCON transition. After the policy resolution, the standing of expert groups changed: the standing of advocate effects, the former progressive NSC who led the wartime OPCON transition in the Roh's Participatory government, went down but the conservatives such as ROK MND and JCS improve their standing because the conservative government kicks off 8 months later from the policy decision. In conclusion, the proposed PSECF through the Roh's Participatory government's case-study is worthy as an explanatory framework for high level national policies.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.119-127
• /
• 2002

Video server which stores video streams should serve more users with the requested streams rapidly, satisfying their time constraints. However, the number of users supported and the response times for the requested services in video server are in the oppositional relationship with viewpoint of disk throughput. In this paper, we propose new policy that can provide not only rapid responses for the service requests but also increase the number of users supported in the storage system of video server. The policy admits the random movements of disk heads for urgent service requests but maintains the sequential or restricted movements of disk heads and eliminates rewind time of disk heads for less-urgent service requests in storage system of multiple disks environment so that it can not satisfy only the QoS of users but also support more users.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.823-834
• /
• 2004

In this research, the similarity search algorithms are provided for large video data streams. A video stream that consists of a number of frames can be expressed by a sequence in the multidimensional data space, by representing each frame with a multidimensional vector By analyzing various characteristics of the sequence, it is partitioned into multiple video segments and clusters which are represented by hyper-rectangles. Using the hyper-rectangles of video segments and clusters, similarity functions between two video streams are defined, and two similarity search algorithms are proposed based on the similarity functions algorithms by hyper-rectangles and by representative frames. The former is an algorithm that guarantees the correctness while the latter focuses on the efficiency with a slight sacrifice of the correctness Experiments on different types of video streams and synthetically generated stream data show the strength of our proposed algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12C
• /
• pp.1020-1028
• /
• 2010

Relay has attracted great attention due to its inherent capability to extend the service coverage and combat shadowing in next generation mobile communication systems. So far, most relay technologies have been developed under the half-duplex (HD) constraint that prevents relays from transmitting and receiving at the same time. Although half-duplex relay (HDR) is easy to implement, it requires partitioning of resource for transmission and reception, reducing the whole system capacity. In this paper, we propose a multinser precoding and power control scheme with sum rate matching for a full-duplex (FD) multiple-input multiple-output (MIMO) relay. Full-duplex relay (FDR) can overcome the drawback of HDR by transmitting and receiving on the same frequency at the same time, while it is crucial to reduce the effect of self-interference that is caused by its own transmitter to its own receiver. The proposed precoding scheme cancels the self-interference of the FDR as well as to support multiuser MIMO. Moreover, we suggest a power allocation scheme for FD MIMO relay with the constraint that the sum rate of the relay's received data streams is equal to that of the relay's transmit data streams.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.606-612
• /
• 2016

The multi-view video service based on the DASH(Dynamic Adaptive Streaming over HTTP) switches the viewpoint or object which is selected by the user among the multiple video streams captured by multiple cameras. However, the problem is that the conventional DASH-based multi-view video service takes a long time to switch the viewpoint. The reason is that the conventional scheme switches to the new video stream after consuming all buffered segments of the previous video stream. In this paper, we propose a video streaming scheme for minimizing the viewpoint switching delay in the DASH-based multi-view video service. In order to minimize the viewpoint switching delay, the proposed scheme configures the video streams by controlling the GoP (Group of Pictures) size and controls the client buffer based on bandwidth estimation and playback buffer occupancy. Through the experimental results, we prove that the proposed scheme reduces the viewpoint switching delay.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.529-546
• /
• 2002

A VOD server, which is the central component for constructing VOD systems, requires to provide high bandwidth and continuous real-time delivery. It is also necessary to the sophisticated disk scheduling and data placement schemes in VOD sewers. One of the most common problem facing in such a system is the high initial latency time to service multiple users concurrently. In this paper, we propose a dynamic stream merging scheme for reducing the initial latency time in VOD servers. The proposed scheme allows clients to merge streams on a request as long as their requests fall within the reasonable time interval. The basic idea behind the dynamic stream merging is to merge multiple streams into one by increasing the frame rate of each stream. In the performance study, the proposed scheme can reduce the initial latency time under the minimum buffer use and also can enhance the performance of the VOD server with respect to the capacity of user admission.

• The KIPS Transactions:PartD
• /
• v.18D no.1
• /
• pp.67-80
• /
• 2011

On an automated business document processing system maintaining financial data, errors on query based retrieval of numbers are critical to overall performance and usability of the system. Automatic spelling correction methods have been emerged and have played important role in development of information retrieval system. However scope of the methods was limited to the symbols, for example alphabetic letter strings, which can be reserved in the form of trainable templates or custom dictionary. On the other hand, numbers, a sequence of digits, are not the objects that can be reserved into a dictionary but a pure markov sequence. In this paper we proposed a new OCR model for spelling correction for numbers using the multiple streams and the context based correction on top of probabilistic information retrieval framework. We implemented the proposed error correction model as a sub-module and integrated into an existing automated invoice document processing system. We also presented the comparative test results that indicated significant enhancement of overall precision of the system by our model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.1025-1031
• /
• 2007

This paper proposes an area-efficient pipeline FFT processor for MIMO-OFDM systems with four transmitting and four receiving antennas. Since the MIMO-OFDM system transmits multiple data streams, the complexity for the MIMO-OFDM system with a single-channel FFT processor increases linearly with the increase of the number of transmit channels. The proposed FFT processor is based on multi-channel structure, and therefore it can efficiently support multiple data streams. With the mixed radix algorithm, the number of non-trivial multiplications of the proposed FFT processor is decreased. The proposed FFT processor is synthesized with CMOS $0.18{\mu}m$ process and reduces the logic gates by 25% over a 4-channel Radix-4 multi-path delay commutator (R4MDC) FFT processor. Since the MIMO-OFDM FFT processor is one of the largest modules in the systems, the proposed FFT processor will be a vast contribution improvement to the low complexity design of MIMO-OFDM systems.