• Korean Journal of Radiology
• /
• v.20 no.4
• /
• pp.558-568
• /
• 2019

Objective: To evaluate whether computed tomography (CT) reconstruction algorithms affect the CT texture features of the liver parenchyma. Materials and Methods: This retrospective study comprised 58 patients (normal liver, n = 34; chronic liver disease [CLD], n = 24) who underwent liver CT scans using a single CT scanner. All CT images were reconstructed using filtered back projection (FBP), hybrid iterative reconstruction (IR) (iDOSE⁴), and model-based IR (IMR). On arterial phase (AP) and portal venous phase (PVP) CT imaging, quantitative texture analysis of the liver parenchyma using a single-slice region of interest was performed at the level of the hepatic hilum using a filtration-histogram statistic-based method with different filter values. Texture features were compared among the three reconstruction methods and between normal livers and those from CLD patients. Additionally, we evaluated the inter- and intra-observer reliability of the CT texture analysis by calculating intraclass correlation coefficients (ICCs). Results: IR techniques affect various CT texture features of the liver parenchyma. In particular, model-based IR frequently showed significant differences compared to FBP or hybrid IR on both AP and PVP CT imaging. Significant variation in entropy was observed between the three reconstruction algorithms on PVP imaging (p < 0.05). Comparison between normal livers and those from CLD patients revealed that AP images depend more strongly on the reconstruction method used than PVP images. For both inter- and intra-observer reliability, ICCs were acceptable (> 0.75) for CT imaging without filtration. Conclusion: CT texture features of the liver parenchyma evaluated using the filtration-histogram method were significantly affected by the CT reconstruction algorithm used.

• Journal of Information Processing Systems
• /
• v.8 no.3
• /
• pp.389-398
• /
• 2012

Texture is an important visual feature for image analysis. Many approaches have been proposed to model and analyze texture features. Although these approaches significantly contribute to various image-based applications, most of these methods are sensitive to the changes in the scale and orientation of the texture pattern. Because textures vary in scale and orientations frequently, this easily leads to pattern mismatching if the features are compared to each other without considering the scale and/or orientation of textures. This paper suggests an Orientation Matching Scheme (OMS) to ease the problem of mismatching rotated patterns. In OMS, a pair of texture features will be compared to each other at various orientations to identify the best matched direction for comparison. A database including rotated texture images was generated for experiments. A synthetic retrieving experiment was conducted on the generated database to examine the performance of the proposed scheme. We also applied OMS to the similarity computation in a K-means clustering algorithm. The purpose of using K-means is to examine the scheme exhaustively in unpromising conditions, where initialized seeds are randomly selected and algorithms work heuristically. Results from both types of experiments show that the proposed OMS can help improve the performance when dealing with rotated patterns.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.436-442
• /
• 2017

A novel method of Skin lesion segmentation based on the combination of Texture and Neural Network is proposed in this paper. This paper combines the textures of different pixels in the skin images in order to increase the performance of lesion segmentation. For segmenting skin lesions, a two-step process is done. First, automatic border detection is performed to separate the lesion from the background skin. This begins by identifying the features that represent the lesion border clearly by the process of Texture analysis. In the second step, the obtained features are given as input towards the Recurrent Echo state neural networks in order to obtain the segmented skin lesion region. The proposed algorithm is trained and tested for 862 skin lesion images in order to evaluate the accuracy of segmentation. Overall accuracy of the proposed method is compared with existing algorithms. An average accuracy of 98.8% for segmenting skin lesion images has been obtained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2109-2123
• /
• 2017

This paper presents a super-resolution reconstruction method based on sparse representation for two-dimensional bar code images. Considering the features of two-dimensional bar code images, Kirsch and LBP (local binary pattern) operators are used to extract the edge gradient and texture features. Feature extraction is constituted based on these two features and additional two second-order derivatives. By joint dictionary learning of the low-resolution and high-resolution image patch pairs, the sparse representation of corresponding patches is the same. In addition, the global constraint is exerted on the initial estimation of high-resolution image which makes the reconstructed result closer to the real one. The experimental results demonstrate the effectiveness of the proposed algorithm for two-dimensional bar code images by comparing with other reconstruction algorithms.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.4
• /
• pp.22-30
• /
• 2001

In this paper we propose three classification algorithms to classify breast tumors that occur in duct into Benign, DCIS(ductal carcinoma in situ) NOS(invasive ductal carcinoma) The general approach for a creating classifier is composed of 2 steps: feature extraction and classification Above all feature extraction for a good classifier is very significance, because the classification performance depends on the extracted features, Therefore in the feature extraction step, we extracted morphology features describing the size of nuclei and texture features The internal structures of the tumor are reflected from wavelet transformed images with 10$\times$ and 40$\times$ magnification. Pariticulary to find the correlation between correct classification rates and wavelet depths we applied 1, 2, 3 and 4-level wavelet transforms to the images and extracted texture feature from the transformed images The morphology features used are area, perimeter, width of X axis width of Y axis and circularity The texture features used are entropy energy contrast and homogeneity. In the classification step, we created three classifiers from each of extracted features using discriminant analysis The first classifier was made by morphology features. The second and the third classifiers were made by texture features of wavelet transformed images with 10$\times$ and 40$\times$ magnification. Finally we analyzed and compared the correct classification rate of the three classifiers. In this study, we found that the best classifier was made by texture features of 3-level wavelet transformed images.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.4
• /
• pp.89-97
• /
• 2015

