• Title/Summary/Keyword: coding region

Search Result 726, Processing Time 0.026 seconds

Sequencing of the RSDA Gene Encoding Raw Starch-Digesting $\alpha$-Amylase of Bacillus circulans F-2: Identification of Possible Two Domains for Raw Substrate-Adsorption and Substrate-Hydrolysis

  • Kim, Cheorl-Ho
    • Journal of Microbiology and Biotechnology
    • /
    • v.2 no.1
    • /
    • pp.56-65
    • /
    • 1992
  • The complete nucleotide sequence of the Bacillus circulans F-2 RSDA gene, coding for raw starch digesting a-amylase (RSDA), has been determined. The RSDA structure gene consists of an open reading frame of 2508 bp. Six bp upstream of the translational start codon of the RSDA is a typical gram-positive Shine-Dalgarno sequence and the RSDA encodes a preprotein of 836 amino acids with an Mr of 96, 727. The gene was expressed from its own regulatory region in E. coli and two putative consensus promoter sequences were identified upstream of a ribosome binding site and an ATG start codon. Confirmation of the nucleotide sequence was obtained and the signal peptide cleavage site was identified by comparing the predicted amino acid sequence with that derived by N-terminal analysis of the purified RSDA. The deduced N-terminal region of the RSDA conforms to the general pattern for the signal peptides of secreted prokaryotic proteins. The complete amino acid sequence was deduced and homology with other enzymes was compared. The results suggested that the Thr-Ser-rich hinge region and the non-catalytic domain are necessary for efficient adsorption onto raw substrates, and the catalytic domain (60 kDa) is necessary for the hydrolysis of substrates, as suggested in previous studies (8, 9).

  • PDF

Region-based scalable self-recovery for salient-object images

  • Daneshmandpour, Navid;Danyali, Habibollah;Helfroush, Mohammad Sadegh
    • ETRI Journal
    • /
    • v.43 no.1
    • /
    • pp.109-119
    • /
    • 2021
  • Self-recovery is a tamper-detection and image recovery methods based on data hiding. It generates two types of data and embeds them into the original image: authentication data for tamper detection and reference data for image recovery. In this paper, a region-based scalable self-recovery (RSS) method is proposed for salient-object images. As the images consist of two main regions, the region of interest (ROI) and the region of non-interest (RONI), the proposed method is aimed at achieving higher reconstruction quality for the ROI. Moreover, tamper tolerability is improved by using scalable recovery. In the RSS method, separate reference data are generated for the ROI and RONI. Initially, two compressed bitstreams at different rates are generated using the embedded zero-block coding source encoder. Subsequently, each bitstream is divided into several parts, which are protected through various redundancy rates, using the Reed-Solomon channel encoder. The proposed method is tested on 10 000 salient-object images from the MSRA database. The results show that the RSS method, compared to related methods, improves reconstruction quality and tamper tolerability by approximately 30% and 15%, respectively.

Parallel Method for HEVC Deblocking Filter based on Coding Unit Depth Information (코딩 유닛 깊이 정보를 이용한 HEVC 디블록킹 필터의 병렬화 기법)

  • Jo, Hyun-Ho;Ryu, Eun-Kyung;Nam, Jung-Hak;Sim, Dong-Gyu;Kim, Doo-Hyun;Song, Joon-Ho
    • Journal of Broadcast Engineering
    • /
    • v.17 no.5
    • /
    • pp.742-755
    • /
    • 2012
  • In this paper, we propose a parallel deblocking algorithm to resolve workload imbalance when the deblocking filter of high efficiency video coding (HEVC) decoder is parallelized. In HEVC, the deblocking filter which is one of the in-loop filters conducts two-step filtering on vertical edges first and horizontal edges later. The deblocking filtering can be conducted with high-speed through data-level parallelism because there is no dependency between adjacent edges for deblocking filtering processes. However, workloads would be imbalanced among regions even though the same amount of data for each region is allocated, which causes performance loss of decoder parallelization. In this paper, we solve the problem for workload imbalance by predicting the complexity of deblocking filtering with coding unit (CU) depth information at a coding tree block (CTB) and by allocating the same amount of workload to each core. Experimental results show that the proposed method achieves average time saving (ATS) by 64.3%, compared to single core-based deblocking filtering and also achieves ATS by 6.7% on average and 13.5% on maximum, compared to the conventional uniform data-level parallelism.

