• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.411-420
• /
• 2004

We propose a novel still image compression system, which is superior in its function than the JPEG2000 system developed by David Taubman. The system shows 40 : 1 high compression ratio using $2\times2$ bitmatrix subblock coding. The $2\times2$ bitmatrix subblock is constructed in the bitplanes by organizing the bits into subblocks composing of $2\times2$matrices. The arithmetic coding performs the high compression by the bitmatrices in the subblock. The input of the system consists of a segmentation mode and a ROI(Region Of Interest) mode. In segmentation mode, the input image is segmented into a foreground consisting of letters and a background consisting of the remaining region. In ROI mode, the input image is represented by the region of interest window. The high compression ratio shows that the proposed system is competent among the JPEG2000 products currently in the market. This system also uses gray coding to improve the compression ratio.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.492-500
• /
• 2012

In this paper, improved contour region coding method is proposed to accomplish better depth map coding performance. First of all, in order to use correlation between color video and depth map, a structure in SVC is applied to 3DVC. This can reduce bit-rate of the depth map while supporting the video to be transferred via various collection of network. As the depth map is mainly used to synthesize videos from different views, corrupted contour region can damage the overall quality of video. We hereby adapt a new differential quantization method when separating the contour region. The experimental results show that the proposed method can improve video quality by 0.06~0.5dB which translate the bit rate saving by 0.1~1.15%, when compared to the reference software.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.301-308
• /
• 2006

Currently, the preferred processing of a user-centered ROI(Region-of-Interest) or a specific region of image than the transmission and decompression of a full image is needed in different applications. This preferred processing has been actively studied about from the ROI coding methods in JPEG2000 standards to the new methods complementing them. But, there does not exist an ROI coding method suitable for all applications. Therefore, this study shows a criterion of selection according to the application requirements for applying an adequate ROI coding method in JPEG2000 applications, and shows the experimental results deciding efficient parameters in the selected methods.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1987.10a
• /
• pp.19-22
• /
• 1987

• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.114-127
• /
• 2017

This paper proposes a color image coding algorithm based on shape-adaptive all phase biorthogonal transform (SA-APBT). This algorithm is implemented through four procedures: color space conversion, image segmentation, shape coding, and texture coding. Region-of-interest (ROI) and background area are obtained by image segmentation. Shape coding uses chain code. The texture coding of the ROI is prior to the background area. SA-APBT and uniform quantization are adopted in texture coding. Compared with the color image coding algorithm based on shape-adaptive discrete cosine transform (SA-DCT) at the same bit rates, experimental results on test color images reveal that the objective quality and subjective effects of the reconstructed images using the proposed algorithm are better, especially at low bit rates. Moreover, the complexity of the proposed algorithm is reduced because of uniform quantization.

• Molecules and Cells
• /
• v.23 no.1
• /
• pp.80-87
• /
• 2007

Beet curly top virus (BCTV) and Beet severe curly top virus (BSCTV), members of curtoviruses, encode seven open reading frames (ORFs) within a ~3 kb genome. One of these viral ORFs, C1, is known to play an important role in the early stage of viral infection in plants during initiation of viral DNA replication. We used promoter:: reporter (${\beta}$-glucuronidase) gene fusions in transgenic Arabidopsis to identify the putative promoter region of BCTV ORF C1. Unlike other geminiviruses, the intergenic region of BCTV was not sufficient to promote C1 expression in transgenic plants. When sequences extending into the coding region of C1 were tested, strong expression of the reporter protein was observed in vascular tissues of transgenic plants. This expression was not dependent on the presence of the intergenic regions or proximal 5' portions of the C1 coding region. Transgenic plants expressing a reporter gene under control of the putative complete C1 promoter were inoculated with virus to determine if any viral transcript affected C1 expression. Virus inoculated plants did not show any altered pattern or change in of reporter gene expression level. These results suggest that (1) important transcriptional activator elements for C1 expression reside in the 3' portion of C1 coding area itself, (2) C1 protein does not auto-regulate its own expression and (3) C1 expression of two curtoviruses is controlled differently compared to other geminiviruses.

