• Title/Summary/Keyword: Mode Complexity

Search Result 406, Processing Time 0.028 seconds

A Fast Intra Skip Detection Algorithm for H.264/AVC Video Encoding

  • Kim, Byung-Gyu;Kim, Jong-Ho;Cho, Chang-Sik
    • ETRI Journal
    • /
    • v.28 no.6
    • /
    • pp.721-731
    • /
    • 2006
  • A fast intra skip detection algorithm based on the ratedistortion (RD) cost for an inter frame (P-slices) is proposed for H.264/AVC video encoding. In the H.264/AVC coding standard, a robust rate-distortion optimization technique is used to select the best coding mode and reference frame for each macroblock (MB). There are three types of intra predictions according to profiles. These are $16{\times}16$ and $4{\times}4$ intra predictions for luminance and an $8{\times}8$ intra prediction for chroma. For the high profile, an $8{\times}8$ intra prediction has been added for luminance. The $4{\times}4$ prediction mode has 9 prediction directions with 4 directions for $16{\times}16$ and $8{\times}8$ luma, and $8{\times}8$ chrominance. In addition to the inter mode search procedure, an intra mode search causes a significant increase in the complexity and computational load for an inter frame. To reduce the computational load of the intra mode search at the inter frame, the RD costs of the neighborhood MBs for the current MB are used and we propose an adaptive thresholding scheme for the intra skip extraction. We verified the performance of the proposed scheme through comparative analysis of experimental results using joint model reference software. The overall encoding time was reduced up to 32% for the IPPP sequence type and 35% for the IBBPBBP sequence type.

  • PDF

Security Architecture for T4 Class Common Data Link

  • Lee, Sang-Gon;Lee, Hoon-Jae;Kim, Hyeong-Rag;Ryu, Young-Jae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.8
    • /
    • pp.63-72
    • /
    • 2017
  • In this paper, we propose a security architecture for HDLC-based T4 class common data link. The common data links are composed of point-to-point, multi-to-point, and point-to-multi mode. For multi-to-point mode, one node has a bundle of point-to-point links with different end-point on the other side of the links. Thus multi-to-point mode can be considered as a bundle of point-to-point mode. Point-to-multi mode is broadcasting link. For point-to-point mode we adopted robust security network scheme to establish a secure data link, and for multi-to-point mode we use broadcast encryption scheme based on ID-based cryptography to distribute encryption key for broadcasting message encryption. We also included MACsec technology for point-to-point data link security. Computational and communicational complexity analysis on the broadcast encryption have been done.

Fast motion estimation and mode decision for variable block sizes motion compensation in H.264 (H.264의 가변 블록 움직임 보상을 위한 고속 움직임 벡터 탐색 및 모드 결정법)

  • 이제윤;최웅일;전병우;석민수
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.4
    • /
    • pp.275-285
    • /
    • 2003
  • The now video coding standard H.264 employs variable block size motion compensation, multiple references, and quarter-pel motion vector accuracy. These techniques are key features to accomplish higher coding gain, however, at the same time main factors that increase overall computational complexity. Therefore, in order to apply H.264 to many applications, key techniques are requested to improve their speed. For this reason, we propose a fast motion estimation which is suited for variable block size motion communication. In addition, we propose a fast mode decision method to choose the best mode at early stage. Experimental results show the reduction of the number of SAT SATD calculations by a factor of 4.5 and 2.6 times respectively, when we compare the proposed fast motion estimation and the conventional MVFAS $T^{[8-10]}$. Besides, the number of RDcost computations is reduced by about 45%. Therefore, the proposed methods reduces significantly its computational complexity without noticeable coding loss.

Derivation of Illumination Compensation Information for SKIP Modes in Multi-view Video Coding (다시점 비디오 부호화에서 스킵 모드의 휘도 보상 정보 유도 방법)

  • Park, Min-Woo;Park, Gwang-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.13 no.4
    • /
    • pp.516-527
    • /
    • 2008
  • This paper introduces a derivation method of both P-SKIP and B-SKIP modes for illumination compensation in the multi-view video coding scheme. In this proposed method, mismatches between IC flag and IC offset in P-SKIP mode are removed, and also computational complexity is far reduced in B-SKIP mode in comparison to a multi-view video coding scheme. In simulation results, proposed method has the almost same coding efficiency in comparison with the referenced coding scheme. However computational complexity in 11m-time decoding process is tremendously reduced, such that the average number of blocks that should be processed in P-SKIP mode is saved in about 7.47%, and the average number of operations per block in B-SKIP mode is saved in about 50.36% and corresponding average decoding time per block is also saved in 46%.

