• Title/Summary/Keyword: adaptive simulation

Search Result 3,132, Processing Time 0.028 seconds

Moving Image Compression with Splitting Sub-blocks for Frame Difference Based on 3D-DCT (3D-DCT 기반 프레임 차분의 부블록 분할 동영상 압축)

  • Choi, Jae-Yoon;Park, Dong-Chun;Kim, Tae-Hyo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.37 no.1
    • /
    • pp.55-63
    • /
    • 2000
  • This paper investigated the sub-region compression effect of the three dimensional DCT(3D-DCT) using the difference component(DC) of inter-frame in images. The proposed algorithm are the method that obtain compression effect to divide the information into subband after 3D-DCT, the data appear the type of cubic block(8${\times}$8${\times}$8) in eight difference components per unit. In the frequence domain that transform the eight differential component frames into eight DCT frames with components of both spatial and temporal frequencies of inter-frame, the image data are divided into frame component(8${\times}$8 block) of time-axis direction into 4${\times}$4 sub block in order to effectively obtain compression data because image components are concentrate in corner region with low-frequency of cubic block. Here, using the weight of sub block, we progressed compression ratio as consider to adaptive sub-region of low frequency part. In simulation, we estimated compression ratio, reconstructed image resolution(PSNR) with the simpler image and the complex image contained the higher frequency component. In the result, we could obtain the high compression effect of 30.36dB(average value in the complex-image) and 34.75dB(average value in the simple-image) in compression range of 0.04~0.05bpp.

  • PDF

Design of Adaptive DCF algorithm for TCP Performance Enhancement in IEEE 802.11 based Mobile Ad-hoc Networks (IEEE 802.11 기반 이동 ad-hoc 망에서 TCP 성능 향상을 위한 적응적 DCF 알고리즘 설계)

  • Kim, Han-Jib;Lee, Gi-Ra;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.10 s.352
    • /
    • pp.79-89
    • /
    • 2006
  • TCP is the most widely used transport protocol in Internet applications that guarantees a reliable data transfer. But, in the wireless multi-hop networks, TCP performance is degraded because it is designed for wired networks. The main reasons of TCP performance degradation are contention for wireless medium at the MAC layer, hidden terminal problem, exposed terminal problem, packet losses in the link layer, unfairness problem, reordering problem caused by path disconnection, bandwidth waste caused by exponential backoff of retransmission timer due to node's mobility and so on. Specially, in the mobile ad-hoc networks, discrepancy between a station's transmission range and interference range produces hidden terminal problem that decreases TCP performance greatly by limiting simultaneous transmission at a time. In this paper, we propose a new MAC algorithm for mobile ad-hoc networks to solve the problem that a node can not transmit and just increase CW by hidden terminal. In the IEEE 802.11 MAC DCF, a node increases CW exponentially when it fails to transmit, but the proposed algorithm, changes CW adaptively according to the reason of failure so we get a TCP performance enhancement. We show by ns-2 simulation that the proposed algorithm enhances the TCP performance by fairly distributing the transmission opportunity to the failed nodes by hidden terminal problems.

Refinement of damage identification capability of neural network techniques in application to a suspension bridge

  • Wang, J.Y.;Ni, Y.Q.
    • Structural Monitoring and Maintenance
    • /
    • v.2 no.1
    • /
    • pp.77-93
    • /
    • 2015
  • The idea of using measured dynamic characteristics for damage detection is attractive because it allows for a global evaluation of the structural health and condition. However, vibration-based damage detection for complex structures such as long-span cable-supported bridges still remains a challenge. As a suspension or cable-stayed bridge involves in general thousands of structural components, the conventional damage detection methods based on model updating and/or parameter identification might result in ill-conditioning and non-uniqueness in the solution of inverse problems. Alternatively, methods that utilize, to the utmost extent, information from forward problems and avoid direct solution to inverse problems would be more suitable for vibration-based damage detection of long-span cable-supported bridges. The auto-associative neural network (ANN) technique and the probabilistic neural network (PNN) technique, that both eschew inverse problems, have been proposed for identifying and locating damage in suspension and cable-stayed bridges. Without the help of a structural model, ANNs with appropriate configuration can be trained using only the measured modal frequencies from healthy structure under varying environmental conditions, and a new set of modal frequency data acquired from an unknown state of the structure is then fed into the trained ANNs for damage presence identification. With the help of a structural model, PNNs can be configured using the relative changes of modal frequencies before and after damage by assuming damage at different locations, and then the measured modal frequencies from the structure can be presented to locate the damage. However, such formulated ANNs and PNNs may still be incompetent to identify damage occurring at the deck members of a cable-supported bridge because of very low modal sensitivity to the damage. The present study endeavors to enhance the damage identification capability of ANNs and PNNs when being applied for identification of damage incurred at deck members. Effort is first made to construct combined modal parameters which are synthesized from measured modal frequencies and modal shape components to train ANNs for damage alarming. With the purpose of improving identification accuracy, effort is then made to configure PNNs for damage localization by adapting the smoothing parameter in the Bayesian classifier to different values for different pattern classes. The performance of the ANNs with their input being modal frequencies and the combined modal parameters respectively and the PNNs with constant and adaptive smoothing parameters respectively is evaluated through simulation studies of identifying damage inflicted on different deck members of the double-deck suspension Tsing Ma Bridge.

