• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.477-480
• /
• 2003

Packet losses in the Internet can dramatically degrade quality of multimedia streams. Forward Error Correction (FEC) is one of the best methods that can protect data from packet erasures by means of sending additional redundant information. Proposed control algorithm provides the possibility of receiving real-time multimedia streams of given quality wifth minimal traffic overhead. The traffic optimization is reached by adjusting packet size as well as block code parameters. Calculations and simulation results show that for non-bursty network conditions traffic optimization can lead to more than 50% bandwidth reduction.

• Communications for Statistical Applications and Methods
• /
• v.8 no.1
• /
• pp.173-184
• /
• 2001

We present an algorithm for the complexity reduction of a general Gaussian mixture model by using a penalized likelihood method. One of our important assumptions is that we begin with an overfitted model in terms of the number of components. So our main goal is to eliminate redundant components in the overfitted model. As shown in the section of simulation results, the algorithm works well with the selected densities.

• International Journal of Reliability and Applications
• /
• v.9 no.1
• /
• pp.79-93
• /
• 2008

The aim of this work is to generalize reliability equivalence techniques to apply them to a system consists of two independent and non-identical components connected in series(parallel) system, that have constant failure rates. We shall improve the system by using one component only. We start by establishing two different types of reliability equivalence factors, the survival reliability equivalence (SRE) and mean reliability equivalence (MRE) factors. Our second studies, introducing some applications for our studies in airports and our life. Also, we introduced some numerical results.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.12
• /
• pp.60-69
• /
• 2000

This paper describes a single-chip full-custom implementation of pipelined adaptive decision-feedback equalizer(PADFE) using a 0.25-${\mu}m$ CMOS technology for wide-band wireless digital communication systems. To enhance the throughput rate of ADFE, two pipeline stages are inserted into the critical path of the ADFE by using delayed least-mean-square(DLMS) algorithm. Redundant binary (RB) arithmetic is applied to all the data processing of the PADFE including filter taps and coefficient update blocks. When compared with conventional methods based on two's complement arithmetic, the proposed approach reduces arithmetic complexity, as well as results in a very simple complex-valued filter structure, thus suitable for VLSI implementation. The design parameters including pipeline stage, filter tap, coefficient and internal bit-width, and equalization performance such as bit error rate (BER) and convergence speed are analyzed by algorithm-level simulation using COSSAP. The single-chip PADFE contains about 205,000 transistors on an area of about $1.96\times1.35-mm^2$. Simulation results show that it can safely operate with 200-MHz clock frequency at 2.5-V supply, and its estimated power dissipation is about 890-mW. Test results show that the fabricated chip works functionally well.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.3
• /
• pp.104-111
• /
• 2014

In this paper, we deal with robotic automation for assembling car brake modules. A car brake module is comprises of a torque member, two brake pads, and two pad liners. In the assembly process, brake pads and pad liners are needed to be inserted in a torque member. If we use a typical robotic hand for the assembly, task time takes too long. So, we propose two methods. The first method is to use an end effector that has five grippers capable of gripping five assembly parts. In the first method we attached the implemented end effector to a conventional 6 degrees of freedom industrial manipulator and performed the bake module assembly task. Experimental results show that the task time is remarkably reduced. The brake module assembly task needs the robot to change its orientation frequently, so, in the second method, we added one degree of freedom to the end effector that is used in the first method. By attaching it to a conventional 6 degrees of freedom industrial manipulator, we composed a 7 degrees of freedom redundant manipulator. A redundant manipulator has the advantage of flexible manipulation so the robot can change its orientation easily and can perform assembly task very fast. Experimental results show that the second method dramatically reduce whole task time for brake module assembly.

• Journal of the Korea Society for Simulation
• /
• v.18 no.4
• /
• pp.165-173
• /
• 2009

