• Journal of Korea Multimedia Society
• /
• v.12 no.4
• /
• pp.483-491
• /
• 2009

In this paper, we propose a fast motion estimation algorithm using adaptive elimination of sub-block partial coefficients. The proposed algorithm predicts an adaptive threshold for each sub-block by using relationship of an initial sum of absolute difference(SAD) and a minimum SAD at the current point, and efficiently reduces unnecessary calculation time of the conventional partial distortion elimination(PDE) algorithm with the predicted threshold. Our algorithm reduces about 60% of computations of the conventional PDE algorithm without any degradation of prediction quality compared with the con ventional full search. Additionally, the proposed algorithm can be applied to other fast motion estimation 떠gorithms. the proposed Our proposing algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

• BMB Reports
• /
• v.53 no.7
• /
• pp.357-366
• /
• 2020

Currently, most biological research relies on conventional experimental techniques that allow only static analyses at certain time points in vitro or ex vivo. However, if one could visualize cellular dynamics in living organisms, that would provide a unique opportunity to study key biological phenomena in vivo. Intravital microscopy (IVM) encompasses diverse optical systems for direct viewing of objects, including biological structures and individual cells in live animals. With the current development of devices and techniques, IVM addresses important questions in various fields of biological and biomedical sciences. In this mini-review, we provide a general introduction to IVM and examples of recent applications in the field of immunology, oncology, and vascular biology. We also introduce an advanced type of IVM, dubbed real-time IVM, equipped with video-rate resonant scanning. Since the realt-ime IVM can render cellular dynamics with high temporal resolution in vivo, it allows visualization and analysis of rapid biological processes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.691-708
• /
• 2010

An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7C
• /
• pp.421-427
• /
• 2011

The importance of the real-time object recognition and tracking field has been growing steadily due to rapid advancement in the computer vision applications industry. As is well known, the mean-shift algorithm is widely used in robust real-time object tracking systems. Since the mentioned algorithm is easy to implement and efficient in object tracking computation, many say it is suitable to be applied to real-time object tracking systems. However, one of the major drawbacks of this algorithm is that it always converges to a local mode, failing to perform well in a cluttered environment. In this paper, an Optical Flow-based algorithm which fits for real-time recognition of multiple moving objects is proposed. Also in the tests, the newly proposed method contributed to raising the similarity of multiple moving objects, the similarity was as high as 0.96, up 13.4% over that of the mean-shift algorithm. Meanwhile, the level of pixel errors from using the new method keenly decreased by more than 50% over that from applying the mean-shift algorithm. If the data processing speed in the video surveillance systems can be reduced further, owing to improved algorithms for faster moving object recognition and tracking functions, we will be able to expect much more efficient intelligent systems in this industrial arena.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.345-354
• /
• 2005

Since motion estimation and motion compensation methods remove the redundant data to employ the temporal redundancy in images, it plays an important role in digital video compression. Because of its high computational complexity, however, it is difficult to apply to high-resolution applications in real time environments. If we have a priori knowledge about the motion of an image block before the motion estimation, the location of a better starting point for the search of an exact motion vector can be determined to expedite the searching process. In this paper presents the motion detection algorithm that can run robustly about recusive motion. The motion detection compares and analyzes two frames each other, motion of whether happened judge. Through experiments, we show significant improvements in the reduction of the computational time in terms of the number of search steps without much quality degradation in the predicted image.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2662-2670
• /
• 1997

High speed network makes possible to transfer not only the test data but also multimedia data such as audio, image, and moving pictures and etc. In a multimedia applications, as a multimedia storage system, it is necessary to use a disk array to store and retrieve data by real time. It is important feature to various disk array parameters as a storage system on a real VOD system, such as configuration method of each disks and allocation method of multimedia data. In this paper, various parameters for the disk array are decided to be used for the video-on-demand system application by simulations in two ways. The real and simulation measurement are compared and analyzed on the performance. Simulation results shows that RAID level 5 and 256KB as striping unit and 185KB as data requests size per seconds are suitable parameter for the disk array architecture which provides MPEG-1 files with a rate of 1.5Mbps in two measurements of real and simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.430-441
• /
• 2006

