• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.577-580
• /
• 1999

Padding is a technique that enables applying conventional discrete cosine transform to encode boundary blocks of arbitrarily shaped objects by assigning imaginary values to the pixels that are not included in the object. Padding prevents the increase of high frequency DCT coefficients. However, in some boundary blocks, too many padded pixels are coded due to a small portion of object pixels. To reduce the number of padded pixels and to improve coding efficiency, we propose a block merging method for texture coding. The proposed mothed searches the shape information of boundary blocks and excludes the 4$\times$4 pixels of 8$\times$8 blocks if all the 4$\times$4 pixels are in the background region, and merges the remained 4$\times$4 pixels into new 8$\times$8 blocks. Experimental results show that our proposed method yields a rate-distortion gain about 0.5~1.6㏈ compared to conventional padding method, LPE

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1847-1850
• /
• 2003

In many image-coding applications such as web browsing, image databases, and telemedicine, it is needed that only a region of interest(ROI) is transmitted and then reconstructed first before the whole image is transmitted and reconstructed. The Maxshift method has been used as a standard one in this research about ROI coding in JPEG2000. However Maxshift method can process only one ROI, this paper suggests an improved Maxshift method which can process Multiple ROI haying the priority order. In this method, the ROI coefficient which has the high priority order can be moved to upward two bit plane in order to process multiple ROI.

• Genomics & Informatics
• /
• v.7 no.4
• /
• pp.217-219
• /
• 2009

The primary clue for locating protein-coding regions is the open reading frame and the determination of ORFs (Open Reading Frames) is the first step toward the gene prediction, especially for prokaryotes. In this respect, we have developed a web-based ORF search tool called ORF Miner. The ORF Miner is a graphical analysis utility which determines all possible open reading frames of a selectable minimum size in an input sequence. This tool identifies all open reading frames using alternative genetic codes as well as the standard one and reports a list of ORFs with corresponding deduced amino acid sequences. The ORF Miner can be employed for sequence annotation and give a crucial clue to determination of actual protein-coding regions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.769-771
• /
• 2004

요즘 Web-Browsing, 영상 데이터 베이스 그리고 원격 진료와 같은 여러 응용 분야에서는 압축할 이미지내의 사용자의 관심 영역을 다른 영역보다 더 우선적으로 처리할 필요가 있다. 즉, 영상을 전송하는데 있어서 관심영역(ROI ： Region Of Interest)을 먼저 전송하고, 영상 복원 시에도 영상의 전체 영역 중 ROI 영역이 우선적으로 복원하여야 하는 경우가 있다. Maxshift 방법은 JPEG2000 ROI Coding 에서 표준으로 사용하고 있다. 그러나 Maxshift 방법은 단지 하나의 ROI 영역만을 처리 가능하다. 본 논문에서는 기존의 방법을 이용하여 우선 순위를 가지는 Multiple ROI Coding 기법을 제안한다. 제안한 방법에서는 계수값들의 비트 플레인에 대한 스케일링 변수를 이용하여 우선 순위를 가지는 Multiple ROI 부호화가 가능함을 보이고, 저 비트율에서 Maxshift 방법보다 좀 더 우수한 성능을 확인하였다.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.7-10
• /
• 2000

Fast block motion estimation technique is proposed to reduce the computational complexity in video coding. In the conventional methods the size of search region is fixed. For small motion regions like background the small size of sea of search region is enough to find a block motion. But for active motion regions the large size of search region is preferred to figure out the accurate motion vector. Therefore, it is reasonable that a block motion is estimated in the variable search region (both the size and the position of it). That is to say, the search region varies according to the predicted motion characteristics of a block. The block motion in video frames has temporal continuity and then the search region of a current block is predicted using the block motion of previous blocks. The computational complexity of the proposed technique is significantly reduced with a good picture quality compared to the conventional methods.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.843-846
• /
• 2000

An optical flow-based motion estimation algorithm is proposed for video coding. The algorithm uses block-matching motion estimation with an adaptive search region. The search region is computed from motion fields that are estimated based on the optical flow. The algorithm is based on the fact that true block-motion vectors have similar characteristics to optical flow vectors. Thereafter, the search region is computed using these optical flow vectors that include spatial relationships. In conventional block matching, the search region is fixed. In contrast, in the new method, the appropriate size and location of the search region are both decided by the proposed algorithm. The results obtained using test images show that the proposed algorithm can produce a significant improvement compared with previous block-matching algorithms.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.11
• /
• pp.152-165
• /
• 1998