Fast Inter/Intra Mode Decision Algorithm in H.264/AVC Considering Coding Efficiency (부호화 효율을 고려한 고속 인터/인트라 모드 결정 알고리즘)

  • Kim, Ji-Woong;Kim, Yong-Kwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8C
    • /
    • pp.720-728
    • /
    • 2007
  • For the improvement of coding efficiency, the H.264/AVC video coding standard employs new coding tools compared with existing coding standards. However, due to these new coding tools, the complexity of H.2641AVC encoder is greatly increased. Specially, Inter/Intra mode decision method of H.264/AVC using RDO(rate-distortion optimization) technique is one of the most complex parts in H.264/AVC. In this paper, we focus on the complexity reduction in macroblock mode decision considering coding efficiency. From the simulation results, the proposed algorithm reduce the encoding time by maximum 80% of total, and reduce the bitrate of the overall sequences by $8{\sim}10%$ on the average compared with existing coding methods.

The Association Between Childhood Interpersonal Trauma and Psychiatric Symptom Complexity, and the Mediating Impact of Dissociation (아동기 대인관계 외상, 정신 증상의 복잡성 및 해리의 매개 효과)

  • Kim, Yaeseul;Kim, Seok Hyeon;Kim, Daeho;Kim, Eun Kyoung;Kim, Jiyeong;Choi, Nayeon
    • Anxiety and mood
    • /
    • v.18 no.2
    • /
    • pp.72-79
    • /
    • 2022
  • Objective : Any traumatic event can be a risk factor, for subsequent mental disorder. However, childhood trauma, especially in interpersonal nature, is associated with later development of complex symptom patterns. This study examined the role of dissociation as a mediator between childhood trauma and symptom complexity. Methods : A pooled data of 369 psychiatric outpatients at a university-affiliated hospital was analyzed for descriptive statistics, group differences, and bivariate correlation analysis to verify a structural model. The questionnaires included the Symptom Checklist-90-Revised, the Trauma History Screen, the Dissociative Experiences Scale-Taxon, the Beck Depression Inventory, the Beck Anxiety Inventory, and the Abbreviated PTSD checklist. Results : When other trauma variables were controlled, childhood interpersonal trauma had significant correlation with symptom complexity (r=0.155, p=0.003). Among the paths analyzed, that of childhood interpersonal trauma and dissociation showed the greatest impact on symptom complexity (b=9.34, t=5.75, p<0.001). Based on the significance of the indirect impact, the results suggest a complete mediation impact of dissociation on symptom complexity. Conclusion : This study validated that childhood interpersonal trauma impacts symptom complexity, through the sequential mediating impact of dissociation. Thus, clinicians should understand childhood interpersonal trauma, dissociation, and symptom patterns in a complex and interacting mode, and develop effective pertinent treatment strategies.

Low-Complexity Energy Efficient Base Station Cooperation Mechanism in LTE Networks

  • Yu, Peng;Feng, Lei;Li, Zifan;Li, Wenjing;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3921-3944
    • /
    • 2015
  • Currently Energy-Saving (ES) methods in cellular networks could be improved, as compensation method for irregular Base Station (BS) deployment is not effective, most regional ES algorithm is complex, and performance decline caused by ES action is not evaluated well. To resolve above issues, a low-complexity energy efficient BS cooperation mechanism for Long Time Evolution (LTE) networks is proposed. The mechanism firstly models the ES optimization problem with coverage, resource, power and Quality of Service (QoS) constraints. To resolve the problem with low complexity, it is decomposed into two sub-problems: BS Mode Determination (BMD) problem and User Association Optimization (UAO) problem. To resolve BMD, regional dynamic multi-stage algorithms with BS cooperation pair taking account of load and geographic topology is analyzed. And then a distributed heuristic algorithm guaranteeing user QoS is adopted to resolve UAO. The mechanism is simulated under four LTE scenarios. Comparing to other algorithms, results show that the mechanism can obtain better energy efficiency with acceptable coverage, throughput, and QoS performance.

