scholarly journals Combination of LBP Bin and Histogram Selections for Color Texture Classification

2020 ◽  
Vol 6 (6) ◽  
pp. 53
Author(s):  
Alice Porebski ◽  
Vinh Truong Hoang ◽  
Nicolas Vandenbroucke ◽  
Denis Hamad
Keyword(s):  
Local Binary Pattern ◽  
Texture Classification ◽  
Selection Procedure ◽  
Texture Features ◽  
Feature Space ◽  
Selection Methods ◽  
Texture Descriptor ◽  
Classification Problems ◽  
The Past ◽  
Color Texture

LBP (Local Binary Pattern) is a very popular texture descriptor largely used in computer vision. In most applications, LBP histograms are exploited as texture features leading to a high dimensional feature space, especially for color texture classification problems. In the past few years, different solutions were proposed to reduce the dimension of the feature space based on the LBP histogram. Most of these approaches apply feature selection methods in order to find the most discriminative bins. Recently another strategy proposed selecting the most discriminant LBP histograms in their entirety. This paper tends to improve on these previous approaches, and presents a combination of LBP bin and histogram selections, where a histogram ranking method is applied before processing a bin selection procedure. The proposed approach is evaluated on five benchmark image databases and the obtained results show the effectiveness of the combination of LBP bin and histogram selections which outperforms the simple LBP bin and LBP histogram selection approaches when they are applied independently.

scholarly journals Unsupervised Local Binary Pattern Histogram Selection Scores for Color Texture Classification

2018 ◽  
Vol 4 (10) ◽  
pp. 112 ◽  
Author(s):  
Mariam Kalakech ◽  
Alice Porebski ◽  
Nicolas Vandenbroucke ◽  
Denis Hamad
Keyword(s):  
Local Binary Pattern ◽  
Color Image ◽  
Texture Classification ◽  
Classification Problems ◽  
Class Label ◽  
Laplacian Score ◽  
Pattern Histogram ◽  
Color Texture

These last few years, several supervised scores have been proposed in the literature to select histograms. Applied to color texture classification problems, these scores have improved the accuracy by selecting the most discriminant histograms among a set of available ones computed from a color image. In this paper, two new scores are proposed to select histograms: The adapted Variance score and the adapted Laplacian score. These new scores are computed without considering the class label of the images, contrary to what is done until now. Experiments, achieved on OuTex, USPTex, and BarkTex sets, show that these unsupervised scores give as good results as the supervised ones for LBP histogram selection.

scholarly journals Color texture classification based on proposed impulse-noise resistant color local binary patterns and significant points selection algorithm

Sensor Review ◽  
2017 ◽  
Vol 37 (1) ◽  
pp. 33-42 ◽  
Author(s):  
Shervan Fekriershad ◽  
Farshad Tajeripour
Keyword(s):  
Computational Complexity ◽  
Texture Classification ◽  
Texture Features ◽  
Local Binary Patterns ◽  
Low Noise ◽  
Selection Algorithm ◽  
Content Type ◽  
Color Sensor ◽  
Sensor Information ◽  
Color Texture

Purpose The purpose of this paper is to propose a color-texture classification approach which uses color sensor information and texture features jointly. High accuracy, low noise sensitivity and low computational complexity are specified aims for this proposed approach. Design/methodology/approach One of the efficient texture analysis operations is local binary patterns (LBP). The proposed approach includes two steps. First, a noise resistant version of color LBP is proposed to decrease its sensitivity to noise. This step is evaluated based on combination of color sensor information using AND operation. In a second step, a significant points selection algorithm is proposed to select significant LBPs. This phase decreases final computational complexity along with increasing accuracy rate. Findings The proposed approach is evaluated using Vistex, Outex and KTH-TIPS-2a data sets. This approach has been compared with some state-of-the-art methods. It is experimentally demonstrated that the proposed approach achieves the highest accuracy. In two other experiments, results show low noise sensitivity and low computational complexity of the proposed approach in comparison with previous versions of LBP. Rotation invariant, multi-resolution and general usability are other advantages of our proposed approach. Originality/value In the present paper, a new version of LBP is proposed originally, which is called hybrid color local binary patterns (HCLBP). HCLBP can be used in many image processing applications to extract color/texture features jointly. Also, a significant point selection algorithm is proposed for the first time to select key points of images.

scholarly journals A Novel Texture Descriptor: Circular Parts Local Binary Pattern

