• Title/Summary/Keyword: Complex coding

Search Result 240, Processing Time 0.024 seconds

On the Adaptive 3-dimensional Transform Coding Technique Employing the Variable Length Coding Scheme (가변 길이 부호화를 이용한 적응 3차원 변환 부호화 기법)

  • 김종원;이신호;이상욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.7
    • /
    • pp.70-82
    • /
    • 1993
  • In this paper, employing the 3-dimensional discrete cosine transform (DCT) for the utilization of the temporal correlation, an adaptive motion sequence coding technique is proposed. The energy distribution in a 3-D DCT block, due to the nonstationary nature of the image data, varies along the veritical, horizontal and temporal directions. Thus, aiming an adaptive system to local variations, adaptive procedures, such as the 3-D classification, the classified linear scanning technique and the VLC table selection scheme, have been implemented in our approach. Also, a hybrid structure which adaptively combines inter-frame coding is presented, and it is found that the adaptive hybrid frame coding technique shows a significant performance gain for a moving sequence which contains a relatively small moving area. Through an intensive computer simulation, it is demonstrated that, the performance of the proposed 3-D transform coding technique shows a close relation with the temporal variation of the sequence to be code. And the proposed technique has the advantages of skipping the computationally complex motion compensation procedure and improving the performance over the 2-D motion compensated transform coding technique for rates in the range of 0.5 ~ 1.0 bpp.

  • PDF

Global Optimum Searching Technique of Multi-Modal Function Using DNA Coding Method (DNA 코딩을 이용한 multi-modal 함수의 최적점 탐색방법)

  • 백동화;강환일;김갑일;한승수
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2001.12a
    • /
    • pp.225-228
    • /
    • 2001
  • DNA computing has been applied to the problem of getting an optimal solution since Adleman's experiment. DNA computing uses strings with various length and four-type bases that makes more useful for finding a global optimal solutions of the complex multi-modal problems. This paper presents DNA coding method for finding optimal solution of the multi-modal function and compares the efficiency of this method with the genetic algorithms (GA). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string and DNA coding method uses a tool of calculation or Information store with DNA molecules and four-type bases denoted by the symbols of A(Ademine), C(Cytosine), G(Guanine) and T(Thymine). The same operators, selection, crossover, mutation, are applied to the both DNA coding algorithm and genetic algorithms. The results show that the DNA based algorithm performs better than GA.

  • PDF

A Study on Coding Education for Non-Computer Majors Using Programming Error List

  • Jung, Hye-Wuk
    • International Journal of Advanced Culture Technology
    • /
    • v.9 no.1
    • /
    • pp.203-209
    • /
    • 2021
  • When carrying out computer programming, the process of checking and correcting errors in the source code is essential work for the completion of the program. Non-computer majors who are learning programming for the first time receive feedback from instructors to correct errors that occur when writing the source code. However, in a learning environment where the time for the learner to practice alone is long, such as an online learning environment, the learner starts to feel many difficulties in solving program errors by himself/herself. Therefore, training on how to check and correct errors after writing the program source code is necessary. In this paper, various types of errors that can occur in a Python program were described, the errors were classified into simple errors and complex errors according to the characteristics of the errors, and the distributions of errors by Python grammar category were analyzed. In addition, a coding learning process to refer error lists was designed to present a coding learning method that enables learners to solve program errors by themselves.

Improved Side Information Generation using Field Coding for Wyner-Ziv Codec (Wyner-Ziv 부호화기를 위한 필드 부호화 기반 개선된 보조정보 생성)

  • Han, Chan-Hee;Jeon, Yeong-Il;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.11
    • /
    • pp.10-17
    • /
    • 2009
  • Wyner-Ziv video coding is a new video compression paradigm based on distributed source coding theory of Slepian-Wolf and Wyner-Ziv. Wyner-Ziv coding enables light-encoder/heavy-decoder structure by shifting complex modules including motion estimation/compensation task to the decoder. Instead of performing the complicated motion estimation process in the encoder, the Wyner-Ziv decoder performs the motion estimation for the generation of side information in order to make the predicted signal of the Wyner-Ziv frame. The efficiency of side information generation deeply affects the overall coding performance, since the bit-rates of the Wyner-Ziv coding is directly dependent on side information. In this paper, an improved side information generation method using field coding is proposed. In the proposed method, top fields are coded with the existing SI generation method and bottom fields are coded with new SI generation method using the information of the top fields. Simulation results show that the proposed method improves the quality of the side information and rate-distortion performance compared to the conventional method.

