• 제목/요약/키워드: coding region

Search Result 726, Processing Time 0.032 seconds

Molecular Cloning of the Gene Coding for 3-Isopropylmalate Dehydrogenase of Kluyveromyces fragilis (Kluyveromyces fragilis의 LEU gene의 Cloning)

  • 박성희;이동선;우주형;김종국;홍순덕
    • Microbiology and Biotechnology Letters
    • /
    • v.18 no.3
    • /
    • pp.305-308
    • /
    • 1990
  • In order to clone the gene coding for 3-isopropylmalate dehydrogenase of Muyveromyces fragilis, a shuttle plasmid vector pHNll4 was used. It can serve as a cloning vector in Saccharomyces cerevisiae DBY746 for other Sau3AI-cleaved DNA segment of Kluyveromyces fragilis. Two cloned fragments which complement the leu2 mutation of Saccharomyces cerevisiae and E, coli were obtained. Their length was 4.4 kb an 3.5 kb, and their orientation was opposite each other. From the fact that the two recombinant plasmids were expressed in Saccharomyces cerevisiae and E, coli, probably the two inserts had the promoter of Ktuyveromyces fi-agilis and that of Kluyveromyces fiagilis was efficiently assosiated with RNA polymerase of Saccharomyces cerevisiae and E. coli. According to the result of Southern hybridization, we thought that the cloned fragment has low homology with 3-isopropylmalate dehydrogenase coding region of E. coli and Saccharomyces cerevisiae.

  • PDF

A New Change Detection Method Based on Macro Block Unit for Selective Video Coding (선택적 영상 부호화를 위한 매크로 블록단위의 변화영역 검출방법)

  • 최재각;권순각;이종극
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2C
    • /
    • pp.172-180
    • /
    • 2003
  • This paper propose a new change detection algorithm based on macro block unit for selective video coding scheme. The conventional method badly decides a macro block of unchanged region into a changed macro block due to a noise of the difference images. To solve the problem of the conventional method, we propose a new test statistic which is robust to the noise of the difference image. As shown in experimental results(Fig. 1∼3), the proposed algorithm shows more accurate segmentation results than the conventional method. Also, because the proposed detection method reduces the average numbers of changed macro block per frame to 55∼60% than the conventional method, it can improve the performance of the selective video coding at lower bit rates.

An Efficient Segmentation-based Wavelet Compression Method for MR Image (MR 영상을 위한 효율적인 영역분할기반 웨이블렛 압축기법)

  • 문남수;이승준;송준석;김종효;이충웅
    • Journal of Biomedical Engineering Research
    • /
    • v.18 no.4
    • /
    • pp.339-348
    • /
    • 1997
  • In this paper, we propose a coding method to improve compression efficiency for MR image. This can be achieved by combining coding scheme and segmentation scheme which removes noisy background region, which is meaningless for diagnosis in the MR image. In segmentation algoritm, we use full-resolution wavelet transform to extract features of regions in image and Kohonen self-organizing map to classify the features. The subsequent wavelet coder encodes only diagnostically significant foreground regions refering to segmentation map. Our proposed algorithm provides about 15% of bit rate reduction when compared with the same coder which is not combined with segmentation scheme. And the proposed scheme shows better reconstructed image quality than JPEG at the same compression ratio.

  • PDF

Link Adaptation and Selection Method for OFDM Based Wireless Relay Networks

  • Can, Basak;Yomo, Hiroyuki;Carvalho, Elisabeth De
    • Journal of Communications and Networks
    • /
    • v.9 no.2
    • /
    • pp.118-127
    • /
    • 2007
  • We propose a link adaptation and selection method for the links constituting an orthogonal frequency division multiplexing (OFDM) based wireless relay network. The proposed link adaptation and selection method selects the forwarding, modulation, and channel coding schemes providing the highest end-to-end throughput and decides whether to use the relay or not. The link adaptation and selection is done for each sub-channel based on instantaneous signal to interference plus noise ratio (SINR) conditions in the source-to-destination, source-to-relay and relay-to-destination links. The considered forwarding schemes are amplify and forward (AF) and simple adaptive decode and forward (DF). Efficient adaptive modulation and coding decision rules are provided for various relaying schemes. The proposed end-to-end link adaptation and selection method ensures that the end-to-end throughput is always larger than or equal to that of transmissions without relay and non-adaptive relayed transmissions. Our evaluations show that over the region where relaying improves the end-to-end throughput, the DF scheme provides significant throughput gain over the AF scheme provided that the error propagation is avoided via error detection techniques. We provide a frame structure to enable the proposed link adaptation and selection method for orthogonal frequency division multiple access (OFDMA)-time division duplex relay networks based on the IEEE 802.16e standard.

