Simultaneous Visualization and Segmentation of Hyperspectral Data Using Fuzzy K Means Clustering
Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2016, Vol 4, Issue 4
Abstract
Hyperspectral imaging collects and processes information from across the electromagnetic spectrum. The goal of hyperspectral imaging is to obtain the spectrum for each pixel in the image of a scene, with the purpose of finding objects, identifying materials, or detecting processes. The existing approaches uses optimization-based method for simultaneous fusion and unsupervised segmentation of hyperspectral remote sensing images by exploiting redundancy in the data. Then the weights are optimized to improve those statistical characteristics. The optimal recovery of the weight matrix additionally provides useful information in segmenting the hyperspectral data set spatially. But it is not suitable for multi spectral data set. In the proposed system uses fuzzy k-means clustering for simultaneous visualization and segmentation of hyperspectral data.
Authors and Affiliations
Dr. T. Arumuga Maria Devi , M. Mathan Raja
Macs: A Highly Customizable Low-Latency Communication Architecture
Networks-on-chips (NoCs) are an increasingly popular communication infrastructure in single chip VLSI design for enhancing parallelism and system scalability. Processing elements (PEs) connect to a communication topolog...
Approaches in DOS Attacks
Application DoS attack,has emerged as a larger threat to network services, compared to the classic DoS attack. To identify application DoS attack, we propose a novel group testing (GT)-based approach deployed on back-en...
Review: Enhancement of heat transfer by using Nano fluids
This paper gives a detailed literature study and scrutiny into the results of the research and development, applications of nanofluids in heat transfer. Nanofluid is a comparatively new technology, the studies on nanofl...
Divisor Cordial Labeling Of Cycle Related Graphs
A divisor cordial labeling of a graph G is a bijection f from V (G) to {1, 2, . . . , |V (G)|} such that an edge uv is assigned the label 1 if f (u)| f (v) or f (v)| f (u) and the label 0 otherwise, then the number of e...
Memory Design Using Logical Gates
This research is about designing memory using logical gates. A memory unit is a collection of storage cells together with associated circuits needed to transform information in and out of the device. Memory cells which...