Fast Intra Prediction Mode Decision using Most Probable Mode for H.264/AVC (H.264/AVC에서의 최고 확률 모드를 이용한 고속 화면 내 예측 모드 결정)

  • Kim, Dae-Yeon;Kim, Jeong-Pil;Lee, Yung-Lyul
    • Journal of Broadcast Engineering
    • /
    • v.15 no.3
    • /
    • pp.380-390
    • /
    • 2010
  • The most recent standard video codec, H.264/AVC achieves significant coding efficiency by using a rate-distortion optimization(RDO). The RDO is a measurement for selecting the best mode which minimizes the Lagrangian cost among several modes. As a result, the computational complexity is increased drastically in encoder. In this paper, a method for fast intra prediction mode decision is proposed to reduce the RDO complexity. To speed up Intra$4{\times}4$ and Chroma Intra encoding, the proposed method decides the case that MPM (Most Probable Mode) is the best prediction mode. In this case, the RDO process is skipped, and only MPM is used for encoding the block in Intra$4{\times}4$. And the proposed method is also applied to the chroma Intra prediction mode in a similar way to the Intra$4{\times}4$. The experimental results show that the proposed method achieves an average encoding time saving of about 63% with negligible loss of PSNR (Peak Signal-to-Noise Ratio).

Fast Intra Prediction Mode Decision based on Rough Mode Decision and Most Probable Mode in HEVC (Rough Mode Decision과 Most Probable Mode에 기반을 둔 HEVC 고속 인트라 예측 모드 결정 방법)

  • Lee, Seung-Ho;Park, Sang-Hyo;Jang, Euee Seon
    • Journal of Broadcast Engineering
    • /
    • v.19 no.2
    • /
    • pp.158-165
    • /
    • 2014
  • High Efficiency Video Coding (HEVC), the latest video coding standard, has twice of the compression efficiency compared to AVC/H.264 under the same image quality condition. To obtain the improved efficiency, however, it was adopted for many methods which need complicated calculation, and the time complexity of HEVC was increased more than that of AVC/H.264. To solve this problem, the various fast algorithms have been researched. In this paper, we propose a fast intra prediction mode decision method which uses result of Rough Mode Decision (RMD) and Most Probable Mode (MPM). The proposed method selects a best predicted mode by comparing each predicted directions which are calculated through RMD and MPM. We applied the proposed method to HM 10.0 and conducted an comparing experiment in All-Intra environment. The experiment result showed that total encoding time is reduced by about 26% on average with about a 0.8% loss of BD-rate.

Frequency Window Method for the Vibration of Secondary Structural Systems (Frequency Window Method에 의한 Secondary 구조 시스템의 진동특성)

  • ;Igusa, Takeru;Achenbach, Jan D.
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1991.04a
    • /
    • pp.153-158
    • /
    • 1991
  • Recently, demands on light weight, high strength, and low noise or vibration have led to the design of complicated structural systems. Although finite elements [1], mode synthesis [2], and statistical energy analysis [3] can be used to compute the dynamic response of such systems, the structural complexity has made the interpretation of the results of such analysis difficult. Many researchers in dynamic analysis have sought to further develop existing theories or develop alternate methods to obtain greater insight in the behavior of large massive primary systems (P systems) with connected light secondary systems (S systems). Some recent research includes work by Sackman and Kelly [4], Sackman et al.[5], Der Kiureghian et al.[6], and Igusa and Der Kiureghian [7-9] who have combined mode synthesis concepts, matrix algebraic theory, and perturbation methods for characterizing weakly-coupled structural systems. A major limitation of these works are that they are limited to lumped mass S systems. In this paper, the general ideas in the Refs.[4-9] are used to study continuous S systems and the method to reduce the complexity, studied in the works by Igusa, Achenbach, and Min [10,11], is developed into the frequency window method.

  • PDF