• Title/Summary/Keyword: Image Texture

Search Result 1,148, Processing Time 0.03 seconds

Texture Image and Preference of Men's Wool/Wool blend Suit Fabrics (남성 정장용 양모 직무의 질감 이미지와 선호도 분석)

  • 배현주;김은애
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.27 no.11
    • /
    • pp.1318-1329
    • /
    • 2003
  • The purpose of this study was to examine the effects of the structural characteristics of men's suit fabrics on the texture image and the preference, and to analyze the relationship between the preference and the practical sales ratio. In addition, the texture images and the preference of fabric and jackets made of the same fabrics were compared. As specimen, jackets for men's suit of 2002' S/S and their fabrics were collected. Questionnaires composed of 22 sensibility related and 21 fabric image related adjectives were developed. For the subjective evaluation of the texture image, both jackets and fabric samples were tested. Tests were performed with 100 female subjects in clothing department and apparel industry. For the objective evaluation, structural characteristics such as fiber contents, yarn twist, fabric count, thickness and weight were analyzed. Total Hand Value were calculated from mechanical properties determined by the KES-FB system. Factor analysis showed sensibilities were classified into 6 categories; "surface roughness", "weight", "density", "stiffness", "elasticity" and "wetness". Fabric images were classified into 4 categories; "classic", "original", "practical", and "stuffy". Depending on the method to show the specimen to the subjects, whether it is suit or fabric, statistically significant differences were observed with a number of adjectives for sensibilities and fabric images. The results of THV of KES did not agree with the preference of subjects, which suggests that we should be careful when using the KES system, which was developed for Japanese people. Price was considered to be another factor besides the texture image that influenced on purchase.

Efficient Text Localization using MLP-based Texture Classification (신경망 기반의 텍스춰 분석을 이용한 효율적인 문자 추출)

  • Jung, Kee-Chul;Kim, Kwang-In;Han, Jung-Hyun
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.3
    • /
    • pp.180-191
    • /
    • 2002
  • We present a new text localization method in images using a multi-layer perceptron(MLP) and a multiple continuously adaptive mean shift (MultiCAMShift) algorithm. An automatically constructed MLP-based texture classifier generates a text probability image for various types of images without an explicit feature extraction. The MultiCAMShift algorithm, which operates on the text probability Image produced by an MLP, can place bounding boxes efficiently without analyzing the texture properties of an entire image.

Texture Feature Extractor Based on 2D Local Fourier Transform (2D 지역푸리에변환 기반 텍스쳐 특징 서술자에 관한 연구)

  • Saipullah, Khairul Muzzammil;Peng, Shao-Hu;Kim, Hyun-Soo;Kim, Deok-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.106-109
    • /
    • 2009
  • Recently, image matching becomes important in Computer Aided Diagnosis (CAD) due to the huge amount of medical images. Specially, texture feature is useful in medical image matching. However, texture features such as co-occurrence matrices can't describe well the spatial distribution of gray levels of the neighborhood pixels. In this paper we propose a frequency domain-based texture feature extractor that describes the local spatial distribution for medical image retrieval. This method is based on 2D Local Discrete Fourier transform of local images. The features are extracted from local Fourier histograms that generated by four Fourier images. Experimental results using 40 classes Brodatz textures and 1 class of Emphysema CT images show that the average accuracy of retrieval is about 93%.

