• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.134-137
• /
• 2009

최근 마이크로소프트 (Microsoft)에서 발표된 후 주목 받고 있는 JPEG XR 은 압축 효율 면에서 뛰어난 장점을 가지고 있다. 일반적으로 JPEG XR 은 기존의 JPEG 과는 다른 압축 과정과 주파수 성분 분포를 가지고 있다고 알려져 있다. 하지만 JPEG 압축 방식과 비교하여 JPEG XR 의 압축영역에서의 영상 필터 처리의 연구는 아직 미흡한 실정이다. 본 논문에서는 JPEG XR 의 압축과정과 주파수 성분 분포의 분석을 기반으로 효율적인 저역/고역통과 필터 함수를 제안하고, 체계적인 실험을 통해 제안한 필터함수의 효율성을 입증하였다.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.27-34
• /
• 2004

This paper proposes a method to trace and interpret a moving object based on the information which can be directly obtained from MPEG-2 compressed video stream without decoding process. In the proposed method, the motion flow is constructed from the motion vectors included in compressed video. We calculate the amount of pan, tilt, and zoom associated with camera operations using generalized Hough transform. The local object motion can be extracted from the motion flow after the compensation with the parameters related to the global camera motion. Initially, a moving object to be traced is designated by user via bounding box. After then automatic tracking Is performed based on the accumulated motion flows according to the area contributions. Also, in order to reduce the cumulative tracking error, the object area is reshaped in the first I-frame of a GOP by matching the DCT coefficients. The proposed method can improve the computation speed because the information can be directly obtained from the MPEG-2 compressed video, but the object boundary is limited by macro-blocks rather than pixels. Also, the proposed method is proper for approximate object tracking rather than accurate tracing of an object because of limited information available in the compressed video data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.8
• /
• pp.1714-1719
• /
• 2011

High quality image processing schemes are used more widely than ever according to the development of various visual media. We need a compressed form of image for sending more capacity and a controlling strategy of images for small display devices. In this paper, we propose an image upsampling and downsamplig scheme using DCT coefficients for those purposes. Our scheme is designed to control the size of picture based on the target display media by reducing the data in DCT domain while not increasing the computational burdens. With the power of controlling the resolution in DCT domain, the proposed method shows higher PSNR than other competing methods in experiment.

• Transactions of Materials Processing
• /
• v.20 no.5
• /
• pp.377-386
• /
• 2011

During stamping processes, the air trapped between sheet metal and the die cavity can be highly compressed and ultimately reduce the shape accuracy of formed panels. To prevent this problem, vent holes and passages are sometimes drilled into the based on expert experience and know-how. CAE can be also used for analyzing the air behavior in die cavity during stamping process, incorporating both elasto-plastic behavior of sheet metal and the fluid dynamic behavior of air. This study presents sheet metal forming simulation combined simultaneously with simulation of air behavior in the die cavity. There are three approaches in modeling of air behavior. One is a simple assumption of the bulk modulus having a constant pressure depending on volume change. The next is the use of the ideal gas law having uniform pressure and temperature in air domain. The third is FPM (Finite point method) having non-uniform pressure in air domain. This approach enables direct coupling of mechanical behavior of solid sheet metal and the fluid behavior of air in sheet metal forming simulation, and its result provides the first-hand idea for the location, size and number of the vent holes. In this study, commercial software, PAM-$STAMP^{TM}$ and PAM-$SAFE^{TM}$, were used.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.146-164
• /
• 2010

Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or a file system. For shredded XML data stored in relational tables, however, it may not be straightforward to apply existing algorithms for twig query processing, since most of the algorithms require XML data to be accessed in a form of streams of elements grouped by their tags and sorted in a particular order. In order to support XML query processing within the common framework of relational database systems, we first propose several bitmap indexes and their strategies for supporting holistic twig joining on XML data stored in relational tables. Since bitmap indexes are well supported in most of the commercial and open-source database systems, the proposed bitmapped indexes and twig query processing strategies can be incorporated into relational query processing framework with more ease. The proposed query processing strategies are efficient in terms of both time and space, because the compressed bitmap indexes stay compressed during data access. In addition, we propose a hybrid index which computes twig query solutions with only bit-vectors, without accessing labeled XML elements stored in the relational tables.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.745-752
• /
• 2002

