• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.531-533
• /
• 2010

솔리드 텍스처 합성에서 최종 결과의 품질과 마찬가지로 텍스처 합성에 필요한 계산을 단축하는 것은 중요하다. 최근 연구에서는 데이터 차원 감소나 k-coherence search 같은 매칭 가속화 방법을 사용해서 솔리드 텍스처 합성 시간을 단축하였다. 본 논문에서는 빠르게 2D 이미지로부터 솔리드 텍스처 합성을 할 수 있는 새로운 방법을 제시한다. 제안하는 방법의 기본 아이디어는 주어진 이미지를 다수 영역으로 분할하여 형상 매칭(feature matching) 과정에서 사용되는 후보 수를 줄이는 것으로, 사물을 이루는 복셀과 관련한 픽셀이 포함된 분할 영역내의 후보들과 비교함으로써, 보다 빠르게 최적의 결과값을 제공한다. 실험적으로 본 방법은 k-coherence search 알고리즘에서 k 값을 1 로 사용했을 때보다 빠르거나 비슷한 시간을 갖는다.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.249-256
• /
• 2011

Finding a new set of features representing textured images is one of the most important studies in textured image analysis. This is because it is impossible to construct a perfect set of features representing every textured image, and it is inevitable to choose some relevant features which are efficient to on-going image processing jobs. This paper intends to find relevant features which are efficient to textured image segmentation. In this regards, this paper presents a different method for the segmentation of textured images based on the Gabor filter. Gabor filter is known to be a very efficient and effective tool which represents human visual system for texture analysis. Filtering a real-valued input image by the Gabor filter results in complex-valued output data defined in the spatial frequency domain. This complex value, as usual, gives the module and the phase. This paper focused its attention on the phase information, rather than the module information. In fact, the module information is considered very useful at region analysis in texture, while the phase information was considered almost of no use. But this paper shows that the phase information can also be fully useful and effective at region analysis in texture, once a good method introduced. We now propose "phase derivated method", which is an efficient and effective way to compute the useful phase information directly from the filtered value. This new method reduces effectively computing burden and widen applicable textured images.

• The KIPS Transactions:PartB
• /
• v.16B no.5
• /
• pp.377-384
• /
• 2009

A new algorithm in order to classify various contents in the image documents, such as text, figure, graph, table, etc. is proposed in this paper by classifying contents using texture-based PCA, and by segmenting document images using local entropy-based histogram. Local entropy and histogram made the binarization of image document not only robust to various transformation and noise, but also easy and less time-consuming. And texture-based PCA algorithm for each segmented region was taken notice of each content in the image documents having different texture information. Through this, it was not necessary to establish any pre-defined structural information, and advantages were found from the fact of fast and efficient classification. The result demonstrated that the proposed method had shown better performances of segmentation and classification for various images, and is also found superior to previous methods by its efficiency.

• Journal of Korea Game Society
• /
• v.8 no.2
• /
• pp.57-68
• /
• 2008

Texture Mapping is a technique for adding realism to an image in 3D graphics Chip. Bilinear filtering mode of this technique needs accesses of 4 texels to process one pixel. In this paper we analyzed the access pattern of texture, and proposed the high performance texture cache which can access 4 texels simultaneously. We evaluated using simulation results of 3D game(Quake 3, Unreal Tournament 2004). Simulation results show that proposed texture cache has high performance on the case where physical size is less then or equal 8KBytes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.160-174
• /
• 2008

In this paper, we propose new coding techniques for photometry data of three-dimensional(3-D) mesh models. We make a good use of geometry and connectivity information to improve coding efficiency of color, normal vector, and texture data. First of all, we determine the coding order of photometry data exploiting connectivity information. Then, we exploit the obtained geometry information of neighboring vortices through the previous process to predict the photometry data. For color coding, the predicted color of the current vertex is computed by a weighted sum of colors for adjacent vortices considering geometrical characteristics between the current vortex and the adjacent vortices at the geometry predictor. For normal vector coding, the normal vector of the current vertex is equal to one of the optimal plane produced by the optimal plane generator with distance equalizer owing to the property of an isosceles triangle. For texture coding, our proposed method removes discontinuity in the texture coordinates and reallocates texture image segments according to the coding order. Simulation results show that the proposed compression schemes provide improved performance over previous works for various 3-D mesh models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.725-733
• /
• 2000

