• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.275-278
• /
• 2000

Recently ATM(Asynchronous Transfer Mode) technology is facing challenges from Integrated Service IP(Internet Protocol), IP router, Gigabit Ethernet. Although ATM is approved by ITU-T as the standard technology in B-ISDN, its survival is still in question. In the ATM networks, the Guaranteed Frame Rate(GFR) service has been designed to accommodate non-real-time applications, such as TCP(Transmission Control Protocol)/IP based traffic. The GFR service not only guarantees a minimum throughput at the frame level, but also supports a fairshare of available resources. We have studied different discarding and scheduling schemes, and compared their throughput and fairness when TCP/IP Traffic is carried. Through simulations, we know that only per-VC queueing with weighted Round Robin(WRR) can guarantee Minimum Cell Rate Among all the Schemes that have been experimented, we recommend DT-EPD(Dynamic Threshold-Early Packet Discard) integrated with MCRplus(Minimum Cell Rate) to support the GFR service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1487-1504
• /
• 1997

In this paper, the two-stage variable block-size multiresolution motion algorithm is proposed for an interframe coding scheme in the wavelet decomposition. An optimal bit allocagion between motion vectors and the prediction error in sense of minimizing the total bit rate is obtained by the proposed algorithm. The proposed algorithm consists of two stages for motion estimatation and only the first stage can be separated and run on its own. The first stage of the algorithm introduces a new method to give the lower bit rate of the displaced frame difference as well as a smooth motion field. In the second stage of the algorithm, the technique is introduced to have more accurate motion vectors in detailed areas, and to decrease the number of motion vectors in uniform areas. The algorithm aims at minimizin gthe total bit rate which is sum of the motion vectors and the displaced frame difference. The optimal bit allocation between motion vectors and displaced frame difference is accomplished by reducing the number of motion vectors in uniform areas and it is based on a botom-up construction of a quadtree. An entropy criterion aims at the control of merge operation. Simulation resuls show that the algorithm lends itself to the wavelet based image sequence coding and outperforms the conventional scheme by up to the maximum 0.28 bpp.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2106-2111
• /
• 2003

In this paper we discuss an algorithm for a real time transmission of moving color images on the TCP/IP network using wavelet transform and neural network. The image frames received from the camera are two-level wavelet-trans formed in the server, and are transmitted to the client on the network. Then, the client performs the inverse wavelet-transform using only the received pieces of each image frame within the prescribed time limit to display the moving images. When the TCP/IP network is busy, only a fraction of each image frame will be delivered. When the line is free, the whole frame of each image will be transferred to the client. The receiver warns the sender of the condition of traffic congestion in the network by sending a special short frame for this specific purpose. The sender can respond to this information of warning by simply reducing the data rate which is adjusted by a back-propagation neural network. In this way we can send a stream of moving images adaptively adjusting to the network traffic condition.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.11
• /
• pp.1077-1081
• /
• 2004

In this Paper we discuss an algorithm for a real-time transmission of moving color image on the TCP/IP network using wavelet transform and neural network. The Image frames received from the camera are two-level wavelet-transformed in the server, and are transmitted to the client on the network. Then, the client performs the inverse wavelet-transform using only the received pieces of each image frame within the prescribed time limit to display the moving images. When the TCP/IP network is busy, only a fraction of each image frame will be delivered. When the line is free, the whole frame of each image will be transferred to the client. The receiver warns the sender of the condition of traffic congestion in the network by sending a special short frame for this specific purpose. The sender can respond to this information of warning by simply reducing the data rate which is adjusted with a neural network or fuzzy logic. In this way we can send a stream of moving images adaptively adjusting to the network traffic condition.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.1957-1964
• /
• 2010

In Video coding, the first frame is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the intial QP for the first frame of GOP affects the first frame as well as the following frames. Traditionally, the initial QP of a GOP is determined by the initial QP of the previous GOP and the average QP of the inter mode frames. In case of JM, the initial QP of a GOP is adjusted as the initial QP being less than the average QP of inter mode frames by two. However, this method is not suitable for the low bit rate video coding. In this paper, the linear relationship between the optimal QP and the ratio of the PSNR of the first frame and the average PSNR of the inter mode frames is first investigated and the linear model is proposed based on the results of the investigation. The proposed model calculate the optimal initial QP using the encoding results of the previous GOP. It is shown by experimental results that the new algorithm can predict the optimal initial QP more accurately and generate the PSNR performance better than that of the existing JM algorithm.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.4
• /
• pp.62-70
• /
• 2015