An Adaptive Anti-collision Algorithm for RFID Systems (RFID 시스템에서의 적응형 리더 충돌 방지 알고리즘)

  • Ok, Chi-Young;Quan, Cheng-Hao;Choi, Jin-Chul;Choi, Gil-Young;Mo, Hee-Sook;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.4
    • /
    • pp.53-63
    • /
    • 2008
  • Reader collision may occur when neighboring RFID readers use the same channel at the same time. Especially when the readers are operated in dense mode, even though many channels are available, because of frequent reader collisions we can not guarantee the performance of RFID readers. Conventional solutions such as FH(Frequency Hopping) or LBT(Listen Before Talk) are not effective in this situation because they can not schedule RFID readers effectively when RFID readers are operated in multi-channel, dense reader mode, In this paper, we propose a new RFID reader anti-collision algorithm which employs LBT, random backoff before channel access, and probabilistic channel hopping at the same time. While LBT and Random backoff before channel access reduces collisions between competing readers, probabilistic channel hopping increases channel utilization by adaptively changing the hopping probability by reflecting the reader density and utilization. Simulation results shows that our algorithm outperforms conventional methods.

An Optimal Design of Neuro-Fuzzy Logic Controller Using Lamarckian Co-adaptation of Learning and Evolution (학습과 진화의 Lamarckian 상호 적응에 의한 뉴로-퍼지 제어기의 최적 설계)

  • 김대진;이한별;강대성
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.12
    • /
    • pp.85-98
    • /
    • 1998
  • This paper proposes a new design method of neuro-FLC by the Lamarckian co-adaptation scheme that incorporates the backpropagation learning into the GA evolution in an attempt to find optimal design parameters (fuzzy rule base and membership functions) of application-specific FLC. The design parameters are determined by evolution and learning in a way that the evolution performs the global search and makes inter-FLC parameter adjustments in order to obtain both the optimal rule base having high covering value and small number of useful fuzzy rules and the optimal membership functions having small approximation error and good control performance while the learning performs the local search and makes intra-FLC parameter adjustments by interacting each FLC with its environment. The proposed co-adaptive design method produces better approximation ability because it includes the backpropagation learning in every generation of GA evolution, shows better control performance because the used COG defuzzifier computes the crisp value accurately, and requires small workspace because the optimization procedure of fuzzy rule base and membership functions is performed concurrently by an integrated fitness function on the same fuzzy partition. Simulation results show that the Lamarckian co-adapted FLC produces the most superior one among the differently generated FLCs in all aspects such as the number of fuzzy rules, the approximation ability, and the control performance.

  • PDF

Image segmentation using fuzzy worm searching and adaptive MIN-MAX clustering based on genetic algorithm (유전 알고리즘에 기반한 퍼지 벌레 검색과 자율 적응 최소-최대 군집화를 이용한 영상 영역화)

  • Ha, Seong-Wook;Kang, Dae-Seong;Kim, Dai-Jin
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.109-120
    • /
    • 1998
  • An image segmentation approach based on the fuzzy worm searching and MIN-MAX clustering algorithm is proposed in this paper. This algorithm deals with fuzzy worm value and min-max node at a gross scene level, which investigates the edge information including fuzzy worm action and spatial relationship of the pixels as the parameters of its objective function. But the conventional segmentation methods for edge extraction generally need the mask information for the algebraic model, and take long run times at mask operation, whereas the proposed algorithm has single operation according to active searching of fuzzy worms. In addition, we also propose both genetic fuzzy worm searching and genetic min-max clustering using genetic algorithm to complete clustering and fuzzy searching on grey-histogram of image for the optimum solution, which can automatically determine the size of ranges and has both strong robust and speedy calculation. The simulation results showed that the proposed algorithm adaptively divided the quantized images in histogram region and performed single searching methods, significantly alleviating the increase of the computational load and the memory requirements.

  • PDF