X-Chromosome Inactivation: A Complex Circuits regulated by Non-coding RNAs and Pluripotent Factors

  • Hwang, Jae Yeon;Lee, Chang-Kyu
    • Reproductive and Developmental Biology
    • /
    • v.41 no.2
    • /
    • pp.33-40
    • /
    • 2017
  • X-chromosome inactivation is one of the most complex events observed in early embryo developments. The epigenetic changes occurred in female X-chromosome is essential to compensate dosages of X-linked genes between males and females. Because of the relevance of the epigenetic process to the normal embryo developments and stem cell studies, X-chromosome inactivation has been focused intensively for last 10 years. Initiation and regulation of the process is managed by diverse factors. Especially, proteins and non-coding RNAs encoded in X-chromosome inactivation center, and a couple of transcription factors have been reported to regulate the event. In this review, we introduce the reported factors, and how they regulate epigenetic inactivation of X-chromosomes.

Preliminary construction of a chimeric cellulose operon containing two structural genes coding for CMCase and cellobiase

  • 이동석;황인규;이백락;박무영
    • Proceedings of the Korean Society for Applied Microbiology Conference
    • /
    • 1986.12a
    • /
    • pp.524.1-524
    • /
    • 1986
  • CMCase, a member of cellulose decomposing enzymes, hydrolyze cellulose up to cellobiose. Cellobiase splits cellobiose to glucose units. Therefore, a linkage of the twogenes coding for CMCase and cellobiase on the same plasmid is needed to produce a cellulase complex which can produce glucose from cellulose. A genetic operon in which the two structural genes are under the control of a single promoter would be ideal for this purpose. The present report is on the linking of the two cellulase genes in one plasmid as a preliminary step of the operon construction.

  • PDF

Efficient Motion Information Representation in Splitting Region of HEVC (HEVC의 분할 영역에서 효율적인 움직임 정보 표현)

  • Lee, Dong-Shik;Kim, Young-Mo
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.4
    • /
    • pp.485-491
    • /
    • 2012
  • This paper proposes 'Coding Unit Tree' based on quadtree efficiently with motion vector to represent splitting information of a Coding Unit (CU) in HEVC. The new international video coding, High Efficiency Video Coding (HEVC), adopts various techniques and new unit concept: CU, Prediction Unit (PU), and Transform Unit (TU). The basic coding unit, CU is larger than macroblock of H.264/AVC and it splits to process image-based quadtree with a hierarchical structure. However, in case that there are complex motions in CU, the more signaling bits with motion information need to be transmitted. This structure provides a flexibility and a base for a optimization, but there are overhead about splitting information. This paper analyzes those signals and proposes a new algorithm which removes those redundancy. The proposed algorithm utilizes a type code, a dominant value, and residue values at a node in quadtree to remove the addition bits. Type code represents a structure of an image tree and the two values represent a node value. The results show that the proposed algorithm gains 13.6% bit-rate reduction over the HM-1.0.

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.

Improvement of Depth Video Coding by Plane Modeling (평면 모델링을 통한 깊이 영상 부호화의 개선)

  • Lee, Dong-Seok;Kwon, Soon-Kak
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.21 no.5
    • /
    • pp.11-17
    • /
    • 2016
  • In this paper, we propose a method of correcting depth image by the plane modeling and then improving the coding performance. We model a plane by using the least squares method to the horizontal and vertical directions including the target pixel, and then determine that the predicted plane is suitable from the estimate error. After that, we correct the target pixel by the plane mode. The proposed method can correct not only the depth image composed the plane but also the complex depth image. From the simulation result that measures the entropy power, which can estimate the coding performance, we can see that the coding performance by the proposed method is improved up to 80.2%.

Fast Coding Mode Decision for H.264 Video Coding (H.264 동영상 압축을 위한 고속 부호화 모드 결정 방법)

  • 이제윤;전병우
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.6
    • /
    • pp.165-173
    • /
    • 2004
  • H.264 is the newest international video coding standard that provides high coding efficiency. A macroblock in H.264 has 7 different motion-compensation block sizes in the Inter mode, and several different prediction directions in the Intra mode. In order to achieve as highest coding efficiency as possible, H.264 reference model employs complex mode decision technique based on rate-distortion (RD) optimization which requires high computational complexity. In this paper, we propose two techniques -'early SKIP mode decision' and 'selective intra mode decision' - which can further reduce the computational complexity. Simulation results show that without considerable performance degradation, the proposed methods reduce encoding time by 30% on average and save the number of computing rate-distortion cost by 72%.