Alfalfa xenomiR-162 targets G protein subunit gamma 11 to regulate milk protein synthesis in bovine mammary epithelial cells

  • Guizhi Meng;Hongjuan Duan;Jingying Jia;Baobao Liu;Yun Ma;Xiaoyan Cai
    • Animal Bioscience
    • /
    • v.37 no.3
    • /
    • pp.509-521
    • /
    • 2024
  • Objective: It was shown that microRNAs (miRNAs) play an important role in milk protein synthesis. However, the post-transcriptional regulation of casein expression by exogenous miRNA (xeno-miRNAs) in ruminants remains unclear. This study explores the regulatory roles of alfalfa xeno-miR162 on casein synthesis in bovine mammary epithelial cells (bMECs). Methods: The effects of alfalfa xenomiR-162 and G protein subunit gamma 11 (GNG11) on proliferation and milk protein metabolism of bMECs were detected by 5-Ethynyl-2'-Deoxyuridine (EdU) staining, flow cytometry, cell counting kit-8 (CCK-8), enzyme-linked immunosorbent assay, quantitative real-time polymerase chain reaction (qRT-PCR), and Western blot. Dual-luciferase reporter assay was used to verify the targeting relationship between GNG11 and xenomiR-162. Results: Results showed that over-expression of xenomiR-162 inhibited cell proliferation but promoted apoptosis, which also up-regulated the expression of several casein coding genes, including CSN1S1, CSN1S2, and CSN3, while decreasing the expression of CSN2. Furthermore, the targeting relationship between GNG11 and xenomiR-162 was determined, and it was confirmed that GNG11 silencing also inhibited cell proliferation but promoted apoptosis and reduced the expression of casein coding genes and genes related to the mammalian target of rapamycin (mTOR) pathway. Conclusion: Alfalfa xenomiR-162 appears to regulate bMECs proliferation and milk protein synthesis via GNG11 in the mTOR pathway, suggesting that this xeno-miRNA could be harnessed to modulate CSN3 expression in dairy cows, and increase κ-casein contents in milk.

Complete Mitochondrial Genome of Echinostoma hortense (Digenea: Echinostomatidae)

  • Liu, Ze-Xuan;Zhang, Yan;Liu, Yu-Ting;Chang, Qiao-Cheng;Su, Xin;Fu, Xue;Yue, Dong-Mei;Gao, Yuan;Wang, Chun-Ren
    • Parasites, Hosts and Diseases
    • /
    • v.54 no.2
    • /
    • pp.173-179
    • /
    • 2016
  • Echinostoma hortense (Digenea: Echinostomatidae) is one of the intestinal flukes with medical importance in humans. However, the mitochondrial (mt) genome of this fluke has not been known yet. The present study has determined the complete mt genome sequences of E. hortense and assessed the phylogenetic relationships with other digenean species for which the complete mt genome sequences are available in GenBank using concatenated amino acid sequences inferred from 12 protein-coding genes. The mt genome of E. hortense contained 12 protein-coding genes, 22 transfer RNA genes, 2 ribosomal RNA genes, and 1 non-coding region. The length of the mt genome of E. hortense was 14,994 bp, which was somewhat smaller than those of other trematode species. Phylogenetic analyses based on concatenated nucleotide sequence datasets for all 12 protein-coding genes using maximum parsimony (MP) method showed that E. hortense and Hypoderaeum conoideum gathered together, and they were closer to each other than to Fasciolidae and other echinostomatid trematodes. The availability of the complete mt genome sequences of E. hortense provides important genetic markers for diagnostics, population genetics, and evolutionary studies of digeneans.

Model-based Inter-view Mismatch Compensation Algorithm for Multi-view Video Coding (다시점 영상 부호화를 위한 모형 기반 시점간 비정합 보상 알고리즘)

  • Jeon, Yeong-Il;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.7
    • /
    • pp.1-8
    • /
    • 2008
  • In this paper, an algorithm to compensate the inter-view mismatch in the multi-view video according to the different characteristics of cameras is presented. Interview mismatches make it difficult to merge the multi-view images and decrease the coding performance. So, a preprocessing operation to compensate the mismatches is requisite in the multi-view video coding. It is shown that the mismatch in the outputs of multi-view cameras with different electro-optical transfer functions can be approximated with a linear model of a gain and an offset. In addition, a new algorithm for estimating and compensating the inter-view mismatch based on the detection of the overlapped region is presented. Experimental results using various rectified stereo images show that the proposed method compensates inter-view mismatches more accurately compared to the conventional approach.