In this paper, a method of color image segmentation based on DBSCAN(Density Based Spatial Clustering of Applications with Noise) using compactness of superpixels and texture information is presented. The DBSCAN algorithm can generate clusters in large data sets by looking at the local density of data samples, using only two input parameters which called minimum number of data and distance of neighborhood data. Superpixel algorithms group pixels into perceptually meaningful atomic regions, which can be used to replace the rigid structure of the pixel grid. Each superpixel is consist of pixels with similar features such as luminance, color, textures etc. Superpixels are more efficient than pixels in case of large scale image processing. In this paper, superpixels are generated by SLIC(simple linear iterative clustering) as known popular. Superpixel characteristics are described by compactness, uniformity, boundary precision and recall. The compactness is important features to depict superpixel characteristics. Each superpixel is represented by Lab color spaces, compactness and texture information. DBSCAN clustering method applied to these feature spaces to segment a color image. To evaluate the performance of the proposed method, computer simulation is carried out to several outdoor images. The experimental results show that the proposed algorithm can provide good segmentation results on various images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5197-5218
• /
• 2019

Large-scale retrieval algorithm is problem for visual analyses applications, along its research track. In this paper, we propose a high-efficiency region division-based image retrieve approaches, which fuse low-level local color histogram feature and texture feature. A novel image region division is proposed to roughly mimic the location distribution of image color and deal with the color histogram failing to describe spatial information. Furthermore, for optimizing our region division retrieval method, an image descriptor combining local color histogram and Gabor texture features with reduced feature dimensions are developed. Moreover, we propose an extended Canberra distance method for images similarity measure to increase the fault-tolerant ability of the whole large-scale image retrieval. Extensive experimental results on several benchmark image retrieval databases validate the superiority of the proposed approaches over many recently proposed color-histogram-based and texture-feature-based algorithms.

• The Journal of the Korea Contents Association
• /
• v.11 no.11
• /
• pp.185-193
• /
• 2011

There is no exact standard of detecting pulmonary tuberculosis(TB) in digital image of simple chest radiography. In this study, I experimented on the principal components analysis(PCA) algorithm in the past and suggested six other parameters as identification of TB lesions. The purpose of this study was to develop and test computer aided diagnosis(detection) method for the detection and measurement of pulmonary abnormalities on digital chest radiography. It showed comparatively low recognition diagnosis rate using PCA method, however, six kinds of texture features parameters algorithm showed similar or higher diagnosis rates of pulmonary disease than that of the clinical radiologists. Proposed algorithms using computer-aided of texture analysis can distinguish between areas of abnormality in the chest digital images, differentiate lesions having pulmonary disease. The method could be useful tool for classifying and measuring chest lesions, it would play a major role in radiologist's diagnosis of disease so as to help in pre-reading diagnosis and prevention of pulmonary tuberculosis.

• Journal of radiological science and technology
• /
• v.35 no.3
• /
• pp.227-235
• /
• 2012

Digital Mammography makes it possible to reproduce the entire breast image. And it is used to detect microcalcification and mass which are the most important point of view of nonpalpable early breast cancer, so it has been used as the primary screening test of breast disease. It is reported that microcalcification of breast lesion is important in diagnosis of early breast cancer. In this study, six types of texture features algorithms are used to detect microcalcification on breast US images and the study has analyzed recognition rate of lesion between normal US images and other US images which microcalification is seen. As a result of the experiment, Computer aided diagnosis recognition rate that distinguishes mammography and breast US disease was considerably high 70~98%. The average contrast and entropy parameters were low in ROC analysis, but sensitivity and specificity of four types parameters were over 90%. Therefore it is possible to detect microcalcification on US images. If not only six types of texture features algorithms but also the research of additional parameter algorithm is being continually proceeded and basis of practical use on CAD is being prepared, it can be a important meaning as pre-reading. Also, it is considered very useful things for early diagnosis of breast cancer.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.220-223
• /
• 2004

Automatic image registration is an essential element of remote sensing because remote sensing system generates enormous amount of data, which are multiple observations of the same features at different times and by different sensor. The general process of automatic image registration includes three steps: 1) The extraction of features to be used in the matching process, 2) the feature matching strategy and accurate matching process, 3) the resampling of the data based on the correspondence computed from matched feature. For step 2) and 3), we have developed an algorithms for automated registration of satellite images with RANSAC(Random Sample Consensus) in success. However, for step 1), There still remains human operation to generate GCP Chips, which is time consuming, laborious and expensive process. The main idea of this research is that we are able to automatically generate GCP chips with comer detection algorithms without GPS survey and human interventions if we have systematic corrected satellite image within adaptable positional accuracy. In this research, we use SUSAN(Smallest Univalue Segment Assimilating Nucleus) algorithm in order to detect the comer. SUSAN algorithm is known as the best robust algorithms for comer detection in the field of compute vision. However, there are so many comers in high-resolution images so that we need to reduce the comer points from SUSAN algorithms to overcome redundancy. In experiment, we automatically generate GCP chips from IKONOS images with geo level using SUSAN algorithms. Then we extract reference coordinate from IKONOS images and DEM data and filter the comer points using texture analysis. At last, we apply automatically collected GCP chips by proposed method and the GCP by operator to in-house automatic precision correction algorithms. The compared result will be presented to show the GCP quality.