As the various A/V devices and home networks are delivered to users, home networks are changing to an entertainment network. It is expected that the required network bandwidth and the amount of usage of media content in home entertainment networks will be increased. Although the access networks and home networks becoming a high speed network, there remains the problems for QoS-guaranteed media content transfer in home networks. Also, in the home network, there can be network traffic caused by applications like video conferencing, video telephone, and VoIP(voice over IP) as well as inner network traffic of home network. Since media content transfer requires the real-time delivery, it is very important and basic requirement that is to transfer media content to A/V device user wants while keeping the media quality. Even though there are many middleware protocol for home networking, they provide basic device discovery and control or simple functions for QoS-guaranteed media content transfer that are not enough to provide QoS-guaranteed media transfer service that user wants. Thus, in this paper, we propose the technique based on UPnP(universal plug and play) protocol for QoS-guaranteed media content transfer in the home network. The proposed technique is compatible with UPnP and can be used with UPnP as additional functions. In this paper, we utilize VideoLAN application to verify the proposed technique. We add the additional modules that support the proposed technique's function to VideoLAN and we verify the its functions through various test scenarios.

• Journal of Broadcast Engineering
• /
• v.20 no.3
• /
• pp.388-397
• /
• 2015

High Efficiency Video Coding (HEVC)/H.265 is a new video coding standard which is known as high compression ratio compared to the previous standard, Advanced Video Coding (AVC)/H.264. Due to achievement of high efficiency, HEVC sacrifices the time complexity. To apply HEVC to the market applications, one of the key requirements is the fast encoding. To achieve the fast encoding, exploiting thread-level parallelism is widely chosen mechanism since multi-threading is commonly supported based on the multi-core computer architecture. In this paper, we implement both the Tile-level parallelism and the Frame-level parallelism for HEVC encoding on multi-core platform. Based on the implementation, we present two approaches in combining the Tile-level parallelism with Frame-level parallelism. The first approach creates the fixed number of tile per frame while the second approach creates the number of tile per frame adaptively according to the number of frame in parallel and the number of available worker threads. Experimental results show that both improves the parallel scalability compared to the one that use only tile-level parallelism and the second approach achieves good trade-off between parallel scalability and coding efficiency for both Full-HD (1080 x 1920) and 4K UHD (3840 x 2160) sequences.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.10 s.352
• /
• pp.45-53
• /
• 2006

In this paper, we proposed a parallel hardware architecture for deblocking filter in K264/AVC. The deblocking filter has high efficiency in H.264/AVC, but it also has high computational complexity. For real time video processing, we chose a two 1-D parallel filter architecture, and tried to reduce memory access using dual-port SRAM. The proposed architecture has been described in Verilog-HDL and synthesized on Hynix 0.25um CMOS Cell Library using Synopsys Design Compiler. The hardware size was about 27.3K logic gates (without On-chip Memory) and the maximum operating frequency was 100Mhz. It consumes 258 clocks to process one macroblock, witch means it can process 47.8 HD1080P(1920pixel* 1080pixel) frames per second. It seems that it can be used for real time H.264/AVC encoding and decoding of various multimedia applications.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.59-69
• /
• 2007

In the video with a various environment, background modeling is important for extraction and recognition the moving object. For this object recognition, many methods of the background modeling are proposed in a process of preprocess. Among these there is a Kumar method which represents the Queue-based background modeling. Because this has a fixed period of updating examination of the frame, there is a limit for various system. This paper use a background modeling based on the queue. We propose the method that major parameters are decided as adaptive by background model. They are the queue size of the sliding window, the sire of grouping by the brightness of the visual and the period of updating examination of the frame. In order to determine the factors, in every process, RCO (Ratio of Correct Object), REO (Ratio of Error Object) and UR (Update Ratio) are considered to be the standard of evaluation. The proposed method can improve the existing techniques of the background modeling which is unfit for the real-time processing and recognize the object more efficient.