Bit Assignment for Wyner-Ziv Video Coding (Wyner-Ziv 비디오 부호화를 위한 비트배정)

  • Park, Jong-Bin;Jeon, Byeung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.1
    • /
    • pp.128-138
    • /
    • 2010
  • In this paper, we propose a new bit assignment scheme for Wyner-Ziv video coding. Distributed video coding (DVC) is a new video coding paradigm which enables greatly low complexity encoding because it does not have any motion prediction module at encoder. Therefore, it is very well suited for many applications such as video communication, video surveillance, extremely low power consumption video coding, and other portable applications. Theoretically, the Wyner-Ziv video coding is proved to achieve the same rate-distortion (RD) performance comparable to that of the joint video coding. However, its RD performance has much gap compared to MC-DCT-based video coding such as H.264/AVC. Moreover, Transform Domain Wyner-Ziv (TDWZ) video coding which is a kind of DVC with transform module has difficulty of exact bit assignment because the entire image is treated as a same message. In this paper, we propose a feasible bit assignment algorithm using adaptive quantization matrix selection for the TDWZ video coding. The proposed method can calculate suitable bit amount for each region using the local characteristics of image. Simulation results show that the proposed method can enhance coding performance.

Reference Frame Memory Compression Using Selective Processing Unit Merging Method (선택적 수행블록 병합을 이용한 참조 영상 메모리 압축 기법)

  • Hong, Soon-Gi;Choe, Yoon-Sik;Kim, Yong-Goo
    • Journal of Broadcast Engineering
    • /
    • v.16 no.2
    • /
    • pp.339-349
    • /
    • 2011
  • IBDI (Internal Bit Depth Increase) is able to significantly improve the coding efficiency of high definition video compression by increasing the bit depth (or precision) of internal arithmetic operation. However the scheme also increases required internal memory for storing decoded reference frames and this can be significant for higher definition of video contents. So, the reference frame memory compression method is proposed to reduce such internal memory requirement. The reference memory compression is performed on 4x4 block called the processing unit to compress the decoded image using the correlation of nearby pixel values. This method has successively reduced the reference frame memory while preserving the coding efficiency of IBDI. However, additional information of each processing unit has to be stored also in internal memory, the amount of additional information could be a limitation of the effectiveness of memory compression scheme. To relax this limitation of previous memory compression scheme, we propose a selective merging-based reference frame memory compression algorithm, dramatically reducing the amount of additional information. Simulation results show that the proposed algorithm provides much smaller overhead than that of the previous algorithm while keeping the coding efficiency of IBDI.

Adaptive Service Mode Conversion to Minimize Buffer Space Requirement in VOD Server (주문형 비디오 서버의 버퍼 최소화를 위한 가변적 서비스 모드 변환)

  • Won, Yu-Jip
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.5
    • /
    • pp.213-217
    • /
    • 2001
  • Excessive memory buffer requirement in continuous media playback is a serious impediment of wide spread usage of on-line multimedia service. Skewed access frequency of available video files provides an opportunity of re-using the date blocks which has been loaded by one session for later usage. We present novel algorithm which minimizes the buffer requirement in multiple sessions of multimedia playbacks. In continuous media playback originated from the disk, a certain amount of memory buffer is required to synchronize asynchronous disk. Read operation and synchronous playback operation. As aggregate playback bandwodth increases, larger amount of buffer needs to be allocated for this synchronization purpose. The focus of this work is to study the asymptotic behavior of the synchronization buffer requirement and to develop an algorithm coping with this excessive buffer requirement under bandwidth congestioon. We argue that in a large scale continuous media server, it may not be necessary to read the blocks for each session directly from the disk. The beauty of our work lies in the fact that it dynamically adapts to disk utilization of the server and finds the optimal way of servicinh the individual sessions while minimizing the overall buffer space requirement. Optimality of the proposed algorithm is shown by proof. The effectiveness and performance of the proposed scheme is examined via simulation.

  • PDF

Adaptive Power Control Schemes for Interference Mitigation in LTE Femtocell Networks (LTE 기반 펨토셀 네트워크에서 간섭 완화를 위한 적응적 전력 제어 기법)

  • Lee, Sang-Joon;Kim, Seung-Yeon;Lee, Hyong-Woo;Ryu, Seung-Wan;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8A
    • /
    • pp.648-660
    • /
    • 2012
  • The low-power, low-cost femtocell network has been proposed not only to alleviate traffic load to the macro base station (eNB) but also to cover the indoor coverage hole problem. However, in the dense femtocell environment where many femtocells are deployed to cover the whole large office building, performance of such femtocell environment can be deteriorated due to severe co-channel interference problem between the eNB and femtocells and among neighboring femtocells. In particular, a macro UE(mUE) located within femtocell coverage may experience severe co-channel interference from surrounding femtocells. Therefore, In this paper, we propose a novel power control schemes to mitigate interference to a mUE under such dense LTE femtocell environment. With proposed femtocell power control schemes, performance of the mUE can be greatly improved in terms of the outage probability and the SINR while maintaining satisfying femtocell performance. Simulation based performance study shows that the proposed power control scheme is able to enhance mUE performance more than 30% than the conventional dense femtocell in terms of the two performance metrics.