The purpose of the paper is to enable a format transcoding between a heterogeneous compression format in a real time, and to enhance the compression ratio using characteristics of the compressed frame. In this paper, for the heterogeneous format transcoding, we tried to transcode from MPEG2 having a lower compression ratio to H.263 having a higher compression ratio. After analyzing MPEG 2 bit stream and H.263 bit stream of the same original video, we found that the number of intra coded macro blocks in MPEG 2 data is much higher than the number of the intra coded macro blocks in H.263 data. In the process of P frame generation, a intra coded macro block is generated when a motion estimation value representing the similarity between the previous frame and current frame does not meet a threshold. Especially the intra coded macro block has a great impact on the compression ratio. Hence the paper, we tried to minimize the number of intra coded macro blocks in H.263 data stream which is transcoded from MPEG 2 in a compressed domain. For the purpose, we propose a guided search method for transcoding the INTRA coded block into INTER coded block using the information about motion vectors surrounding the intra macro block in order to minimize the complexity of the motion estimation process. The experimental results show that the transcoding of MPEG 2 into H.263 can be done in a real time successfully.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.296-305
• /
• 2000

In this paper, we propose the method of embedding the encrypted digital watermark in quantization coefficient when we encode the image data in the process of JPEC. The proposed method is as following. After a DCT coefficient of each block is quantized, we arrange the quantization coefficient as on dimension with a zigzag scan and replace each block. By applying even-odd feature of frequency of the encrypted watermark to a quantization coefficient of some fixed domain of replaced each block and embedding it, we obtain the compressed image data by encoding after placing it in the order prior to replacement. The advantages of the proposed method here are as follows: We can embed many information keeping a secret as much as possible by using the algorithm of block replacement. We can control the amount of embedding of each use, as we embed the encrypted information by selecting some fixed domain of a quantization coefficient, we can fix the embedding data regardless of the image and the value of quantization. We verified the results by experiments and analyzed the efficiency of them in comparison with the former study.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.138-148
• /
• 2001

Digital Video (DV) coding standards for digital video cassette recorder are based mainly on DCT and variable length coding. DV has low hardware complexity but high compressed bit rate of about 26 Mb/s. Thus, it is necessary to encode video with low complex video coding at the studios and then transcode compressed video into MPEG-2 for video-on-demand system. Because these coding methods exploit DCT, transcoding in the DCT domain can reduce computational complexity by excluding duplicated procedures. In transcoding DV into MPEC-2 intra coding, multiplying matrix by transformed data is used for 4:1:1-to-4:2:2 chroma format conversion and the conversion from 2-4-8 to 8-8 DCT mode, and therefore enables parallel processing. Variance of sub block for MPEG-2 rate control is computed completely in the DCT domain. These are verified through experiments. We estimate motion hierarchically using DCT coefficients for transcoding into MPEG-2 inter coding. First, we estimate motion of a macro block (MB) only with 4 DC values of 4 sub blocks and then estimate motion with 16-point MB using IDCT of 2$\times$2 low frequencies in each sub block, and finish estimation at a sub pixel as the fifth step. ME with overlapped search range shows better PSNR performance than ME without overlapping.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.343-350
• /
• 2002

A scene change detection which involves finding a cut between two consecutive shots is an important step for video indexing and retrieval. This paper proposes an algorithm for fast and accurate detection of abrupt scene changes in an MPEG compressed domain with minimal decoding requirements arid computational effort. The proposed method compares two successive DC images of I-frames for finding the GOP (group of picture) which contain a scene change and uses macroblock-coded type information contained in B-frames to detect the exact frame where the scene change occurred. The experiment results demonstrate that the proposed algorithm has better detection performance, such as precision and recall rate, than the existing method using all DC images. The algorithm has the advantage of speed, simplicity and accuracy. In addition, it requires less amount of storage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.68-78
• /
• 2008

The transmission of multimedia information over error-prone channels such as wireless networks has become an important area of research. In this paper, we propose two Error Concealment(EC) schemes for wireless transmission of JPEG2000 image. The Multiple Representation(MR) is employed as the preprocessing in our schemes, whereas the main error concealing operation is applied in wavelet domain at receiver side. The compressed code-stream of several subsampled versions of original image is transmitted over a single channel with random bit errors. In the decoder side, the correctly reconstructed wavelet coefficients are utilized to recover the corrupted coefficients in other sub-images. The recovery is carried out by proposed basic(MREC-BS) or enhanced(MREC-ES) methods, both of which can be simply implemented. Moreover, there is no iterative processing during error concealing, which results a big time saving. Also, the simulation results confirm the effectiveness and efficiency of our proposed schemes.