• Title/Summary/Keyword: redundancy method

Search Result 559, Processing Time 0.025 seconds

New filter design to replace the post and perceptual weighting filter of transcoder and performance evaluation (상호부호화기의 후처리 필터와 인지가중 필터를 대신하는 새로운 필터 설계 및 성능 평가)

  • 최진규;윤성완;강홍구;윤대희
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2232-2235
    • /
    • 2003
  • In speech communication systems where two different speech codecs are interoperated, transcoding algorithm is a good approach because of its low complexity and improved synthesized speech quality. This paper proposes an efficient method to further improve the performance of transcoding algorithms as well as to reduce the complexity. In the conventional transcoding algorithms. a post-filter and a perceptual weighting filter should be operated sequentially because both decoding and encoding processes are needed. This results in the redundancy of the processing in terms of complexity and perceptual quality. Using the fact that their filter structures are similar, we replaced the two filters with one. The proposed algorithm requires 72.8% lower complexity than the conventional transcoding algorithm when we compare only the complexity of the filtering processes. The results of both objective and subjective tests verify that the proposed algorithm has slightly better quality than the conventional one.

  • PDF

Adaptive coding method of MVP candidate flag by redundancy check among AMVP candidates in HEVC (HEVC의 화면 간 예측에서 AMVP 후보의 중복성 확인을 통한 적응적인 MVP Flag 코딩 방법)

  • Won, Dong-jae;Lim, Sung-won;Moon, Joo-hee
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2014.11a
    • /
    • pp.180-181
    • /
    • 2014
  • 현재 HEVC의 AMVP(Adaptive Motion Vector Prediction) 모드에서는 공간적, 시간적 후보를 고려하여 최종 후보 2개를 결정 한 후 어떤 후보를 사용하였는지 MVP flag를 이용하여 디코더로 알려준다. 이때, 최종 2개의 후보가 동일하다면 AMVP의 성능이 저하 될 수 있다. 따라서 본 논문에서는 그러한 경우를 고려하여 개선된 알고리즘을 제안한다. 실험결과는 휘도 기준 최대 -0.5%의 성능이 나오며 제안된 알고리즘이 효율적임을 보여준다.

  • PDF

An Efficient Motion Compensation Algorithm for Video Sequences with Brightness Variations (밝기 변화가 심한 비디오 시퀀스에 대한 효율적인 움직임 보상 알고리즘)

  • 김상현;박래홍
    • Journal of Broadcast Engineering
    • /
    • v.7 no.4
    • /
    • pp.291-299
    • /
    • 2002
  • This paper proposes an efficient motion compensation algorithm for video sequences with brightness variations. In the proposed algorithm, the brightness variation parameters are estimated and local motions are compensated. To detect the frame with large brightness variations. we employ the frame classification based on the cross entropy between histograms of two successive frames, which can reduce the computational redundancy. Simulation results show that the proposed method yields a higher peak signal to noise ratio (PSNR) than the conventional methods, with a low computational load, when the video scene contains large brightness changes.

A study on high availability of the linux clustering web server (리눅스 클러스터링 웹 서버의 고가용성에 대한 연구)

  • 박지현;이상문;홍태화;김학배
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.88-88
    • /
    • 2000
  • As more and more critical commercial applications move on the Internet, providing highly available servers becomes increasingly important. One of the advantages of a clustered system is that it has hardware and software redundancy. High availability can be provided by detecting node or daemon failure and reconfiguring the system appropriately so that the workload can be taken over bi the remaining nodes in the cluster. This paper presents how to provide the guaranteeing high availability of clustering web server. The load balancer becomes a single failure point of the whole system. In order to prevent the failure of the load balancer, we setup a backup server using heartbeat, fake, mon, and checkpointing fault-tolerance method. For high availability of file servers in the cluster, we setup coda file system. Coda is a advanced network fault-tolerance distributed file system.

  • PDF

Broadcast Redundancy Reduction Algorithm for Enhanced Wireless Sensor Network Lifetime (무선 센서 네트워크의 수명 향상을 위한 브로드캐스트 중복 제거 알고리즘)

  • Park, Cheol-Min;Kim, Young-Chan
    • Journal of Internet Computing and Services
    • /
    • v.8 no.4
    • /
    • pp.71-79
    • /
    • 2007
  • The communicative behaviors in Wireless Sensor Networks(WSNs) can be characterized by two different types: routing and broadcasting. The broadcasting is used for effective route discoveries and packet delivery. However, broadcasting shorten the network lifetime due to the energy overconsumption by redundant transmissions. In this paper, we proposed a algorithm that remove redundant forward nodes based on Dominant Pruning method using 2-hop neighbors knowledge. Simulation results show that the proposed algorithm appears superior performance in respect of the number of forward nodes and the network lifetime.

  • PDF

