• Title/Summary/Keyword: Delta tree

Search Result 72, Processing Time 0.032 seconds

A Study on the HEVC Video Encoder PMR Block Design (HEVC 비디오 인코더 PMR 블록 설계에 대한 연구)

  • Lee, Sukho;Lee, Jehyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.12
    • /
    • pp.141-146
    • /
    • 2016
  • HEVC/H.265 is the latest joint video coding standard proposed by ITU-T SG 16 WP and ISO/IEC JTC 1/SC29/WG 11. In H.265, pictures are divided into a sequence of coding tree units(CTUs), and the CTU further is partitioned into multiple CUs to adapt to various local characteristics. Its coding efficiency is approximately two times high compared to previous standard H.264/AVC. However according to the size of extended CU(coding unit) and transform block, the hardware size of PMR(prediction/mode decision/reconstruction) block within video encoder is about 4 times larger than previous standard. In this study, we propose a new less complex hardware architecture of PMR block which has the most high complexity within encoder without any noticeable PSNR loss. Using this simplified block, we can shrink the overall size the H.265 encoder. For FHD image, it operates at clocking frequency of 300 MHz and frame rate of 60 fps. And also for the test image, the Bjøntegaard Delta (BD) bit rate increase about average 30 % in PMR prediction block, and the total estimated gate count of PMR block is around 1.8 M.

Fast Coding Unit Decision Algorithm Based on Region of Interest by Motion Vector in HEVC (움직임 벡터에 의한 관심영역 기반의 HEVC 고속 부호화 유닛 결정 방법)

  • Hwang, In Seo;Sunwoo, Myung Hoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.11
    • /
    • pp.41-47
    • /
    • 2016
  • High efficiency video coding (HEVC) employs a coding tree unit (CTU) to improve the coding efficiency. A CTU consists of coding units (CU), prediction units (PU), and transform units (TU). All possible block partitions should be performed on each depth level to obtain the best combination of CUs, PUs, and TUs. To reduce the complexity of block partitioning process, this paper proposes the PU mode skip algorithm with region of interest (RoI) selection using motion vector. In addition, this paper presents the CU depth level skip algorithm using the co-located block information in the previously encoded frames. First, the RoI selection algorithm distinguishes between dynamic CTUs and static CTUs and then, asymmetric motion partitioning (AMP) blocks are skipped in the static CTUs. Second, the depth level skip algorithm predicts the most probable target depth level from average depth in one CTU. The experimental results show that the proposed fast CU decision algorithm can reduce the total encoding time up to 44.8% compared to the HEVC test model (HM) 14.0 reference software encoder. Moreover, the proposed algorithm shows only 2.5% Bjontegaard delta bit rate (BDBR) loss.

The Effects of Various Vegatable Pesticides on Materials of Cultural Property - Dyed and Undyed Silk Fabrics, Cotton Fabrics and Korean Papers, Undyed Ramie Fabric, Pigments, Painted Plates - (식물에서 추출한 살충.살균제가 문화재 재질에 미치는 영향 - 견직물, 면직물, 저마직물, 한지, 안료분말, 채색편 -)

  • Oh, Joon-Suk
    • Journal of Conservation Science
    • /
    • v.20
    • /
    • pp.9-22
    • /
    • 2007
  • Three kinds of natural pesticides extracted from plants which are being sold in the Korean markets, were estimated effects on materials of art of museum. Tested samples were 1) silk fabrics : undyed, dyed(amur cork tree, gallut, gallut(alum post mordancy), gallut(copperas post mordancy), gardenia, turmeric, acorn, acorn(copperas post mordancy), gromwell, madder, madder(alum post mordancy), safflower, sappanwood, sappanwood(alum pre mordancy, post mordancy), indigo, indigo+amur cork tree, indigo+sappanwood) 2) cotton fabrics : undyed, dyed(amur cork tree, gallut, gallut(alum post mordancy), gardenia, acorn, acorn(copperas post mordancy), gromwell, madder, madder(alum post mordancy), safflower, sappanwood, sappanwood(alum pre mordancy, post mordancy), indigo, indigo+sappanwood) 3) undyed ramie fabric 4) Korean papers : undyed, dyed(sappanwood, indigo, gardenia, amur cork tree, safflower) 5) pigments : azurite, malachite, red lead, litharge, orpiment, hematite, iron oxide, cinnabar, vermilion, indigo, lake indigo, kaolin, lead white, oyster shell white 6) painted plates : azurite, malachite, red lead, litharge, orpiment, hematite, iron oxide, cinnabar, vermilion, indigo, lake indigo, kaolin, lead white, oyster shell white. Conditions of tests were that after samples were exposed to 10 times of promoted concentration for 9 months in relative humidity $55{\pm}1%$ and temperature $20{\pm}2^{\circ}C$, they were compared with standards. Items of estimation were color difference(${\Delta}E^*$) and tenacity. After exposure to pesticides, undyed silk cotton ramie fabrics and Korean papers were not nearly changed in their colors, but colors of most of dyed samples were clearly changed by pesticides except for partial samples(acorn- and madder-dyed fabrics etc, gardenia-dyed samples). Especially changes of colors of turmeric-dyed silk fabrics were most distinct. And colors of pigments and painted plates containing lead, copper, arsenic, mercury and vegetable pigments, were clearly changed. Tenacities of yams of undyed silk fabrics were not nearly changed and undyed cotton fabrics were a little reduced as compared with standards. But tenacities of yams of dyed silk and cotton fabrics were clearly reduced or increased as compared with standards. Especially, madder-dyed silk fabrics were increased 10% or more and indigo-dyed silk fabrics were reduced 10% or less in all pesticides. Also madder- and sappanwood(alum post mordancy)-dyed cotton fabrics were increased 10% or more in all pesticides.

  • PDF

