• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.9
• /
• pp.1428-1435
• /
• 1989

In this paper we propose a new algorithm which extracts spatial arrangement information of texture elements in structural textures. In the proposed algorithm, by the use of projection information in several directions obtained from the texture image we can get two directions which determine the texture structure and the parallelogram grid which isolates texture elements. The isolated texture elements are analyzed and used to synthesize texture images. Computer simulation shows that the proposed method can extract proper spatial structure of the texture element even when the texture image is highly corrupted by additive noise.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1183-1202
• /
• 2017

Image restoration has been carried out by texture synthesis mostly for large regions and inpainting algorithms for small cracks in images. In this paper, we propose a new approach that allows for the simultaneous fill-in of different structures and textures by processing in a wavelet domain. A combination of structure inpainting and patch-based texture synthesis is carried out, which is known as patch-based inpainting, for filling and updating the target region. The wavelet transform is used for its very good multiresolution capabilities. The proposed algorithm uses the wavelet domain subbands to resolve the structure and texture components in smooth approximation and high frequency structural details. The subbands are processed separately by the prioritized patch-based inpainting with isophote energy driven texture synthesis at the core. The algorithm automatically estimates the wavelet coefficients of the target regions of various subbands using optimized patches from the surrounding DWT coefficients. The suggested performance improvement drastically improves execution speed over the existing algorithm. The proposed patch optimization strategy improves the quality of the fill. The fill-in is done with higher priority to structures and isophotes arriving at target boundaries. The effectiveness of the algorithm is demonstrated with natural and textured images with varying textural complexions.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.675-683
• /
• 1987

In general, texture images with regular patterns can be described by using the standard texture model regularity vectors for their shape analysis. Early methods not only take much time but also have computational complexity in obtaining regularity vectors. The proposed some improved preprocessing algorithms for texture analysis. Finally, we showed the utility of the proposed method through texture synthesis by making use of the results of texture analysis.

• Journal of the HCI Society of Korea
• /
• v.2 no.2
• /
• pp.11-18
• /
• 2007

We propose a novel method to conceal fiducial markers observed in augmented scenes using patch-based texture synthesis. Despite the efficiency for simple object recognition and tracking, the markers deliver inherent obtrusiveness. They do not only reduce immersiveness, but also severely degrade usability of augmented reality. The proposed method constructs alternative images in real time to overlay markers present in the sequence of images. The global characteristics of background textures are retained and the results are more adaptive to illumination changes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3642-3667
• /
• 2021

Texture synthesis technology has the advantages of repairing texture and structure at the same time. However, during the filling process, the size of the patch is fixed, and the content of the filling is not fully considered. In order to be able to adaptively change the patch size, we used the exemplar-based inpainting technique as the test algorithm, considering the image structure and texture, calculated the image structure patch size and texture patch size, and comprehensively determined the image patch size. This can adaptively change the patch size according to the filling content. In addition, we use multi-layer images to calculate the priority, so that the order of image repair was more stable. The proposed repair algorithm is compared with other image repair algorithms. The experimental results showed that the proposed adaptive image repair algorithm can better repair the texture and structure of the image, which proved the effectiveness of the proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2400-2419
• /
• 2014

Pre-segmented pixels can reduce the difficulty of segmentation and promote the segmentation performance. This paper proposes a novel segmentation method based on merging texture superpixels by computing inner similarity. Firstly, we design a set of Gabor filters to compute the amplitude responses of original image and compute the texture map by a salience model. Secondly, we employ the simple clustering to extract superpixles by affinity of color, coordinates and texture map. Then, we design a normalized histograms descriptor for superpixels integrated color and texture information of inner pixels. To obtain the final segmentation result, all adjacent superpixels are merged by the homogeneity comparison of normalized color-texture features until the stop criteria is satisfied. The experiments are conducted on natural scene images and synthesis texture images demonstrate that the proposed segmentation algorithm can achieve ideal segmentation on complex texture regions.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.2189-2196
• /
• 2015

Stereo matching algorithm is usually used to obtain a disparity map from a pair of images. However, the disparity map obtained by using stereo matching contains lots of noise and error regions. In this paper, we propose a virtual-view synthesis algorithm using disparity refinement in order to improve the quality of the synthesized image. First, the error region is detected by examining the consistency of the disparity maps. Then, motion information is acquired by applying optical flow to texture component of the image in order to improve the performance. Then, the occlusion region is found using optical flow on the texture component of the image in order to improve the performance of the optical flow. The refined disparity map is finally used for the synthesis of the virtual view image. The experimental results show that the proposed algorithm improves the quality of the generated virtual-view.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1129-1144
• /
• 2020

The thangka image inpainting method based on wavelet transform is not ideal for contour curves when the high frequency information is repaired. In order to solve the problem, a new image inpainting algorithm is proposed based on edge structural constraints and wavelet transform coefficients. Firstly, a damaged thangka image is decomposed into low frequency subgraphs and high frequency subgraphs with different resolutions using wavelet transform. Then, the improved fast marching method is used to repair the low frequency subgraphs which represent structural information of the image. At the same time, for the high frequency subgraphs which represent textural information of the image, the extracted and repaired edge contour information is used to constrain structure inpainting in the proposed algorithm. Finally, the texture part is repaired using texture synthesis based on the wavelet coefficient characteristic of each subgraph. In this paper, the improved method is compared with the existing three methods. It is found that the improved method is superior to them in inpainting accuracy, especially in the case of contour curve. The experimental results show that the hierarchical method combined with structural constraints has a good effect on the edge damage of thangka images.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2024.01a
• /
• pp.415-418
• /
• 2024

본 논문에서는 텍스처 합성을 할 때 CNN을 사용하여 효율성을 높이고 방향을 고려하여 동적인 결과로 품질을 개선시킬 수 있는 방법을 제안한다. 자유로운 회전 각도로 방향성을 고려하여 동적인 결과물을 생성할 수 있도록 하였으며, 기존 접근법인 사각형 형태의 마스크 블록이 아닌 다양한 회전 각도를 고려하여 학습을 했기 때문에 텍스처 합성 과정에서 방향성 특징을 좀 더 잘 표현할 수 있다.

• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.197-200
• /
• 2011

In this paper, we propose a multi-view stereoscopic image synthesis algorithm for 3DTV system using depth information with an RGB texture from a depth camera. The proposed algorithm synthesizes multi-view images which a virtual convergence camera model could generate. Experimental results showed that the performance of the proposed algorithm is better than those of conventional methods.