Abstract -Remote Sensing is the science and art of acquiring information (spectral, spatial, and temporal) about material objects, area, or phenomenon, without coming into physical contact with them ad plays a significant role in feature extraction. In the present paper, implementation of color mapping index method is analyzed to extract features from RSI in spectral domain. Color indexing is applied after fixing the index value to the pixels of selected ROI (Region of Interest) of RSI and there by clustering based on these index values. Color mapping, which is also called tone mapping can be used to apply color transformations on the final image colors of the ROI. The process of color map indexing is a color map approximation approach on RSI for feature extraction includes designing appropriate algorithm, its implementation and discussion on the results of such implementation on ROI.
Remotely Sensed Image (RSI) Analysis for feature extraction using Color map I...ijdmtaiir
Remote Sensing is the science and art of acquiring
information (spectral, spatial, and temporal) about material
objects, area, or phenomenon, without coming into physical
contact with them ad plays a significant role in feature
extraction. In the present paper, implementation of color
mapping index method is analyzed to extract features from RSI
in spectral domain. Color indexing is applied after fixing the
index value to the pixels of selected ROI (Region of Interest)
of RSI and there by clustering based on these index values.
Color mapping, which is also called tone mapping can be used
to apply color transformations on the final image colors of the
ROI. The process of color map indexing is a color map
approximation approach on RSI for feature extraction includes
designing appropriate algorithm, its implementation and
discussion on the results of such implementation on ROI.
Analysis of color image features extraction using texture methodsTELKOMNIKA JOURNAL
A digital color images are the most important types of data currently being traded; they are used in many vital and important applications. Hence, the need for a small data representation of the image is an important issue. This paper will focus on analyzing different methods used to extract texture features for a color image. These features can be used as a primary key to identify and recognize the image. The proposed discrete wave equation DWE method of generating color image key will be presented, implemented and tested. This method showed that the percentage of reduction in the key size is 85% compared with other methods.
GEOGRAPHIC MAPS CLASSIFICATION BASED ON L*A*B COLOR SYSTEMIJCNCJournal
Today any geographic information system (GIS) layers became vital part of any GIS system , and
consequently , the need for developing automatic approaches to extract GIS layers from different image
maps like digital maps or satellite images is very important.
Map classification can be defined as an image processing technique which creates thematic maps from
scanned paper maps or remotely sensed images. Each resultant theme will represent a GIS layer of the
images.
A new proposed approach to extract GIS layers (classes) automatically based on L*A*B colorsystem
selected from ( A and B ) is proposed in this paper, our experiments shows that the hsi color space gives
better than L*A*B.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Remotely Sensed Image (RSI) Analysis for feature extraction using Color map I...ijdmtaiir
Remote Sensing is the science and art of acquiring
information (spectral, spatial, and temporal) about material
objects, area, or phenomenon, without coming into physical
contact with them ad plays a significant role in feature
extraction. In the present paper, implementation of color
mapping index method is analyzed to extract features from RSI
in spectral domain. Color indexing is applied after fixing the
index value to the pixels of selected ROI (Region of Interest)
of RSI and there by clustering based on these index values.
Color mapping, which is also called tone mapping can be used
to apply color transformations on the final image colors of the
ROI. The process of color map indexing is a color map
approximation approach on RSI for feature extraction includes
designing appropriate algorithm, its implementation and
discussion on the results of such implementation on ROI.
Analysis of color image features extraction using texture methodsTELKOMNIKA JOURNAL
A digital color images are the most important types of data currently being traded; they are used in many vital and important applications. Hence, the need for a small data representation of the image is an important issue. This paper will focus on analyzing different methods used to extract texture features for a color image. These features can be used as a primary key to identify and recognize the image. The proposed discrete wave equation DWE method of generating color image key will be presented, implemented and tested. This method showed that the percentage of reduction in the key size is 85% compared with other methods.
GEOGRAPHIC MAPS CLASSIFICATION BASED ON L*A*B COLOR SYSTEMIJCNCJournal
Today any geographic information system (GIS) layers became vital part of any GIS system , and
consequently , the need for developing automatic approaches to extract GIS layers from different image
maps like digital maps or satellite images is very important.
Map classification can be defined as an image processing technique which creates thematic maps from
scanned paper maps or remotely sensed images. Each resultant theme will represent a GIS layer of the
images.
A new proposed approach to extract GIS layers (classes) automatically based on L*A*B colorsystem
selected from ( A and B ) is proposed in this paper, our experiments shows that the hsi color space gives
better than L*A*B.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Segmentation and recognition of handwritten digit numeral string using a mult...ijfcstjournal
In this paper, the use of Multi-Layer Perceptron (MLP) Neural Network model is proposed for recognizing
unconstrained offline handwritten Numeral strings. The Numeral strings are segmented and isolated
numerals are obtained using a connected component labeling (CCL) algorithm approach. The structural
part of the models has been modeled using a Multilayer Perceptron Neural Network. This paper also
presents a new technique to remove slope and slant from handwritten numeral string and to normalize the
size of text images and classify with supervised learning methods. Experimental results on a database of
102 numeral string patterns written by 3 different people show that a recognition rate of 99.7% is obtained
on independent digits contained in the numeral string of digits includes both the skewed and slant data.
Quality and size assessment of quantized images using K-Means++ clusteringjournalBEEI
In this paper, an amended K-Means algorithm called K-Means++ is implemented for color quantization. K-Means++ is an improvement to the K-Means algorithm in order to surmount the random selection of the initial centroids. The main advantage of K-Means++ is the centroids chosen are distributed over the data such that it reduces the sum of squared errors (SSE). K-Means++ algorithm is used to analyze the color distribution of an image and create the color palette for transforming to a better quantized image compared to the standard K-Means algorithm. The tests were conducted on several popular true color images with different numbers of K value: 32, 64, 128, and 256. The results show that K-Means++ clustering algorithm yields higher PSNR values and lower file size compared to K-Means algorithm; 2.58% and 1.05%. It is envisaged that this clustering algorithm will benefit in many applications such as document clustering, market segmentation, image compression and image segmentation because it produces accurate and stable results.
The development of multimedia system technology in Content based Image Retrieval (CBIR) System is
one in every of the outstanding area to retrieve the images from an oversized collection of database. The feature
vectors of the query image are compared with feature vectors of the database images to get matching images.It is
much observed that anyone algorithm isn't beneficial in extracting all differing kinds of natural images. Thus an
intensive analysis of certain color, texture and shape extraction techniques are allotted to spot an efficient CBIR
technique that suits for a selected sort of images. The Extraction of an image includes feature description and
feature extraction. During this paper, we tend to projected Color Layout Descriptor (CLD), grey Level Co-
Occurrences Matrix (GLCM), Marker-Controlled Watershed Segmentation feature extraction technique that
extract the matching image based on the similarity of Color, Texture and shape within the database. For
performance analysis, the image retrieval timing results of the projected technique is calculated and compared
with every of the individual feature.
SLIC Superpixel Based Self Organizing Maps Algorithm for Segmentation of Micr...IJAAS Team
We can find the simultaneous monitoring of thousands of genes in parallel Microarray technology. As per these measurements, microarray technology have proven powerful in gene expression profiling for discovering new types of diseases and for predicting the type of a disease. Gridding, Intensity extraction, Enhancement and Segmentation are important steps in microarray image analysis. This paper gives simple linear iterative clustering (SLIC) based self organizing maps (SOM) algorithm for segmentation of microarray image. The clusters of pixels which share similar features are called Superpixels, thus they can be used as mid-level units to decrease the computational cost in many vision applications. The proposed algorithm utilizes superpixels as clustering objects instead of pixels. The qualitative and quantitative analysis shows that the proposed method produces better segmentation quality than k-means, fuzzy cmeans and self organizing maps clustering methods.
APPLYING R-SPATIOGRAM IN OBJECT TRACKING FOR OCCLUSION HANDLINGsipij
Object tracking is one of the most important problems in computer vision. The aim of video tracking is to extract the trajectories of a target or object of interest, i.e. accurately locate a moving target in a video sequence and discriminate target from non-targets in the feature space of the sequence. So, feature descriptors can have significant effects on such discrimination. In this paper, we use the basic idea of many trackers which consists of three main components of the reference model, i.e., object modeling, object detection and localization, and model updating. However, there are major improvements in our system. Our forth component, occlusion handling, utilizes the r-spatiogram to detect the best target candidate. While spatiogram contains some moments upon the coordinates of the pixels, r-spatiogram computes region-based compactness on the distribution of the given feature in the image that captures richer features to represent the objects. The proposed research develops an efficient and robust way to keep tracking the object throughout video sequences in the presence of significant appearance variations and severe occlusions. The proposed method is evaluated on the Princeton RGBD tracking dataset considering sequences with different challenges and the obtained results demonstrate the effectiveness of the proposed method.
User Interactive Color Transformation between ImagesIJMER
Abstract: In this paper we present a process called color
transfer which can borrow one image’s color
characteristics from another. Most current colorization
algorithms either require a significant user effort or have
large computational time. Here focus on orthogonal color
space i.e. lαβ color space without correlation between the
axes is given. Here we have implemented two global color
transfer algorithms in lαβ color space using simple color
statistical information such as mean, standard deviation
and covariance between the pixels of image. Our approach
is the extension of Reinhard's. Our local color transfer
algorithm uses simple color statistical analysis to recolor
the target image according to selected color range in
source image. Target image’s color influence mask is
prepared. It is a mask that specifies what parts of target
image will be affected according to selected color range.
After that target image is recolored in lαβ color space
according to prepared color influence map. In the lαβ
color space luminance and chrominance information is
separate so it allows making image recoloring optional.
The basic color transformation uses stored color statistics
of source and target image. All the algorithms are
implemented in JAVA object oriented language. The main
advantage of proposed method over the existing one is it
allows the user to recolor a part of the image in a simple &
intuitive way, preserving other color intact & achieving
natural look.
Index Terms: color transfer, local color statistics, color
characteristics, orthogonal color space, color influence
map.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Abstract Image Segmentation plays a vital role in image processing. The research in this area is still relevant due to its wide applications. Image segmentation is a process of assigning a label to every pixel in an image such that pixels with same label share certain visual characteristics. Sometimes it becomes necessary to calculate the total number of colors from the given RGB image to quantize the image, to detect cancer and brain tumour. The goal of this paper is to provide the best algorithm for image segmentation. Keywords: Image segmentation, RGB
Noise tolerant color image segmentation using support vector machineeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
This paper presents embedding of data in an image using pixel-value differencing technique. This scheme is used to embed large amount of data by changing the difference between two pixels so that we are able to increase the embedding capacity. There is another technique that is pixel value shifting which also increase the embedding capacity but according to this scheme capacity will increase at edge areas of image.
Color Particle Filter Tracking using Frame Segmentation based on JND Color an...IOSRJVSP
Object tracking is one of the most important components in numerous applications of computer vision. Color can provide an efficient visual feature for tracking non-rigid objects in real-time. The color is chosen as tracking feature to make the process scale and rotation invariant. The color of an object can vary over time due to variations in the illumination conditions, the visual angle and the camera parameters. This paper presents the integration of color distributions into particle filtering. The color feature is extracted using our novel 4D color histogram of the image, which is determined using JND color similarity threshold and connectivity of the neighboring pixels. Particle filter tracks several hypotheses simultaneously and weighs them according to their similarity to the target model. The popular Bhattacharyya coefficient is used as similarity measure between two color distributions. The tracking results are compared on the basis of precision over the data set of video sequences from the website http://visualtracking.net of CVPR13 bench marking paper. The proposed tracker yields better precision values as compared to previous reported results
An Improved Way of Segmentation and Classification of Remote Sensing Images U...ijsrd.com
The Ultimate significance of Images lies in processing the digital image which stems from two principal application areas: Advances of pictorial information for human interpretation; and dispensation of image data for storage, communication, and illustration for self-sufficient machine perception. The objective of this research work is to define the meaning and possibility of image segmentation based on remote sensing images which are successively classified with statistical measures. In this paper kernel induced Possiblistic C-means clustering algorithm has been implemented for classifying remote sensing image data with image features. As a final point of the proposed work is to point out that this algorithm works well for segmenting and classifying the image with better accuracy with statistical metrices.
A STUDY AND ANALYSIS OF DIFFERENT EDGE DETECTION TECHNIQUEScscpconf
In the first study [1], a combination of K-means, watershed segmentation method, and Difference In Strength (DIS) map were used to perform image segmentation and edge detection
tasks. We obtained an initial segmentation based on K-means clustering technique. Starting from this, we used two techniques; the first is watershed technique with new merging
procedures based on mean intensity value to segment the image regions and to detect their boundaries. The second is edge strength technique to obtain accurate edge maps of our images without using watershed method. In this technique: We solved the problem of undesirable over segmentation results produced by the watershed algorithm, when used directly with raw data images. Also, the edge maps we obtained have no broken lines on entire image. In the 2nd study level set methods are used for the implementation of curve/interface evolution under various forces. In the third study the main idea is to detect regions (objects) boundaries, to isolate and extract individual components from a medical image. This is done using an active contours to detect regions in a given image, based on techniques of curve evolution, Mumford–Shah functional for segmentation and level sets. Once we classified our images into different intensity regions based on Markov Random Field. Then we detect regions whose boundaries are not necessarily defined by gradient by minimize an energy of Mumford–Shah functional forsegmentation, where in the level set formulation, the problem becomes a mean-curvature which will stop on the desired boundary. The stopping term does not depend on the gradient of the image as in the classical active contour. The initial curve of level set can be anywhere in the image, and interior contours are automatically detected. The final image segmentation is one
closed boundary per actual region in the image.
Methods to Maximize the well being and Vitality of Moribund Communitiespraveena06
Abstract-It has become the primary concern for the governments to chart effective methods and policies to revitalize the communities which are on the verge of extinction, most of which are indigenous. This has become more relevant and important in an era of liberalization, which more often adversely affects the welfare of such communities. In this paper we make an effort to identify and qualify measures that would revitalize moribund communities and to quantify them using fuzzy analysis. We come out with concrete suggestions for the governments and the policy makers which can be easily put in action.
Identification of Differentially Expressed Genes by unsupervised Learning Methodpraveena06
Abstract-Microarrays are one of the latest breakthroughs in experimental molecular biology that allow monitoring of gene expression of tens of thousands of genes in parallel. Micro array analysis include many stages. Extracting samples from the cells, getting the gene expression matrix from the raw data, and data normalization which are low level analysis.Cluster analysis for genome-wide expression data from DNA micro array data is described as a high level analysis that uses standard statistical algorithms to arrange genes according to similarity patterns of expression levels. This paper presents a method for the number of clusters using the divisive hierarchical clustering, and k-means clustering of significant genes. The goal of this method is to identify genes that are strongly associated with disease in 12607 genes. Gene filtering is applied to identify the clusters. k-means shows that about four to seven genes or less than one percent of the genes account for the disease group which are the outliers, more than seventy percent falls as undefined group. The hierarchical clustering dendo gram shows clusters at two levels which shows again less than one percent of the genes are differentially expressed.
Segmentation and recognition of handwritten digit numeral string using a mult...ijfcstjournal
In this paper, the use of Multi-Layer Perceptron (MLP) Neural Network model is proposed for recognizing
unconstrained offline handwritten Numeral strings. The Numeral strings are segmented and isolated
numerals are obtained using a connected component labeling (CCL) algorithm approach. The structural
part of the models has been modeled using a Multilayer Perceptron Neural Network. This paper also
presents a new technique to remove slope and slant from handwritten numeral string and to normalize the
size of text images and classify with supervised learning methods. Experimental results on a database of
102 numeral string patterns written by 3 different people show that a recognition rate of 99.7% is obtained
on independent digits contained in the numeral string of digits includes both the skewed and slant data.
Quality and size assessment of quantized images using K-Means++ clusteringjournalBEEI
In this paper, an amended K-Means algorithm called K-Means++ is implemented for color quantization. K-Means++ is an improvement to the K-Means algorithm in order to surmount the random selection of the initial centroids. The main advantage of K-Means++ is the centroids chosen are distributed over the data such that it reduces the sum of squared errors (SSE). K-Means++ algorithm is used to analyze the color distribution of an image and create the color palette for transforming to a better quantized image compared to the standard K-Means algorithm. The tests were conducted on several popular true color images with different numbers of K value: 32, 64, 128, and 256. The results show that K-Means++ clustering algorithm yields higher PSNR values and lower file size compared to K-Means algorithm; 2.58% and 1.05%. It is envisaged that this clustering algorithm will benefit in many applications such as document clustering, market segmentation, image compression and image segmentation because it produces accurate and stable results.
The development of multimedia system technology in Content based Image Retrieval (CBIR) System is
one in every of the outstanding area to retrieve the images from an oversized collection of database. The feature
vectors of the query image are compared with feature vectors of the database images to get matching images.It is
much observed that anyone algorithm isn't beneficial in extracting all differing kinds of natural images. Thus an
intensive analysis of certain color, texture and shape extraction techniques are allotted to spot an efficient CBIR
technique that suits for a selected sort of images. The Extraction of an image includes feature description and
feature extraction. During this paper, we tend to projected Color Layout Descriptor (CLD), grey Level Co-
Occurrences Matrix (GLCM), Marker-Controlled Watershed Segmentation feature extraction technique that
extract the matching image based on the similarity of Color, Texture and shape within the database. For
performance analysis, the image retrieval timing results of the projected technique is calculated and compared
with every of the individual feature.
SLIC Superpixel Based Self Organizing Maps Algorithm for Segmentation of Micr...IJAAS Team
We can find the simultaneous monitoring of thousands of genes in parallel Microarray technology. As per these measurements, microarray technology have proven powerful in gene expression profiling for discovering new types of diseases and for predicting the type of a disease. Gridding, Intensity extraction, Enhancement and Segmentation are important steps in microarray image analysis. This paper gives simple linear iterative clustering (SLIC) based self organizing maps (SOM) algorithm for segmentation of microarray image. The clusters of pixels which share similar features are called Superpixels, thus they can be used as mid-level units to decrease the computational cost in many vision applications. The proposed algorithm utilizes superpixels as clustering objects instead of pixels. The qualitative and quantitative analysis shows that the proposed method produces better segmentation quality than k-means, fuzzy cmeans and self organizing maps clustering methods.
APPLYING R-SPATIOGRAM IN OBJECT TRACKING FOR OCCLUSION HANDLINGsipij
Object tracking is one of the most important problems in computer vision. The aim of video tracking is to extract the trajectories of a target or object of interest, i.e. accurately locate a moving target in a video sequence and discriminate target from non-targets in the feature space of the sequence. So, feature descriptors can have significant effects on such discrimination. In this paper, we use the basic idea of many trackers which consists of three main components of the reference model, i.e., object modeling, object detection and localization, and model updating. However, there are major improvements in our system. Our forth component, occlusion handling, utilizes the r-spatiogram to detect the best target candidate. While spatiogram contains some moments upon the coordinates of the pixels, r-spatiogram computes region-based compactness on the distribution of the given feature in the image that captures richer features to represent the objects. The proposed research develops an efficient and robust way to keep tracking the object throughout video sequences in the presence of significant appearance variations and severe occlusions. The proposed method is evaluated on the Princeton RGBD tracking dataset considering sequences with different challenges and the obtained results demonstrate the effectiveness of the proposed method.
User Interactive Color Transformation between ImagesIJMER
Abstract: In this paper we present a process called color
transfer which can borrow one image’s color
characteristics from another. Most current colorization
algorithms either require a significant user effort or have
large computational time. Here focus on orthogonal color
space i.e. lαβ color space without correlation between the
axes is given. Here we have implemented two global color
transfer algorithms in lαβ color space using simple color
statistical information such as mean, standard deviation
and covariance between the pixels of image. Our approach
is the extension of Reinhard's. Our local color transfer
algorithm uses simple color statistical analysis to recolor
the target image according to selected color range in
source image. Target image’s color influence mask is
prepared. It is a mask that specifies what parts of target
image will be affected according to selected color range.
After that target image is recolored in lαβ color space
according to prepared color influence map. In the lαβ
color space luminance and chrominance information is
separate so it allows making image recoloring optional.
The basic color transformation uses stored color statistics
of source and target image. All the algorithms are
implemented in JAVA object oriented language. The main
advantage of proposed method over the existing one is it
allows the user to recolor a part of the image in a simple &
intuitive way, preserving other color intact & achieving
natural look.
Index Terms: color transfer, local color statistics, color
characteristics, orthogonal color space, color influence
map.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Abstract Image Segmentation plays a vital role in image processing. The research in this area is still relevant due to its wide applications. Image segmentation is a process of assigning a label to every pixel in an image such that pixels with same label share certain visual characteristics. Sometimes it becomes necessary to calculate the total number of colors from the given RGB image to quantize the image, to detect cancer and brain tumour. The goal of this paper is to provide the best algorithm for image segmentation. Keywords: Image segmentation, RGB
Noise tolerant color image segmentation using support vector machineeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
This paper presents embedding of data in an image using pixel-value differencing technique. This scheme is used to embed large amount of data by changing the difference between two pixels so that we are able to increase the embedding capacity. There is another technique that is pixel value shifting which also increase the embedding capacity but according to this scheme capacity will increase at edge areas of image.
Color Particle Filter Tracking using Frame Segmentation based on JND Color an...IOSRJVSP
Object tracking is one of the most important components in numerous applications of computer vision. Color can provide an efficient visual feature for tracking non-rigid objects in real-time. The color is chosen as tracking feature to make the process scale and rotation invariant. The color of an object can vary over time due to variations in the illumination conditions, the visual angle and the camera parameters. This paper presents the integration of color distributions into particle filtering. The color feature is extracted using our novel 4D color histogram of the image, which is determined using JND color similarity threshold and connectivity of the neighboring pixels. Particle filter tracks several hypotheses simultaneously and weighs them according to their similarity to the target model. The popular Bhattacharyya coefficient is used as similarity measure between two color distributions. The tracking results are compared on the basis of precision over the data set of video sequences from the website http://visualtracking.net of CVPR13 bench marking paper. The proposed tracker yields better precision values as compared to previous reported results
An Improved Way of Segmentation and Classification of Remote Sensing Images U...ijsrd.com
The Ultimate significance of Images lies in processing the digital image which stems from two principal application areas: Advances of pictorial information for human interpretation; and dispensation of image data for storage, communication, and illustration for self-sufficient machine perception. The objective of this research work is to define the meaning and possibility of image segmentation based on remote sensing images which are successively classified with statistical measures. In this paper kernel induced Possiblistic C-means clustering algorithm has been implemented for classifying remote sensing image data with image features. As a final point of the proposed work is to point out that this algorithm works well for segmenting and classifying the image with better accuracy with statistical metrices.
A STUDY AND ANALYSIS OF DIFFERENT EDGE DETECTION TECHNIQUEScscpconf
In the first study [1], a combination of K-means, watershed segmentation method, and Difference In Strength (DIS) map were used to perform image segmentation and edge detection
tasks. We obtained an initial segmentation based on K-means clustering technique. Starting from this, we used two techniques; the first is watershed technique with new merging
procedures based on mean intensity value to segment the image regions and to detect their boundaries. The second is edge strength technique to obtain accurate edge maps of our images without using watershed method. In this technique: We solved the problem of undesirable over segmentation results produced by the watershed algorithm, when used directly with raw data images. Also, the edge maps we obtained have no broken lines on entire image. In the 2nd study level set methods are used for the implementation of curve/interface evolution under various forces. In the third study the main idea is to detect regions (objects) boundaries, to isolate and extract individual components from a medical image. This is done using an active contours to detect regions in a given image, based on techniques of curve evolution, Mumford–Shah functional for segmentation and level sets. Once we classified our images into different intensity regions based on Markov Random Field. Then we detect regions whose boundaries are not necessarily defined by gradient by minimize an energy of Mumford–Shah functional forsegmentation, where in the level set formulation, the problem becomes a mean-curvature which will stop on the desired boundary. The stopping term does not depend on the gradient of the image as in the classical active contour. The initial curve of level set can be anywhere in the image, and interior contours are automatically detected. The final image segmentation is one
closed boundary per actual region in the image.
Methods to Maximize the well being and Vitality of Moribund Communitiespraveena06
Abstract-It has become the primary concern for the governments to chart effective methods and policies to revitalize the communities which are on the verge of extinction, most of which are indigenous. This has become more relevant and important in an era of liberalization, which more often adversely affects the welfare of such communities. In this paper we make an effort to identify and qualify measures that would revitalize moribund communities and to quantify them using fuzzy analysis. We come out with concrete suggestions for the governments and the policy makers which can be easily put in action.
Identification of Differentially Expressed Genes by unsupervised Learning Methodpraveena06
Abstract-Microarrays are one of the latest breakthroughs in experimental molecular biology that allow monitoring of gene expression of tens of thousands of genes in parallel. Micro array analysis include many stages. Extracting samples from the cells, getting the gene expression matrix from the raw data, and data normalization which are low level analysis.Cluster analysis for genome-wide expression data from DNA micro array data is described as a high level analysis that uses standard statistical algorithms to arrange genes according to similarity patterns of expression levels. This paper presents a method for the number of clusters using the divisive hierarchical clustering, and k-means clustering of significant genes. The goal of this method is to identify genes that are strongly associated with disease in 12607 genes. Gene filtering is applied to identify the clusters. k-means shows that about four to seven genes or less than one percent of the genes account for the disease group which are the outliers, more than seventy percent falls as undefined group. The hierarchical clustering dendo gram shows clusters at two levels which shows again less than one percent of the genes are differentially expressed.
Abstract- A feature based “Selection of feature region set for digital image using Optimization Algorithm” is proposed here. The work is based on simulated attacking and optimization solving procedure. Image transformation techniques are used to extract local features. Simulated attacking procedure is performed to evaluate the robustness of every candidate feature region. According to the evaluation results, a track-with-pruning procedure I adopted to search a minimal primary feature set which may resists the most predefined attacks. In order to enhance its resistance capability against undefined attacks, primary feature set is then extended by adding some auxiliary feature regions in it. This work is formulated as a multidimensional knapsack problem and solved by optimization algorithms such as Genetic Algorithm, Particle Swarm Optimization and Simulated Annealing.
Abstract -Data mining is a process of extracting knowledge from huge amount of data stored in databases, data warehouses and data repositories. Crime is an interesting application where data mining plays an important role in terms of prediction and analysis. Clustering is the process of combining data objects into groups. The data objects within the group are very similar and very dissimilar as well when compared to objects of other groups. This paper presents detailed study on clustering techniques and its role on crime applications. This study also helps crime branch for better prediction and classification of crimes.
Abstract - In wireless sensor network, energy efficiency is a major concern as the sensors have minimum energy capacity. As the sensor energy consumption plays a vital role in determining the network lifetime, many strategies have been proposed for energy conservation. One of them is mobile data gathering (MDG).In Mobile Data Gathering either the sink can go on tour to collect the data or a Mobile Data Collector (MDC) can collect the data from sensors and drops them back to the static sink. In this paper, static sink with mobile data collector is considered for the topic of interest. The mobile data collector will reach the cluster of sensors at some appropriate locations called as anchor points. For the formation of clusters, many algorithms have been proposed so far, two of them , Square Grid based Clustering (SGC) and Sensor Transmission based Clustering (STC) are analysed here for the selection of anchors in the anchor based mobile data gathering approach.
Abstract-Denial-of-Service attacks, a type of attack on a network that is designed to bring the network to its knees by flooding it with useless traffic. Many Dos attacks, such as the Ping of Death ,Teardrop attacks etc., exploit the limitations in the TCP/IP protocols. like viruses, new Dos attacks are constantly being dreamed up by hackers.So the users have to take own effort of a large number of protected system such as Firewall or up-to-date antivirus software. . If the system or links are affected from an attack then the legitimate clients may not be able to connect it.. This detection system is the next level of the security to protect the server from major problems occurs such as Dos attacks, Flood IP attacks, and also the Proxy Surfer. So these kinds of anonymous activities barred out by using this Concept.
Abstract-Software is ubiquitous in our daily life. It brings us great convenience and a big headache about software reliability as well: Software is never bug-free, and software bugs keep incurring monetary loss of even catastrophes. In the pursuit of better reliability, software engineering researchers found that huge amount of data in various forms can be collected from software systems, and these data, when properly analyzed, can help improve software reliability. Unfortunately, the huge volume of complex data renders the analysis of simple techniques incompetent; consequently, studies have been resorting to data mining for more effective analysis. In the past few years, we have witnessed many studies on mining for software reliability reported in data mining as well as software engineering forums. These studies either develop new or apply existing data mining techniques to tackle reliability problems from different angles. In order to keep data mining researchers abreast of the latest development in this growing research area, we propose this paper on data mining for software reliability. In this paper, we will present a comprehensive overview of this area, examine representative studies, and lay out challenges to data mining researchers.
Abstract-Population exploration causes the high usage of electronic devices such as computer, laptop, and household equipments. So we can save the power and world from the pollution and its unpleasant additional result. Using the Green Computing we can save the power, world., .Green computing means the study and practice of designing ,manufacturing using, and disposing of computers ,servers, and associate subsystem such as printers, monitors etc. The goal of Green computing are similar to green chemistry reduce the use of hazardous materials maximum energy efficiency during the product’s life time and promote the reusability of defunct products and factory waste. Green computing can also develop solutions that offer benefits by “aligning all IT process and practices with the core principles of sustainability which are to reduce, reuse, and recycle and finding innovative ways to use it in business product to deliver sustainability benefits across the enterprise and beyond”.In this thesis, green maturity model for virtualization and its levels are explained “Green Computing,” is especially important and timely: As computing becomes increasingly pervasive, the energy consumption attributable to computing is climbing, despite the clarion call to action to reduce consumption and reverse greenhouse effects. At the same time, the rising cost of energy — due to regulatory measures enforcing a “true cost” of energy coupled with scarcity as finite natural resources are rapidly being diminished — is refocusing IT leaders on efficiency and total cost of ownership, particularly in the context of the world-wide financial crisis.. The Five steps for Green computing for energy conservation.
Abstract - Let G = (V,E) be a simple, undirected, finite nontrivial graph. A non empty set DÍV of vertices in a graph G is a dominating set if every vertex in V-D is adjacent to some vertex in D. The domination number g(G) of G is the minimum cardinality of a dominating set. A dominating set D is called a non split locating equitable dominating set if for any two vertices u,wÎV-D, N(u)ÇD ¹ N(w)ÇD, ½N(u)ÇD½=½N(w)ÇD½ and the induced sub graph áV-Dñ is connected.The minimum cardinality of a non split locating equitable dominating set is called the non split locating equitable domination number of G and is denoted by gnsle(G). In this paper, bounds for gnsle(G) and exact values for some particular classes of graphs were found.
Abstract- Machine learning, a branch of artificial intelligence is a natural outgrowth of the intersection of Computer Science and Statistics. Disease diagnosis is one of its well known applications. This paper focuses on diagnosing diseases in human beings by analyzing their tongue using decision tree classifiers algorithm. Data collection is performed by manual methods. The ultimate aim is to track some common diseases by analyzing the basic tongue.
Abstract-GasCan is a specialized and unique database of gastric cancer protein encoding genes expressed in human and mouse. The features that make GasCan unique are availability of gene information, availability of primers for each gene, with their features and conditions given that are useful in PCR amplification, especially in cloning experiments and to make it more unique built in programmed sequence analysis facility is provided that analyze gene sequences in database itself, resulting sequence analysis information can be valuable for researchers in different experiments. Furthermore, DNA sequence analysis tool is provided that can be access freely. GasCan will expand in future to other species, genes and cover more useful information of other species. Flexible database design, expandability and easy access of information to all of the users are the main features of the database. The Database is publicly available at http://www.gastric-cancer.site40.net.
Abstract-The current trend in the application space towards systems of loosely coupled and dynamically bound components that enables just-in-time integration jeopardizes the security of information that is shared between the broker, the requester, and the provider at runtime. In particular, new advances in data mining and knowledge discovery that allow for the extraction of hidden knowledge in an enormous amount of data impose new threats on the seamless integration of information. We consider the problem of building privacy preserving algorithms for one category of data mining techniques, association rule mining.Suppose Alice owns a k-anonymous database and needs to determine whether her database, when inserted with a tuple owned by Bob, is still k-anonymous. Also, suppose that access to the database is strictly controlled, because for example data are used for certain experiments that need to be maintained confidential. Clearly, allowing Alice to directly read the contents of the tuple breaks the privacy of Bob (e.g., a patient’s medical record); on the other hand, the confidentiality of the database managed by Alice is violated once Bob has access to the contents of the database. Thus, the problem is to check whether the database inserted with the tuple is still k-anonymous, without letting Alice and Bob know the contents of the tuple and the database, respectively. In this paper, we propose two protocols solving this problem on suppression-based and generalization-based k-anonymous and confidential databases. The protocols rely on well-known cryptographic assumptions, and we provide theoretical analyses to proof their soundness and experimental results to illustrate their efficiency.We have presented two secure protocols for privately checking whether a k-anonymous database retains its anonymity once a new tuple is being inserted to it. Since the proposed protocols ensure the updated database remains K-anonymous, the results returned from a user’s (or a medical researcher’s) query are also k-anonymous. Thus, the patient or the data provider’s privacy cannot be violated from any query. As long as the database is updated properly using the proposed protocols, the user queries under our application domain are always privacy-preserving.
Abstract-Intrusion Detection System used to discover attacks against computers and network Infrastructures. There are many techniques used to determine the IDS such as Outlier Detection Schemes for Anomaly Detection, K-Mean Clustering of monitoring data, classification detection and outlier detection. The data mining approaches help to determine what meets the criteria as an intrusion versus normal traffic, whether a system uses anomaly detection, misuse detection, target monitoring, or stealth probes. This paper attempts to evaluate, categorize, compares and summarizes the performance of data mining techniques to detect the intrusion.
Abstract - Human learning system is highly sensitive to responsive system according the processing, mapping, motion, auditory and visualization system. Special education system is implemented to overcome the demanded sense of the human special care sensitive signals. This responsive system is balanced and effectively instrumented with modern technological learning pedagogy to bring the special need learners into the normal learning system. In the learning process, cognitive human sensors directly influence the learning effectiveness. This paper attempted to observe the cognitive load such as mental , physical , temporal ,performance , effort and frustration in the long term , short term, working , instant , responsive, process, recollect , reference , instruction and action memory and classify the observed values as per the generalized and specialized properties. The six working loads are observed in the ten types of learning system. The classification analysis aimed to predicate the pattern for learning system for specific learning challenges.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
1. Integrated Intelligent Research (IIR) International Journal of Data Mining Techniques and Applications
Volume: 01 Issue: 01 June 2015 Page No.1-3
ISSN: 2278-2419
1
Remotely Sensed Image (RSI) Analysis for feature
extraction using Color map Indexing Classification
S.Sasikala1
, N.Radhakrishnan2
1
Research Scholar, Mother Theresa Women’s University, Kodaikanal.
2
Managing Director, Geosensing Information Pvt., Ltd.,Chennai
Email: 1
sasikalarams@gmail.com, 2
radhakrishnan.nr@gmail.com
Abstract -Remote Sensing is the science and art of acquiring
information (spectral, spatial, and temporal) about material
objects, area, or phenomenon, without coming into physical
contact with them ad plays a significant role in feature
extraction. In the present paper, implementation of color
mapping index method is analyzed to extract features from RSI
in spectral domain. Color indexing is applied after fixing the
index value to the pixels of selected ROI (Region of Interest)
of RSI and there by clustering based on these index values.
Color mapping, which is also called tone mapping can be used
to apply color transformations on the final image colors of the
ROI. The process of color map indexing is a color map
approximation approach on RSI for feature extraction includes
designing appropriate algorithm, its implementation and
discussion on the results of such implementation on ROI.
Key words- Feature extraction, Remote sensing Image, Color
map
I. INTRODUCTION
In the present paper, digital number values (DN) of the
selected remote sensing image (RSI) are studied to understand
the image mining technique to extract features in spectral
domain. In remote sensing, information transfer is
accomplished by use of electromagnetic radiation (EMR),
which is a form of energy that reveals its presence by the
observable effects it produces when it strikes the matter. The
electromagnetic radiation (EMR), which is reflected or emitted
from an object, is the usual source of remote sensing data. This
is represented in the combination of pixels and stored in the
digital media for analysis and predications using data mining
technique such as color indexing and color mapping as
discussed in the present study.
II. METHODOLOGY
In color index method color impact of the [R, G, B] of each
pixel are considered to form clusters from RSI. The color
values adopted in the present study coincides with the common
color values observed in the Microsoft tools. Based on the
color map table values, the pixels are formed as a cluster and
its features are manipulated. The classification is based on the
index value of color mapping which is used for the image
representation process. The mapping process is implemented
by Color map approximation and these conversions are based
on the “dither” as well as “no-dither” methods. In dither , the
original image value will be consider with the exclusion of
noise and the collusion of the digital image, but in no –dither
process, the image is processed as it is without the
consideration of noise and collusion. Color map index, color
values of the pixels could be truncated to lower levels, for
example 0- 255 colors presented in the present study may be
truncated to 128 or 64 color values based on the computing
system. It takes the converted pixel value, as explained in the
uniform quantization method, as initial data input. Mapping
value must be less than or equal to 65536, because the map
represents 256x256 color combinations. This method verified
the each pixel compare with its color map values as per the
Microsoft Color representation index. The color index differs
from 0 to 65535 because the color combinations are 256x256
matrix. According to the number of clusters, the color maps are
separated. For example, if the number of clusters is considered
as eight, then the range of the first cluster may be computed by
[0-(65536/8)-1] which is equal to (0-8191). The cluster has all
the color index values of 0 to 255 but the pixel index from 0-7.
Similarly, the following clusters are represented with group of
256 x 32 or 32 x 256 portioned color index values. As per the
assigned index values the clustered are grouped and the
process leads towards the extraction features and determination
of their range values.
The designed algorithm of this method requires that the pixels
of ROI are to be divided into clusters according to the color
index which are assigned by Color map index approaches. At
the end of the process, the resultant color values may contain
decimal values. To overcome such fractional values
represented in the resultant color values, better color resolution
at the expense of spatial resolution is applied, which is called
as dither process. In 'no-dither' maps, each color in the original
image forms to the closest color in the resultant output image.
As per the converted mapping of the color, the same index
values are grouped and form the clusters. The process is
iterated till reaching the unique cluster of pixels with the
similar index values. The sub clusters’ DNs are tabulated.
From the tabulated values, similar features are identified along
with the pixel range vales. The mean is calculated and featured
range is determined. From the determined range value, the
segmented image is formed from the selected ROI. The sub
image feature is verified with the truth value then the
determined range values assigned as a feature range common
index.
III. EXPERIMENT
The preprocessed and rectified image selected for classification
is of size (400,400) with the area of 381747 Sq.M2.
The value
of the area is arrived by computing the product of spatial
resolution of the image, in this case 23.5 mts, with the number
of pixels in the image. This classification approach is
2. Integrated Intelligent Research (IIR) International Journal of Data Mining Techniques and Applications
Volume: 01 Issue: 01 June 2015 Page No.1-3
ISSN: 2278-2419
2
manipulated based on the DNs of each layer together as well as
each layers separately. The classified image and its range
values of pixel based equal interval programmed and executed
using matlab 7.0 are presented below
Figure 1
A. Color Map approximation
Color map approximation method fixes the index by matching
colors in RGB with the nearest color. As per the RGB color
map scheme, the pixels are clustered and the clusters pixel
values and its ranges are presented in Table 1In the color map
approximation, the DN range values of pixels of the RSI are
distributed in all the eight clusters.
Table 1 Clustering and DN Range values by Index Color
Map Method
Cluste
r
No.
of
Pixe
l
%of
Pixel
Blue Green Red
Star
t
En
d
Star
t
En
d
Star
t
En
d
1 210
2
12.8
3
84 134 45 81 34 69
2 290
0
17.7
0
92 133 53 76 102 10
2
3 248
7
15.1
8
102 144 80 92 100 96
4 260
0
15.8
7
110 135 99 118 103 11
8
5 100
3
6.12 92 122 57 60 110 12
1
6 233
8
14.2
7
101 160 82 95 107 12
9
7 104
1
6.35 136 169 96 126 100 13
3
8 191
3
11.6
8
95 147 64 79 111 13
7
All these DN range values derived from the above method -
color map - are also given as image output as shown in the
Figure 1. From the figure, it is evident that major features of
RSI could be extracted without much confusion or overlapping
while applying this algorithm. The output images of clusters as
derived from the color map algorithm shows in the form of
recognizable pattern of pixels and exactly replicate the DN
range values as observed in Table 1.
1 2
3
4
5 6
7 8
Figure 2. Clustered Image output of ROI by Index Color map
Method
The first cluster clearly shows the presence of a major feature -
waterbody. In the second cluster, DN range values attribute
predominantly to vegetation including crop, scrub and
plantation. Similarly, other clusters also show the presence of
scrub, water body, crop and soil moisture. Thus, the clusters
derived from the implementation of color map algorithm
helped to extract predominant features which are later
interpreted and identified with the help of application domain
expertise and limited field verification. Some of the
predominant features that are extracted from the selected RSI
using color map algorithm include waterbody, agricultural
crop, plantation and natural vegetation (scrub) have been
clustered individually as shown in Figure2. A second level
iteration is carried out for the above method to observe any
significant improvement in extracting features. It is an attempt
to enhance the ability of feature extraction process. The
resultant DN range values as obtained by applying the
algorithm are tabulated below (Table.2) and the results are
discussed.
3. Integrated Intelligent Research (IIR) International Journal of Data Mining Techniques and Applications
Volume: 01 Issue: 01 June 2015 Page No.1-3
ISSN: 2278-2419
3
Table 2 Second level Cluster Range Values by color map
method
Clus
ter
Feat
ure
% of
Pixel
Blue Green Red
Star
t
End
Star
t
End
St
art
En
d
1 5 12.83 88 97 47 53 33 38
2 1 8.85 97 116 54 76 93
10
2
3 8.85 109 116 64 71 76 88
3 7 15.18 111 125 85 93 90
10
8
4 4 15.87 121 133 98 113 97
11
2
5 1 6.12 96 102 52 63
10
6
12
2
6 1 14.27 121 135 80 95
10
7
11
3
7 6 6.35 136 143 98 111
10
5
11
1
8 7 11.68 107 113 64 76
10
7
12
9
From Table 2, it is observed that the percentage of pixels of
various features within a cluster is equal and mixing of pixels
is evidently carried over in the second level iteration too. DN
range of pixels in the first cluster suggests predominant
presence of waterbody, crop and scrub together and barren soil.
In the second cluster, features such as plantation and scrub are
observed. But in all the other clusters, DN range values suggest
predominant presence of one particular feature such as scrub,
water body, crop and soil moisture. Such narrow separation in
range values, in turn positively contribute to separate and
cluster pixels aiding in feature extraction.
IV. CONCLUSION
The color map index approach of common index value for
feature extraction from RSI assisted in determining the
unknown range values of the features in the ROI. The features
and their common index values that are extracted have been
derived from implementing color Indexed map algorithmic
technique. In each level, the same numbers of clusters (eight
clusters) are selected for the process. It needs iteration to
produce clusters of valid or sensible features. Otherwise, it
may in the first iteration produce large set of mixed pixel or
create confusion among pixels, which forms the limitation of
this procedure. But still predominant features, in this case
agriculture, barren land, fallow, scrub, waterbody and soil
moisture could be extracted with lesser confusion among pixel
groups or clusters from the selected ROI.
REFERENCES
[1] Datcu, M., et al., Information Mining in Remote Sensing Image Archives
- Part A: System Concepts. IEEE Trans. On Geoscience and Remote
Sensing, 2003. 41(2923--2936).
[2] G.J. Briem, J.A. Benediktsson, and J.R. Steeveinsson, “Multiple
Classifiers in Classification of Multisource Remote Sensing Data,” IEEE
Trans. on Geoscience and Remote Sensing, vol. 40, no. 10, pp. 2291-
2299, Oct.2002.
[3] GORTE, B. (1998): Probabilistic Segmentation of Remotely Sensed
Images. In: ITC Publication Series No. 63
[4] JANSSEN, L. (1993): Methodology for updating terrain object data from
remote sensing data. The application of Landsat TM data with respect to
agricultural fields. Doctoral Thesis, Wageningen Agricultural University
[5] KARTIKEYAN, B., SARKAR, A., MAJUMDER, K. (1998): A
segmentation approach to classification of remote sensing imagery. In:
International Journal of Remote Sensing 19 (9): 1695–1709.
[6] Kittler J (1998). Combining classifiers: a theoretical framework. Pattern
Anal Appl 1:18-27.
[7] Koepfler, G., C. Lopez and J. M. Morel, A Multiscale Algorithm for
Image Segmentation by Variational Method, SIAM Journal of Numerical
Analysis, vol.31, pp. 282 – 299, 1994.
[8] Koperski, K. A Progressive Refinement Approach to Spatial Data
Mining. Ph.D. Thesis. Simon Fraser University, 1999.
[9] Lambin, E.F., H.J. Geist, and E. Lepers, Dynamics of land-use and land-
cover change in Tropical Regions. Annual Review of Environment and
Resources, 2003. 28: p. 205- 241.