Pub Date : 2012-04-03DOI: 10.1109/NCC.2012.6176800
Sarada Prasad Gochhayat, P. Venkataram
A ubiquitous network plays a critical role to provide rendered services to ubiquitous application running nodes. To provide appropriate resources the nodes are needed to be monitored continuously. Monitoring a node in ubiquitous network is challenging because of dynamicity and heterogeneity of the ubiquitous network. The network monitor has to monitor resource parameters, like data rate, delay and throughput, as well as events such as node failure, network failure and fault in the system to curb the system failure. In this paper, we propose a method to develop a ubiquitous system monitoring protocol using agents. Earlier works on network monitoring using agents consider that the agents are designed for particular network. While in our work the heterogeneity property of the network has been considered. We have shown that the nodes' behaviour can be easily monitored by using agents (both static and mobile agent). The past behavior of the application and network, and past history of the Unode and the predecessor are taken into consideration to help SA to take appropriate decision during the time of emergency situation like unavailability of resources at the local administration, and to predict the migration of the Unode based on the previous node history. The results obtained in the simulation reflects the effectiveness of the technique.
{"title":"A method of developing an agent based ubiquitous node monitoring protocol","authors":"Sarada Prasad Gochhayat, P. Venkataram","doi":"10.1109/NCC.2012.6176800","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176800","url":null,"abstract":"A ubiquitous network plays a critical role to provide rendered services to ubiquitous application running nodes. To provide appropriate resources the nodes are needed to be monitored continuously. Monitoring a node in ubiquitous network is challenging because of dynamicity and heterogeneity of the ubiquitous network. The network monitor has to monitor resource parameters, like data rate, delay and throughput, as well as events such as node failure, network failure and fault in the system to curb the system failure. In this paper, we propose a method to develop a ubiquitous system monitoring protocol using agents. Earlier works on network monitoring using agents consider that the agents are designed for particular network. While in our work the heterogeneity property of the network has been considered. We have shown that the nodes' behaviour can be easily monitored by using agents (both static and mobile agent). The past behavior of the application and network, and past history of the Unode and the predecessor are taken into consideration to help SA to take appropriate decision during the time of emergency situation like unavailability of resources at the local administration, and to predict the migration of the Unode based on the previous node history. The results obtained in the simulation reflects the effectiveness of the technique.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131386621","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176801
J. B. Tamakuwala
LDPC codes are among the few FEC schemes that have been used for distributed data compression schemes, like the Slepian-Wolf encoding. An LDPC code having good degree distribution polynomials, along with a large girth and large minimum distance, can compress close to the Slepian-Wolf limit. In this paper, we describe a method to choose good degree distribution polynomials and the corresponding code construction for binary sources. Furthermore, the performance of the proposed compression scheme is also demonstrated. In selected cases, we improve the best schemes reported in literature.
{"title":"LDPC codes for the Slepian-Wolf coding","authors":"J. B. Tamakuwala","doi":"10.1109/NCC.2012.6176801","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176801","url":null,"abstract":"LDPC codes are among the few FEC schemes that have been used for distributed data compression schemes, like the Slepian-Wolf encoding. An LDPC code having good degree distribution polynomials, along with a large girth and large minimum distance, can compress close to the Slepian-Wolf limit. In this paper, we describe a method to choose good degree distribution polynomials and the corresponding code construction for binary sources. Furthermore, the performance of the proposed compression scheme is also demonstrated. In selected cases, we improve the best schemes reported in literature.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134207282","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176751
P. Mankar, S. S. Pathak, R. V. Rajakumar
Cognitive radio is a way of opportunistically sharing the scarce spectrum among licensed and unlicensed users of the spectrum. One of the key challenges in deploying cognitive radio networks (CRNs) is to find out the spectrum holes in the primary (licensed) wireless systems for allowing the secondary (unlicensed) users to share. In order to detect spectrum holes, CRN needs to sense the spectrum to find whether the primary user (PU) is available. In this paper, a cooperative algorithm to estimate the PU location and its coverage, based on received signal strength (RSS) at several local secondary users (SUs) locations, is presented. Maximum likelihood (ML) algorithm is used to estimate the PU locations and its transmission power. Locations of SUs are estimated using Time Difference of Arrival (TDOA) method and the cooperation among the Cognitive Radio Base Stations (CBSs) of CRN. For the convenience of analysis we take error as Euclidian distance between actual location and estimated location. The performance evaluation uses the mean error as a metric.
{"title":"A cooperative secondary user localization based primary user localization method for cognitive radio networks","authors":"P. Mankar, S. S. Pathak, R. V. Rajakumar","doi":"10.1109/NCC.2012.6176751","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176751","url":null,"abstract":"Cognitive radio is a way of opportunistically sharing the scarce spectrum among licensed and unlicensed users of the spectrum. One of the key challenges in deploying cognitive radio networks (CRNs) is to find out the spectrum holes in the primary (licensed) wireless systems for allowing the secondary (unlicensed) users to share. In order to detect spectrum holes, CRN needs to sense the spectrum to find whether the primary user (PU) is available. In this paper, a cooperative algorithm to estimate the PU location and its coverage, based on received signal strength (RSS) at several local secondary users (SUs) locations, is presented. Maximum likelihood (ML) algorithm is used to estimate the PU locations and its transmission power. Locations of SUs are estimated using Time Difference of Arrival (TDOA) method and the cooperation among the Cognitive Radio Base Stations (CBSs) of CRN. For the convenience of analysis we take error as Euclidian distance between actual location and estimated location. The performance evaluation uses the mean error as a metric.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134267012","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176754
Debasish Bera, S. S. Pathak, I. Chakrabarti
In this paper, normal factor graph (NFG) based probabilistic inference approach for the cooperative spectrum sensing in cognitive radio (CR) is presented. Spectrum sensing problem is modeled as binary hypothesis testing problem. We have formulated the joint probability function with all latent and manifest variables which describe the system. Then decompose the joint distribution function into simpler conditional probability functions and represent them through normal factor graph. The exact marginalization is computed by passing the messages (probability values) among the nodes and edges using Sum-product-algorithm (SPA) / Belief-propagation (BP) algorithm. We compute messages for null and alternate hypothesis and apply Neyman-Pearson (NP) theorem based Likelihood ratio test (LRT) for optimal decision at fusion center. We consider non-central chi-square distribution for alternate hypothesis (H1). It is assumed that secondary users (SUs) are independently sensing the primary user (PU), therefore the graph has no cycle. It is employing energy detector based local sensing with hard decision. We consider non-ideal channel conditions for both PU-SU and SU-FC channels. Initially flat-fading, time-invariant channels with AWGN between PU-SUs and binary symmetric channels (BSC) and AWGN channels between SUs and fusion center (FC) are considered. Simulation results show that proposed methods improves the performance of the cooperative spectrum sensing.
{"title":"A normal factor graph approach for co-operative spectrum sensing in cognitive radio","authors":"Debasish Bera, S. S. Pathak, I. Chakrabarti","doi":"10.1109/NCC.2012.6176754","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176754","url":null,"abstract":"In this paper, normal factor graph (NFG) based probabilistic inference approach for the cooperative spectrum sensing in cognitive radio (CR) is presented. Spectrum sensing problem is modeled as binary hypothesis testing problem. We have formulated the joint probability function with all latent and manifest variables which describe the system. Then decompose the joint distribution function into simpler conditional probability functions and represent them through normal factor graph. The exact marginalization is computed by passing the messages (probability values) among the nodes and edges using Sum-product-algorithm (SPA) / Belief-propagation (BP) algorithm. We compute messages for null and alternate hypothesis and apply Neyman-Pearson (NP) theorem based Likelihood ratio test (LRT) for optimal decision at fusion center. We consider non-central chi-square distribution for alternate hypothesis (H1). It is assumed that secondary users (SUs) are independently sensing the primary user (PU), therefore the graph has no cycle. It is employing energy detector based local sensing with hard decision. We consider non-ideal channel conditions for both PU-SU and SU-FC channels. Initially flat-fading, time-invariant channels with AWGN between PU-SUs and binary symmetric channels (BSC) and AWGN channels between SUs and fusion center (FC) are considered. Simulation results show that proposed methods improves the performance of the cooperative spectrum sensing.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117048511","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176907
C. Pujara, V. Veera, A. Kumar, N. Reddy, V. Tholath
With the production of 3D movies like `Avatar', demand for 3D content has seen enormous growth. With the development of advanced display and capturing technologies, 3D has become popular now a day. In this paper, techniques to implement stereo video (H.264/MVC coded) decoding and rendering on dual-core processors have been described. Depending on the type of display techniques used to display 3D video, different 3D formats are used to appropriately render it. E.g. Anaglyph for 2D screen, side by side, top bottom, checker board (DLP), frame sequential for 3D TVs. Format conversion is implemented as a post processing module and final 3D format data is fed to the device. Format conversion and rendering is also a cycle consuming task which is independent of video decoding. We here propose to decode the stereo video on one core and rendering and format conversion on the other core of a dual-core processor. Proposed idea has been implemented on Intel dual core architecture and on OMAP4 platform having ARM Cortex-A9 dual core processor. Results show that total decoding and rendering time can be brought closer to decoding time using dual core architecture under assumption that decoding time is greater than the rendering time which is the case generally.
{"title":"Real-time stereo video decoding and rendering on multi-core architecture","authors":"C. Pujara, V. Veera, A. Kumar, N. Reddy, V. Tholath","doi":"10.1109/NCC.2012.6176907","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176907","url":null,"abstract":"With the production of 3D movies like `Avatar', demand for 3D content has seen enormous growth. With the development of advanced display and capturing technologies, 3D has become popular now a day. In this paper, techniques to implement stereo video (H.264/MVC coded) decoding and rendering on dual-core processors have been described. Depending on the type of display techniques used to display 3D video, different 3D formats are used to appropriately render it. E.g. Anaglyph for 2D screen, side by side, top bottom, checker board (DLP), frame sequential for 3D TVs. Format conversion is implemented as a post processing module and final 3D format data is fed to the device. Format conversion and rendering is also a cycle consuming task which is independent of video decoding. We here propose to decode the stereo video on one core and rendering and format conversion on the other core of a dual-core processor. Proposed idea has been implemented on Intel dual core architecture and on OMAP4 platform having ARM Cortex-A9 dual core processor. Results show that total decoding and rendering time can be brought closer to decoding time using dual core architecture under assumption that decoding time is greater than the rendering time which is the case generally.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124051979","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176808
M. Faruk Ali, S. Ray
In this paper, theoretical investigation has been carried out to determine the usefulness of electromagnetic wave for detection and selective destruction of bacteria colony at THz frequencies. To carry out the investigation, a realistic three dimensional electrical model of bacteria colony has been developed and placed between a pair of dipole antennas designed at THz frequencies. The model is simulated using Finite Difference in Time Domain (FDTD) based in-house numerical code developed with MATLAB. Results obtained from the simulations show that significant electromagnetic energy absorption occurs in the bacteria cell at THz frequencies near their electrical resonance frequencies. THz frequencies are also found suitable for detection of dimensions and density of bacteria cells in a colony, and selectively destroy them.
{"title":"Detection and selective destruction of bacteria colony at THz frequencies","authors":"M. Faruk Ali, S. Ray","doi":"10.1109/NCC.2012.6176808","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176808","url":null,"abstract":"In this paper, theoretical investigation has been carried out to determine the usefulness of electromagnetic wave for detection and selective destruction of bacteria colony at THz frequencies. To carry out the investigation, a realistic three dimensional electrical model of bacteria colony has been developed and placed between a pair of dipole antennas designed at THz frequencies. The model is simulated using Finite Difference in Time Domain (FDTD) based in-house numerical code developed with MATLAB. Results obtained from the simulations show that significant electromagnetic energy absorption occurs in the bacteria cell at THz frequencies near their electrical resonance frequencies. THz frequencies are also found suitable for detection of dimensions and density of bacteria cells in a colony, and selectively destroy them.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124516790","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176780
S. Nallagonda, S. D. Roy, S. Kundu
Performance of cooperative spectrum sensing has been assessed in presence of Rayleigh fading. Cognitive radio (CR) users which employ energy detectors are censored depending on the quality of radio channels between them and a fusion center (FC). A training based channel estimator is used at the FC to estimate the complex Gaussian fading coefficients characterizing the channels between the CR users and the FC. This channel state information (CSI) on fading coefficients is used for censoring the CR users. Each CR makes a hard decision about the primary user (PU) using energy detection and transmits the information to the FC using BPSK signaling if the CR user is selected to transmit. Several fusion rules such as OR logic, majority logic, likelihood ratio test (LRT) fusion are applied at the FC for estimating the performance in terms of missed detection probability (Pm). Comparative performance of fusion rules in terms of probability of missed detection has been evaluated under both perfect and imperfect channel estimation for various probabilities of false alarm (Pf), average reporting and sensing channel SNR values.
{"title":"Cooperative spectrum sensing with censoring of cognitive radios in Rayleigh fading channel","authors":"S. Nallagonda, S. D. Roy, S. Kundu","doi":"10.1109/NCC.2012.6176780","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176780","url":null,"abstract":"Performance of cooperative spectrum sensing has been assessed in presence of Rayleigh fading. Cognitive radio (CR) users which employ energy detectors are censored depending on the quality of radio channels between them and a fusion center (FC). A training based channel estimator is used at the FC to estimate the complex Gaussian fading coefficients characterizing the channels between the CR users and the FC. This channel state information (CSI) on fading coefficients is used for censoring the CR users. Each CR makes a hard decision about the primary user (PU) using energy detection and transmits the information to the FC using BPSK signaling if the CR user is selected to transmit. Several fusion rules such as OR logic, majority logic, likelihood ratio test (LRT) fusion are applied at the FC for estimating the performance in terms of missed detection probability (Pm). Comparative performance of fusion rules in terms of probability of missed detection has been evaluated under both perfect and imperfect channel estimation for various probabilities of false alarm (Pf), average reporting and sensing channel SNR values.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128160742","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176847
S. Kadhe, Sandhyasree Thaskani, M. Chandra, B. S. Adiga
The resource-constraints in the sensor networks make reliable data communication a challenging task. Particularly, the limited availability of battery and computing power necessitates designing computationally efficient means for providing data compression and protection against data loss. In this paper, we propose to integrate the emerging framework of compressive sensing (CS) with real expander codes (RECs), coined as CS-REC, for robust data transmission. CS works as a computationally inexpensive data compression scheme, while RECs act as an elegant application layer erasure coding scheme. The benefits provided by RECs are twofold: one, RECs require only few addition-subtraction operations over real numbers for encoding and decoding; two, they provide graceful degradation in recovery performance with increase in the number of erasures. Through elaborate simulations, we show that CS-REC can achieve the recovery performance close to the case where there is no data loss. Further, again via simulations, we demonstrate the usefulness of CS-REC for reliably transmitting image data in multimedia sensor networks.
{"title":"Reliable data transmission in sensor networks using compressive sensing and real expander codes","authors":"S. Kadhe, Sandhyasree Thaskani, M. Chandra, B. S. Adiga","doi":"10.1109/NCC.2012.6176847","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176847","url":null,"abstract":"The resource-constraints in the sensor networks make reliable data communication a challenging task. Particularly, the limited availability of battery and computing power necessitates designing computationally efficient means for providing data compression and protection against data loss. In this paper, we propose to integrate the emerging framework of compressive sensing (CS) with real expander codes (RECs), coined as CS-REC, for robust data transmission. CS works as a computationally inexpensive data compression scheme, while RECs act as an elegant application layer erasure coding scheme. The benefits provided by RECs are twofold: one, RECs require only few addition-subtraction operations over real numbers for encoding and decoding; two, they provide graceful degradation in recovery performance with increase in the number of erasures. Through elaborate simulations, we show that CS-REC can achieve the recovery performance close to the case where there is no data loss. Further, again via simulations, we demonstrate the usefulness of CS-REC for reliably transmitting image data in multimedia sensor networks.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128606448","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176812
R. U. Mahesh, A. Chaturvedi
In this paper, we consider the effect of fractional timing and carrier frequency offsets on the performance of BPSK-OFDM systems in additive white Gaussian noise (AWGN) and flat Rayleigh fading channels. Closed form bit error rate (BER) expressions for BPSK-OFDM systems impaired by timing and carrier frequency offsets are derived. Simulation results are provided to verify the accuracy of the theoretical analysis.
{"title":"Closed form BER expressions for BPSK OFDM systems with fractional timing offset and carrier frequency offset","authors":"R. U. Mahesh, A. Chaturvedi","doi":"10.1109/NCC.2012.6176812","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176812","url":null,"abstract":"In this paper, we consider the effect of fractional timing and carrier frequency offsets on the performance of BPSK-OFDM systems in additive white Gaussian noise (AWGN) and flat Rayleigh fading channels. Closed form bit error rate (BER) expressions for BPSK-OFDM systems impaired by timing and carrier frequency offsets are derived. Simulation results are provided to verify the accuracy of the theoretical analysis.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127373503","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176908
K. P. Reddy, R. Aravind
In this paper we propose a method to obtain the region of interest in a camera-trap tiger image so that it can be used for identification of the tiger in later stage. We use a combination of texture and color features to discriminate the tiger from the background. Based on these features, a level set based active contour segmentation is performed. A series of morphological operation are then performed on the segmented result to obtain the desired region of interest. The experimental results show the effectiveness of the proposed algorithm.
{"title":"Segmentation of camera-trap tiger images based on texture and color features","authors":"K. P. Reddy, R. Aravind","doi":"10.1109/NCC.2012.6176908","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176908","url":null,"abstract":"In this paper we propose a method to obtain the region of interest in a camera-trap tiger image so that it can be used for identification of the tiger in later stage. We use a combination of texture and color features to discriminate the tiger from the background. Based on these features, a level set based active contour segmentation is performed. A series of morphological operation are then performed on the segmented result to obtain the desired region of interest. The experimental results show the effectiveness of the proposed algorithm.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127037129","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
扫码关注我们
求助内容：
应助结果提醒方式：