Pub Date : 2013-03-01DOI: 10.1109/ISSP.2013.6526887
Ajinkya S. Deshmukh, S. Medasani, G. R. Reddy
Atmospheric turbulence degrades image with nonuniform geometric deformations and distortions, due to random fluctuations of refractive index over air media. Typical approaches to turbulence removal do not consider moving objects of interest. We propose a method that combines two independent approaches, non-rigid image registration and background subtraction using Gaussian mixture modeling (GMM), to detect moving objects in turbulent conditions. Nonrigid image registration removes geometric distortions and stabilizes overall scene. Then GMM based background subtraction technique is used to detect moving objects. We demonstrate robustness of our proposed approach under varying turbulence conditions using qualitative and quantitative comparisons with existing methods.
{"title":"Moving object detection from images distorted by atmospheric turbulence","authors":"Ajinkya S. Deshmukh, S. Medasani, G. R. Reddy","doi":"10.1109/ISSP.2013.6526887","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526887","url":null,"abstract":"Atmospheric turbulence degrades image with nonuniform geometric deformations and distortions, due to random fluctuations of refractive index over air media. Typical approaches to turbulence removal do not consider moving objects of interest. We propose a method that combines two independent approaches, non-rigid image registration and background subtraction using Gaussian mixture modeling (GMM), to detect moving objects in turbulent conditions. Nonrigid image registration removes geometric distortions and stabilizes overall scene. Then GMM based background subtraction technique is used to detect moving objects. We demonstrate robustness of our proposed approach under varying turbulence conditions using qualitative and quantitative comparisons with existing methods.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128676741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-03-01DOI: 10.1109/ISSP.2013.6526892
V. Thakur, M. Saikia
The Internet is always vulnerable to interception by unauthorized people over the world. The importance of reducing a chance of the information being detected during the transmission is being an issue now days. Some solution to overcome these issues is cryptography, but once it is decrypted the information secrecy will not exits any more. Hiding data for confidentiality, this approach of information hiding can be extended to copyright protection for digital media. The importance as well as the technique used in implementing data hiding is trying to discuss in details here. The traditional LSB modification technique by randomly dispersing the bits of the message in the image and thus making it harder for unauthorized people to extract the original message, is vulnerable to lose of valuable hidden secrete information. Here, we propose a data hiding and extraction procedure for AVI (Audio Video Interleave) videos embedding the secret message bits in DCT higher order coefficients. The secret information taken here is an grayscale image pixel values. The grayscale pixel values are converted to binary values and embedded those values in higher order coefficient value of DCT of AVI video frames. Data Hiding and Extraction procedure a re experimented successfully. Various experiment results are show here. All experiments are done using Matlab 2010a simulation software.
互联网总是容易受到世界各地未经授权的人的拦截。如今，减少信息在传输过程中被检测到的机会的重要性正在成为一个问题。克服这些问题的一些解决方案是加密，但一旦解密，信息的保密性将不复存在。为了保护数据的机密性，这种信息隐藏方法可以推广到数字媒体的版权保护中。这里将详细讨论实现数据隐藏的重要性以及所使用的技术。传统的LSB修改技术通过将信息位随机分散到图像中，使未经授权的人难以提取原始信息，容易丢失有价值的隐藏秘密信息。本文提出了一种将秘密信息位嵌入到DCT高阶系数中的AVI (Audio Video Interleave)视频的数据隐藏和提取方法。这里采集的秘密信息是灰度图像的像素值。将灰度像素值转换为二值，并嵌入到AVI视频帧的DCT高阶系数值中。数据隐藏和提取程序的实验成功。这里展示了各种实验结果。所有实验均采用Matlab 2010a仿真软件完成。
{"title":"Hiding secret image in video","authors":"V. Thakur, M. Saikia","doi":"10.1109/ISSP.2013.6526892","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526892","url":null,"abstract":"The Internet is always vulnerable to interception by unauthorized people over the world. The importance of reducing a chance of the information being detected during the transmission is being an issue now days. Some solution to overcome these issues is cryptography, but once it is decrypted the information secrecy will not exits any more. Hiding data for confidentiality, this approach of information hiding can be extended to copyright protection for digital media. The importance as well as the technique used in implementing data hiding is trying to discuss in details here. The traditional LSB modification technique by randomly dispersing the bits of the message in the image and thus making it harder for unauthorized people to extract the original message, is vulnerable to lose of valuable hidden secrete information. Here, we propose a data hiding and extraction procedure for AVI (Audio Video Interleave) videos embedding the secret message bits in DCT higher order coefficients. The secret information taken here is an grayscale image pixel values. The grayscale pixel values are converted to binary values and embedded those values in higher order coefficient value of DCT of AVI video frames. Data Hiding and Extraction procedure a re experimented successfully. Various experiment results are show here. All experiments are done using Matlab 2010a simulation software.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127245751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-03-01DOI: 10.1109/ISSP.2013.6526942
Rashmi Chauhan, Rayan Goudar, Robin Sharma, A. Chauhan
To achieve semantic search, a search engine is needed which can interpret the meaning of a user's query and the relations among the concepts that a document contains with respect to a particular domain. We are presenting the skeleton of such a system based on ontology. In this system, a user enters a query from which the meaningful concepts are extracted; using these concepts and domain ontology, query expansion is performed. For all the terms (expanded and initial query terms), SPARQL query is built and then it is fired on the knowledge base that finds appropriate RDF triples in knowledge Base. Web documents relevant to the requested concepts and individuals specified in these triples are then retrieved. Finally, the retrieved documents are ranked according to their relevance to the user's query and then are sent to the user. If a user wants to find specific information; can search with another module of our system that works without query expansion. The approach of query expansion makes use of query concepts as well as synonyms of these concepts and the new terms relate with the original query terms within a threshold.
{"title":"Domain ontology based semantic search for efficient information retrieval through automatic query expansion","authors":"Rashmi Chauhan, Rayan Goudar, Robin Sharma, A. Chauhan","doi":"10.1109/ISSP.2013.6526942","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526942","url":null,"abstract":"To achieve semantic search, a search engine is needed which can interpret the meaning of a user's query and the relations among the concepts that a document contains with respect to a particular domain. We are presenting the skeleton of such a system based on ontology. In this system, a user enters a query from which the meaningful concepts are extracted; using these concepts and domain ontology, query expansion is performed. For all the terms (expanded and initial query terms), SPARQL query is built and then it is fired on the knowledge base that finds appropriate RDF triples in knowledge Base. Web documents relevant to the requested concepts and individuals specified in these triples are then retrieved. Finally, the retrieved documents are ranked according to their relevance to the user's query and then are sent to the user. If a user wants to find specific information; can search with another module of our system that works without query expansion. The approach of query expansion makes use of query concepts as well as synonyms of these concepts and the new terms relate with the original query terms within a threshold.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130463612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-03-01DOI: 10.1109/ISSP.2013.6526915
K. Lakshmisudha, C. Arun
Advances in technology enabled researchers in the field of wireless sensor networks to forecast unprecedented growth of ubiquitous applications. Because of the limited energy storage capability of sensor nodes, energy consumption is one of the most challenging aspects of these networks and different strategies and protocol deals with this area. However, deployment of the Wireless Sensor Networks in difficult to access areas makes it difficult to replace the batteries, the main power supply of a sensor node. It means that the power limitation of the sensor nodes appreciably constraints their functionality and potential applications. All the layers of the Wireless sensor networks protocol stack are responsible for the power consumption. In this paper we have discussed about the research issues in physical layer, MAC layer and the different methods to optimize the power consumption in both the layers of Wireless sensor networks. We have also discussed the Cross Layer designs to improve the energy efficiency.
{"title":"Research on power optimization in physical and MAC layer of wireless sensor networks — A survey","authors":"K. Lakshmisudha, C. Arun","doi":"10.1109/ISSP.2013.6526915","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526915","url":null,"abstract":"Advances in technology enabled researchers in the field of wireless sensor networks to forecast unprecedented growth of ubiquitous applications. Because of the limited energy storage capability of sensor nodes, energy consumption is one of the most challenging aspects of these networks and different strategies and protocol deals with this area. However, deployment of the Wireless Sensor Networks in difficult to access areas makes it difficult to replace the batteries, the main power supply of a sensor node. It means that the power limitation of the sensor nodes appreciably constraints their functionality and potential applications. All the layers of the Wireless sensor networks protocol stack are responsible for the power consumption. In this paper we have discussed about the research issues in physical layer, MAC layer and the different methods to optimize the power consumption in both the layers of Wireless sensor networks. We have also discussed the Cross Layer designs to improve the energy efficiency.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133739405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-03-01DOI: 10.1109/ISSP.2013.6526920
Asvin Gohil, Hardik Modi, Shobhit K Patel
The objective of this paper is comprehensive study related to 5G technology of mobile communication. Existing research work in mobile communication is related to 5G technology. In 5G, researches are related to the development of World Wide Wireless Web (WWWW), Dynamic Adhoc Wireless Networks (DAWN) and Real Wireless Communication. The most important technologies for 5G technologies are 802.11 Wireless Local Area Networks (WLAN) and 802.16 Wireless Metropolitan Area Networks (WMAN), Ad-hoc Wireless Personal Area Network (WPAN) and Wireless networks for digital communication. 4G technology will include several standards under a common umbrella, similar to 3G, but with IEEE 802.xx wireless mobile networks integrated from the commencement. The major contribution of this paper is the key provisions of 5G (Fifth Generation) technology of mobile communication, which is seen as consumer oriented. In 5G technology, the mobile consumer has given utmost priority compared to others. 5G Technology stands for 5th Generation Mobile Technology. 5G technology is to make use of mobile phones within very high bandwidth. The consumer never experienced the utmost valued technology as 5G. The 5G technologies include all types of advanced features which make 5G technology most dominant technology in near future.
{"title":"5G technology of mobile communication: A survey","authors":"Asvin Gohil, Hardik Modi, Shobhit K Patel","doi":"10.1109/ISSP.2013.6526920","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526920","url":null,"abstract":"The objective of this paper is comprehensive study related to 5G technology of mobile communication. Existing research work in mobile communication is related to 5G technology. In 5G, researches are related to the development of World Wide Wireless Web (WWWW), Dynamic Adhoc Wireless Networks (DAWN) and Real Wireless Communication. The most important technologies for 5G technologies are 802.11 Wireless Local Area Networks (WLAN) and 802.16 Wireless Metropolitan Area Networks (WMAN), Ad-hoc Wireless Personal Area Network (WPAN) and Wireless networks for digital communication. 4G technology will include several standards under a common umbrella, similar to 3G, but with IEEE 802.xx wireless mobile networks integrated from the commencement. The major contribution of this paper is the key provisions of 5G (Fifth Generation) technology of mobile communication, which is seen as consumer oriented. In 5G technology, the mobile consumer has given utmost priority compared to others. 5G Technology stands for 5th Generation Mobile Technology. 5G technology is to make use of mobile phones within very high bandwidth. The consumer never experienced the utmost valued technology as 5G. The 5G technologies include all types of advanced features which make 5G technology most dominant technology in near future.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131536437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-03-01DOI: 10.1109/ISSP.2013.6526903
Nidhi H. Divecha, Dr. N. N. Jani
Digital image watermarking is one such technology that has been developed to protect digital content (text, images, audio, and video) from illegal manipulations. In this paper we proposed implementation and performance analysis of two different watermarking schemes based on DCT-DWT-SVD. Both are non blind techniques. One is based on SVD of DC coefficients using second level DWT decomposition and other is consider SVD of all DCT values of second level DWT composition of cover image. To check effectiveness of both techniques for Imperceptibility and robustness PSNR and NCC parameters are used.
{"title":"Implementation and performance analysis of DCT-DWT-SVD based watermarking algorithms for color images","authors":"Nidhi H. Divecha, Dr. N. N. Jani","doi":"10.1109/ISSP.2013.6526903","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526903","url":null,"abstract":"Digital image watermarking is one such technology that has been developed to protect digital content (text, images, audio, and video) from illegal manipulations. In this paper we proposed implementation and performance analysis of two different watermarking schemes based on DCT-DWT-SVD. Both are non blind techniques. One is based on SVD of DC coefficients using second level DWT decomposition and other is consider SVD of all DCT values of second level DWT composition of cover image. To check effectiveness of both techniques for Imperceptibility and robustness PSNR and NCC parameters are used.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131867286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-03-01DOI: 10.1109/ISSP.2013.6526928
S. Soni, S. D. Nayak
In this paper, a novel security mechanism is presented to enhance security & performance of AODV (Adhoc On-demand Distance Vector) routing protocol under the attack for MANET (Mobile Ad-hoc Networks). The AODV routing protocol was initially developed without considering security in mind. So it is not able to defend against any kind of security attack. But there are many security mechanisms available that make AODV secure. However, by doing more research in this area, one major flaw in any of the existing secure routing protocols was discovered. That is security mechanisms that are available consume more processing power and required complex key-management system. Here, we present a novel security mechanism that integrates digital signature and hash chain to protect the AODV routing protocol that is capable of defending itself against both malicious and unauthenticated nodes with marginal performance difference. The proposed security mechanism was also simulated in the Network Simulator 2 (NS2) to show marginal performance difference under attack.
{"title":"Enhancing security features & performance of AODV protocol under attack for MANET","authors":"S. Soni, S. D. Nayak","doi":"10.1109/ISSP.2013.6526928","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526928","url":null,"abstract":"In this paper, a novel security mechanism is presented to enhance security & performance of AODV (Adhoc On-demand Distance Vector) routing protocol under the attack for MANET (Mobile Ad-hoc Networks). The AODV routing protocol was initially developed without considering security in mind. So it is not able to defend against any kind of security attack. But there are many security mechanisms available that make AODV secure. However, by doing more research in this area, one major flaw in any of the existing secure routing protocols was discovered. That is security mechanisms that are available consume more processing power and required complex key-management system. Here, we present a novel security mechanism that integrates digital signature and hash chain to protect the AODV routing protocol that is capable of defending itself against both malicious and unauthenticated nodes with marginal performance difference. The proposed security mechanism was also simulated in the Network Simulator 2 (NS2) to show marginal performance difference under attack.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122393845","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-03-01DOI: 10.1109/ISSP.2013.6526866
Ravinder Singh, K. Roy, B. R. Kapuriya, C. Bhattacharya
We report here fifth-degree Bezier curve approximations by genetic algorithm for sine amplitudes that computes the amplitudes from phase values ranging from 0 to π/2. The full period of a sine wave is generated by exploiting the quarter wave symmetry. Sine waves generated by this technique are spectrally very pure, and are produced without ROM in a direct digital frequency synthesizer (DDS). It produces sine waves with a maximum error in amplitude of order 7.6×10-06 that is lesser than errors introduced in any typical DDS based sine wave output. DDS circuitry is designed in the Simulink environment. Spectral analysis shows that worst case spurious free dynamic range (SFDR) for a sinusoid is -132 dBc.
{"title":"A ROM-less direct digital frequency synthesizer based on fifth-degree Bezier curve approximation","authors":"Ravinder Singh, K. Roy, B. R. Kapuriya, C. Bhattacharya","doi":"10.1109/ISSP.2013.6526866","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526866","url":null,"abstract":"We report here fifth-degree Bezier curve approximations by genetic algorithm for sine amplitudes that computes the amplitudes from phase values ranging from 0 to π/2. The full period of a sine wave is generated by exploiting the quarter wave symmetry. Sine waves generated by this technique are spectrally very pure, and are produced without ROM in a direct digital frequency synthesizer (DDS). It produces sine waves with a maximum error in amplitude of order 7.6×10-06 that is lesser than errors introduced in any typical DDS based sine wave output. DDS circuitry is designed in the Simulink environment. Spectral analysis shows that worst case spurious free dynamic range (SFDR) for a sinusoid is -132 dBc.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127267737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-03-01DOI: 10.1109/ISSP.2013.6526884
S. Panwar, N. Nain
Handwritten text recognition needs some preprocessing steps for better recognition. One of the preprocessing task is handwritten text document binarization. Several binarization approaches are proposed previously and several are widely used in handwritten text binarization but the choice of most appropriate binarization approach for handwritten document is a very difficult itself. In this paper, we propose an adaptive binarization approach which can handle both continuous and abrupt intensity variations across the lines as well as words for handwritten or printed document. Experiments found that, the proposed approach is very simple as it uses only addition operations with constant complexity, and it also gives competitive results for handwritten (printed) documents compared to standard binarization approaches.
{"title":"A simple and novel adaptive binarization approach for handwritten documents","authors":"S. Panwar, N. Nain","doi":"10.1109/ISSP.2013.6526884","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526884","url":null,"abstract":"Handwritten text recognition needs some preprocessing steps for better recognition. One of the preprocessing task is handwritten text document binarization. Several binarization approaches are proposed previously and several are widely used in handwritten text binarization but the choice of most appropriate binarization approach for handwritten document is a very difficult itself. In this paper, we propose an adaptive binarization approach which can handle both continuous and abrupt intensity variations across the lines as well as words for handwritten or printed document. Experiments found that, the proposed approach is very simple as it uses only addition operations with constant complexity, and it also gives competitive results for handwritten (printed) documents compared to standard binarization approaches.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116781151","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-03-01DOI: 10.1109/ISSP.2013.6526941
C. Ramesh, G. Jena, K. R. Rao, C. V. Sastry
A Characteristic of the crisp clustering technique is that the boundary between clusters is fully defined. However, in many real-time situations, the boundaries between clusters cannot be clearly identified. Some patterns may belong to more than one cluster. In such cases, the fuzzy clustering method provides a better and more useful method to classify these patterns. Fuzzy c-means (FCM) FCM method is applicable to a wide variety of geostatistical data-analysis problems. This method generates fuzzy partitions and prototypes for any set of numerical data. These partitions are useful for corroborating known substructures or suggesting substructures in unexplored data. The clustering criterion used to aggregate subsets is a generalized least-squares objective function. We have implemented FCM algorithm with Gaussian membership values. Features of this method include a choice of an adjustable weighting factor that essentially controls sensitivity to the number of clusters.
{"title":"Fuzzy clustering with Gaussian-type member ship function","authors":"C. Ramesh, G. Jena, K. R. Rao, C. V. Sastry","doi":"10.1109/ISSP.2013.6526941","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526941","url":null,"abstract":"A Characteristic of the crisp clustering technique is that the boundary between clusters is fully defined. However, in many real-time situations, the boundaries between clusters cannot be clearly identified. Some patterns may belong to more than one cluster. In such cases, the fuzzy clustering method provides a better and more useful method to classify these patterns. Fuzzy c-means (FCM) FCM method is applicable to a wide variety of geostatistical data-analysis problems. This method generates fuzzy partitions and prototypes for any set of numerical data. These partitions are useful for corroborating known substructures or suggesting substructures in unexplored data. The clustering criterion used to aggregate subsets is a generalized least-squares objective function. We have implemented FCM algorithm with Gaussian membership values. Features of this method include a choice of an adjustable weighting factor that essentially controls sensitivity to the number of clusters.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124144251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：