2021 ◽  
Vol 40 (2) ◽  
pp. 105-114
Author(s):  
Ibtissam Al Saidi ◽  
Mohammed Rziza ◽  
Johan Debayle
Keyword(s):  
High Performance ◽  
Local Binary Pattern ◽  
Texture Classification ◽  
Polar Coordinates ◽  
Data Sets ◽  
Texture Descriptor ◽  
Complete Evaluation ◽  
Benchmark Data ◽  
Texture Information ◽  
Computer Vision Applications

Local Binary Pattern (LBP) are considered as a classical descriptor for texture analysis, it has mostly been used in pattern recognition and computer vision applications. However, the LBP gets information from a restricted number of local neighbors which is not enough to describe texture information, and the other descriptors that get a large number of local neighbors suffer from a large dimensionality and consume much time. In this regard, we propose a novel descriptor for texture classification known as Circular Parts Local Binary Pattern (CPLBP) which is designed to enhance LBP by extending the area of neighborhood from one to a region of neighbors using polar coordinates that permit to capture more discriminating relationships that exists amongst the pixels in the local neighborhood which increase efficiency in extracting features. Firstly, the circle is divided into regions with a specific radius and angle. After that, we calculate the average gray-level value of each part. Finally, the value of the center pixel is compared with these average values. The relevance of the proposed idea is validate in databases Outex 10 and 12. A complete evaluation on benchmark data sets reveals CPLBP's high performance. CPLBP generates the score of 99.95 with SVM classification.

scholarly journals Distinguishing Adenocarcinomas from Granulomas in the CT scan of the chest: performance degradation evaluation in the automatic segmentation framework

2021 ◽  
Vol 14 (1) ◽  
Author(s):  
Mahsa Bank Tavakoli ◽  
Mahdi Orooji ◽  
Mehdi Teimouri ◽  
Ramita Shahabifar
Keyword(s):  
State Of The Art ◽  
Automatic Segmentation ◽  
Texture Features ◽  
Standards Of Care ◽  
Shape Features ◽  
Selection Methods ◽  
Segmentation Framework ◽  
Vessel Tortuosity ◽  
Benign Nodules ◽  
Degradation Evaluation

Abstract Objective The most common histopathologic malignant and benign nodules are Adenocarcinoma and Granuloma, respectively, which have different standards of care. In this paper, we propose an automatic framework for the diagnosis of the Adenocarcinomas and the Granulomas in the CT scans of the chest from a private dataset. We use the radiomic features of the nodules and the attached vessel tortuosity for the diagnosis. The private dataset includes 22 CTs for each nodule type, i.e., adenocarcinoma and granuloma. The dataset contains the CTs of the non-smoker patients who are between 30 and 60 years old. To automatically segment the delineated nodule area and the attached vessels area, we apply a morphological-based approach. For distinguishing the malignancy of the segmented nodule, two texture features of the nodule, the curvature Mean and the number of the attached vessels are extracted. Results We compare our framework with the state-of-the-art feature selection methods for differentiating Adenocarcinomas from Granulomas. These methods employ only the shape features of the nodule, the texture features of the nodule, or the torsion features of the attached vessels along with the radiomic features of the nodule. The accuracy of our framework is improved by considering the four selected features.

scholarly journals T1K+: A Database for Benchmarking Color Texture Classification and Retrieval Methods

Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 1010
Author(s):  
Claudio Cusano ◽  
Paolo Napoletano ◽  
Raimondo Schettini
Keyword(s):  
Design Of Experiments ◽  
Texture Classification ◽  
Construction Materials ◽  
Heterogeneous Database ◽  
High Quality ◽  
Visual Descriptors ◽  
Classification Tasks ◽  
Color Texture

In this paper we present T1K+, a very large, heterogeneous database of high-quality texture images acquired under variable conditions. T1K+ contains 1129 classes of textures ranging from natural subjects to food, textile samples, construction materials, etc. T1K+ allows the design of experiments especially aimed at understanding the specific issues related to texture classification and retrieval. To help the exploration of the database, all the 1129 classes are hierarchically organized in 5 thematic categories and 266 sub-categories. To complete our study, we present an evaluation of hand-crafted and learned visual descriptors in supervised texture classification tasks.

scholarly journals Multi-scale characterizations of colon polyps via computed tomographic colonography

2019 ◽  
Vol 2 (1) ◽  
Author(s):  
Weiguo Cao ◽  
Marc J. Pomeroy ◽  
Yongfeng Gao ◽  
Matthew A. Barish ◽  
Almas F. Abbasi ◽  
...  
Keyword(s):  
Area Under The Curve ◽  
Texture Features ◽  
Learning Model ◽  
Colon Polyps ◽  
Texture Descriptor ◽  
Operating Characteristics ◽  
Computed Tomographic ◽  
Multi Scale ◽  
Definition Of ◽  
Occurrence Matrix

