• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.4
• /
• pp.158-167
• /
• 2007

Indirect illumination plays an important role for realistic image synthesis. We present a novel realtime indirect illumination rendering technique using image pyramids. Hundreds of thousands of indirect point light sources are stored into images, and then they hierarchically clustered into quad-tree image pyramids. We also introduce a GPU based top-down and breadth-first traversal of the quad-trees to approximate the illumination with clusters (set of lights). All steps entirely run on the GPU in real-time. Result images demonstrate that our method represents diffuse interreflection, especially a color bleeding effect well. We achieved interactive frame rates of tens to hundreads, without any preprocessing. We can avoid artifacts caused by sampling, and our method is seven times faster than a recently proposed sampling based method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.2
• /
• pp.20-25
• /
• 2019

Most multimedia signals contain image data, so the problem of efficient processing and transmitting the image data is an important task of the information society. This paper proposes a compression algorithm that reduces the color bits according to importance using YUV color space among the various methods of compressing image data. 4: 2: 2 subsampling is the standard in the field of video. Using the color information and the characteristics of the human retina, YUV color data was reduced by 4: 2: 2 subsampling. The YUV images and RGB images can be interconverted using the transformation matrix. The image data was converted into color space by YUV, and the relatively low U and V bits were subjected to a downscaling operation. The data was then compressed through 4: 2: 2 subsampling. The performance of the proposed algorithm was compared and analyzed by a comparison with existing methods. As a result of the analysis, it was possible to compress the image without reducing the information of the low importance color element and without significant deterioration in the quality compared to the original.

• Journal of the Korea Computer Graphics Society
• /
• v.25 no.3
• /
• pp.21-29
• /
• 2019

This paper proposes a novel framework for image fusion of satellite imagery to enhance spatial resolution of the image via structure-texture decomposition. The resolution of the satellite imagery depends on the sensors, for example, panchromatic images have high spatial resolution but only a single gray band whereas multi-spectral images have low spatial resolution but multiple bands. To enhance the spatial resolution of low-resolution images, such as multi-spectral or infrared images, the proposed framework combines the structures from the low-resolution image and the textures from the high-resolution image. To improve the spatial quality of structural edges, the structure image from the low-resolution image is guided filtered with the structure image from the high-resolution image as the guidance image. The combination step is performed by pixel-wise addition of the filtered structure image and the texture image. Quantitative and qualitative evaluation demonstrate the proposed method preserves spectral and spatial fidelity of input images.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.709-712
• /
• 2006

다양한 종류의 컴퓨터가 사람, 사물, 환경 속에 내재되어 있고, 이들이 서로 연결되어, 필요한 곳에서 활용할 수 있는 유비쿼터스 환경에서는 홈 네트워크를 통해 이 기종 기기간 다양한 데이터 교환을 요구한다. 더욱이 원활한 영상 데이터의 처리, 전송, 모니터링 기술은 핵심적 요소가 아닐 수 없다. 공간 및 시간적인 해상도, 컬러의 표현 그리고 화질의 측정방법 등 고전적 영상 처리 연구 분야뿐만 아니라 국한된 대역폭을 갖는 홈네트워크의 전송체계에서 전송률 문제에 대한 심도 있는 연구가 필요하다. 본 논문에서는 홈네트워크 상황에서 콘텐츠의 중심이 되는 영상 데이터의 전송과 처리 그리고 제어를 위하여 새로운 움직임 추정 알고리즘을 제안한다. 각도, 거리등 다양한 환경에서 전송되어지는 스테레오 카메라의 영상데이터들은 축소, 확대, 이동, 보정 등 전처리 후 제안된 변형계층 모션벡터 추정 알고리즘을 이용하여 압축 처리, 전송된다. 기존 모션벡터 추정 알고리즘의 장점을 계승하고 단점을 보완한 변형계층 알고리즘은 비정형, 소형 매크로 블록을 이용하여 휘도의 편차가 큰 영상의 효율적 움직임 추정에 이용된다. 본 논문에서 제안한 변형계층 알고리즘과 이를 이용해 구현된 영상시스템은 유비쿼터스 환경에서 다양하게 활용될 수 있다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.137-152
• /
• 2005