• The Journal of the Korea Contents Association
• /
• v.15 no.2
• /
• pp.21-30
• /
• 2015

Image coding based on mixed raster content model generates don't care regions (DCR) in foreground and background layers, and its overall coding performance is greatly affected by region filling methods for DCRs. Most conventional methods for DCR filling fail in utilizing the local signal properties in hole regions and thus the high frequency components in non-DCR regions are reflected into DCR after signal filling. In addition, further high frequency components are induced to the filled signal because of signal discontinuities in the boundary of DCR. To solve this problem, a new DCR filling algorithm using the priority-based adaptive region growing is proposed in this paper. The proposed method uses the watershed algorithm and the flooding priority of each pixel for region filling is determined from the degree of smoothness in the neighborhood area. By growing the filled region into DCR based on the computed priority, the expansion of high-textured area can be minimized which can improve the overall coding performance. Experimental results show that the proposed method outperforms conventional algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2043-2052
• /
• 1997

The object-oriented coding technique which is one of the coding methods in very low bit rate environment is suitable for videophone image sequence. The selection of source model affect image analysis. In this paper, an image analysis method for the object-oriented coding is presented. The process is composed of changed region detection andmotion estimateion. First, we use the standard deviation of frame difference as thrreshold to extract themoving area. If thesum of gray values in mask is greater than the threshold, the center pixel of the mask is regarded as moving region. After moving is detected in changed region by edge operator, observation point is determined from moving region. The motion is estimated by 6-parameter mapping method with determined observation point. The experimantal resutls show that the proposed method can significantly improve the image quality.

• Journal of Plant Biotechnology
• /
• v.40 no.1
• /
• pp.27-36
• /
• 2013

We isolated and functionally characterized a Dendrobium Actin1 (DmACT1) promoter that drives strong gene expression in the orchid genus Dendrobium. A genomic fragment containing the region 3227 bp upstream of the coding region of DmACT1 was obtained by inverse PCR. Detailed comparison of the full-length cDNA and genomic sequences revealed that DmACT1 has a 1374 bp first intron in the 5' UTR. However, the 5' flanking sequences upstream of the coding region showed no obvious sequence similarities compared to those of known promoters, including plant actin promoters. Serial deletion constructs of the 5' flanking region from the translation initiation codon were fused to the coding sequence of a GUS/luciferase fusion reporter to identify the regulatory elements necessary for promoter activity. Transient assays in the flowers of Dendrobium revealed that the 5' UTR-intron greatly enhanced promoter activity. Moreover, the DmACT1 promoter with its 5' UTR-intron yielded approximately 10-fold higher reporter activity than the rice Act1 promoter-intron. Our data suggest that the DmACT1 promoter with its 5' UTR-intron is a useful tool for strong expression of transgenes in Dendrobium orchids.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.3166-3168
• /
• 2000

This paper proposed variable threshold dual rate ADPCM coding method which is modified from the standard ADPCM of ITU G.726 for speech quality improvement. The speech quality of variable threshold dual rate ADPCM is better than single rate ADPCM at noisy environment without increasing the complexity by using ZCR(Zero Crossing Rate). In this case, ZCR is used to divide input signal samples into two categories(noisy & speech). The samples with higher ZCR is categorized as the noisy region and the samples with lower ZCR is categorized as the speech region. Noisy region uses higher threshold value to be compressed by 16Kbps for reduced bit rates and the speech region uses lower threshold value to be compressed by 40Kbps for improved speech quality. Comparing with the conventional ADPCM, which adapts the fixed coding rate. the proposed variable threshold dual rate ADPCM coding method improves noise character without increasing the bit rate. For real time applications, ZCR calculation was considered as a simple method to obtain the background noise information for preprocess of speech analysis such as FFT and the experiment showed that the simple calculation of ZCR can be used without complexity increase. Dual rate ADPCM can decrease the amount of transferred data efficiently without increasing complexity nor reducing speech quality. Therefore result of this paper can be applied for real-time speech application such as the internet phone or VoIP.