Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019741
Seema B. Hegde, Research Scholor, B Sathish Babu
Opportunistic computing(OC) being a new paradigm of computing exploits the chance of acquiring the devices and service required for computing with the principle, sharing of resources with resource utilization at high priority. Among the multitude of challenges faced by OC, routing and security factors are the urgent issues to be attended. The paper provides a review of various routing protocols taxnomised based on the smartness they accomplish and security protocols designed around the OC principles.
{"title":"An analysis of routing and security protocols in oppurtunstic computing","authors":"Seema B. Hegde, Research Scholor, B Sathish Babu","doi":"10.1109/IC3I.2014.7019741","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019741","url":null,"abstract":"Opportunistic computing(OC) being a new paradigm of computing exploits the chance of acquiring the devices and service required for computing with the principle, sharing of resources with resource utilization at high priority. Among the multitude of challenges faced by OC, routing and security factors are the urgent issues to be attended. The paper provides a review of various routing protocols taxnomised based on the smartness they accomplish and security protocols designed around the OC principles.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123849564","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019643
Rupesh Gupta, T. Singh
Since the rise of usage of internet in the world security is becoming the major concern all over. So making this thing clear in mind developers are continuously working to make internet a safe environment for all the users. Many algorithm or techniques are proposed and they worked but as the intruders are acting smartly to hack information developers are also supposed to invent new techniques to stop hacker's intentions. As per the basic knowledge more is the PSNR value and lesser is the MSE results are better so, here in this paper we are proposing a new method by combing three major security techniques that is cryptography, stegnography and watermarking that will not only hide the information but produce better results for MSE. PSNR and Embedding capacity still after the noise attack. The purpose this paper is to provide a new technique that will provide better security for hiding data in an image and watermarked video.
{"title":"New proposed practice for secure image combing cryptography stegnography and watermarking based on various parameters","authors":"Rupesh Gupta, T. Singh","doi":"10.1109/IC3I.2014.7019643","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019643","url":null,"abstract":"Since the rise of usage of internet in the world security is becoming the major concern all over. So making this thing clear in mind developers are continuously working to make internet a safe environment for all the users. Many algorithm or techniques are proposed and they worked but as the intruders are acting smartly to hack information developers are also supposed to invent new techniques to stop hacker's intentions. As per the basic knowledge more is the PSNR value and lesser is the MSE results are better so, here in this paper we are proposing a new method by combing three major security techniques that is cryptography, stegnography and watermarking that will not only hide the information but produce better results for MSE. PSNR and Embedding capacity still after the noise attack. The purpose this paper is to provide a new technique that will provide better security for hiding data in an image and watermarked video.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124147875","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019706
G. Vadivelou, E. Ilavarasan
Web services have become the primary source for constructing software system over Internet. The quality of whole system greatly dependents on the QoS of single Web service, so QoS information is an important indicator for service selection. In reality, QoSs of some Web services may be unavailable for users. How to predicate the missing QoS value of Web service through fully using the existing information is a difficult problem. This paper attempts to settle this difficulty by fusing Pearson similarity and Slope One methods for QoS prediction. In this paper, the Pearson similarity is adopted between two services as the weight of their deviation. Meanwhile, some strategies like weight adjustment and SPC-based smoothing are also utilized for reducing prediction error. In order to evaluate the validity of the proposed algorithm, comparative experiments are performed on the real-world data set. The result shows that the proposed algorithm exhibits better prediction precision than both basic Slope One and the well-known WsRec algorithm in most cases. Meanwhile, the new approach has the strong ability of reducing the impact of noise data.
{"title":"Fusion of Pearson similarity and Slope One methods for QoS prediction for web services","authors":"G. Vadivelou, E. Ilavarasan","doi":"10.1109/IC3I.2014.7019706","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019706","url":null,"abstract":"Web services have become the primary source for constructing software system over Internet. The quality of whole system greatly dependents on the QoS of single Web service, so QoS information is an important indicator for service selection. In reality, QoSs of some Web services may be unavailable for users. How to predicate the missing QoS value of Web service through fully using the existing information is a difficult problem. This paper attempts to settle this difficulty by fusing Pearson similarity and Slope One methods for QoS prediction. In this paper, the Pearson similarity is adopted between two services as the weight of their deviation. Meanwhile, some strategies like weight adjustment and SPC-based smoothing are also utilized for reducing prediction error. In order to evaluate the validity of the proposed algorithm, comparative experiments are performed on the real-world data set. The result shows that the proposed algorithm exhibits better prediction precision than both basic Slope One and the well-known WsRec algorithm in most cases. Meanwhile, the new approach has the strong ability of reducing the impact of noise data.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125165393","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019729
B. Simhachalam, G. Ganesan
Classification or Clustering is the task of grouping similar objects based on the similarity among the individuals. The techniques using in clustering are mostly unsupervised methods. In this study, Possibilistic Fuzzy C-means (PFCM) clustering technique is used to classify the patients into different clusters of thyroid diseases. Further, the results of Possibilistic Fuzzy C-means clustering algorithm and Fuzzy c-Means clustering (FCM) algorithm are compared according to the classification performance. The results exhibit that the Possibilistic Fuzzy C-means clustering algorithm performs well.
{"title":"Possibilistic Fuzzy C-means clustering on medical diagnostic systems","authors":"B. Simhachalam, G. Ganesan","doi":"10.1109/IC3I.2014.7019729","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019729","url":null,"abstract":"Classification or Clustering is the task of grouping similar objects based on the similarity among the individuals. The techniques using in clustering are mostly unsupervised methods. In this study, Possibilistic Fuzzy C-means (PFCM) clustering technique is used to classify the patients into different clusters of thyroid diseases. Further, the results of Possibilistic Fuzzy C-means clustering algorithm and Fuzzy c-Means clustering (FCM) algorithm are compared according to the classification performance. The results exhibit that the Possibilistic Fuzzy C-means clustering algorithm performs well.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125745060","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019752
Mithun Vijayan, M. J. Josemartin, P. R. Geetharanjin
In this paper, an undecimated double density dual tree discrete wavelet transform (UDDDT-DWT) based image resolution enhancement technique is proposed. The critically sampled discrete wavelet transform (DWT) suffers from the drawbacks of being shift-variant and lacking the capacity to process directional information in images. The double density dual tree wavelet transform (DDDT-WT) is an approximately shift-invariant transform capturing directional information. The UDDDT-DWT is an improvement of the DDDT-DWT, making it exactly shift-invariant. The method uses a forward and inverse (UDDDT-DWT) to construct a high-resolution (HR) image from the given lower-resolution (LR) image. The HR image is reconstructed from the LR image using the inverse UDDDT-DWT. Results are presented and discussed through comparisons between state-of-the-art resolution enhancement methods.
{"title":"Image resolution enhancement using undecimated double density dual tree wavelet transform","authors":"Mithun Vijayan, M. J. Josemartin, P. R. Geetharanjin","doi":"10.1109/IC3I.2014.7019752","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019752","url":null,"abstract":"In this paper, an undecimated double density dual tree discrete wavelet transform (UDDDT-DWT) based image resolution enhancement technique is proposed. The critically sampled discrete wavelet transform (DWT) suffers from the drawbacks of being shift-variant and lacking the capacity to process directional information in images. The double density dual tree wavelet transform (DDDT-WT) is an approximately shift-invariant transform capturing directional information. The UDDDT-DWT is an improvement of the DDDT-DWT, making it exactly shift-invariant. The method uses a forward and inverse (UDDDT-DWT) to construct a high-resolution (HR) image from the given lower-resolution (LR) image. The HR image is reconstructed from the LR image using the inverse UDDDT-DWT. Results are presented and discussed through comparisons between state-of-the-art resolution enhancement methods.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126033950","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019624
Navjot Kaur, G. Soni
Free space optical communication provides a unique method for the satellites orbiting around the earth to communication with each other. Inter-satellite optical wireless communication systems (IsOWC), one of the important applications of Free space optical communication technology, will be deployed in space in the near future as such systems provide a high bandwidth, small size, light weight, low power and low cost alternative to present microwave satellite systems. In this paper, optical inter-satellite link (ISL) is modeled using optisystem and then investigation is carried out to study the effect of varying the wavelength between two satellites estranged by a distance of 1300 km at data rate 3 Gbps. In this paper the performance of the IsOWC link is evaluated keeping into consideration the pointing errors.
{"title":"Performance analysis of inter-satellite optical wireless communication (IsOWC) system at 980 nm and 1550 nm wavelengths","authors":"Navjot Kaur, G. Soni","doi":"10.1109/IC3I.2014.7019624","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019624","url":null,"abstract":"Free space optical communication provides a unique method for the satellites orbiting around the earth to communication with each other. Inter-satellite optical wireless communication systems (IsOWC), one of the important applications of Free space optical communication technology, will be deployed in space in the near future as such systems provide a high bandwidth, small size, light weight, low power and low cost alternative to present microwave satellite systems. In this paper, optical inter-satellite link (ISL) is modeled using optisystem and then investigation is carried out to study the effect of varying the wavelength between two satellites estranged by a distance of 1300 km at data rate 3 Gbps. In this paper the performance of the IsOWC link is evaluated keeping into consideration the pointing errors.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130083136","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019825
M. Patel, S. L. Reddy
The scanning of paper documents followed by the storage, retrieval, display, and management of the resulting electronic images, is known as document image processing, which is a subfield of Digital Image Processing. The main objective of the document image analysis is to recognize the text and graphics components in the images. Optical Character Recognition [OCR] is the process of converting the image obtained by scanning a text or a document into machine-editable format. OCR has practical potential applications in writer identification, forensic analysis handwriting, health care, legal, banking, postal services, etc. Recently, handwriting recognition is now gain spread lot of importance due to sources such as paper documents, photographs, touch-screens and other devices. In this paper we study the impact of grid based approach in offline handwritten Kannada word recognition. Popular subspace learning method, i.e. Principal Component Analysis is used for better representation of the given input word. The study is experimented on handwritten word comprising of 28 district names of Karnataka state. The experiment suggest grid based approach outperforms the standard global based approach.
{"title":"An impact of grid based approach in offline handwritten Kannada word recognition","authors":"M. Patel, S. L. Reddy","doi":"10.1109/IC3I.2014.7019825","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019825","url":null,"abstract":"The scanning of paper documents followed by the storage, retrieval, display, and management of the resulting electronic images, is known as document image processing, which is a subfield of Digital Image Processing. The main objective of the document image analysis is to recognize the text and graphics components in the images. Optical Character Recognition [OCR] is the process of converting the image obtained by scanning a text or a document into machine-editable format. OCR has practical potential applications in writer identification, forensic analysis handwriting, health care, legal, banking, postal services, etc. Recently, handwriting recognition is now gain spread lot of importance due to sources such as paper documents, photographs, touch-screens and other devices. In this paper we study the impact of grid based approach in offline handwritten Kannada word recognition. Popular subspace learning method, i.e. Principal Component Analysis is used for better representation of the given input word. The study is experimented on handwritten word comprising of 28 district names of Karnataka state. The experiment suggest grid based approach outperforms the standard global based approach.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"53 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129459602","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019584
Jyothi Thomas, G. Kulanthaivel
The role of the cervix in the pathogenesis of premature delivery is controversial. In a prospective, multicenter study of pregnant women, we used vaginal ultrasonography to measure the length of the cervix; we also documented the incidence of spontaneous delivery before 35 weeks' gestation. We performed vaginal ultrasonography at approximately 24 and 28 weeks of gestation in women with singleton pregnancies. We then assessed the relation between the length of the cervix and the risk of spontaneous preterm delivery. We examined 2915 women at approximately 24 weeks of gestation and 2531 of these women again at approximately 28 weeks. Spontaneous preterm delivery (at less than 35 weeks) occurred in 126 of the women (4.3 percent) examined at 24 weeks. The length of the cervix was normally distributed at 24 and 28 weeks (mean [SD], 35.28.3 mm and 33.78.5 mm, respectively). The relative risk of preterm delivery increased as the length of the cervix decreased. The paper discusses approximation properties of other possible types of nonlinearities that might be implemented by artificial neural networks. The daily registration has N cases that each of the well-known stimulus-answer couples represents. The objective of this work is to develop a function that allows finding the vector of entrance variables t to the vector of exit variables P. F is any function, in this case the electric power consumption. Their modeling with Artificial Neural Network (ANN) is Multi a Perceptron Layer (PMC). Another form of modeling it is using Interpolation Algorithms (AI). For the lengths measured at 28 weeks, the corresponding relative risks were 2.80, 3.52, 5.39, 9.57, 13.88, and 24.94 (P0.001 for values at or below the 50th percentile; P0.003 for values at the 75th percentile). The risk of spontaneous preterm delivery is increased in women who are found to have a short cervix by vaginal ultrasonography during pregnancy.
{"title":"Predicting the risk of newborns based on fuzzy clustering method with prediction risk assessment","authors":"Jyothi Thomas, G. Kulanthaivel","doi":"10.1109/IC3I.2014.7019584","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019584","url":null,"abstract":"The role of the cervix in the pathogenesis of premature delivery is controversial. In a prospective, multicenter study of pregnant women, we used vaginal ultrasonography to measure the length of the cervix; we also documented the incidence of spontaneous delivery before 35 weeks' gestation. We performed vaginal ultrasonography at approximately 24 and 28 weeks of gestation in women with singleton pregnancies. We then assessed the relation between the length of the cervix and the risk of spontaneous preterm delivery. We examined 2915 women at approximately 24 weeks of gestation and 2531 of these women again at approximately 28 weeks. Spontaneous preterm delivery (at less than 35 weeks) occurred in 126 of the women (4.3 percent) examined at 24 weeks. The length of the cervix was normally distributed at 24 and 28 weeks (mean [SD], 35.28.3 mm and 33.78.5 mm, respectively). The relative risk of preterm delivery increased as the length of the cervix decreased. The paper discusses approximation properties of other possible types of nonlinearities that might be implemented by artificial neural networks. The daily registration has N cases that each of the well-known stimulus-answer couples represents. The objective of this work is to develop a function that allows finding the vector of entrance variables t to the vector of exit variables P. F is any function, in this case the electric power consumption. Their modeling with Artificial Neural Network (ANN) is Multi a Perceptron Layer (PMC). Another form of modeling it is using Interpolation Algorithms (AI). For the lengths measured at 28 weeks, the corresponding relative risks were 2.80, 3.52, 5.39, 9.57, 13.88, and 24.94 (P0.001 for values at or below the 50th percentile; P0.003 for values at the 75th percentile). The risk of spontaneous preterm delivery is increased in women who are found to have a short cervix by vaginal ultrasonography during pregnancy.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"18 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124986849","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019805
M. Saranya, Arun K. Mohan, K. Anusudha
A Composite algorithm for improved image security is proposed by taking the advantages of DNA based image encryption and evolutionary algorithms (EA). A number of deoxyribonucleic acid (DNA) masks are created using logistic map function and DNA conversion rules. Then encryption is performed on the plain image to generate a number of cipher images. Finally, genetic algorithm (GA) is applied to find the best DNA mask. From the simulation results it is observed that the proposed scheme improves the level of security.
{"title":"A composite image cipher using DNA sequence and genetic algorithm","authors":"M. Saranya, Arun K. Mohan, K. Anusudha","doi":"10.1109/IC3I.2014.7019805","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019805","url":null,"abstract":"A Composite algorithm for improved image security is proposed by taking the advantages of DNA based image encryption and evolutionary algorithms (EA). A number of deoxyribonucleic acid (DNA) masks are created using logistic map function and DNA conversion rules. Then encryption is performed on the plain image to generate a number of cipher images. Finally, genetic algorithm (GA) is applied to find the best DNA mask. From the simulation results it is observed that the proposed scheme improves the level of security.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131118782","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 : 2014-11-01DOI: 10.1109/IC3I.2014.7019622
K. Jeevan, S. Krishnakumar
Hexagonal geometry has some advantageous like higher sampling efficiency, consistent connectivity and higher angular resolution. In addition to these advantages, the layout of photo-receptors in the human retina is more closely resembles to the hexagonal structure. It is due to these reasons many researchers have studied the possibility of using a hexagonal structure to represent digital images. Wavelet also have its own advantage and combining wavelet and processing of images in Hexagonal grid, that also will give better performance, because hexagonal wavelet includes the advantages of the hexagonal grid along with the wavelets. In this wok, the wavelet based image compression is performed on both square as well as hexagonal sampled images and the performance is compared using Mean Square Error (MSE) and Peak Signal to Noise Ratio (PSNR). Gabor filter is used for the interpolation of hexagonally sampled images. Compression on hexagonal domain gives better results compared to compression on rectangular domain.
{"title":"Compression of images represented in hexagonal lattice using wavelet and gabor filter","authors":"K. Jeevan, S. Krishnakumar","doi":"10.1109/IC3I.2014.7019622","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019622","url":null,"abstract":"Hexagonal geometry has some advantageous like higher sampling efficiency, consistent connectivity and higher angular resolution. In addition to these advantages, the layout of photo-receptors in the human retina is more closely resembles to the hexagonal structure. It is due to these reasons many researchers have studied the possibility of using a hexagonal structure to represent digital images. Wavelet also have its own advantage and combining wavelet and processing of images in Hexagonal grid, that also will give better performance, because hexagonal wavelet includes the advantages of the hexagonal grid along with the wavelets. In this wok, the wavelet based image compression is performed on both square as well as hexagonal sampled images and the performance is compared using Mean Square Error (MSE) and Peak Signal to Noise Ratio (PSNR). Gabor filter is used for the interpolation of hexagonally sampled images. Compression on hexagonal domain gives better results compared to compression on rectangular domain.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125431691","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
扫码关注我们
求助内容：
应助结果提醒方式：