• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권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.

• Journal of Computing Science and Engineering
• /
• 제10권2호
• /
• pp.68-73
• /
• 2016

An efficient texture compression method is proposed based on a block matching process between the current block and the previously encoded blocks. Texture mapping is widely used to improve the quality of rendering results in real-time applications. For fast texture mapping, it is important to find an optimal trade-off between compression efficiency and computational complexity. Low-complexity methods (e.g., ETC1 and DXT1) have often been adopted in real-time rendering applications because conventional compression methods (e.g., JPEG) achieve a high compression ratio at the cost of high complexity. We propose a block matching-based compression method that can achieve a higher compression ratio than ETC1 and DXT1 while maintaining computational complexity lower than that of JPEG. Through a comparison between the proposed method and existing compression methods, we confirm our expectations on the performance of the proposed method.

• 한국멀티미디어학회논문지
• /
• 제18권2호
• /
• pp.149-157
• /
• 2015

The 3D-AVC standard aims at improving coding efficiency by applying new techniques for utilizing intra, inter and view predictions. 3D video scenes are rendered with existing texture video and additional depth map. The depth map comes at the expense of increased computational complexity of the encoding process. For real-time applications, reducing the complexity of 3D-AVC is very important. In this paper, we present a fast intra mode decision algorithm to reduce the complexity burden in the 3D video system. The proposed algorithm uses similarity between texture video and depth map. The best intra prediction mode of the depth map is similar to that of the corresponding texture video. The early decision algorithm can be made on the intra prediction of depth map coding by using the coded intra mode of texture video. Adaptive threshold for early termination is also proposed. Experimental results show that the proposed algorithm saves the encoding time on average 29.7% without any significant loss in terms of the bit rate or PSNR value.

• 대한전자공학회논문지
• /
• 제24권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.1899-1902
• /
• 2003

Recently several methods have been developed for the virtual space construction. Generally, most of the methods are geometric-based rendering technic, but they are difficult to construct real-time rendering because of large data. In this paper, we present a three dimension image-based rendering method that enable a constant speed of real-time rendering regardless of object complexity in virtual space. The Proposed method shows good performance for the virtual space construction with high complexity.

• 대한원격탐사학회지
• /
• 제21권2호
• /
• pp.121-133
• /
• 2005

화소들 사이의 관계를 고려해 Texture 영상을 생성해 내는 것을 의미하는 Texture 영상화는 유용한 영상 분석 방법 중의 하나로 잘 알려져 있고, 대부분의 상업적인 원격 탐사 소프트웨어들은 GLCM이라는 Texture 분석 기능을 제공하고 있다. 본 연구에서는, GLCM 알고리즘에 기반한 Texture 영상화 프로그램이 구현되었고, 추가적으로 GLDV에 기반을 둔 Texture 영상화 모듈 프로그램을 제공한다. 본 프로그램에서는 Homogeneity, Dissimilarity, Energy, Entropy, Angular Second Moment(ASM), Contrast 등과 같은 GLCN/GLDV의 6가지 Texture 변수에 따라 각각 이에 해당하는 Texture 영상들을 생성해 낸다. GLCM/GLDV Texture 영상 생성에서는 방향 의존성을 고려해야 하는데, 이 프로그램에서는 기본적으로 동-서, 북동-남서, 북-남, 북서-남동 등의 기본적인 방향설정을 제공한다. 또한 이 논문에서 새롭게 구현된 커널내의 모든 방향을 고려해서 평균값을 계산하는 Omni 방향 모드와 커널내의 중심 화소를 정하고_그 주변 화소에 대한 원형 방향을 고려하는 원형방향 모드를 지원한다. 또한 본 연구에서는 여러 가지 변수와 모드에 따라 얻어진 Texture 영상의 분석을 위하여 가상 영상 및 실제 위성 영상들에 의하여 생성된 Texture 영상간의 특징 분석과 상호상관 분석을 수행하였다. Texture 영상합성 응용시에는 영상의 생성시에 적용된 변수들에 대한 이해와 영상간의 상관도를 분석하는 과정이 필요할 것으로 생각된다.

• ETRI Journal
• /
• 제26권2호
• /
• pp.122-135
• /
• 2004

Although frame-based MPEG-4 video services have been successfully deployed since 2000, MPEG-4 video coding is now facing great competition in becoming a dominant player in the market. Object-based coding is one of the key functionalities of MPEG-4 video coding. Real-time object-based video encoding is also important for multimedia broadcasting for the near future. Object-based video services using MPEG-4 have not yet made a successful debut due to several reasons. One of the critical problems is the coding complexity of object-based video coding over frame-based video coding. Since a video object is described with an arbitrary shape, the bitstream contains not only motion and texture data but also shape data. This has introduced additional complexity to the decoder side as well as to the encoder side. In this paper, we have analyzed the current MPEG-4 video encoding tools and proposed efficient coding technologies that reduce the complexity of the encoder. Using the proposed coding schemes, we have obtained a 56 percent reduction in shape-coding complexity over the MPEG-4 video reference software (Microsoft version, 2000 edition).

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1628-1639
• /
• 2017

The combination texture feature extraction approach for texture image retrieval is proposed in this paper. Two kinds of low level texture features were combined in the approach. One of them was extracted from singular value decomposition (SVD) based dual-tree complex wavelet transform (DTCWT) coefficients, and the other one was extracted from multi-scale local binary patterns (LBPs). The fusion features of SVD based multi-directional wavelet features and multi-scale LBP features have short dimensions of feature vector. The comparing experiments are conducted on Brodatz and Vistex datasets. According to the experimental results, the proposed method has a relatively better performance in aspect of retrieval accuracy and time complexity upon the existing methods.

• 대한전자공학회논문지SP
• /
• 제39권3호
• /
• pp.11-22
• /
• 2002

다중 텍스쳐 영상으로부터 최적의 텍스쳐 특징을 생성하는 최적 필터 설계는 표면, 물체, 모양, 깊이 인식 등을 위한 텍스쳐 분석에 있어서 가장 성능이 뛰어난 기술 중의 하나이다. 그러나 대부분의 최적 필터설계는 많은 복잡한 계산량과 교사적 특성에 의해서 효율적인 텍스쳐 영역의 분할을 수행하지 못하는 실정이다. 따라서 본 논문에서는 다중 텍스쳐 영상에 내재하는 각 텍스쳐들의 공간 주파수 분석에 의한 효율적인 최적 가버필터 설계 방법을 제시한다. 설계된 최적 필터는 "Brodaz texture book"서 발췌한 다양한 형태의 다중 텍스쳐 영상을 생성하여 실험한 후 성공적인 결과를 보인다.

• 한국정보전자통신기술학회논문지
• /
• 제9권6호
• /
• pp.519-525
• /
• 2016

This paper addresses the framework of object-oriented image coding, describing a new algorithm, based on monodimensional Legendre polynomials, for texture approximation. Through the use of 1D orthogonal basis functions, the computational complexity which usually makes prohibitive most of 2D region-oriented approaches is significantly reduced, while only a slight increment of distortion is introduced. In the aim of preserving the bidimensional intersample correlation of the texture information as much as possible, suitable pseudo-bidimensional basis functions have been used, yielding significant improvements with respect to the straightforward 1D approach. The algorithm has been experimented for coding still images as well as motion compensated sequences, showing interesting possibilities of application for very low bitrate video coding.