• Journal of Korea Multimedia Society
• /
• v.15 no.8
• /
• pp.977-985
• /
• 2012

The purpose of this study was to present a non-photorealistic rendering technique that is efficient in single images and moving images. In case of single images, they could be processed in a real-time base by realizing flow-based DoG filter and bilateral filter, which have been frequently used in the single image NPR technique recently, in the CUDA environment. In case of moving images, the investigator presented not the existing method of NPR moving images which generating images by applying the single image NPR technique to every frame, but the method of using the single image NPR technique in the first frame and stylizing it, and then of using the motion vector-based pixel mapping in the second frame on and copying the bright values of pixels that move on the frame into the location of next frame's motion vector, thus reducing unnecessary volume of calculation and maintaining the consistency between frames. In this study, the performance of this method was proved via an experiment.

• The Journal of the Korea Contents Association
• /
• v.10 no.1
• /
• pp.1-9
• /
• 2010

In this paper we present a shading technique for realistic rendering of the surfaces with irregular and complex textures using a single photograph. So far, most works have been using many photographs or special photographing equipment to render the surfaces with irregular and complex textures as well as dividing texture regions manually. We present an automatic selection method of the region segmentation techniques according to properties of materials. As our technique produces a reflectance model and the approximated Bidirectional Reflection Distribution Function(BRDF) parameters, it allows the recovery of the photometric properties of diffuse, specular, isotropic or anisotropic textured objects. Also it make it possible to present several synthetic images with novel lighting conditions and views.

• Journal of Digital Convergence
• /
• v.10 no.4
• /
• pp.191-197
• /
• 2012

In this paper we present creating 3D image from 2D image by extract initial depth values calculated from focal values. The initial depth values are created by using the extracted focal information, which is calculated by the comparison of original image and Gaussian filtered image. This initial depth information is allocated to the object segments obtained from normalized cut technique. Then the depth of the objects are corrected to the average of depth values in the objects so that the single object can have the same depth. The generated depth is used to convert to 3D image using DIBR(Depth Image Based Rendering) and the generated 3D image is compared to the images generated by other techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.350-357
• /
• 2010

In this paper, we present an auto-range fast bilateral filter (FBF) for high-dynamic-range (HDR) images, which increases computation speed by using adaptive standard deviations for range filter (RF) of FBF in iCAM06. Many images that cover the entire dynamic range of the scene with different exposure times are fused into one High Dynamic Range (HDR) image. The representative algorithm for HDR image rendering is iCAM06, which is based on the iCAM framework, such as the local white point adaptation, chromatic adaptation, and the image processing transform (IPT) uniform color space. FBF in iCAM06 uses constant standard deviation in RF. So, it causes unnecessary FBF computation in high stimulus range with broad and low distribution. To solve this problem, the low stimulus image and high stimulus image of CIE tri-stimulus values (XYZ) divided by the threshold are respectively processed by adaptive standard deviation based on its histogram distribution. Experiment results show that the proposed method reduces computation time than the previous FBF.

• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.05
• /
• pp.45-48
• /
• 1995

Visualization of three dimensional medical images has been studied in many ways. For CT and MRI data, 3D rendering schemes are commercially available and widly used. However visualization of ultrasonic 3D data is not popular yet, even though its potentional in medical diagnosis seems very high. In this paper we try to visualize 3D ultrasonic data. The basic method is adopted from the volume rendering technique. Based on the characteristics of the ultrasonic images, 3D visualization algorithm is developed and applied for the 3D image set of a dog heart.

• 한국HCI학회:학술대회논문집
• /
• 2007.02c
• /
• pp.170-175
• /
• 2007

영상 재투영이란, 깊이 맵을 투영하여 임의의 시점에서 본 이미지를 생성해내는 기법을 말한다. 기존의 CPU를 이용한 영상 재투영 기법들의 가장 큰 단점은 CPU와 GPU 간의 데이터 복사가 일어나고 재투영 연산 자체의 속도가 느리기 때문에 실시간 렌더링이 불가능 하다는 것이다. 따라서 본 논문에서는 GPU를 이용하여 영상 재투영을 구현하고 실시간에 이미지를 렌더링하는 기법을 소개한다. 우리의 기법은 입력으로 참조 이미지와 해당 이미지의 깊이 맵이 주어졌을 때, 임의의 시점에서 보이는 새로운 이미지를 실시간으로 생성한다. 임의의 시점에서 이미지를 생성하기 위해, 각 픽셀에서 참조 이미지에 해당하는 평면을 렌더링하여 시점 반대 방향의 광선을 생성한다. 이 광선을 참조 이미지의 투영 공간으로 변환한 후, 광선과 깊이 맵간의 교차점을 찾는다. 이렇게 찾아낸 깊이 맵의 교차점과 일치하는 참조 이미지의 픽셀 색으로 새로운 시점의 이미지를 만들어 낼 수 있다. 이와 같은 기법은 기하 정보의 복잡도와 관계없이 수십 프레임의 속도로 실시간 렌더링이 가능하다.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2918-2920
• /
• 2000

