• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.315-323
• /
• 2004

In this paper we present a method to generate the bit stream of static video test patterns for testing the picture quality in DTV system. The proposed user-defined quantization table is suitable for the static video test pattern and for minimizing the deterioration of picture quality by quantization, the underflow or overflow of video buffer generated on the process of coding the static video test pattern is compensated by a adaptive zero stuffing algorithm so that optimal picture quality is implemented. Experimental result showed that the test pattern stream encoded by MPEG-2 software with the proposed algorithm had a stable bit rate and good video quality during the decoding process, which is about 3 dB higher than that of the conventional case.

• Journal of Korea Multimedia Society
• /
• v.23 no.6
• /
• pp.765-771
• /
• 2020

To enable AI(artificial intelligence) to realize visual emotions, it attempts to create music centered on color, an element that causes emotions in paintings. Traditional image-based music production studies have a limitation in playing notes that are unrelated to the picture because of the absence of musical elements. In this paper, we propose a new algorithm to set the group of music through the average color of the picture, and to produce music after adding diatonic code progression and deleting sound using median value. And the results obtained through the proposed algorithm were analyzed.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.835-836
• /
• 2006

For non-contact structure vibration displacement measurement system, an algorithm for image processing using high speed CCD camera is introduced. The system sets the target to the structure, take picture using camera and image processing is performed to display the vibration data. The algorithm flow is basic preprocessing, projection data generation and curve fitting to find three crossing points for calibration or one center point in limited area.

• Journal of Korea Multimedia Society
• /
• v.14 no.12
• /
• pp.1528-1535
• /
• 2011

We present a fog generation algorithm in 2D images. The proposed algorithm provides a scattering model for the approximated calculation of fog density. The scattering model needs parameters of distance and altitude information. However, 2D images do not include that information, so that we calculate them from the depth information generated in an interactive manner, and estimate the scattering factor by using the scattering model. Then we generate fog effect on an input image using the scattering factor by distance-oriented selection blur and color blending. With the algorithm, we can easily create the fog-effected images and fog generated animation from 2D images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.147-152
• /
• 2005

In this paper, we proposed a method for compressing the static video test patterns in high quality to test the picture quality in DTV. In our method, we use the fact that the generated bits and average quantization value have almost identical distribution characteristics per each GOP and we propose a new target bit allocation method suitable for compressing the static test pattern while the target bit allocation method in MPEG-2 TM5 is suitable for the moving picture. The proposed target bit allocation method is to maintain the high quality video continuously by using the normalized complexities which are updated or maintained by means of picture qualities at each GOP. Experiment result showed that the test pattern stream encoded by MPEG-2 software with the proposed algorithm had a stable bit rate and good video quality during the decoding process.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.407-417
• /
• 2014

A new-generation video coding standard, named High Efficiency Video Coding (HEVC), has recently been developed by JCT-VC. This new standard provides a significant improvement in picture quality, especially for high-resolution videos. However, one the most important challenges in HEVC is time complexity. A quadtree-based structure is created for the encoding and decoding processes and the rate-distortion (RD) cost is calculated for all possible dimensions of coding units in the quadtree. This provides a high encoding quality, but also causes computational complexity. We focus on a reduction scheme of the computational complexity and propose a new approach that can terminate the quadtree-based structure early, based on the RD costs of the parent and current levels. Our proposed algorithm is compared with HEVC Test Model version 10.0 software and a previously proposed algorithm. Experimental results show that our algorithm provides a significant time reduction for encoding, with only a small loss in video quality.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.1045-1053
• /
• 2006

We introduce a new method of painterly rendering. Instead of using the gradient direction of the source image to generate a brush stroke, we extract regions that can be drawn in one stroke using MHN filtering followed by identification of connected components, and make a brush stroke from each, based on an approximation to the medial axis. This method results in realistic-looking brush strokes of varying width that have an irregular directions where necessary.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.2
• /
• pp.7-13
• /
• 2002

When a USB digital camera is used for PC video-conference applications, motion picture data need to be transferred to the PC through the USB port. Due to the mismatch between the data rates of the USB and the motion picture, data compression should be performed before the transmission from the USB. While many motion picture compression algorithms require large intermediate memory space, the JPEG algorithm does not need to store an entire frame for the compression. Instead, a relatively small buffer is required at the input of the JPEG compression engine to resolve the inconsistency between the orders of the inputted data and the consumed data. Data reordering can be easily implemented using a double buffering scheme, which still requires a considerable size of memory. In this paper, a novel memory management scheme is proposed to avoid the double buffering. The proposed memory architecture requires a small amount of memory and a simple address generation scheme, resulting in overall cost reduction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.471-479
• /
• 2008

In this paper, we propose a novel algorithm to automatically generate an RTP timestamp value that is required for the RTP packetization in order to transmit SVC video over various If networks such as Internet. Unlike the conventional single layer coding algorithms such as H.263, MPEG-4 and H.264, SVC generates a multi-layered single bitstream which is composed of a base layer and one or more enhancement layers in order to simultaneously provide temporal, spatial, and SNR scalability. Especially, in order to provide temporal scalability based on hierarchical B-picture prediction structure, the encoding (or transmission) and display order of pictures in SVC coding is completely decoupled. Thus, the timestamp value to be specified at the header of each RTP packet in video transmission does not increase monotonically according to the display time instant of each picture. Until now, no method for automatically generating an RTP timestamp when SVC video is loaded in a RTP packet has teen introduced. In this paper, a novel automatic RTP timestamp generation method exploiting the TID (temporal ID) field of the SVC NAL unit header is proposed to accommodate the SVC video transmission.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.331-335
• /
• 2008

In this paper, we parallelized a feature point extraction algorithm to reduce panorama image generation time in multi-core environment. While we compose a panorama image with several images, the step to extract feature points of each picture is needed to find overlapped region of pictures. To perform rapidly feature extraction stage which requires much calculation, we developed a parallel algorithm to extract feature points and examined the performance using CBE(Cell Broadband Engine) which is asymmetric multi-core architecture. As a result of the exam, the algorithm we proposed has a property of linear scalability-the performance is increased in proportion the number of processors utilized. In this paper, we will suggest how Image processing operation can make high performance result in multi-core environment.