Recent portable devices are so versatile that they have multiple communication channels and play several multimedia formats. Especially, many services are under development for users who connect Internet or nearby devices via WWAN (Wireless Wide Area Network) and/or WLAN (Wireless LAN). In case of paying the telecommunication cost proportional to the amount of data downloaded, it is necessary to reduce the cost by constructing a special ad hoc network in which each participating peer downloads a specific portion of the want-to-be-shared content over the payable WWAN channel and exchanges the remaining portion with other peers using the cost-free WLAN channel. If all peers participate in forwarding packets, some transmissions are redundant which results in the unnecessary consumption of bandwidth as well as the delayed content distribution time. In order to reduce the redundant transmission, this paper proposes both the excluding method which discourages some peers not to forward redundant packets, and the minimum cover set method in which only the minimum number of peers are in charge of forwarding packets. These two methods obviate redundant packet forwarding, and result in reduction of content distribution time by up to around 29%.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.4
• /
• pp.485-493
• /
• 2004

Open-loop position estimation methods are commonly used in mobile robot applications. Their strength lies in the speed and simplicity with which an estimated position is determined. However, these methods can lead to inaccurate or unreliable estimates. Two position estimation methods are developed in this paper, one using a single optical flow sensor and a second using two optical sensors. The first method can accurately estimate position under ideal conditions and also when wheel slip perpendicular to the axis of the wheel occurs. The second method can accurately estimate position even when wheel slip parallel to the axis of the wheel occurs. Location of the sensors is investigated in order to minimize errors caused by inaccurate sensor readings. Finally, a method is implemented and tested using a potential field based navigation scheme. Estimates of position were found to be as accurate as dead-reckoning in ideal conditions and much more accurate in cases where wheel slip occurs.

• Journal of KIISE:Software and Applications
• /
• v.34 no.9
• /
• pp.804-816
• /
• 2007

Sample training data for machine learning often contain irrelevant information or redundant concept. It is also the case that the original data may include noise. If the information collected for constructing learning model is not reliable, it is difficult to obtain accurate information. So the system attempts to find relations or regulations between features and categories in the teaming phase. The feature selection is to remove irrelevant or redundant information before constructing teaming model. for improving its performance. Existing feature selection methods assume that the distribution of documents is balanced in terms of the number of documents for each class and the length of each document. In practice, however, it is difficult not only to prepare a set of documents with almost equal length, but also to define a number of classes with fixed number of document elements. In this paper, we propose a new feature selection method that considers the impurities among the words and unbalanced distribution of documents in categories. We could obtain feature candidates using the word impurity and eventually select the features through unbalanced distribution of documents. We demonstrate that our method performs better than other existing methods via some experiments.

• Journal of Advanced Navigation Technology
• /
• v.18 no.1
• /
• pp.67-73
• /
• 2014

Due to the development of the communication technology and the high-performance mobile device, the number of video streaming service user has been increasing. Video streaming services in the restricted network environments need error control to support users for the Ultra High Definition(UHD) video delivery. Packet-level FEC method was used to control the error for delay-sensitive video service, but it has a defect in huge occupation of network resources by redundant packets. In this paper, we proposed a packet-level FEC algorithm which maintains the video quality by previous FEC methods and also reduces the occupation of network resource in the restricted network environments. The proposed algorithm controls the redundant rate with using the delivery characteristic of the video coding technology, and improves the efficiency of network resources by reducing the traffic by around 33% in comparison with the previous FEC methods.

• Journal of Korea Multimedia Society
• /
• v.21 no.10
• /
• pp.1131-1141
• /
• 2018

Motion Estimation which is used to reduce the redundant data plays an important role in video compressions. However, it requires huge computational complexity of the encoder part. And therefore many fast motion estimation methods has been developed to reduce complexity. Multi-view video is obtained by using many cameras at different positions and its complexity increases in proportion to the number of cameras. In this paper, we proposed a fast motion estimation method for multi-view video. The proposed method predicts a search start point by using correlated candidate vectors of the current block. According to the motion size of the start search point, a search start pattern of the current block is decided adaptively. The proposed method proves to be about 2 ~ 5 times faster than existing methods while maintaining similar image quality and bitrates.