• Animal cells and systems
• /
• v.4 no.1
• /
• pp.77-85
• /
• 2000

This study has demonstrated the molecular variation of 5S rRNA genes in 15 Allium subgenus Rhizirideum and 1 Allium subg. Allium. For cloning of the 5S rRNA genes, PCR products were obtained from amplification with oligonucleotide primers which were derived from the conserved coding region of 5S rRNA genes. These amplified PCR products were cloned and identified by FISH and sequence analysis. The 5S rRNA loci were primarily located on chromosomes 5 and/or 7 in diploid species and various chromosomes in alloploid species. The size of the coding region of 5S rRNA genes was 120 bp in all the species and the sequences were highly conserved within Allium species. The sizes of nontranscribed spacer (NTS) region were varied from 194 bp (A. dektiude-fustykisum, 2n=16) to 483 bp (A. sativum). Two kinds of NTS regions were observed in A. victorialis var. platyphyllum a diploid, A. wakegi an amphihaploid, A. sacculiferum, A. grayi, A. deltoide-fistulosum and A. wenescens all allotetraploids, while most diploid species showed only one NTS region. The species containing two components of NTS region were grouped with different diploid species in a phylogenetic tree analysis using the sequences of 5S rRNA genes and adjacent non-coding regions.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.06a
• /
• pp.83-88
• /
• 1999

In this paper, a novel gray-scale lossless image coder combining context-based minimum mean squared error (MMSE) prediction and entropy coding is proposed. To obtain context of prediction, this paper first defines directional difference according to sharpness of edge and gradients of localities of image data. Classification of 4 directional differences forms“geometry context”model which characterizes two-dimensional general image behaviors such as directional edge region, smooth region or texture. Based on this context model, adaptive DPCM prediction coefficients are calculated in MMSE sense and the prediction is performed. The MMSE method on context-by-context basis is more in accord with minimum entropy condition, which is one of the major objectives of the predictive coding. In entropy coding stage, context modeling method also gives useful performance. To reduce the statistical redundancy of the residual image, many contexts are preset to take full advantage of conditional probability in entropy coding and merged into small number of context in efficient way for complexity reduction. The proposed lossless coding scheme slightly outperforms the CALIC, which is the state-of-the-art, in compression ratio.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.30-38
• /
• 2002

In this paper, we propose a new method for image coding which efficiently use the relationship between the properties of spatial image and its wavelet transform. Firstly, an original image is decomposed into several layers by the wavelet transform, and simultaneously decomposed into 2$^n$$\times$2$^n$blocks. Each block is classified into two regions according to their standard deviation, i.e., low activity region(LAR) and high activity region(HAR). The region with low frequency in spatial domain does not only appears as zero regions in wavelet frequency domain like HL, LH, and HH but also gives little influence to the quality of reconstructed image. The other side, the high frequency regions are related to significant coefficients which gives much influence to image reconstruction. In this paper, we propose a image coding method to obtain high compression rate at low bit rate by these properties. The LAR region is encoded by LAR coding method which is proposed in this paper, the HAR by a technique similar to bitplane coding in hierarchical tree. Simulation results show that th,$\boxUl$ proposed coding method has better performance than EZW and SPIHT schemes in terms of image quality and transmitted bit rates, can be successfully applied to the application areas that require of progressive transmission.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.5
• /
• pp.914-922
• /
• 1987

An image coding technique based on a segmentation, which utilizes a simplified description of regions composing an image, is investigated in this paper. The proposed coding technique consists of 3 stages: segmentation, contour coding. In this paper, emphasis was given to texture coding in order to improve a quality of an image. Split-and-merge method was employed for a segmentation. In the texture coding, a linear predictive coding(LPC), along with approximation technique based on a two-dimensional polynomial function was used to encode texture components. Depending on a size of region and a mean square error between an original and a reconstructed image, appropriate texture coding techniques were determined. A computer simulation on natural images indicates that an acceptable image quality at a compression ratio as high as 15-25 could be obtained. In comparison with a discrete cosine transform coding technique, which is the most typical coding technique in the first-generation coding, the proposed scheme leads to a better quality at compression ratio higher than 15-20.