Adaptive Medical Image Compression Based on Lossy and Lossless Embedded Zerotree Methods

  • Elhannachi, Sid Ahmed;Benamrane, Nacera;Abdelmalik, Taleb-Ahmed
    • Journal of Information Processing Systems
    • /
    • v.13 no.1
    • /
    • pp.40-56
    • /
    • 2017
  • Since the progress of digital medical imaging techniques, it has been needed to compress the variety of medical images. In medical imaging, reversible compression of image's region of interest (ROI) which is diagnostically relevant is considered essential. Then, improving the global compression rate of the image can also be obtained by separately coding the ROI part and the remaining image (called background). For this purpose, the present work proposes an efficient reversible discrete cosine transform (RDCT) based embedded image coder designed for lossless ROI coding in very high compression ratio. Motivated by the wavelet structure of DCT, the proposed rearranged structure is well coupled with a lossless embedded zerotree wavelet coder (LEZW), while the background is highly compressed using the set partitioning in hierarchical trees (SPIHT) technique. Results coding shows that the performance of the proposed new coder is much superior to that of various state-of-art still image compression methods.

Performance Analysis of Full-Duplex Relay Networks with Residual Self-Interference and Crosstalk

  • Liu, Guoling;Feng, Wenjiang;Zhang, Bowei;Ying, Tengda;Lu, Luran
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4957-4976
    • /
    • 2016
  • This paper investigates the error performance of the amplify-and-forward (AF) relaying systems in the context of full-duplex (FD) communication. In addition to the inherent self-interference (SI) due to simultaneous transmission and reception, coexistent FD terminals may cause crosstalk. In this paper, we utilize the information exchange via the crosstalk channel to construct a particular distributed space-time code (DSTC). The residual SI is also considered. Closed-form pairwise error probability (PEP) is first derived. Then we obtain the upper bound of PEP in high transmit power region to provide more insights of diversity and coding gain. The proposed DSTC scheme can attain full cooperative diversity if the variance of SI is not a function of the transmit power. The coding gain can be improved by lengthening the frame and proper power control. Feasibility and efficiency of the proposed DSTC are verified in numerical simulations.

A Visual Weighting-Based Bit Allocation Algorithm for H.264 Scalable Extension(SE) (H.264 스케일러블 확장을 위한 시각적 가중치 기반 비트 할당 알고리즘)

  • Quan, Shan Guo;Ha, Ho-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.5
    • /
    • pp.650-657
    • /
    • 2011
  • This paper proposes a novel bit allocation algorithm for H.264 scalable extension(SE) based on a human visual system (HVS) to improve the coding efficiency. The proposed algorithm is consist of two stages: visual weighting model and visual weighting-based bit allocation algorithm. In the first stage, the visual weighting for each macroblock (MB) is analyzed according to the region of interests. Then the adaptation of the visual weighting into the bit allocation routine for each quality layer is performed for improving the visual quality. In the simulation results, it is observed that the proposed scheme can improve the subjective and objective video quality in the same bit rate, compared to the previous scalable video coding in H.264.

Multiple Region of Interest Coding using Maxshift Method

  • Lee Han Jeong;You Kang Soo;Jang Yoon Up;Seo Duck Won;Yoo Gi Hyoung;Kwak Hoon Sung
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.853-856
    • /
    • 2004
  • Image data processing on the region of interest (ROI) for providing the primary information is needed the view of saving search time and bandwidth over image communications related to web browsing, image database, and telemedicine, etc. Hence, the issue on extracting the region of interest is drawing a plenty of attention for the communication environment with a relatively low bandwidth such as mobile internet. In this paper, we propose a improved standard Maxshift method. The proposed algorithm compress image that includes multiple ROI using Maxshift method in Part 1 of JPEG2000. Simulation results show that proposed method increases PSNR vs. compression ratio performance above the Maxshift method.

  • PDF

Facial Feature Extraction using Genetic Algorithm from Original Image (배경영상에서 유전자 알고리즘을 이용한 얼굴의 각 부위 추출)

  • 이형우;이상진;박석일;민홍기;홍승홍
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.214-217
    • /
    • 2000
  • Many researches have been performed for human recognition and coding schemes recently. For this situation, we propose an automatic facial feature extraction algorithm. There are two main steps: the face region evaluation from original background image such as office, and the facial feature extraction from the evaluated face region. In the face evaluation, Genetic Algorithm is adopted to search face region in background easily such as office and household in the first step, and Template Matching Method is used to extract the facial feature in the second step. We can extract facial feature more fast and exact by using over the proposed Algorithm.

  • PDF

Morphological Grayscale Reconstruction Based on the Region Size and Brightness Contrast (영역의 크기와 휘도값의 대조를 고려한 수리형태학적 영상재구성)

  • 김태현;문영식
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1999.11b
    • /
    • pp.3-8
    • /
    • 1999
  • In this paper, we propose a new connected operator using morphological grayscale reconstruction for region-based coding. First, an effective method of reference-image creation is proposed, which is based on the size as well as the contrast. The conventional connected operators are good for removing small regions, but have a serious drawback for low-contrast regions that are larger than the structuring element. That is, when the conventional connected operators are applied to these regions. the simplification becomes less effective or several meaningful regions are merged to one region. To avoid this, the conventional geodesic dilation is modified to propose an adaptive operator. To reduce the effect of inappropriate propagation, pixels reconstructed to the original values are excluded in the dilation operation. Experimental results have shown that the proposed algorithm achieves better performance in terms of the reconstruction of flat zones. The picture quality has also been improved by about 7dB, compared to the conventional methods.

  • PDF