A new multi-planar interpolation technique for three dimensional medical image rendering is proposed. In medical imaging. resolution in the slice direction is usually much lower than those in the transverse planes. The proposed method is based on the solution of the Laplace's equation used in the electrostatics. In this approach. two contours in the source and destination planes for a given object is assumed to have equi-potentials. Some preprocessing and post-processing including scaling. displacement. rotation from the centers of mass are involved in the algorithm. The interpolation solution assumes mostly smoothing changes in between the source and destination planes. Simultaneous multiple interpolation planes are inherently obtained in the proposed method. Some experimental and simulation results are shown.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.58-63
• /
• 2007

본 논문은 현미경이나 카메라 영상 등의 실시간 영상을 이용한 변형체(deformable object)의 햅틱 렌더링을 구현하는 방법에 관한 것이다. 이는 저속으로 변형하는 물체의 영상정보를 실시간으로 추출하여, 그에 대한 영상처리를 통해 변형과 이동에 대한 위치 정보를 제공함으로써 이루어진다. 물체에 변형이 가해지면 카메라를 통해 컴퓨터로 그 영상이 전송되며 얻어진 영상은 스네이크 알고리즘의 영상처리 과정을 거쳐 이차원 모델 구현을 위한 위치정보를 제공한다. 이 가상모델에 대한 햅틱 렌더링을 구현하여 햅틱장치에 힘 피드백을 주게 되며, 안정적인 햅틱 렌더링의 구현을 위해 보간법(interpolation) 및 보외법(extrapolation)을 적용하여 모델과 햅틱장치간의 샘플링 문제를 해결한다. 그래픽 렌더링 또한 구현하여 조작의 용이함을 제공한다.

• Journal of the Korea Computer Graphics Society
• /
• v.4 no.2
• /
• pp.15-28
• /
• 1998

최근 영상 기반 렌더링(image-based rendering)을 위한 새로운 접근방법으로서 광학 흐름 요소 렌더링(optical flow rendering)이 제안되었다. 이 방법은 좌우 영상 대응(stereo matching)에서 발생하는 오류와 무관하게 고품질의 영상을 생성할 수 있고 깊이 정보 비교를 통해 기존의 렌더링 방법으로 생성한 영상과 광학 흐름 요소로부터 생성한 영상을 합성할 수 있는 반면에, 한 화소 당 하나 이상의 광학 흐름 요소를 필요로하기 때문에 연산량이 많아져 영상 생성이 느려지는 단점이 있었다. 본 논문에서는 실시간 영상 생성을 위한 광학 흐름 요소 구성법과 영상 생성법을 제안한다. 각각의 광학 흐름 요소가 영상 내에서 화소들의 구간에 대응되도록 개선하여 전체 광학 흐름 요소의 수를 줄였으며, 필터링 탐색법 (filtering search)을 적용하여 전체 광학 흐름 요소를 모두 탐색하는 대신 실제로 영상 생성에 사용되는 광학 흐름 요소만을 탐색함으로써 전체 연산량을 크게 줄였다. 제안된 방법을 SGI Indigo2 Impact 워크스테이션(R10000 CPU; 128 Mbytes)상에서 구현한 결과, 초당 10장 이상의 고속 영상 생성이 가능했다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5063-5073
• /
• 2016

In this paper, an efficient texture compression method is proposed for fast rendering, which exploits the spatial correlation among blocks through intra-picture block matching. Texture mapping is widely used to enhance the visual quality of results in real-time rendering applications. For fast texture mapping, it is necessary to identify an effective trade-off between compression efficiency and computational complexity. The conventional compression methods utilized for image processing (e.g., JPEG) provide high compression efficiency while resulting in high complexity. Thus, low complexity methods, such as ETC1, are often used in real-time rendering applications. Although these methods can achieve low complexity, the compression efficiency is still lower than that of JPEG. To solve this problem, we propose a texture compression method by reducing the spatial redundancy between blocks in order to achieve the better compression performance than ETC1 while maintaining complexity that is lower than that of JPEG. Experimental results show that the proposed method achieves better compression efficiency than ETC1, and the decoding time is significantly reduced compared to JPEG while similar to ETC1.