• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.1282-1285
• /
• 2022

기존의 video domain adaptation은 closed set 환경에서 주로 연구되었다. 하지만 이는 source와 target의 label이 같다는 비현실적인 전제를 요구한다. 따라서 본 논문에서는 target의 label space가 source보다 넓은 open set video domain adaptation 문제를 다룬다. 우린 open set image domain adaptation에서 사용되는 방법들을 video로 확장 시켜 모델을 설계하고 UCF to HMDB, HMDB to UCF 와 같은 video dataset에서 실험하였다. 그 결과 source only 대비 UCF to HMDB에서 12%, HMDB to UCF 7.1% 향상된 결과를 얻었다.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.257-271
• /
• 2008

Wireless broadcast environments has character that a number of mobile client can receive data streaming from central server no matter how they are so many. Because it is asymmetric bandwidth in that uplink and downlink bandwidth are different. This advantage helps wireless broadcast environments is used in many applications. These applications work almost read operation and need control concurrency using transaction unit. Previous concurrency control scheme in single channel is not adapted in multi channel environments because consistency of data are broken when a mobile client tunes in a broadcast cycle in a channel and then move into another channel and listen to different broadcast cycle with already accessed broadcast cycle. In this paper, we propose concurrency control for read-only mobile transactions in multiple wireless broadcast channel. First of all, we adapt index and data dedicated channel and propose LBCPC(Longest Broadcast Cycle Per Channel) as new unit of consistency. In index dedicated channel, it is repeatedly broadcasted data in same BCPC(Broadcast Cycle Per Channel) until LBCPC. And mobile transaction executes validation using control information every LBCPC. As a result, consistency of data is kept and average response time is shorter than one in single channel because waiting time for restart reduces. And as control information is broadcasted more frequently than in single channel, it is guaranteed currency about data accessed by transaction. Finally, according to the simulation result, we verify performance of our scheme in multi channel as comparing average response time with single channel.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.6
• /
• pp.1297-1307
• /
• 2013

Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or disseminate useful traffic information to othet vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collision at the link layer due to an excessive number of broadcast packets. To solve broadcast storm problem, we propose an RPB-MACn-based LV-CAST that is a vehicular broadcast algorithm for disseminating safety-related emergency message. The proposed LV-CAST identifies the last node within transmission range by computing the distance extending on 1 hop from the sending node of an emergency message to the next node of receiving node of the emergency message, and the last node only re-broadcasts the emergency message. The performance of LV-CAST is evaluated through simulation and compared with other message dissemination algorithms.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.394-402
• /
• 2011

We introduce the standard content identifier Universal Content Identifier (UCI) and a watermarking system that embeds UCI for the broadcast content distribution services. Our proposed UCI embedder is designed in consideration of integrating with the previously established broadcast system and protecting the illegal distribution of broadcast contents. Our goal is that when broadcast content is transmitted, 28 byte UCI is embedded imperceptibly in the content itself in real-time and the embedded UCI is successfully extracted not only in the typical format used in the broadcast content distribution service but also in the illegally distributed broadcast contents. Usually the illegally distributed contents are modified from the original by changing resolutions, frame rates, or adjusting colors. In this paper, we present a watermarking scheme that embeds 28 byte UCI in broadcast content in real-time while keeping the visual quality high and the embedded watermark robust enough to survive through the various modification. The experimental results show that the embedded UCI remains in the various modified versions of content and that the visual degradation by embedding is not noticeable.

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

Deblocking Filter (DF) is newly introduced into H.264/AVC to remove blocky artifacts. It improves the picture quality and the improved picture is set to the frame buffer for motion compensation. As a result, higher coding efficiency is achieved by DF. However, if the original image has heavily-slanted patterns, DF removes the edges to be kept because it is applied only perpendicularly to the block boundaries. In this paper, we propose Edge Adaptive Deblocking Filter (EADF) which is applied not only for the perpendicular but also for several slanted directions to deal with the problem. Simulation results showed us that EADF was especially effective for the sequence "Foreman" with PSNR gain of 0.04 dB.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.06a
• /
• pp.57.2-62
• /
• 1999

Fractal coding is image compression techniques using one of image characteristics self-transformability. In fractal image coding, the encoding process is to select the domain block similar to a range block. The reconstructed image quality of fractal image coding depends on similitude between a range block and the selected domain block. Domain block similar to a range blocks. In fact, the error of the reconstructed image adds up the generated error in encoding process and the generated error in decoding process. But current domain block estimating function considered only the encoding error. We propose a domain block estimating function to consider not only the encoding error but also the decoding error. By computer simulation, it was verified to obtain the high quality reconstructed image.

• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.24-31
• /
• 2004

This paper embodies the rating recognition system of broadcast program which can automatically acknowledge the broadcast pictures indicating the harmfulness rating, so prevent children from watching TV. This experiment was progressed as the course of extracting featured patterns (standard number patterns) and the proper patterns owned only by the concerned numbers from the numbers of standard font used by broadcasters, and comparing these patterns with input pictures and arranging them. The recognition rate of x-rating was remarkably high as a result of this experiment.

• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.79-89
• /
• 2002

The performance of OCC is very sensitive to the transaction abort rate, Even if the abort probability can be reduced by re-ordering, most of re-ordering schemes have space overhead in maintaining a graph or histories, In this paper, we proposed an efficient re-ordering scheme based on a broadcast invalidation mechanism. Our scheme, called CBI, can reduce the abort probability without space overhead in maintaining a graph or histories, By simulation studies, we showed that CBI reduced the abort rate and unnecessary operations, Additionally, we showed that CBI outperforms not only BTS but also TSH with low space overhead.

• Journal of Broadcast Engineering
• /
• v.14 no.6
• /
• pp.692-702
• /
• 2009

Real-time virtual studios which could run only on expensive workstations are now available for personal computers thanks to the recent development of graphics hardware. Nevertheless, graphics are rendered off-line in the post production stage in film or TV drama productions, because the graphics' quality is still restricted by the real-time hardware. Software-based camera tracking methods taking only the source video into account take much computation time, and often shows unstable results. To overcome this restriction, we propose a system that stores camera motion data from sensors at shooting time as common virtual studios and uses them in the post production stage, named as POVIS(post virtual imaging system). For seamless registration of graphics onto the camera video, precise zoom lens calibration must precede the post production. A practical method using only two planar patterns is used in this work. We present a method to reduce the camera sensor's error due to the mechanical mismatch, using the Kalman filter. POVIS was successfully used to track the camera in a documentary production and saved much of the processing time, while conventional methods failed due to lack of features to track.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.3
• /
• pp.400-410
• /
• 2010

In an identity-based threshold broadcast encryption (IDTHBE) scheme, a broadcaster chooses a set of n recipients and a threshold value t, and the plaintext can be recovered only if at least t receivers cooperate. IDTHBE scheme is different from the standard threshold public key encryption schemes, where the set of receivers and the threshold value are decided from the beginning. This kind of scheme has wide applications in ad hoc networks. Previously proposed IDTHBE schemes have ciphertexts which contain at least n elements. In addition, the security of theses schemes relies on the random oracles. In this paper, we introduce two new constructions of IDTHBE for ad hoc networks. Our first scheme achieves S-size private keys while the modified scheme achieves constant size private keys. Both schemes achieve approximately (n-t)-size ciphertexts. Furthermore, we also show that they are provablesecurity under the decision bilinear Diffie-Hellman Exponent (BDHE) assumption in the standard model.