In this Paper, we Propose an efficient web-based video learning evaluation system that is tailored to individual student's characteristics through the use of user profile-based information filtering. As a means of giving video-based questions, keyframes are extracted based on the location, size, and color information, and question-making intervals are extracted by means of differences in gray-level histograms as well as time windows. In addition, through a combination of the category-based system and the keyword-based system, questions for examination are given in order to ensure efficient evaluation. Therefore, students can enhance school achievement by making up for weak areas while continuing to identify their areas of interest.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.28 no.2
• /
• pp.117-128
• /
• 2010

Advancements in digital image have put high quality digital camera into the hands of many image professionals and consumers alike. High quality digital camera images consist originally of raw which have a set of color rendering operation applied to them to produce good images. With color rendering, the raw file was converted to Adobe RGB and sRGB color space. Also color rendering can incorporate factor such as white balance, contrast, saturation. Therefore, in this paper we conduct a study on production of optimum profile considered color rendering in digital camera. To do the experiment, the images were Digital ColorChecker SG target and ColorChecker DC target. A profiling tool was ProfileMaker 5.03. The results were analyzed by comparing in color gamut of $CIEL^*a^*b^*$ color space and calculating ${\Delta}E^*_{ab}$. Also results were analyzed in terms of different $CIEL^*a^*b^*$ color space quadrants based on lightness, chroma.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.1 no.1
• /
• pp.10-16
• /
• 2002

In this paper, a novel algorithm for segmentation of moving multiple vehicles in video sequences using logic operations is proposed. For the case of multiple vehicles in a scene, the proposed algorithm begins with a robust double-edge image derived from the difference between two successive frames using exclusive OR operation. After extracting only the edges of moving multiple vehicles using Laplacian filter, AND operation and dilation operation, the image is segmented into moving multiple vehicle image. The features of moving vehicles can be directly extracted from the segmented images. The proposed algorithm has no the two preprocessing steps, so it can reduce noises which are norm at in preprocessing of the original images. The algorithm is more simplified using logic operations. The proposed algorithm is evaluated on an outdoor video sequence with moving multiple vehicles in 90,000 frames of 30fps by a low-end video camera and produces promising results.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.5
• /
• pp.433-439
• /
• 2010

This paper proposes a beacon color code scheduling algorithm for the localization of multiple robots in a multi-block workspace. With the developments of intelligent robotics and ubiquitous technology, service robots are applicable for the wide area such as airports and train stations where multiple indoor GPS systems are required for the localization of the mobile robots. Indoor localization schemes using ultrasonic sensors have been widely studied due to its cheap price and high accuracy. However, ultrasonic sensors have some shortages of short transmission range and interferences with other ultrasonic signals. In order to use multiple robots in wide workspace concurrently, it is necessary to resolve the interference problem among the multiple robots in the localization process. This paper proposes an indoor localization system for concurrent multiple robots localization in a wide service area which is divided into multi-block for the reliable sensor operation. The beacon color code scheduling algorithm is developed to avoid the signal interferences and to achieve efficient localization with high accuracy and short sampling time. The performance of the proposed localization system is verified through the simulations and the real experiments.

• Journal of Korea Game Society
• /
• v.20 no.3
• /
• pp.75-84
• /
• 2020

This paper introduces an interactive indirect illumination algorithm which considers indirect visibility. First, a small number of rays are emitted on hemisphere of the current pixel to obtain the first intersection. If this point is directly illuminated by the light source, its illuminated color is collected. Second, in order to approximate the indirect visibility, a 3D ray marching algorithm, which is based on a hierarchy structure, is used to accelerate the ray-voxel intersection. Third, the indirect images are denoised by an edge-avoiding filtering with a local means replacement method.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.675-688
• /
• 2007

Memory access errors are frequently occurred in C programs. A number of tools and research works have been trying to detect the errors automatically. However, they have one or more of the following problems: inability to detect all memory errors, changing the memory allocation mechanism, incompatibility with libraries, and excessive performance overhead. In this paper, we suggest a new method to solve these problems, and then present a result of comparison to the previous research works through the experiments. Our approach consists of two phases. First is to transform source code at compile time through inserting instrumentation into the source code. And second is to detect memory errors at run time with a bitmap that maintains information about memory allocation. Our approach has improved the error detection abilities against the binary code analysis based ones by using the source code analysis technique, and enhanced performance in terms of both space and time, too. In addition, our approach has no problem with respect to compatibility with shared libraries as well as does not need to modify memory allocation mechanism.