• Journal of Internet Computing and Services
• /
• v.11 no.3
• /
• pp.43-51
• /
• 2010

In this paper, we evaluate the system throughput and the method of optimal wireless resource allocation for the access zone (AZ) and relay zone (RZ) in downlink when the cell coverage is extended using the non-transparent Relay Station (RS) in a 2-hop cellular relay system based on IEEE802.16j, which uses the OFDMA-TDD structure. For the analyses, we first introduce the MAC (Media Access Control) frame structure in the non-transparent mode, then we investigate the interfering elements in both AZ and RZ for the network devices such as the Mobile Station (MS) and RS. Through computer simulation, we analyze the cell coverage extension and system throughput in terms of the distance between Base Station (BS) and RS, then we present the amount of the optimal allocation of wireless resource for the AZ and RZ in downlink using our results.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.237-240
• /
• 2003

Efficient memory management is one of the most crucial requirement of lava virtual machine. In Java, memory is allocated everytime when a new instance of class is created or when a method is called. The allocated memory is freed when the instance is no longer used, or when the called method is returned. In this paper we have examined the memory management scheme applied to the simpleRTJ lava virtual machine. The simpleRTJ has such a distinguished characteristic in its memory management scheme that the size of all instances are forced to be the same and the size of stack frames of all methods be the same, respectively. We present in this paper the scheme thoroughly and analyze its anticipated performance qualitatively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6A
• /
• pp.445-454
• /
• 2005

To measure the performance of call quality, we have built the experiment environment and observed that the delay caused by encapsulation between internet and VoIP telephones is under 5ms at most. The major delay is assumed to be the time required to capsulate the packet for tunnelling of VPN. Because the difference of average delay time is under $4ms{\sim}5ms$, the difference of call quality between VoIP and VoIP telephone adopting VPN is negligible. We have concluded that the capsulation process between PAC and PNS is the major factor influencing the network load by changing the number of fames in a packet during communication Also, we have concluded that the most suitable frame numbers is tow or three by adding the frame numbers in a packet to obtain the suitable frames in a packet and setting up end-to-end delay under 150ms.

• Journal of Advanced Navigation Technology
• /
• v.22 no.1
• /
• pp.20-26
• /
• 2018

In this paper, we propose a moving object detection and tracking algorithm based on multi-frame feature point tracking information to reduce false positives. However, there are problems of detection error and tracking speed in existing studies. In order to compensate for this, we first calculate the corner feature points and the optical flow of multiple frames for camera movement compensation and object tracking. Next, the tracking error of the optical flow is reduced by the multi-frame forward-backward tracking, and the traced feature points are divided into the background and the moving object candidate based on homography and RANSAC algorithm for camera movement compensation. Among the transformed corner feature points, the outlier points removed by the RANSAC are clustered and the outlier cluster of a certain size is classified as the moving object candidate. Objects classified as moving object candidates are tracked according to label tracking based data association analysis. In this paper, we prove that the proposed algorithm improves both precision and recall compared with existing algorithms by using quadrotor image - based detection and tracking performance experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8B
• /
• pp.1424-1435
• /
• 2000

A bit-rate controller that can achieve a constant bit rate when coding object-based video sequences is an important part to achieve an adaptation to bit-rate constraints, desired video quality, distribution of bits among objects, relationship between texture and shape coding, and determination of frame skip or not. Therefore we design content-based bit rate controller which will be used for relevant bit-rate control. The implementation is an extension of MPEG-4 rate control algorithm which employs a quadratic rate-quantizer model. The importance of different objects in a video is analyzed and segmented into a number of VOPs which are adaptively bit-allocated using the object-based modelling. Some test sequences are observed by a number of non-experts and interests in each object are analysed. The initial total target bit-rate for all objects is obtained by using the proposed technique. Then the total target bits are jointly analyzed for preventing from overflow or underflow of the buffer fullness. The target bits are distributed to each object in view of its importance, not only of statistical analysis such as motion vector magnitude, size of object shape, and coding distortion of previous frame. The scheme is compared with the rate controller adopted by the MPEG-4 VM8 video coder by representing their statistics and performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.470-475
• /
• 2012

