Clustering of high dimensionality data which can be seen in almost all fields these days is becoming very tedious process. The key disadvantage of high dimensional data which we can pen down is curse of dimensionality. As the magnitude of datasets grows the data points become sparse and density of area becomes less making it difficult to cluster that data which further reduces the performance of traditional algorithms used for clustering. To route these toils, hubness based algorithms were introduced. These algorithms which influences the distribution of the data points among the k-nearest neighbor. The hubness is an unguided method which finds out which points appear more frequently in the k-nearest neighbor than other points in the dataset. Mainly three algorithms are used for hub based clustering such as K-hubs, Hubness proportional clustering and Hubness proportional K-means. K-hubs algorithm is used to initialize the hubs for the clusters. Hubness Proportional Clustering (HPC) algorithm is used group the probabilistic data models. Hubness Proportional K-Means (HPKM) algorithm integrates the hubness based centroid selection and partitioning process. These algorithms are basically used for increasing the efficiency and increasing predicting accuracy of the system. The main drawback of in this method is number of iteration increasing with dimensionality is increased. To overcome this drawback a new algorithm is proposed which is based on the combination of kernel mapping and hubness phenomenon. The proposed algorithm detects arbitrary shaped clusters in the dataset and also improves the performance of clustering by minimizing the intra-cluster distance and maximizing the inter-cluster distance which improves the cluster quality.
{"title":"A Novel Approach for Clustering High Dimensional Data Using Kernal Hubness","authors":"M. Amina, Farook K. Syed","doi":"10.1109/ICACC.2015.67","DOIUrl":"https://doi.org/10.1109/ICACC.2015.67","url":null,"abstract":"Clustering of high dimensionality data which can be seen in almost all fields these days is becoming very tedious process. The key disadvantage of high dimensional data which we can pen down is curse of dimensionality. As the magnitude of datasets grows the data points become sparse and density of area becomes less making it difficult to cluster that data which further reduces the performance of traditional algorithms used for clustering. To route these toils, hubness based algorithms were introduced. These algorithms which influences the distribution of the data points among the k-nearest neighbor. The hubness is an unguided method which finds out which points appear more frequently in the k-nearest neighbor than other points in the dataset. Mainly three algorithms are used for hub based clustering such as K-hubs, Hubness proportional clustering and Hubness proportional K-means. K-hubs algorithm is used to initialize the hubs for the clusters. Hubness Proportional Clustering (HPC) algorithm is used group the probabilistic data models. Hubness Proportional K-Means (HPKM) algorithm integrates the hubness based centroid selection and partitioning process. These algorithms are basically used for increasing the efficiency and increasing predicting accuracy of the system. The main drawback of in this method is number of iteration increasing with dimensionality is increased. To overcome this drawback a new algorithm is proposed which is based on the combination of kernel mapping and hubness phenomenon. The proposed algorithm detects arbitrary shaped clusters in the dataset and also improves the performance of clustering by minimizing the intra-cluster distance and maximizing the inter-cluster distance which improves the cluster quality.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129922848","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}
Clustering DNA sequences of Aspergillus fumigatus is a process that groups a set of sequences into clusters such that the similarity among sequences in the same cluster is high, while that among the sequences in different clusters is low. The main objective of this clustering is to obtain a more refined clustering techinque inorder to analyze biological data and to bunch DNA sequences to many clusters more easily. CDHIT and DNACLUST are the two existing approaches used in bioinformatics for clustering sequences. The major disadvantage of both approach is that longest sequence is selected as the cluster representative. As DNA sequences are enomorous in number, the traditional clustering algorithm are infeasible for analysis. To handle such large DNA sequences, a modified version of incremental clustering using multiple medoids has been proposed. The key idea is to find multiple representative sequences like medoids to represent a cluster in a chunk and final DNA analysis is carried out based on those identified medoids from all the chunks. The main advantage of this incremental clustering is that it uses multiple medoids to represent each cluster in each chunk which capture the pattern structure more accurately. Not only that it overcomes the disadvantages of existing techniques but also has the mechanism to make use of DNA sequence relationship among those identified medoids that serves as a side information to help the final DNA sequence clustering. The proposed incremental approach outperforms existing clustering approaches in terms of clustering accuracy.
{"title":"Clustering DNA Sequences of Aspergillus Fumigatus Using Incremental Multiple Medoids","authors":"T. Ajayan, P. Sony, Janu R. Panicker, S. Shailesh","doi":"10.1109/ICACC.2015.19","DOIUrl":"https://doi.org/10.1109/ICACC.2015.19","url":null,"abstract":"Clustering DNA sequences of Aspergillus fumigatus is a process that groups a set of sequences into clusters such that the similarity among sequences in the same cluster is high, while that among the sequences in different clusters is low. The main objective of this clustering is to obtain a more refined clustering techinque inorder to analyze biological data and to bunch DNA sequences to many clusters more easily. CDHIT and DNACLUST are the two existing approaches used in bioinformatics for clustering sequences. The major disadvantage of both approach is that longest sequence is selected as the cluster representative. As DNA sequences are enomorous in number, the traditional clustering algorithm are infeasible for analysis. To handle such large DNA sequences, a modified version of incremental clustering using multiple medoids has been proposed. The key idea is to find multiple representative sequences like medoids to represent a cluster in a chunk and final DNA analysis is carried out based on those identified medoids from all the chunks. The main advantage of this incremental clustering is that it uses multiple medoids to represent each cluster in each chunk which capture the pattern structure more accurately. Not only that it overcomes the disadvantages of existing techniques but also has the mechanism to make use of DNA sequence relationship among those identified medoids that serves as a side information to help the final DNA sequence clustering. The proposed incremental approach outperforms existing clustering approaches in terms of clustering accuracy.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129699742","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}
Visual Cryptography is an approach to share secrets, basically images, which are divided into n shares using the basic principles of Shamir Secret Sharing Schemes. In (t, n) system, the secrets can be retrieved by combining t number of threshold shares from n shares. In the existing system, the attacks by malicious outsider and malicious participant cannot be detected. In this paper, a double security system using transform domain along with the key verification has been proposed to overcome these attacks. Security analysis and quality evaluations ensures that the system is highly secure.
{"title":"A Double Security Approach for Visual Cryptography Using Transform Domain","authors":"A. Ravikumar, L. Mredhula","doi":"10.1109/ICACC.2015.32","DOIUrl":"https://doi.org/10.1109/ICACC.2015.32","url":null,"abstract":"Visual Cryptography is an approach to share secrets, basically images, which are divided into n shares using the basic principles of Shamir Secret Sharing Schemes. In (t, n) system, the secrets can be retrieved by combining t number of threshold shares from n shares. In the existing system, the attacks by malicious outsider and malicious participant cannot be detected. In this paper, a double security system using transform domain along with the key verification has been proposed to overcome these attacks. Security analysis and quality evaluations ensures that the system is highly secure.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129054327","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}
A new method of model order reduction technique for interval system is proposed here. The reduced order denominator coefficients are determined by combined benefits of reciprocal transformation, principal pseudo break frequency and a new method of eigen spectrum analysis. Then the reduced order numerator coefficients are obtained using polynomial coefficient matching method. Optimization method can also be used for determining the coefficients of reduced order numerator. In this paper Luus -- Jaakola optimization technique is tried. This method guaranteed a stable reduced order model for the stable higher order system along with performance matching. The illustrated examples using MATLAB simulation show the effectiveness of the proposed method.
{"title":"Eigen Value Computation Based Approach for Reduced Order Modeling for Interval Systems","authors":"Anju Kalangadan, N. Priya, T. S. Sunil Kumar","doi":"10.1109/ICACC.2015.73","DOIUrl":"https://doi.org/10.1109/ICACC.2015.73","url":null,"abstract":"A new method of model order reduction technique for interval system is proposed here. The reduced order denominator coefficients are determined by combined benefits of reciprocal transformation, principal pseudo break frequency and a new method of eigen spectrum analysis. Then the reduced order numerator coefficients are obtained using polynomial coefficient matching method. Optimization method can also be used for determining the coefficients of reduced order numerator. In this paper Luus -- Jaakola optimization technique is tried. This method guaranteed a stable reduced order model for the stable higher order system along with performance matching. The illustrated examples using MATLAB simulation show the effectiveness of the proposed method.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117063627","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}
An improved algorithm to compress fingerprint images based on sparse representation is proposed. The algorithm includes two parts namely, construction of the dictionary and the compression process. In order to construct the dictionary, recursive least squares dictionary learning algorithm (RLS-DLA) is used. In RLS-DLA, any given fingerprint is divided into small blocks called patches. Then sparse coding is performed on each patch and the dictionary is continuously updated. Each patch is represented as a linear combination of a few columns from the pre-constructed fingerprint dictionary, which leads to compression. To compute a linear expansion of the current patch, orthogonal projection of the patch on the pre-constructed dictionary element is done. Then the representation is quantized and encoded. The results obtained through RLS-DLA shows improvement of 2.98% in PSNR compared to K-singular value decomposition (K-SVD) dictionary learning algorithm.
{"title":"An Improved Algorithm for Fingerprint Compression Based on Sparse Representation","authors":"Sinju P. Elias, P. Mythili","doi":"10.1109/ICACC.2015.84","DOIUrl":"https://doi.org/10.1109/ICACC.2015.84","url":null,"abstract":"An improved algorithm to compress fingerprint images based on sparse representation is proposed. The algorithm includes two parts namely, construction of the dictionary and the compression process. In order to construct the dictionary, recursive least squares dictionary learning algorithm (RLS-DLA) is used. In RLS-DLA, any given fingerprint is divided into small blocks called patches. Then sparse coding is performed on each patch and the dictionary is continuously updated. Each patch is represented as a linear combination of a few columns from the pre-constructed fingerprint dictionary, which leads to compression. To compute a linear expansion of the current patch, orthogonal projection of the patch on the pre-constructed dictionary element is done. Then the representation is quantized and encoded. The results obtained through RLS-DLA shows improvement of 2.98% in PSNR compared to K-singular value decomposition (K-SVD) dictionary learning algorithm.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124531843","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}
Fourth generation cellular networks use Orthogonal Frequency Division Multiple Access (OFDMA) as the multiple access technique. It allows multiple users to transmit simultaneously on different subcarriers per OFDM symbol, thereby reducing the effect of multipath fading. To enhance indoor coverage and reduce traffic within macrocells, femtocells are introduced. Femtocells can be efficiently deployed in the existing macrocell networks and both uses same spectrum. To fully realize the potential of these networks, resources must be properly allocated such that interference between macrocell and femtocell is mitigated. In this paper a joint subchannel and power allocation algorithm is used to improve the performance of OFDMA femtocell networks. This method seems to give better performance than the existing methods in terms of fairness.
{"title":"Fairness Improvement in OFDMA Femtocell Networks","authors":"Y. A. Sandhya, P. Swapna, S. Pillai","doi":"10.1109/ICACC.2015.57","DOIUrl":"https://doi.org/10.1109/ICACC.2015.57","url":null,"abstract":"Fourth generation cellular networks use Orthogonal Frequency Division Multiple Access (OFDMA) as the multiple access technique. It allows multiple users to transmit simultaneously on different subcarriers per OFDM symbol, thereby reducing the effect of multipath fading. To enhance indoor coverage and reduce traffic within macrocells, femtocells are introduced. Femtocells can be efficiently deployed in the existing macrocell networks and both uses same spectrum. To fully realize the potential of these networks, resources must be properly allocated such that interference between macrocell and femtocell is mitigated. In this paper a joint subchannel and power allocation algorithm is used to improve the performance of OFDMA femtocell networks. This method seems to give better performance than the existing methods in terms of fairness.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123323344","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}
A new design for metamaterial absorber with triple band in X band range is proposed for Radar cross section reduction in stealth technology. The proposed metamaterial absorber has the advantage of ease design. It is a three layered structure, designed with modified ring resonators printed on a dielectric material with a metal ground. By proper tuning of the geometry parameters of the structure, a triple band metamaterial absorber is achieved and it is adjusted to match the effective impedance of metamaterial absorber to the free space. Hence, there is no wave transmission, minimized reflection and the absorption rate is maximized in all the bands. The resonant frequency bands are at 7.7 GHz, 9.2 GHz and 11.1 GHz with absorption rates of 99.7%, 98% and 94% respectively. The bandwidths measured at the triple band are 0.2757 GHz, 0.311 GHz and 0.2182 GHz. The total miniaturized metamaterial absorber unit cell size is 6 mm × 12 mm × 0.705 mm. Simulation results show that the proposed absorber with triple band and with high absorption rate is well suited for Radar cross section reduction in stealth technology.
{"title":"Design of New Metamaterial Absorber with Triple Band for Radar Cross Section Reduction","authors":"S. Ramya, I. S. Rao","doi":"10.1109/ICACC.2015.12","DOIUrl":"https://doi.org/10.1109/ICACC.2015.12","url":null,"abstract":"A new design for metamaterial absorber with triple band in X band range is proposed for Radar cross section reduction in stealth technology. The proposed metamaterial absorber has the advantage of ease design. It is a three layered structure, designed with modified ring resonators printed on a dielectric material with a metal ground. By proper tuning of the geometry parameters of the structure, a triple band metamaterial absorber is achieved and it is adjusted to match the effective impedance of metamaterial absorber to the free space. Hence, there is no wave transmission, minimized reflection and the absorption rate is maximized in all the bands. The resonant frequency bands are at 7.7 GHz, 9.2 GHz and 11.1 GHz with absorption rates of 99.7%, 98% and 94% respectively. The bandwidths measured at the triple band are 0.2757 GHz, 0.311 GHz and 0.2182 GHz. The total miniaturized metamaterial absorber unit cell size is 6 mm × 12 mm × 0.705 mm. Simulation results show that the proposed absorber with triple band and with high absorption rate is well suited for Radar cross section reduction in stealth technology.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123385059","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}
In this paper we have designed high speed Adder based hardware efficient Discrete Cosine Transform (DCT) Algorithm, which process data in a sequential form at high data rate. We designed a novel DCT by using orthogonal property and compared with conventional DCT in terms of number of cells, cell area, leakage power, internal power, net power, switching power, delay and power delay product (PDP). In comparison with multiplier based conventional DCT and Adder based Conventional DCT, the net power dissipation is reduced by 32%. The proposed Adder based DCT net power Dissipation is reduced by 47% less and multiplier based proposed DCT is reduced by 38%. Here we have used Cadence RTL 180nm Technology to implement the design.
{"title":"Design and Analysis of a Novel High Speed Adder Based Hardware Efficient Discrete Cosine Transform (DCT)","authors":"K. R. Kiran, C. Kumar, M. S. Kumar","doi":"10.1109/ICACC.2015.88","DOIUrl":"https://doi.org/10.1109/ICACC.2015.88","url":null,"abstract":"In this paper we have designed high speed Adder based hardware efficient Discrete Cosine Transform (DCT) Algorithm, which process data in a sequential form at high data rate. We designed a novel DCT by using orthogonal property and compared with conventional DCT in terms of number of cells, cell area, leakage power, internal power, net power, switching power, delay and power delay product (PDP). In comparison with multiplier based conventional DCT and Adder based Conventional DCT, the net power dissipation is reduced by 32%. The proposed Adder based DCT net power Dissipation is reduced by 47% less and multiplier based proposed DCT is reduced by 38%. Here we have used Cadence RTL 180nm Technology to implement the design.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115517786","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}
A. Deshmukh, A. Desai, S. Shaikh, K. Lele, Shafin Nagarbowdi, K. Ray
Modified rectangular shape ultra wide band microstrip antenna with microstrip line feed is proposed. The effects of tapering structure on the realized bandwidth are discussed. The tapered end configuration yields bandwidth of 15.4 GHz with a peak gain of 2 dBi. Further, the effect of replacing the tapered end structure with an elliptical base structure is investigated. The elliptical base antenna yields slightly increased bandwidth and peak gain of 15.6 GHz and 2.3 dBi, respectively. Further effects of cutting slots in the ground plane of elliptical base structure were studied. The slot optimizes the resonance frequencies and impedance of fundamental and higher order modes, to yield bandwidth of more than 16 GHz with a peak gain of 2.6 dBi.
{"title":"Modified Rectangular Ultra Wideband Microstrip Antenna","authors":"A. Deshmukh, A. Desai, S. Shaikh, K. Lele, Shafin Nagarbowdi, K. Ray","doi":"10.1109/ICACC.2015.31","DOIUrl":"https://doi.org/10.1109/ICACC.2015.31","url":null,"abstract":"Modified rectangular shape ultra wide band microstrip antenna with microstrip line feed is proposed. The effects of tapering structure on the realized bandwidth are discussed. The tapered end configuration yields bandwidth of 15.4 GHz with a peak gain of 2 dBi. Further, the effect of replacing the tapered end structure with an elliptical base structure is investigated. The elliptical base antenna yields slightly increased bandwidth and peak gain of 15.6 GHz and 2.3 dBi, respectively. Further effects of cutting slots in the ground plane of elliptical base structure were studied. The slot optimizes the resonance frequencies and impedance of fundamental and higher order modes, to yield bandwidth of more than 16 GHz with a peak gain of 2.6 dBi.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115580708","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}
D. Sathyanath, M. P. Jayakrishnan, H. P. Thushara, S. Mridula, P. Mohanan
The proposed study investigates the feasibility of a microwave based sensor - the Split Ring Resonator (SRR) and its complementary structure (CSRR), as a non/minimally invasive blood glucose monitoring system. The technique is based on observing the change in resonance frequency of the resonators which is a function of their geometry and the dielectric constant of the surrounding medium. Here the change in dielectric constant of blood due to variation of glucose level is subject to study. Analysis has been carried out using the resonator in simulation and confirmed through experimental studies. A linear response is obtained from the sensor with variation of glucose level up to a certain level, which promises future of CSRR as an efficient biosensor.
本研究探讨了一种基于微波传感器的劈裂环谐振器(Split Ring Resonator, SRR)及其互补结构(complementary structure, CSRR)作为无/微创血糖监测系统的可行性。该技术是基于观察谐振器谐振频率的变化，这是谐振器几何形状和周围介质介电常数的函数。在这里，由于葡萄糖水平的变化而引起的血液介电常数的变化是值得研究的。利用该谐振器进行了仿真分析，并通过实验研究进行了验证。该传感器在一定程度上随葡萄糖水平的变化呈线性响应，预示着CSRR作为一种高效的生物传感器的发展前景。
{"title":"Microwave Based Biosensor for Blood Glucose Monitoring","authors":"D. Sathyanath, M. P. Jayakrishnan, H. P. Thushara, S. Mridula, P. Mohanan","doi":"10.1109/ICACC.2015.56","DOIUrl":"https://doi.org/10.1109/ICACC.2015.56","url":null,"abstract":"The proposed study investigates the feasibility of a microwave based sensor - the Split Ring Resonator (SRR) and its complementary structure (CSRR), as a non/minimally invasive blood glucose monitoring system. The technique is based on observing the change in resonance frequency of the resonators which is a function of their geometry and the dielectric constant of the surrounding medium. Here the change in dielectric constant of blood due to variation of glucose level is subject to study. Analysis has been carried out using the resonator in simulation and confirmed through experimental studies. A linear response is obtained from the sensor with variation of glucose level up to a certain level, which promises future of CSRR as an efficient biosensor.","PeriodicalId":368544,"journal":{"name":"2015 Fifth International Conference on Advances in Computing and Communications (ICACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130804361","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
扫码关注我们
求助内容：
应助结果提醒方式：