• ETRI Journal
• /
• v.28 no.2
• /
• pp.239-242
• /
• 2006

In this letter, we propose a new functionality to scalable video coding (SVC), that is, the support of multiple region of interests (ROIs) for heterogeneous display resolution. The main objective of SVC is to provide temporal, spatial, and quality scalability of an encoded bitstream. The ROI is an area that is semantically important to a particular user, especially users with heterogeneous display resolutions. Less transmission bandwidth is needed compared to when the entire region is transmitted/decoded and then sub-sampled or cropped. To support multiple ROIs in SVC, we adopt flexible macroblock ordering (FMO), a tool defined in H.264, and based on it, we propose a way to encode and, independently, decode ROIs. The proposed method is implemented on the joint scalable video model (JSVM) and its functionality verified.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.6
• /
• pp.154-159
• /
• 2003

In this paper, we proposed variable threshold dual rate ADPCM coding method which adapts two coding rates of the standard ADPCM of ITU G.726 for speech quality improvement at a comparably low coding rates. The ZCR(Zero Crossing Rate) is computed for speecd data and under the noisy environment, noise data dominant region showed higher ZCR and speech data dominant region showed lower ZCR. The speech data with the higher ZCR is encoded by low coding rate for reduced coded data and the speech data with the lower ZCR is encoded by high coding rate for speech quality improvements. For coded data, 2 bits are assigned for low coding rate of 16[Kbps] and 5 bits are is assigned for high coding rate of 40[Kbps]. Through the simulation, the proposed idea is evaluated and shown that the variable dual rate ADPCM coding technique shows the qood speech quality at low coding rate.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.6
• /
• pp.89-96
• /
• 1989

An improved method on texture coding, which is a part of the region growing based image coding, is presented in this paper. An image is segmented into stochastic regions which can be described as a stochastic random field, and non-stochastic ones in order to efficiently represent texture. In the texture coding and reconstruction, an autoregressive model is used for the stochastic regions, while a two-dimensional polynomial approximation is used for the non-stochastic ones. This proposed method leads to a better subjective quality, relatively higher compression ratio and shorter processing time for coding and reconstructing than the conventional method which uses only two-dimensional polynomial approximation.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.1
• /
• pp.41-46
• /
• 2005

A new multiple description selective coding is proposed to overcome noisy channels. Our algorithm adopts an embedded coding scheme, in which subband coefficients are encoded one bit plane at a time using a non-adaptive arithmetic encoder. According to the importance ratio for each region, we code interest regions with more passes than background in order to reconstruct interest regions with higher quality. To overcome channel errors, we adopt multiple description scheme which adds controlled amounts of redundancy to the original data during the compression process. Proposed algorithm achieves better qualify compared with other algorithms especially in the circumstances where very low bit rate coding is required and some regions are more important than other regions.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.211-214
• /
• 2001

This paper presents an efficient fast motion estimation algorithm and image segmentation method for low bit-rate coding. First, with region split information, the algorithm splits the image having homogeneous and semantic regions like face and semantic regions in image. Then, in these regions, We find the motion vector using adaptive search window adjustment. Additionally, with this new segment based fast motion estimation, we reduce blocking artifacts by intensively coding our interesting region(face or arm) in input image. The simulation results show the improvement in coding performance and image quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1178-1184
• /
• 1997

Encoding of segment contours is a critical part of a region-based coding system especially at low bit rates where the contour information occupies a majority of the bit rate. When approximating contours with polygons, a fixed upper bound on the distortion is set for the approximation process. Instead of using this fixed bound, adaptive approximation bound for a lossy coding of contourts is proposed in this paper. A function representing the relative importance of the contour segmentis defined to take into account the spatial content of the image. By using this function, the contour can be approximated adaptively. This allows a more general approach than the methods with the fixed distortion measure. The effectiveness of the adaptive contour coding approach is verified through experiments.