Gradient-Based Methods of Fast Intra Mode Decision and Block Partitioning in VVC (VVC의 기울기 기반 화면내 예측모드 결정 및 블록분할 고속화 기법)

  • Yoon, Yong-Uk;Park, Dohyeon;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.25 no.3
    • /
    • pp.338-345
    • /
    • 2020
  • Versatile Video Coding (VVC), which has been developing as a next generation video coding standard, has adopted various techniques to achieve more than twice the compression performance of HEVC (High Efficiency Video Coding). The recently released VVC Test Model (VTM) shows 38% Bjontegaard Delta bitrate (BD-rate) improvement and 9x/1.6x encoding/decoding complexity over HEVC. In order to reduce such increased complexity, various fast algorithms have been proposed. In this paper, gradient-based methods of fast intra mode decision and block splitting are presented. Experimental results show that, compared to VTM6.0, the proposed method gives up to 65% encoding time reduction with 3.54% BD-rate loss in All-Intra (AI) configuration.

An optimal design of 4${\times}$4 optical matrix switch (4${\times}$4 매트릭스 광스위치의 최적 설계)

  • Choi, Won-Jun;Hong, Song-Cheol;Lee, Seok;Kim, Hwe-Jong;Lee, Jung-Il;Kang, Kwang-Nham;Cho, Kyu-Man
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.8
    • /
    • pp.153-165
    • /
    • 1995
  • The design procedure of a GaAs/AlGaAs semiconductor matrix optical switch is presented for a simplified tree architecture in the viewpoint of optical loss. A low loss, 0.537 dB/cm, pin type substrate is designed by considering the loss due to imputity doping at 1.3 $\mu$m wavelength. The operating voltage and the device length of a reversed ${\Delta}{\beta}$ electro-optic directional coupler(EODC) swith which is a cross-point device of the 4${\times}$4 matrix optical switch and the bending loss of rib waveguide are caculated as functions of waveguide parameters and bending parameters. There is an optimum bending radius for some waveguide parameters. It is recommened that higher optical confinement conditions such as wide waveguide width and higher rib-height should be chosen for structural parameters of a low loss and a process insensitive 4${\times}$4 matris optical switch. A 4${\times}$4 optical matrix switch which has a 3 dB loss and a 12 volt operating voltage is designed.

  • PDF

An Evaluation of Tree Roots Effect on Soil Reinforcement by Direct Shear Test (일면전단실험에 의한 수목뿌리의 토양보강효과 평가)

  • Cha, Du Song;Oh, Jae-Heun
    • Journal of Korean Society of Forest Science
    • /
    • v.94 no.4 s.161
    • /
    • pp.281-286
    • /
    • 2005
  • Trees enhance slope stability against down slope mass movement through the removal of soil water by transpiration and by the mechanical reinforcement of their roots. To assess the magnitude of this reinforcement on natural slope stability, direct shear tests were made on dry sand reinforced with different array types of roots. Pinus koraiensis was used as root specimens. The peak shear resistance at each normal stress level was measured on the rooted and unrooted soil specimens. Increased soil resistance(${\Delta}S$) by roots was calculated using parameters like internal friction angle and cohesion of tested soil and also evaluated the effects of root array in tested soil. As results, we find that shear resistance increased in tested soil shear box as diameters and arrayed numbers of root specimen increased and cross root array in tested soil had a much greater reinforcing effect than other root arrays. Comparison of traditional root-soil model with experiments showed that simulated reinforce strength by the model was different with those obtained by the experiment due to its linearity.