In this paper, we propose a modified boundary block merging technique for the texture coding of MPEG-4. We propose an ORP(Optimized Region Partitioning) method that partition the VOP-based reference position to minimize the number of coding blocks. The merging possibility is improved by adding +90。and -90。 Rotation merging. We propose a MRM(Multiple Rotation Merging) method which applies the rotation merging in the order of 180。, +90。and -90。. If a pair of boundary blocks has low correlation, existing BBM's padding technique is not efficient. Our padding after merging method gives better result even if it has low correlation. The proposed method showed 5 ~8(%) coding bit reduction at the same PSNR values compared to BBM method.

• Journal of Korea Multimedia Society
• /
• v.16 no.2
• /
• pp.169-179
• /
• 2013

Change detection algorithms take two image frames and return the locations of newly introduced objects which cause differences between the images. This paper presents a new change detection method, which classifies intensity changes due to introduced objects, reflected light and shadow from the objects to their neighborhood, and the noise, and exactly localizes the introduced objects. For classification and localization, first we analyze the histogram of the intensity difference between two images, and estimate multiple threshold values. Second we estimate candidate object boundaries using the gradient difference between two images. Using those threshold values and candidate object boundaries, we segment the frame difference image into multiple regions. Finally we classify whether each region belongs to the introduced objects or not using textures in the region. Experiments show that the proposed method exactly localizes the objects in various scenes with different lighting.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.8
• /
• pp.579-588
• /
• 2013

This paper proposes an effective watermarking approach for copyright protection of fire video images. The proposed watermarking approach efficiently utilizes the inherent characteristics of fire data with respect to color and texture by using a gray level co-occurrence matrix (GLCM) and fuzzy c-means (FCM) clustering. GLCM is used to generate a texture feature dataset by computing energy and homogeneity properties for each candidate fire image block. FCM is used to segment color of the fire image and to select fire texture blocks for embedding watermarks. Each selected block is then decomposed into a one-level wavelet structure with four subbands [LL, LH, HL, HH] using a discrete wavelet transform (DWT), and LH subband coefficients with a gain factor are selected for embedding watermark, where the visibility of the image does not affect. Experimental results show that the proposed watermarking approach achieves about 48 dB of high peak-signal-to-noise ratio (PSNR) and 1.6 to 2.0 of low M-singular value decomposition (M-SVD) values. In addition, the proposed approach outperforms conventional image watermarking approach in terms of normalized correlation (NC) values against several image processing attacks including noise addition, filtering, cropping, and JPEG compression.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.11a
• /
• pp.161-163
• /
• 2022

본 논문에서는 패치매치 기법 및 분할 기법의 조밀 깊이지도들의 효율적인 결합을 통해 기존의 패치매치 기반의 방법들이 낮은 깊이값 추정 정확도를 보인 영역들인 텍스처가 부족한 영역과 기존의 분할 기반 방법들이 깊이값 추정에 한계를 보인 세밀한 영역에서의 깊이값 추정 정확도를 동시에 높이고 고품질의 조밀 깊이지도를 얻는 것을 목표로 한다. 이를 위해 제안한 방법에서는 신뢰지도를 바탕으로 패치매치 기법의 조밀 깊이지도, 조밀 노말지도와 분할 기법의 조밀 깊이지도, 조밀 노말지도의 초기 결합 깊이지도 및 초기 결합 노말지도를 생성한다. 이후 각 픽셀에서 원래 픽셀과 주변 픽셀에서의 깊이값, 노말값들로 업데이트를 위한 후보들을 만든다. 이후 각각의 후보들에 대해서 깊이값, 노말값, 컬러값들을 바탕으로 비용을 계산한다. 이후 가장 최적의 비용을 가지는 후보값으로 각 픽셀의 깊이값과 노말값을 업데이트한다. 이를 통해 패치매치 기법 및 분할 기법의 조밀 깊이지도들의 장점을 합친 결합 조밀 깊이지도를 생성한다.