• Journal of the Korea Society of Computer and Information
• /
• v.22 no.7
• /
• pp.47-54
• /
• 2017

Recently, correlation filter based trackers have shown excellent tracking performance and computational efficiency. In order to enhance tracking performance in the correlation filter based tracker, search area which is image patch for finding target must include target. In this paper, two methods to discriminatively represent target in the search area are proposed. Firstly, search area location is estimated using pyramidal Lucas-Kanade algorithm. By estimating search area location before filtering, fast motion target can be included in the search area. Secondly, we investigate multi-channel Local Edge Pattern(LEP) which is insensitive to illumination and noise variation. Qualitative and quantitative experiments are performed with eight dataset, which includes ground truth. In comparison with method without search area estimation, our approach retain tracking for the fast motion target. Additionally, the proposed multi-channel LEP improves discriminative performance compare to existing features.

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

In general, channel information of received DTV signal analyzed based on symbol timing clock with only In-phase information in DTV receiver. This paper presents technical requirements of channel analysis system for DTV reception signal. In order to meet such requirements and measure more accurate magnitude and phase of channel information, compensation method for the quadrature information from measured in-phase data is proposed. The proposed channel analysis system is implemented with a commercial DTV chipset and provides fast data analysis with good connectivity with field test vehicles. Computer simulation and laboratory test results are provided to figure out the performance of the proposed channel analysis system for DTV signal.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.2
• /
• pp.37-43
• /
• 2009

In this study, multi-channel digital hearing aid algorithm for low power system is proposed. First, MDCT(Modified Discrete Cosine Transform) method converts time domain of input speech signal into frequency domain of it. Output signal from MDCT makes a group about each channel, and then each channel signal adjusts a gain using LCF(Loudness Compensation Function) table depending on hearing loss of an auditory person. Finally, compensation signal is composed by TDAC and IMDCT. Its all of process make progress 16-bit fixed-point operation. We use fast-MDCT instead of MDCT for reducing system complexity and previously computed tables instead of log computation for estimating a gain. This algorithm evaluate through computer simulation.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1201-1209
• /
• 2009

Recently, the convergence of the telecommunications industry through the development of network media has brought along interactive data services in addition to the traditional broadcast services by providing direct connections between the users and the broadcasters. This can be easily achieved by the combination of existing network technology and multimedia technology, but in reality, as seen in the actual implementation of IPVT, it's difficult to provide satisfactory levels of service to users due to issues of network bandwidth and problems of streaming system. In particular, a network which is able to fully support Qos/QoE, and also a fast enough channel changing technology that is satisfactory to the user, are prerequisites for IPTV success. Therefore this thesis proposes a fast channel changing technique to delivery enhanced IPTV user experience. Recent IP set-top-boxes use only a small portion of the CPU to feed Ethernet packets to the hardware decoder and play them. Thus, by making IP set-top-boxes share cached channel information and content with each other, reducing the load on the server and enhancing the channel changing time is made possible.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.45-51
• /
• 2009

We have presented a routing mechanism that selects a route by considering channel statuses in order to fast transfer delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is the shortest or the number of hops is the smallest. An algorithm to select a real-time transfer path based on link error rates according to the characteristic of wireless medium was also suggested. However, the propagation delay and retransmission timeout affected by link error rates are shorter than channel assessment time and backoff time. Therefore, the mechanism proposed in this paper estimated the time spent in using a clear channel and sending out a packet, which is based on channel backoff rates. A source node comes to select a route with the shortest end-to-end delay as a fast transfer path for real-time traffic, and sends data along the path chosen. We found that this proposed mechanism improves the speed of event-to-sink data transfer by performing experiments under different link error and channel backoff rates.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.3 no.2
• /
• pp.42-50
• /
• 2004

This paper describes a new approach to Internet host mobility. We argue that local mobility, the performance of existing mobile host protocol can be significantly improved. It proposes Fast Moving Detection schemethat based on neighbor AP channel information and moving detection table. And, it composes Local Area Clustering Path (LACP) domain that collected in AP's channel information and MN interface information. It stored the roaming table to include channel information and moving detection. Those which use the proposal scheme will need to put LACP information into the beacon or probe frame. Each AP uses scheme to inform available channel information to MN. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of theburst blocking probability and the link utilization.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.209-215
• /
• 2010

In an asymmetrical speed channel environment like asymmetric digital subscriber line, the up-link bandwidth is normally smaller than the down-link bandwidth, which will lead to extremely low utilization of down-link bandwidth when current P2P video transmission is applied. To overcome this, a new fast P2P video transmission method applied in an asymmetrical speed channel environment is proposed in this paper. On the basis of the many-to-one concept, the proposed method uses a new multipeer aggregation technique to enhance the utilization of down-link bandwidth. In addition, an adaptive peer assignment algorithm is also introduced in order to minimize the overall transmission time. Experimental results show that by using our proposed method, the utilization of down-link bandwidth is significantly improved, and the overall transmission time is greatly reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4595-4610
• /
• 2020

In the practical communication environment, the accurate channel state information (CSI) is difficult to obtain, which will cause the mismatch of resource and degrade the system performance. In this paper, to account for the channel uncertainties, a robust power allocation scheme for a downlink Non-orthogonal multiple access (NOMA) heterogeneous network (HetNet) is designed to maximize energy efficiency (EE), which can ensure the quality of service (QoS) of users. We conduct the robust optimization model based on worse-case method, in which the channel gains belong to certain ellipsoid sets. To solve the non-convex non-liner optimization, we transform the optimization problem via Dinkelbach method and sequential convex programming, and the power allocation of small cell users (SCUs) is achieved by Lagrange dual approach. Finally, we analysis the convergence performance of proposed scheme. The simulation results demonstrate that the proposed algorithm can improve total EE of SCUs, and has a fast convergence performance.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.3
• /
• pp.29-36
• /
• 2000

It is very import role to increase communication quality that fast detection of random sequence synchronization fail in synchronous stream cipher system using initial synchronization mode. Generally it sends additional information to detect random sequency synchronization fail. But we can't transmit additional informations to decide synchronization fail in a system using RMVD to correct channel error. In this paper we propose a method to detect synchronization fail in the receiver even though a system using RMVD has no margin to send additional information, For detecting random sequency synchronization fail we decipher receiver data analyze probability of transition rate for pre-determined period and decide synchronization fail using calculated transition rate probability. This proposed method is fast very reliable and robust in noisy channel and is easily implemented with hardware.

• Journal of electromagnetic engineering and science
• /
• v.4 no.2
• /
• pp.93-96
• /
• 2004

In this paper we introduce a new escalator(ESC) structure-based adaptation algorithm. The proposed algorithm is independent of eigenvalues spread ratio(ESR) of channel and has faster convergence speed than that of the conventional ESC algorithms. This algorithm combines the fast adaptation ability of least square methods and the orthogonalization property of the ESC structure. From the simulation results the proposed algorithm shows superior convergence speed and no slowing down of convergence speed when we increase the ESR of the channel.