In this research study, an intelligent detection system to support medical diagnosis and detection of abnormal lesions by processing endoscopic images is presented. The images used in this study have been obtained using the M2A Swallowable Imaging Capsule a patented, video color-imaging disposable capsule. Schemes have been developed to extract texture features from the fuzzy texture spectra in...

This paper presents a class of hierarchical fuzzy system applied to a cigar classification system. The weight, texture and chromatic characteristics are used to classify multiple cigars using a previous classification based on heuristic knowledge. In the adaptive part, a gradient descendent and error backpropagation method is applied for adjusting the parameters. A detailed description of the a...

Graph colouring enjoys many practical as well theoretical uses. is still a very active subject of research. This article introduces new concept the chromatic number neutrosophic graph (NG). There discussion difference between fuzzy (FG) and NG. Finally, real-life application for detecting phishing websites has been demonstrated by NG colouring.

Colorization is an automatic technique to enhance greyscale images by introducing chromatic information. In this research we investigate to produce colorized medical images, potentially supporting in better understanding of anatomy, anomalies and infections. Begins with proposed mandatory preprocessing steps for medical images noise removal and edge improvement, followed by colorization process...

Graph theory has numerous application to problems in systems analysis, operations research, economics, and transportation. However, in many cases, some aspects of a graph-theoretic problem may be uncertain. For example, the vehicle travel time or vehicle capacity on a road network may not be known exactly. In such cases, it is natural to deal with the uncertainty using the methods of fuzzy sets...

Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most  colours, which is for a fixed graph G , a polynomial in  , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.

‎For a coloring $c$ of a graph $G$‎, ‎the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively‎ ‎$sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$‎, ‎where the summations are taken over all edges $abin E(G)$‎. ‎The edge-difference chromatic sum‎, ‎denoted by $sum D(G)$‎, ‎and the edge-sum chromatic sum‎, ‎denoted by $sum S(G)$‎, ‎a...