The contour coding usually occupies the biggest part in the encoded bitstream, which causes the bottleneck problem of a region-based coding scheme. In this paper, new adaptive contour coding technique is proposed for the segmentation-based image coding. By adaptive contour coding considering contrast of neighbor regions in the proposed method, the overall bitrate can be significantly reduced without loss of the subjective image quality. After segmentation using watershed algorithm to the image, the contour segments are classified according to the contrast of the adjacent regions. Then, the contour segments between classified low contrast regions are highly compressed using morphological low pass filtering. The needed bits for encoding the contour information is reduced without loss of subjective image quality in the experiment.

• Journal of fish pathology
• /
• v.8 no.1
• /
• pp.37-46
• /
• 1995

The amino acid analysis of polyhedrin protein and nucleotide sequence of polyhedrin gene in H. cunea nuclear polyhedrosis virus (HcNPV) genome have been studied. Polyhedrin had three polypeptide bands in SDS - polyactylamide gel electrophoresis. The major polypeptide had a molecular weight of 25 kd. The polyhedrin was composed of 17 different amino acids. HcNPV DNA was digested with EcoRI restriction enzyme and hybridized with ($\alpha^{32}P$) -labelled AcNPV polyhedrin gene cDNA. The polyhedrin gene was located on the fragment of EcoRI-H. The EcoRI - H fragment containing polyhedrin gene was cloned into the EcoRI site of pUC8 vector which was confirmed with southern blotting, and the recombinant plasmid containg polyhedrin gene was designated as hPE-H. The promoter region of polyhedrin genomic DNA was sequenced. The sequences identified as the TATA box was found at the 5' flanking region of the polyhedrin genomic DNA approximately -79 bp upstream from the transcriptional start site. But CAAT-like box was not shown near the TATA-like box in the polyhedrin gene. Four tandem repeats with the sequence 5' -CTAATAT-3' and 5'-TAAATAA-3' were found between -141 and -108 or -83 upstream and -52 bp downstream from the translation start site. About -141 bp region upstream from the translational start site was highly AT (78%) rich. The coding region for the polyhedrin starts and ends with ATG and TAA, respectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.1
• /
• pp.128-138
• /
• 2010

In this paper, we propose a new bit assignment scheme for Wyner-Ziv video coding. Distributed video coding (DVC) is a new video coding paradigm which enables greatly low complexity encoding because it does not have any motion prediction module at encoder. Therefore, it is very well suited for many applications such as video communication, video surveillance, extremely low power consumption video coding, and other portable applications. Theoretically, the Wyner-Ziv video coding is proved to achieve the same rate-distortion (RD) performance comparable to that of the joint video coding. However, its RD performance has much gap compared to MC-DCT-based video coding such as H.264/AVC. Moreover, Transform Domain Wyner-Ziv (TDWZ) video coding which is a kind of DVC with transform module has difficulty of exact bit assignment because the entire image is treated as a same message. In this paper, we propose a feasible bit assignment algorithm using adaptive quantization matrix selection for the TDWZ video coding. The proposed method can calculate suitable bit amount for each region using the local characteristics of image. Simulation results show that the proposed method can enhance coding performance.

• Journal of Korea Multimedia Society
• /
• v.6 no.1
• /
• pp.78-88
• /
• 2003

A novel adaptive error concealment technique is proposed using a variable operating region algorithm based on MPEG-4 coding. In the algorithm, a missing block is classified as flat or edge block based on local information from the surrounding blocks extracted using a Sobel operation in a variable operating region (VOR). In this case, the VOR is determined adaptively according to the number of edge directions in the missing block. 1;sing the classification, the flat blocks are then concealed by the Proposed mean based weighted bilinear interpolation (MWBLI) method, and the edge blocks by the boundary directional interpolation (BDI) method. Consequently, the use of the Proposed VOR improves the subjective performance in a curved edge region, while the adaptive processing based on block classification improves the objective performance. Experimental results confirmed that the proposed algorithm produced better results than conventional algorithms, both subjectively and objectively.