Image Coding by Block Based Fractal Approximation (블록단위의 프래탈 근사화를 이용한 영상코딩)

  • 정현민;김영규;윤택현;강현철;이병래;박규태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.2
    • /
    • pp.45-55
    • /
    • 1994
  • In this paper, a block based image approximation technique using the Self Affine System(SAS) from the fractal theory is suggested. Each block of an image is divided into 4 tiles and 4 affine mapping coefficients are found for each tile. To find the affine mapping cefficients that minimize the error between the affine transformed image block and the reconstructed image block, the matrix euation is solved by setting each partial differential coefficients to aero. And to ensure the convergence of coding block. 4 uniformly partitioned affine transformation is applied. Variable block size technique is employed in order to applynatural image reconstruction property of fractal image coding. Large blocks are used for encoding smooth backgrounds to yield high compression efficiency and texture and edge blocks are divided into smaller blocks to preserve the block detail. Affine mapping coefficinets are found for each block having 16$\times$16, 8$\times$8 or 4$\times$4 size. Each block is classified as shade, texture or edge. Average gray level is transmitted for shade bolcks, and coefficients are found for texture and edge blocks. Coefficients are quantized and only 16 bytes per block are transmitted. Using the proposed algorithm, the computational load increases linearly in proportion to image size. PSNR of 31.58dB is obtained as the result using 512$\times$512, 8 bits per pixel Lena image.

  • PDF

Evaluation of Volumetric Texture Features for Computerized Cell Nuclei Grading

  • Kim, Tae-Yun;Choi, Hyun-Ju;Choi, Heung-Kook
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.12
    • /
    • pp.1635-1648
    • /
    • 2008
  • The extraction of important features in cancer cell image analysis is a key process in grading renal cell carcinoma. In this study, we applied three-dimensional (3D) texture feature extraction methods to cell nuclei images and evaluated the validity of them for computerized cell nuclei grading. Individual images of 2,423 cell nuclei were extracted from 80 renal cell carcinomas (RCCs) using confocal laser scanning microscopy (CLSM). First, we applied the 3D texture mapping method to render the volume of entire tissue sections. Then, we determined the chromatin texture quantitatively by calculating 3D gray-level co-occurrence matrices (3D GLCM) and 3D run length matrices (3D GLRLM). Finally, to demonstrate the suitability of 3D texture features for grading, we performed a discriminant analysis. In addition, we conducted a principal component analysis to obtain optimized texture features. Automatic grading of cell nuclei using 3D texture features had an accuracy of 78.30%. Combining 3D textural and 3D morphological features improved the accuracy to 82.19%. As a comparative study, we also performed a stepwise feature selection. Using the 4 optimized features, we could obtain more improved accuracy of 84.32%. Three dimensional texture features have potential for use as fundamental elements in developing a new nuclear grading system with accurate diagnosis and predicting prognosis.

  • PDF

Comparative analysis of the deep-learning-based super-resolution methods for generating high-resolution texture maps (고해상도 텍스처 맵 생성을 위한 딥러닝 기반 초해상도 기법들의 비교 분석 연구)

  • Hyeju Kim;Jah-Ho Nah
    • Journal of the Korea Computer Graphics Society
    • /
    • v.29 no.5
    • /
    • pp.31-40
    • /
    • 2023
  • As display resolution increases, many apps also tend to include high-resolution texture maps. Recent advancements in deep-learning-based image super-resolution techniques make it possible to automate high-resolution texture generation. However, there is still a lack of comprehensive analysis of the application of these techniques to texture maps. In this paper, we selected three recent super-resolution techniques, namely BSRGAN, Real-ESRGAN, and SwinIR (classical and real-world image SR), and applied them to upscale texture maps. We then conducted a quantitative and qualitative analysis of the experimental results. The findings revealed various artifacts after upscaling, which indicates that there are still limitations in directly applying super-resolution techniques to texture-map upscaling.