Fusion of Background Subtraction and Clustering Techniques for Shadow Suppression in Video Sequences

  • Chowdhury, Anuva;Shin, Jung-Pil;Chong, Ui-Pil
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.14 no.4
    • /
    • pp.231-234
    • /
    • 2013
  • This paper introduces a mixture of background subtraction technique and K-Means clustering algorithm for removing shadows from video sequences. Lighting conditions cause an issue with segmentation. The proposed method can successfully eradicate artifacts associated with lighting changes such as highlight and reflection, and cast shadows of moving object from segmentation. In this paper, K-Means clustering algorithm is applied to the foreground, which is initially fragmented by background subtraction technique. The estimated shadow region is then superimposed on the background to eliminate the effects that cause redundancy in object detection. Simulation results depict that the proposed approach is capable of removing shadows and reflections from moving objects with an accuracy of more than 95% in every cases considered.

A Study on the Effective Knowledge Acquisition in the TDX-1A Fault Diagnosis Expert System (TDX-1A 고장진단 전문가 시스팀을 위한 효율적인 지식획득에 대한 연구)

  • Kim, Seung-Hee;Lee, Tae-Won;Lim, Young-Hwan
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.506-509
    • /
    • 1988
  • This paper describes an effective knowledge acquisition method in the fault diagnosis expert system for the electronic switching system TDX-1A. The knowledge acquisition procedure consists of the knowledge collection, the fault diagnosis modeling and the knowledge representation. Furthermore, to improve the performance of the knowledge bases with rule and frame representation, we showed the knowledge base checking methodlogy by using redundancy and inconsistency check algorithm.

  • PDF

A Study on the Determination of the Information Block Length of mBIZ Code (mBIZ 부호의 최적 정보장 결정에 관한 연구)

  • Song, J.C.;Yoo, B.S.;Won, D.H.;Park, B.C.
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.461-464
    • /
    • 1988
  • In order to use mBIZ code as the practical transmission code, the information block length have to be determined. If the information block length is short, timing information disapperance is reduced, but transmission speed is increased as the result of inserted redundancy bit. While, if the information block length is long, timing information disapperance and jitter are caused. So it is very important to determine the optimal timing information block length. Therefore, in this paper, we determined the optimal information block length using S/X endurance method.

  • PDF

Method of Evaluation of the Strength Required in Current Seismic Design Code (현행 내진설계 규준에서 요구되는 수평강도의 평가 방법)

  • 한상환
    • Proceedings of the Earthquake Engineering Society of Korea Conference
    • /
    • 1997.10a
    • /
    • pp.193-200
    • /
    • 1997
  • Current seismic design code is based of the assumption that the designed structures would be behaved inelastically during a severe earthquake ground motion. For this reason, seismic design forces calculated by seismic codes are much lower than the forces generated by design earthquakes which makes structures responding elastically. Present procedures for calculating seismic design forces are based on the use of elastic spectra reduced by a strength reduction factors known as "response modificaion factor". Because these factors were determined empirically, it is difficult to know how much inelastic behaviors of the structures exhibit. In this study, base shear forces required to maintain target ductility ratio were first calculated from nonlinear dynamic analysis on the single degree of freedom system. And then, base shear foeces specified in seismic design code compare with above results. If the strength(base shear) required strength should be filled by overstrength and/or redundancy. Therefore, overstrength of moment resisting frame structure will be estimated from the results of static nonlinear analysis(push-over analysis).analysis).

  • PDF

Optimal Target Reliability of Bridges Based on Minimum Life-Cycle Cost Consideration

  • Wang, Junjie;Lee, J-C
    • Computational Structural Engineering : An International Journal
    • /
    • v.2 no.1
    • /
    • pp.11-17
    • /
    • 2002
  • Cost-effectiveness in design is considered for determining the target reliability of concrete bridges under seismic actions. This objective can be achieved based on the economic optimization of the expected life-cycle cost of a bridge, which includes initial cost, direct losses, and indirect losses of a bridge due to strong earthquakes over its lifetime. A separating factor is defined to consider the redundancy of a transportation network. The Park-Ang damage model is employed to define the damage of a bridge under seismic action, and a Monte Carlo method based on the DRAIN-2DX program is developed to assess the failure probability of a bridge. The results for an example bridge analyzed in this paper show that the optimal target failure probability depends on the traffic volume carried by the bridge and is between 1.0×10/sup -3/ to 3.0×10/sup -3/ over a life of 50 years.

  • PDF