• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.297-306
• /
• 2008

MJoin is proposed as an algorithm to join multiple data streams efficiently, whose characteristics are unpredictably changed. It extends a symmetric hash join to handle multiple data streams. Whenever a tuple arrives from a remote stream source, MJoin checks whether all of hash tables have matching tuples. However, when a join involves many data streams with low join selectivity, the performance of this checking process is significantly influenced by the checking order of hash tables. In this paper, we propose a BiHT-Join algorithm which extends MJoin to conduct this checking in a constant time regardless of a join order. BiHT-Join maintains a bit-vector which represents the existence of tuples in streams and decides a successful/unsuccessful join through comparing a bit-vector. Based on the bit-vector comparison, BiHT-Join can conduct a hash join only for successful joining tuples based on this decision. Our experimental results show that the proposed BiHT-Join provides better performance than MJoin in the processing of multiple streams.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.6
• /
• pp.837-842
• /
• 2010

In this paper, quantum cryptography systems used in the design process inevitably open bit stream of pseudo-random number that exists multiple open channels between them and the need to share information on the part of the situation exposes a pair of bit stream. In this paper, the base test of pseudo-random number I tested out this process and the merge bit binary column look out for randomness.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.207-210
• /
• 2009

An efficient algorithm to compress high dynamic range (HDR) videos is proposed in this work. We separate an HDR video sequence into a tone-mapped low dynamic range (LDR) sequence and a ratio sequence. Then, we encode those two sequences using the standard H.264/AVC codec. During the encoding, we allocate a limited amount of bit budget to the LDR sequence and the ratio sequence adaptively to maximize the qualities of both the LDR and HDR sequences. While a conventional LDR decoder uses only the LDR stream, an HDR decoder can reconstruct the HDR video using the LDR stream and the ratio stream. Simulation results demonstrate that the proposed algorithm provides higher performance than the conventional methods.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.258-265
• /
• 2003

Transmission of continuous media streams has been a challenging problem of multimedia service. Lots of works have been done trying to figure out the best solution for this problem, and some works presented the optimal solution for transmitting the stored video using smoothing schemes applied to each individual stream. But those smoothing schemes considered only one stream, not the whole streams being serviced, to apply themselves, which could only achieve local optimum not the global optimum. Most of all, they did not exploit statistical multiplexing gain that can be obtained before smoothing. In this paper, we propose a new smoothing scheme that deals with not an individual stream but the whole streams being serviced simultaneously to achieve the optimal network bandwidth utilization and maximize the number of streams that can be serviced simultaneously. We formally proved that the proposed scheme not only provides deterministic QoS for each client but also maximizes number of clients that can be serviced simultaneously and hence achieves maximum utilization of transmission bandwidth.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.115-122
• /
• 2005

There are some problems in directly applying the conventional MPEG bit-stream based watermarking schemes to the bit-stream of a new compression standard, H.264/AVC. In this paper we analyze the effects of the conventional DCT-based watermarking scheme to H.264/AVC, especially in terms of image distortions and bit-rate changes. It turns out that the intra-frame prediction md CAVLC of H.264/AVC with the watermarking worsen the image distortions and bit-rate changes. The experiment results show on average 28.17dB decrease in PSNR and 56.71% increase in bit-rate over all QPs.

• 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 Platform Technology
• /
• v.6 no.4
• /
• pp.26-33
• /
• 2018

In this paper, we propose an image retrieval algorithm for real-time processing and design it as hardware. The proposed method is based on the classification of BoWs(Bag of Words) algorithm and proposes an image search algorithm using bit stream. K-fold cross validation is used for the verification of the algorithm. Data is classified into seven classes, each class has seven images and a total of 49 images are tested. The test has two kinds of accuracy measurement and speed measurement. The accuracy of the image classification was 86.2% for the BoWs algorithm and 83.7% the proposed hardware-accelerated software implementation algorithm, and the BoWs algorithm was 2.5% higher. The image retrieval processing speed of BoWs is 7.89s and our algorithm is 1.55s. Our algorithm is 5.09 times faster than BoWs algorithm. The algorithm is largely divided into software and hardware parts. In the software structure, C-language is used. The Scale Invariant Feature Transform algorithm is used to extract feature points that are invariant to size and rotation from the image. Bit streams are generated from the extracted feature point. In the hardware architecture, the proposed image retrieval algorithm is written in Verilog HDL and designed and verified by FPGA and Design Compiler. The generated bit streams are stored, the clustering step is performed, and a searcher image databases or an input image databases are generated and matched. Using the proposed algorithm, we can improve convenience and satisfaction of the user in terms of speed if we search using database matching method which represents each object.

• 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.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.4
• /
• pp.573-584
• /
• 2016

Invertible transformations over n-bit words are essential ingredients in many cryptographic constructions. Such invertible transformations are usually represented as a composition of simpler operations such as linear functions, S-P networks, Feistel structures and T-functions. Among them T-functions are probably invertible transformations and are very useful in stream ciphers. In this paper we will characterize a secure trinomial on ${\mathbb{Z}}_{2^n}$ which generates an n-bit word sequence without consecutive elements of period $2^n$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.147-152
• /
• 2005

In this paper, we proposed a method for compressing the static video test patterns in high quality to test the picture quality in DTV. In our method, we use the fact that the generated bits and average quantization value have almost identical distribution characteristics per each GOP and we propose a new target bit allocation method suitable for compressing the static test pattern while the target bit allocation method in MPEG-2 TM5 is suitable for the moving picture. The proposed target bit allocation method is to maintain the high quality video continuously by using the normalized complexities which are updated or maintained by means of picture qualities at each GOP. Experiment result showed that the test pattern stream encoded by MPEG-2 software with the proposed algorithm had a stable bit rate and good video quality during the decoding process.