A Bit-rate Converter for Selective Coding (선택적부호화를 위한 비트율 변환기)

  • Lee, Jongbae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.9
    • /
    • pp.229-237
    • /
    • 2014
  • This paper presents a video bitrate converter for baseline profile in H.264/AVC standards to control a selective coding scheme for several applications such as tactical scenes or multimedia area. Transmission channels have various capacities according to the application area, and the bitstream stored in computer should be converted in order not to exceed the capacities of a transmission channel. So the problem is how to convert compressed bitsreams of a given bit-rate into compressed bitsreams of other bit-rates. Such a specific transcoding problem in this paper is referred to as bit-rate conversion. Several researches have been done on bit-rate conversion for the bitstreams compressed by MPEG or H.264/AVC. But the existing schemes are not suitable for selective coding scheme because it needs to recover interest regions better image quality than background. So we propose a new bit-rate converter which considers the importance between interest regions and background.

Rate-Distortion Based Selective Encoding in Distributed Video Coding (율-왜곡 기반 선택적 분산 비디오 부호화 기법)

  • Lee, Byung-Tak;Kim, Jae-Gon;Kim, Jin-Soo;Seo, Kwang-Deok
    • Journal of Broadcast Engineering
    • /
    • v.16 no.1
    • /
    • pp.123-132
    • /
    • 2011
  • Recently, DVC (Distributed Video Coding) is receiving a lot of attention as one of the low complexity video encoding techniques suitable for various applications with computation-limited and/or power-limited environment, and is being actively studied for improving the coding efficiency. This paper proposes a rate-distortion based selective block encoding scheme. First, the motion information is obtained in the process of generating side information at decoder and received through the feedback channel, and then, based on this information, the proposed method performs a selective block encoding based on rate-distortion optimization. Experimental results show that the performance of the proposed scheme reaches up to 2.2 dB PSNR gain over the existing scheme. Moreover, it is shown that the complexity can be reduced by encoding parts of region considering rate-distortion cost.

Early Decision of Transform unit for HEVC (HEVC를 위한 고속 변환 크기 결정방법)

  • Kang, Jang-Byung;Choi, Haechul
    • Journal of Broadcast Engineering
    • /
    • v.18 no.4
    • /
    • pp.631-642
    • /
    • 2013
  • For the emerging High Efficiency Video Coding (HEVC) standard, a fast transform unit (TU) decision method is proposed. HEVC defines the TU representing a region sharing the same transformation, and it allows a residual block to be split into multiple TUs recursively to form a quadtree. By using the quadtree of TUs, HEVC supports various transform sizes from $4{\times}4$ to $32{\times}32$. The various sizes of TUs can provide a good coding efficiency, whereas this may increase encoding complexity dramatically. In the assumption that a TU with highly compacted energy is unlikely to be split, the proposed method determines TU sizes according to the position of the last non-zero transform coefficient. In the experimental results, the proposed method reduced 18% encoding run time with the negligible coding loss of 0.7% BD-rate for the Random_access case.

A Technique Getting Fast Masks Using Rough Division in Dynamic ROI Coding of JPEG2000 (JPEG2000의 동적 ROI 코딩에서 개략적인 분할을 이용한 빠른 마스크 생성 기법)

  • Park, Jae-Heung;Lee, Jum-Sook;Seo, Yeong-Geon;Hong, Do-Soon;Kim, Hyun-Joo
    • The KIPS Transactions:PartB
    • /
    • v.17B no.6
    • /
    • pp.421-428
    • /
    • 2010
  • It takes a long time for the users to view a whole image from the image server under the low-bandwidth internet environments or in case of a big sized image. In this case, as there needs a technique that preferentially transfers a part of image, JPEG2000 offers a ROI(Region-of-Interest) coding. In ROI coding, the users see the thumbnail of image from the server and specifies some regions that they want to see first. And then if an information about the regions are informed to the server, the server preferentially transfers the regions of the image. The existing methods requested a huge time to compute the mask information, but this thesis approximately computes the regions and reduces the creating time of the ROI masks. If each code block is a mixed block which ROI and background are mixed, the proper boundary points should be acquired. Searching the edges of the block, getting the two points on the edge, to get the boundary point inside the code block, the method searches a mid point between the two edge points. The proposed method doesn't have a big difference compared to the existing methods in quality, but the processing time is more speedy than the ones.