Effect of light illumination and camera moving speed on soil image quality (조명 및 카메라 이동속도가 토양 영상에 미치는 영향)

  • Chung, Sun-Ok;Cho, Ki-Hyun;Jung, Ki-Yuol
    • Korean Journal of Agricultural Science
    • /
    • v.39 no.3
    • /
    • pp.407-412
    • /
    • 2012
  • Soil texture has an important influence on agriculture such as crop selection, movement of nutrient and water, soil electrical conductivity, and crop growth. Conventionally, soil texture has been determined in the laboratory using pipette and hydrometer methods requiring significant amount of time, labor, and cost. Recently, in-situ soil texture classification systems using optical diffuse reflectometry or mechanical resistance have been reported, especially for precision agriculture that needs more data than conventional agriculture. This paper is a part of overall research to develop an in-situ soil texture classification system using image processing. Issues investigated in this study were effects of sensor travel speed and light source and intensity on image quality. When travel speed of image sensor increased from 0 to 10 mm/s, travel distance and number of pixel were increased to 3.30 mm and 9.4, respectively. This travel distances were not negligible even at a speed of 2 mm/s (i.e., 0.66 mm and 1.4), and image degradation was significant. Tests for effects of illumination intensity showed that 7 to 11 Lux seemed a good condition minimizing shade and reflection. When soil water content increased, illumination intensity should be greater to compensate decrease in brightness. Results of the paper would be useful for construction, test, and application of the sensor.

An Algorithm for the Multi-view Image Improvement with the Resteicted Number of Images in Texture Extraction (텍스쳐 추출시 제한된 수의 참여 영상을 이용한 Multi-view 영상 개선 알고리듬)

  • 김도현;양영일
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.1
    • /
    • pp.34-40
    • /
    • 2000
  • '[n this paper, we propose an efficient multi-view image coding algorithm which finds the optimal texture from a restricted number of multi-view image. The X-Y plane of the normalized object space is divided into the triangular patches. The depth of each node is determined by appling a block based disparity compensation method. Thereafter the texture of each patch is extracted by appling an affine transformation based disparity compensation method to the multi-view images. We reduced the number of images needed to determine the texture compared to traditional methods which use all the multi-view image in the texture extraction. The experimental results show that the SNR of images encoded by the proposed algorithm is better than that of images encoded by the traditional method by the approximately 0.2dB for the test sets of multi -view image called dragon, santa, city and kid. Image data recovered after encoding by the proposed method show a better visual results than after using traditional method.

  • PDF

Document Image Segmentation and Classification using Texture Features and Structural Information (텍스쳐 특징과 구조적인 정보를 이용한 문서 영상의 분할 및 분류)

  • Park, Kun-Hye;Kim, Bo-Ram;Kim, Wook-Hyun
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.11 no.3
    • /
    • pp.215-220
    • /
    • 2010
  • In this paper, we propose a new texture-based page segmentation and classification method in which table region, background region, image region and text region in a given document image are automatically identified. The proposed method for document images consists of two stages, document segmentation and contents classification. In the first stage, we segment the document image, and then, we classify contents of document in the second stage. The proposed classification method is based on a texture analysis. Each contents in the document are considered as regions with different textures. Thus the problem of classification contents of document can be posed as a texture segmentation and analysis problem. Two-dimensional Gabor filters are used to extract texture features for each of these regions. Our method does not assume any a priori knowledge about content or language of the document. As we can see experiment results, our method gives good performance in document segmentation and contents classification. The proposed system is expected to apply such as multimedia data searching, real-time image processing.

Enhanced Graph-Based Method in Spectral Partitioning Segmentation using Homogenous Optimum Cut Algorithm with Boundary Segmentation

  • S. Syed Ibrahim;G. Ravi
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.7
    • /
    • pp.61-70
    • /
    • 2023
  • Image segmentation is a very crucial step in effective digital image processing. In the past decade, several research contributions were given related to this field. However, a general segmentation algorithm suitable for various applications is still challenging. Among several image segmentation approaches, graph-based approach has gained popularity due to its basic ability which reflects global image properties. This paper proposes a methodology to partition the image with its pixel, region and texture along with its intensity. To make segmentation faster in large images, it is processed in parallel among several CPUs. A way to achieve this is to split images into tiles that are independently processed. However, regions overlapping the tile border are split or lost when the minimum size requirements of the segmentation algorithm are not met. Here the contributions are made to segment the image on the basis of its pixel using min-cut/max-flow algorithm along with edge-based segmentation of the image. To segment on the basis of the region using a homogenous optimum cut algorithm with boundary segmentation. On the basis of texture, the object type using spectral partitioning technique is identified which also minimizes the graph cut value.