Recently the demand for projected capacitance touch screens is sharply growing especially for large screens for medical devices, PC monitors and TVs. Large touch screens in general need a controller of higher complexity. They usually have a larger number of driving and sensing lines, and hence it takes longer to scan one frame for touch detection leading to a low frame scan rate. In this paper, a novel touch screen control technique is presented, which scans each frame in two steps of simultaneous multi-channel driving. The first step is to drive all driving lines simultaneously and determine which sensing lines have any touch. The second step is to sequentially rescan only the touched sensing lines, and determine exact positions of the touches. This technique can substantially increase the frame scan rate. This technique has been implemented using an FPGA and an AFE board, and tested using a commercial 23-inch touch screen panel. Experimental results show that the proposed technique improves the frame scan rate by 8.4 times for the 23-inch touch screen panel over conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3B
• /
• pp.529-540
• /
• 2000

This is paper presents the semantic based rate-control method which is based on very low bit rate video coding standards H.263 plus, applied on very low bit rate applications. Previous rate control methods control the generated bit rates by setting the optimum quantization parameters per macro block unit on frame. But, in this paper, we added the pre-processing algorithm, semantic region recognition and assignment of priority algorithm, to obtain the subjective quality enhancement. This work aims to improve the subjective quality of skin color region or face by using unimportant background region's bit resources.

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

In this paper, We propose an efficient iteration decoding control method with variable iteration decoding for iteration codes decoding. As the number of iterations increases, the bit error rate and frame error rate of the decoder decrease and the incremental improvement gradually diminishes. However, as the iteration decoding number is increase, it require much delay and amount of processing for decoding. Thus we propose variable iteration control method to adapt variation of channel using Frame Error-Check indicator. Therefore, the CRC method requires the fewest iterations and less computation than the CE method and the SCR methods.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.175-181
• /
• 1999

There are issues regarding how some of traffic parameters should be set so that ATM and non-ATM service parameters can be compatible. For example, policing method used by frame relay based on CIR(committed information rate) will not exactly match the ATM UPC(Usage Parameter Control) method. ATM and the frame relay have different transfer modes and traffic parameters. The cells and frames are police by their own traffic control schemes. For the same information, the real traffic of the ATM side takes greater bandwidth than that of the frame relay side caused by ATM cell format and AAL5 format. IN both networks this bandwidth than that of the frame relay side caused by ATM cell format and AAL5 format. In both networks this bandwidth ratio should be considered on traffic parameter mapping to maintain their QoS and to perform efficient network resource management. In this paper we describe traffic parameter mapping schemes between frame relay and ATM in ATM network and how to expect the bandwidth ratio to maintain FR QoS in ATM network. We assumed frame length distribution to Erlang or Exponential probability density function.

• Bulletin of the Korean Space Science Society
• /
• 2004.10b
• /
• pp.296-299
• /
• 2004

KARI precision attitude determination system has been developed for high accurate geo-coding of KOMPSAT-2 image. Sensor data from two star trackers and a IRU are used as measurement and dynamic data. Sensor data from star tracker are composed of QUEST and unit vector filter. Filter algorithms consists of extended Kalman filter, unscented Kalman filter, and least square batch filter. The type of sensor data and filter algorithm can be chosen by user options. Estimated parameters are Euler angle from 12000 frame to optical bench frame, gyro drift rate bias, gyro scale factor, misalignment angle of star tracker coordinate frame with respect to optical bench frame, and misalignment angle of gyro coordinate frame with respect to optical bench frame. In particular, ground control point data can be applied for estimating misalignment angle of star tracker coordinate frame. Through the simulation, KPADS is able to satisfy the KOMPSAT-2 mission requirement in which geo-location accuracy of image is 80 m (CE90) without ground control point.