In Q-algorithm of EPCglobal Class-1 Gen-2 RFID system, the initial value of $Q_{fp}$, which is the slot-count parameter, is not defined in the standard. And the values of weight C, which is the parameter for incrementing or decrementing the slot-count size, are not determined. Therefore, if the number of tags is small and we let the initial $Q_{fp}$ be large, the number of empty slot will be large. On the other hand, if we let the initial $Q_{fp}$ be small in spite of many tags, almost all the slots will be collided. Also, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to allocate the optimal initial $Q_{fp}$ through the tag number estimation and select the weight based on the slot-count size of current query round.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.2
• /
• pp.60-64
• /
• 2006

In typical video streaming services such as MPEG encoded video, the transmission data sizes change depending on the frame types and the required bandwidth for QoS support also changes as time passes. Accordingly, in video streaming services using the Internet it could happen that the video services stop occasionally due to instantaneous deficiencies of the required bandwidth under unexpected congestion even if the highest priority is allocated to the service by network administration. In this paper, we investigate several methods for bandwidth allocation and traffic engineering to support MPEG video traffic and propose a new method to reduce the transmission delay and enhance the throughput, there by provisioning the QoS requirements. In the proposed scheme, LSPs are established based on temporal variation patterns of the Internet traffic and the CQ_LLQ policing scheme is applied for traffic shaping at the ingress routers. Finally we verified the performance of the proposed scheme via computer simulations using OPNET.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.68-74
• /
• 2009

In this paper, we propose an effective memory reduction algorithm to reduce the amount of reference frame buffer and memory bandwidth in video encoder and decoder. In general video codecs, decoded previous frames should be stored and referred to reduce temporal redundancy. Recently, reference frames are recompressed for memory efficiency and bandwidth reduction between a main processor and external memory. However, these algorithms could hurt coding efficiency. Several algorithms have been proposed to reduce the amount of reference memory with minimum quality degradation. They still suffer from quality degradation with fixed-bit allocation. In this paper, we propose an adaptive block-based min-max quantization that considers local characteristics of image. In the proposed algorithm, basic process unit is $8{\times}8$ for memory alignment and apply an adaptive quantization to each $4{\times}4$ block for minimizing quality degradation. We found that the proposed algorithm can obtain around 1.7% BD-bitrate gain and 0.03dB BD-PSNR gain, compared with the conventional fixed-bit min-max algorithm with 37.5% memory saving.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.8
• /
• pp.45-53
• /
• 2004

This paper proposes and analyzes a new media access control (MAC) scheduling algorithm, “Interleaved Polling with Deficit Round Robin (IPDRR)” that supports weighted fairness among ONUs in Ethernet Passive Optical Network (PON). The purpose of the proposed IPDRR algerian is not only to eliminate the unused bandwidth of upstream ONU traffic, but also to provide weighted fair sharing of upstream bandwidth among ONUs in Ethernet PON systems. Simulation results show that the IPDRR improves the utilization of upstream channel by removing the unused bandwidth and provides weighted fairness among ONUs, although the IPACT scheduling is unfair according to traffic characteristics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.307-314
• /
• 2003

In the general multiple video object coder, more interested objects such as speaker or moving object is consistently coded with higher priority. Since the priority of each object may not be fixed in the whole sequence and be variable on frame basis, it must be adjusted in a frame. In this paper, we analyze the independent rate control algorithm and global algorithm that the QP value is controled by the static parameters, object importance or priority, target PSNR, weighted distortion. The priority among static parameters is analyzed and adjusted into dynamic parameters according to the visual interests or importance obtained by camera interface. Target PSNR and weighted distortion are proportionally derived by using magnitude, motion, and distortion. We apply those parameters for the weighted distortion control and the priority-based control resulting in the efficient bit-rate distribution. As results of this paper, we achieved that fewer bits are allocated for video objects which has less importance and more bits for those which has higher visual importance. The duration of stability in the visual quality is reduced to less than 15 frames of the coded sequence. In the aspect of PSNR, the proposed scheme shows higher quality of more than 2d13 against the conventional schemes. Thus the coding scheme interfaced to human- eye proves an efficient video coder dealing with the multiple number of video objects.