AbstractTexture features have played an essential role in the field of medical imaging for computer-aided diagnosis. The gray-level co-occurrence matrix (GLCM)-based texture descriptor has emerged to become one of the most successful feature sets for these applications. This study aims to increase the potential of these features by introducing multi-scale analysis into the construction of GLCM texture descriptor. In this study, we first introduce a new parameter - stride, to explore the definition of GLCM. Then we propose three multi-scaling GLCM models according to its three parameters, (1) learning model by multiple displacements, (2) learning model by multiple strides (LMS), and (3) learning model by multiple angles. These models increase the texture information by introducing more texture patterns and mitigate direction sparsity and dense sampling problems presented in the traditional Haralick model. To further analyze the three parameters, we test the three models by performing classification on a dataset of 63 large polyp masses obtained from computed tomography colonoscopy consisting of 32 adenocarcinomas and 31 benign adenomas. Finally, the proposed methods are compared to several typical GLCM-texture descriptors and one deep learning model. LMS obtains the highest performance and enhances the prediction power to 0.9450 with standard deviation 0.0285 by area under the curve of receiver operating characteristics score which is a significant improvement.

scholarly journals A branch & bound algorithm to determine optimal bivariate splits for oblique decision tree induction

2021 ◽  
Author(s):  
Ferdinand Bollwein ◽  
Stephan Westphal
Keyword(s):  
Decision Tree ◽  
Feature Space ◽  
Classification Problems ◽  
Decision Tree Induction ◽  
Single Attribute ◽  
Global Optimal ◽  
The Individual ◽  
Tree Building ◽  
Very High ◽  
Multiclass Classification Problems

AbstractUnivariate decision tree induction methods for multiclass classification problems such as CART, C4.5 and ID3 continue to be very popular in the context of machine learning due to their major benefit of being easy to interpret. However, as these trees only consider a single attribute per node, they often get quite large which lowers their explanatory value. Oblique decision tree building algorithms, which divide the feature space by multidimensional hyperplanes, often produce much smaller trees but the individual splits are hard to interpret. Moreover, the effort of finding optimal oblique splits is very high such that heuristics have to be applied to determine local optimal solutions. In this work, we introduce an effective branch and bound procedure to determine global optimal bivariate oblique splits for concave impurity measures. Decision trees based on these bivariate oblique splits remain fairly interpretable due to the restriction to two attributes per split. The resulting trees are significantly smaller and more accurate than their univariate counterparts due to their ability of adapting better to the underlying data and capturing interactions of attribute pairs. Moreover, our evaluation shows that our algorithm even outperforms algorithms based on heuristically obtained multivariate oblique splits despite the fact that we are focusing on two attributes only.

scholarly journals Implementation Framework for a Blockchain-Based Federated Learning Model for Classification Problems

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1116
Author(s):  
Zeba Mahmood ◽  
Vacius Jusas
Keyword(s):  
Machine Learning ◽  
Learning Model ◽  
Global Perspective ◽  
Learning Technology ◽  
Classification Problems ◽  
Zero Knowledge ◽  
Privacy And Security ◽  
Implementation Framework ◽  
The Past

This paper introduces a blockchain-based federated learning (FL) framework with incentives for participating nodes to enhance the accuracy of classification problems. Machine learning technology has been rapidly developed and changed from a global perspective for the past few years. The FL framework is based on the Ethereum blockchain and creates an autonomous ecosystem, where nodes compete to improve the accuracy of classification problems. With privacy being one of the biggest concerns, FL makes use of the blockchain-based approach to ensure privacy and security. Another important technology that underlies the FL framework is zero-knowledge proofs (ZKPs), which ensure that data uploaded to the network are accurate and private. Basically, ZKPs allow nodes to compete fairly by only submitting accurate models to the parameter server and get rewarded for that. We have conducted an analysis and found that ZKPs can help improve the accuracy of models submitted to the parameter server and facilitate the honest participation of all nodes in FL.

Color Texture Classification Using Shortest Paths in Graphs

2014 ◽  
Vol 23 (9) ◽  
pp. 3751-3761 ◽  
Author(s):  
Jarbas Joaci de Mesquita Sa Junior ◽  
Paulo Cesar Cortez ◽  
Andre Ricardo Backes
Keyword(s):  
Texture Classification ◽  
Shortest Paths ◽  
Color Texture
Sign in / Sign up

Export Citation Format

Share Document