A Fast CU Size Decision Optimal Algorithm Based on Neighborhood Prediction for HEVC

  • Wang, Jianhua;Wang, Haozhan;Xu, Fujian;Liu, Jun;Cheng, Lianglun
    • Journal of Information Processing Systems
    • /
    • v.16 no.4
    • /
    • pp.959-974
    • /
    • 2020
  • High efficiency video coding (HEVC) employs quadtree coding tree unit (CTU) structure to improve its coding efficiency, but at the same time, it also requires a very high computational complexity due to its exhaustive search processes for an optimal coding unit (CU) partition. With the aim of solving the problem, a fast CU size decision optimal algorithm based on neighborhood prediction is presented for HEVC in this paper. The contribution of this paper lies in the fact that we successfully use the partition information of neighborhood CUs in different depth to quickly determine the optimal partition mode for the current CU by neighborhood prediction technology, which can save much computational complexity for HEVC with negligible RD-rate (rate-distortion rate) performance loss. Specifically, in our scheme, we use the partition information of left, up, and left-up CUs to quickly predict the optimal partition mode for the current CU by neighborhood prediction technology, as a result, our proposed algorithm can effectively solve the problem above by reducing many unnecessary prediction and partition operations for HEVC. The simulation results show that our proposed fast CU size decision algorithm based on neighborhood prediction in this paper can reduce about 19.0% coding time, and only increase 0.102% BD-rate (Bjontegaard delta rate) compared with the standard reference software of HM16.1, thus improving the coding performance of HEVC.

Matching Algorithms using the Union and Division (결합과 분배를 이용한 정합 알고리즘)

  • 박종민;조범준
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.5
    • /
    • pp.1102-1107
    • /
    • 2004
  • Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trieving features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In matching between On-line and Off-line treatment, the most important thing is which features we are going to use as the standard. Therefore, we have been using “Delta” and “Core” as this standard until now, but there might have been some deficits not to exist in every person when we set them up as the standards. In order to handle the users who do not have those features, we are still using the matching method which enables us to make up of the spanning tree or the triangulation with the relations of the spanned feature. However, there are some overheads of the time on these methods and it is not sure whether they make the correct matching or not. Therefore, I would like to represent the more correct matching algorism in this paper which has not only better matching rate but also lower mismatching rate compared to the present matching algorism by selecting the line segment connecting two minutiae on the same ridge and furrow structures as the reference point.

Bacterial Community Structure Shift Driven by Salinity: Analysis of DGGE Band Patterns from Freshwater to Seawater of Hyeongsan River, Korea (염도의 변화에 따른 미생물 군집의 변화: 경북 형산강 하류 미생물 군집 변화의 DGGE pattern 분석)

  • Beck, Bo Ram;Holzapfel, Wilhelm;Hwang, Cher Won;Do, Hyung Ki
    • Journal of Life Science
    • /
    • v.23 no.3
    • /
    • pp.406-414
    • /
    • 2013
  • The influence of a gradual increase in salinity on the diversity of aquatic bacterial in rivers was demonstrated. The denaturing gradient gel electrophoresis (DGGE) was used to analyze the bacterial community shift downstream in the Hyeongsan River until it joins the open ocean. Four water samples were taken from the river showing the salinity gradients of 0.02%, 1.48%, 2.63%, and 3.62%. The samples were collected from four arbitrary stations in 2.91 km intervals on average, and a DGGE analysis was performed. Based on the results of this analysis, phylogenetic similarity identification, tree analysis, and a comparison of each station were performed. The results strongly suggested that the response of the bacterial community response was concomitant to gradual changes in salinity, which implies that salt concentration is a major factor in shifting the microbiota in aquatic habitats. The results also imply a huge diversity in a relatively small area upstream from the river mouth, compared to that in open oceans or coastal regions. Therefore, areas downstream towards a river mouth or delta are could be good starting points in the search for new bacterial species and strains ("biotypes").

(A Scalable Multipoint-to-Multipoint Routing Protocol in Ad-Hoc Networks) (애드-혹 네트워크에서의 확장성 있는 다중점 대 다중점 라우팅 프로토콜)

  • 강현정;이미정
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.3
    • /
    • pp.329-342
    • /
    • 2003
  • Most of the existing multicast routing protocols for ad-hoc networks do not take into account the efficiency of the protocol for the cases when there are large number of sources in the multicast group, resulting in either large overhead or poor data delivery ratio when the number of sources is large. In this paper, we propose a multicast routing protocol for ad-hoc networks, which particularly considers the scalability of the protocol in terms of the number of sources in the multicast groups. The proposed protocol designates a set of sources as the core sources. Each core source is a root of each tree that reaches all the destinations of the multicast group. The union of these trees constitutes the data delivery mesh, and each of the non-core sources finds the nearest core source in order to delegate its data delivery. For the efficient operation of the proposed protocol, it is important to have an appropriate number of core sources. Having too many of the core sources incurs excessive control and data packet overhead, whereas having too little of them results in a vulnerable and overloaded data delivery mesh. The data delivery mesh is optimally reconfigured through the periodic control message flooding from the core sources, whereas the connectivity of the mesh is maintained by a persistent local mesh recovery mechanism. The simulation results show that the proposed protocol achieves an efficient multicast communication with high data delivery ratio and low communication overhead compared with the other existing multicast routing protocols when there are multiple sources in the multicast group.