Pub Date : 2016-12-01DOI: 10.1109/ISSPIT.2016.7886025
J.-M. Kadjo, K. Yao, A. Mansour
The methods of dynamic access to spectrum developed in Cognitive Radio require efficient and robust spectrum detectors. Most of these detectors suffer from four main limits: the computational cost required for the detection procedure; the need of prior knowledge of Primary User's (PU) signal features; the poor performances obtained in low SNR (Signal to Noise Ratio) environment; finding an optimal detection threshold is a crucial issue. In this paper, we propose a blind detection method based on the cyclostationary features of communication signals to overcome the four limits of spectrum sensors. In order to reduce the computational cost, the FFT Accumulation Method has been adjusted to estimate the cyclic spectrum of the intercepted signal. Then, the spectrum coherence principle is used to catch the periodicity hidden in the cyclic autocorrelation function of this signal. The hidden periodicity is revealed by the crest factor of the cyclic domain profile. The detection of PU's signal is achieved by comparing the embedded periodicity level with a predetermined threshold related to the crest factor. This threshold varies randomly dependent on the SNR. Then, we have modelized the distribution law of the threshold in order to select the optimal value. Using the crest factor of the cyclic domain profile as a detection criterion has permitted to develop a spectrum sensor which is able to work in a blind context. Simulation results corroborate the efficiency and robustness of the proposed detector compared with the classical Energy Detector.
{"title":"Blind detection of cyclostationary features in the context of Cognitive Radio","authors":"J.-M. Kadjo, K. Yao, A. Mansour","doi":"10.1109/ISSPIT.2016.7886025","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886025","url":null,"abstract":"The methods of dynamic access to spectrum developed in Cognitive Radio require efficient and robust spectrum detectors. Most of these detectors suffer from four main limits: the computational cost required for the detection procedure; the need of prior knowledge of Primary User's (PU) signal features; the poor performances obtained in low SNR (Signal to Noise Ratio) environment; finding an optimal detection threshold is a crucial issue. In this paper, we propose a blind detection method based on the cyclostationary features of communication signals to overcome the four limits of spectrum sensors. In order to reduce the computational cost, the FFT Accumulation Method has been adjusted to estimate the cyclic spectrum of the intercepted signal. Then, the spectrum coherence principle is used to catch the periodicity hidden in the cyclic autocorrelation function of this signal. The hidden periodicity is revealed by the crest factor of the cyclic domain profile. The detection of PU's signal is achieved by comparing the embedded periodicity level with a predetermined threshold related to the crest factor. This threshold varies randomly dependent on the SNR. Then, we have modelized the distribution law of the threshold in order to select the optimal value. Using the crest factor of the cyclic domain profile as a detection criterion has permitted to develop a spectrum sensor which is able to work in a blind context. Simulation results corroborate the efficiency and robustness of the proposed detector compared with the classical Energy Detector.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121879921","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 : 2016-12-01DOI: 10.1109/ISSPIT.2016.7886048
Yangyong Zhang, Huan Zheng, Kui Ding, Ling Wang, Zhongtao Luo, Zishu He
This paper analyzes code-aided interference suppression techniques for communication systems with minimum shift keying (MSK) modulation. Base on the minimum bit error rate (MBER) criterion, we develop the so-called MBER detector and explain how it is related with the conventional MMSE (minimum mean square error) detector. Inspired by the MBER detector, a new subspace projection (SP) detector is proposed for the strong interference. Additionally, the forward continuous mean exclusion (FCME) algorithm is introduced for classifying the interference subspace and noise subspace adaptively. Simulation results of BER performances demonstrate that the MBER detector achieves the minimum BER, except in the case of strong interference when the SP based detector performs the best.
{"title":"Code-aided interference suppression for communication system with MSK modulation","authors":"Yangyong Zhang, Huan Zheng, Kui Ding, Ling Wang, Zhongtao Luo, Zishu He","doi":"10.1109/ISSPIT.2016.7886048","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886048","url":null,"abstract":"This paper analyzes code-aided interference suppression techniques for communication systems with minimum shift keying (MSK) modulation. Base on the minimum bit error rate (MBER) criterion, we develop the so-called MBER detector and explain how it is related with the conventional MMSE (minimum mean square error) detector. Inspired by the MBER detector, a new subspace projection (SP) detector is proposed for the strong interference. Additionally, the forward continuous mean exclusion (FCME) algorithm is introduced for classifying the interference subspace and noise subspace adaptively. Simulation results of BER performances demonstrate that the MBER detector achieves the minimum BER, except in the case of strong interference when the SP based detector performs the best.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129778875","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 : 2016-12-01DOI: 10.1109/ISSPIT.2016.7886005
Hussain Albarakati, R. Ammar, Ayman Alharbi, H. Alhumyani
Underwater computing systems have recently emerged as a new technology for underwater applications. In our previous work, we employed various nodes (processing nodes, gateway nodes, and sensing nodes) that are used to construct different candidate computing architectures (i.e. single, pipeline, and hybrid of parallel/pipeline). In this paper, we use these computing architectures in a real world scenario of underwater applications. The selected application is the detection and classification of fish species in real-time. The selected application scenario proves the applicability and performance relevance of the developed computing architectures for underwater environment. Our results show that the proposed computing architectures provide high speed-up gain for the selected application.
{"title":"An application of using embedded underwater computing architectures","authors":"Hussain Albarakati, R. Ammar, Ayman Alharbi, H. Alhumyani","doi":"10.1109/ISSPIT.2016.7886005","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886005","url":null,"abstract":"Underwater computing systems have recently emerged as a new technology for underwater applications. In our previous work, we employed various nodes (processing nodes, gateway nodes, and sensing nodes) that are used to construct different candidate computing architectures (i.e. single, pipeline, and hybrid of parallel/pipeline). In this paper, we use these computing architectures in a real world scenario of underwater applications. The selected application is the detection and classification of fish species in real-time. The selected application scenario proves the applicability and performance relevance of the developed computing architectures for underwater environment. Our results show that the proposed computing architectures provide high speed-up gain for the selected application.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129822090","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 : 2016-12-01DOI: 10.1109/ISSPIT.2016.7886056
F. Sattar, S. Cullis-Suzuki, F. Jin
In this paper, we address the preparation of ecological datasets for data mining. We propose a new adaptive method for automatic dataset construction using Erblet transform, which can be seen as a non-uniform filter bank where the center frequency and the bandwidth of each filter match the ERB (Equivalent Rectangular Bandwidth) scale, followed by data quality assessment using a tonality index (TI). Our ecological database consists of two naturally occurring fish calls produced by the plainfin midshipman fish, Porichthys notatus. The performance of the method is evaluated in terms of K-means clustering on the constructed datasets, and show promising results that would assist in long-term activity monitoring for fish data.
{"title":"The use of adaptive Erblet transform with application to ecological data","authors":"F. Sattar, S. Cullis-Suzuki, F. Jin","doi":"10.1109/ISSPIT.2016.7886056","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886056","url":null,"abstract":"In this paper, we address the preparation of ecological datasets for data mining. We propose a new adaptive method for automatic dataset construction using Erblet transform, which can be seen as a non-uniform filter bank where the center frequency and the bandwidth of each filter match the ERB (Equivalent Rectangular Bandwidth) scale, followed by data quality assessment using a tonality index (TI). Our ecological database consists of two naturally occurring fish calls produced by the plainfin midshipman fish, Porichthys notatus. The performance of the method is evaluated in terms of K-means clustering on the constructed datasets, and show promising results that would assist in long-term activity monitoring for fish data.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126417569","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 : 2016-12-01DOI: 10.1109/ISSPIT.2016.7885999
H. Zhang, Xukui Yang, Weiqiang Zhang, Wenlin Zhang, Jia Liu
This paper proposes a speech/music classification system based on i-vector. An analysis of two classification methods, namely cosine distance score (CDS) and support vector machine (SVM) is performed. Two session compensation methods, within-class covariance normalization (WCCN) and linear discriminant analysis (LDA) are also discussed. The performance of proposed systems yields better results compared with Gaussian mixture model (GMM) method and modified low energy ratio (MLER) method.
{"title":"Application of i-vector in speech and music classification","authors":"H. Zhang, Xukui Yang, Weiqiang Zhang, Wenlin Zhang, Jia Liu","doi":"10.1109/ISSPIT.2016.7885999","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7885999","url":null,"abstract":"This paper proposes a speech/music classification system based on i-vector. An analysis of two classification methods, namely cosine distance score (CDS) and support vector machine (SVM) is performed. Two session compensation methods, within-class covariance normalization (WCCN) and linear discriminant analysis (LDA) are also discussed. The performance of proposed systems yields better results compared with Gaussian mixture model (GMM) method and modified low energy ratio (MLER) method.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123720681","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 : 2016-12-01DOI: 10.1109/ISSPIT.2016.7886040
Milan Papez
The identification of slowly-varying noise parameters in non-linear state-space models constitutes a long-standing problem. The present paper addresses this task using the Bayesian framework and sequential Monte Carlo (SMC) methodology. The proposed approach utilizes an algebraic structure of the model so that the Rao-Blackwellization of the parameters can be performed, thus involving a finite-dimensional sufficient statistic for each particle trajectory into the resulting algorithm. However, relying on standard SMC methods, such techniques are known to suffer from the particle path degeneracy problem. To counteract this issue, it is proposed to use alternative stabilized forgetting, which compensates for the incomplete knowledge of a model of parameter variations by finding a compromise between possible predictive densities of the parameters. An experimental study proves the efficiency of the introduced Rao-Blackwellized particle filter (RBPF) compared to some recently proposed approaches.
{"title":"A Rao-Blackwellized particle filter to estimate the time-varying noise parameters in non-linear state-space models using alternative stabilized forgetting","authors":"Milan Papez","doi":"10.1109/ISSPIT.2016.7886040","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886040","url":null,"abstract":"The identification of slowly-varying noise parameters in non-linear state-space models constitutes a long-standing problem. The present paper addresses this task using the Bayesian framework and sequential Monte Carlo (SMC) methodology. The proposed approach utilizes an algebraic structure of the model so that the Rao-Blackwellization of the parameters can be performed, thus involving a finite-dimensional sufficient statistic for each particle trajectory into the resulting algorithm. However, relying on standard SMC methods, such techniques are known to suffer from the particle path degeneracy problem. To counteract this issue, it is proposed to use alternative stabilized forgetting, which compensates for the incomplete knowledge of a model of parameter variations by finding a compromise between possible predictive densities of the parameters. An experimental study proves the efficiency of the introduced Rao-Blackwellized particle filter (RBPF) compared to some recently proposed approaches.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128961863","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 : 2016-12-01DOI: 10.1109/ISSPIT.2016.7886014
Zacharenia Garofalaki, Dimitris Kallergis, Georgios Katsikogiannis, Ioannis Ellinas, C. Douligeris
Within the Internet of Things (IoT) ecosystem, there is a need to interconnect networks of sensors and smart objects in a way that they can intelligently interact with humans. In most cases, these networks have been implemented following the machine-to-machine (M2M) communication disciplines. To adequately design such an emerging system which also has legacy technology characteristics, it is crucial to adopt an architecture reference model. In the context of this work, an architecture and characteristics assessment is conducted to form a roadmap of evolution from an M2M solution to an IoT in the field of Autonomous Vehicles (AVs). Then, an architecture for an AV prototype within the IoT ecosystem is proposed; the intelligent Bus on Campus (iBuC). The respective services are illustrated through a customised real-life scenario.
{"title":"Transport services within the IoT ecosystem using localisation parameters","authors":"Zacharenia Garofalaki, Dimitris Kallergis, Georgios Katsikogiannis, Ioannis Ellinas, C. Douligeris","doi":"10.1109/ISSPIT.2016.7886014","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886014","url":null,"abstract":"Within the Internet of Things (IoT) ecosystem, there is a need to interconnect networks of sensors and smart objects in a way that they can intelligently interact with humans. In most cases, these networks have been implemented following the machine-to-machine (M2M) communication disciplines. To adequately design such an emerging system which also has legacy technology characteristics, it is crucial to adopt an architecture reference model. In the context of this work, an architecture and characteristics assessment is conducted to form a roadmap of evolution from an M2M solution to an IoT in the field of Autonomous Vehicles (AVs). Then, an architecture for an AV prototype within the IoT ecosystem is proposed; the intelligent Bus on Campus (iBuC). The respective services are illustrated through a customised real-life scenario.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125852608","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 : 2016-12-01DOI: 10.1109/ISSPIT.2016.7886017
Mohamed Abaza, R. Mesleh, A. Mansour, Hadi M. Aggoune
This paper investigates the performance of the best relay selection, based on the max-min signal-to-noise ratio criterion for dual-hop free-space optical (FSO) full-duplex (FD) relays communication system. Decode-and-forward relays over log-normal (LN) channels for weak-to-moderate turbulence and gamma-gamma (G-G) channels for strong turbulence are considered. We assume that the relays have full channel knowledge and the channel is symmetrical. Considering path loss effects and misalignment errors, the outage probability (OP) of the selection is obtained for both half-duplex (HD) and FD relays using the cumulative distribution function (CDF) of the best selection for LN and G-G random variables. Moreover, the average bit error rate (ABER) expressions for FSO communication system over LN channels are derived with the help of Gauss-Laguerre's quadrature rule for HD relays, FD relays and direct link. Our results show that FD relays have lowest ABER and OP compared with the direct link and HD relays. Monte Carlo simulations corroborate the correctness of the obtained analytical results.
{"title":"Relay selection for full-duplex FSO relays over turbulent channels","authors":"Mohamed Abaza, R. Mesleh, A. Mansour, Hadi M. Aggoune","doi":"10.1109/ISSPIT.2016.7886017","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886017","url":null,"abstract":"This paper investigates the performance of the best relay selection, based on the max-min signal-to-noise ratio criterion for dual-hop free-space optical (FSO) full-duplex (FD) relays communication system. Decode-and-forward relays over log-normal (LN) channels for weak-to-moderate turbulence and gamma-gamma (G-G) channels for strong turbulence are considered. We assume that the relays have full channel knowledge and the channel is symmetrical. Considering path loss effects and misalignment errors, the outage probability (OP) of the selection is obtained for both half-duplex (HD) and FD relays using the cumulative distribution function (CDF) of the best selection for LN and G-G random variables. Moreover, the average bit error rate (ABER) expressions for FSO communication system over LN channels are derived with the help of Gauss-Laguerre's quadrature rule for HD relays, FD relays and direct link. Our results show that FD relays have lowest ABER and OP compared with the direct link and HD relays. Monte Carlo simulations corroborate the correctness of the obtained analytical results.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130631966","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 : 2016-12-01DOI: 10.1109/ISSPIT.2016.7886022
Antonia Gogoglou, Zenonas Theodosiou, Tasos Kounoudes, A. Vakali, Y. Manolopoulos
With the emerging and intense use of Online Social Networks (OSNs) amongst young children and teenagers (youngsters), safe networking and socializing on the Web has faced extensive scrutiny. Content and interactions which are considered safe for adult OSN users might embed potentially threatening and malicious information when it comes to underage users. This work is motivated by the strong need to safeguard youngsters OSNs experience such that they can be empowered and aware. The topology of a graph is studied towards detecting the so called “social bridges”, i.e. the major supporters of malicious users, who have links and ties to both honest and malicious user communities. A graph-topology based classification scheme is proposed to detect such bridge linkages which are suspicious for threatening youngsters networking. The proposed scheme is validated by a Twitter network, at which potentially dangerous users are identified based on their Twitter connections. The achieved performance is higher compared to previous efforts, despite the increased complexity due to the variety of groups identified as malicious.
{"title":"Early malicious activity discovery in microblogs by social bridges detection","authors":"Antonia Gogoglou, Zenonas Theodosiou, Tasos Kounoudes, A. Vakali, Y. Manolopoulos","doi":"10.1109/ISSPIT.2016.7886022","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886022","url":null,"abstract":"With the emerging and intense use of Online Social Networks (OSNs) amongst young children and teenagers (youngsters), safe networking and socializing on the Web has faced extensive scrutiny. Content and interactions which are considered safe for adult OSN users might embed potentially threatening and malicious information when it comes to underage users. This work is motivated by the strong need to safeguard youngsters OSNs experience such that they can be empowered and aware. The topology of a graph is studied towards detecting the so called “social bridges”, i.e. the major supporters of malicious users, who have links and ties to both honest and malicious user communities. A graph-topology based classification scheme is proposed to detect such bridge linkages which are suspicious for threatening youngsters networking. The proposed scheme is validated by a Twitter network, at which potentially dangerous users are identified based on their Twitter connections. The achieved performance is higher compared to previous efforts, despite the increased complexity due to the variety of groups identified as malicious.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132228091","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 : 2016-12-01DOI: 10.1109/ISSPIT.2016.7886055
Mehdi Fallahpour, D. Megías
In contrast to many image watermarking schemes, the suggested method is implemented in the JPEG compressed domain with no transcoding or decompression. Therefore, this scheme is highly efficient in real-time applications and suitable for multimedia information, which is rarely available in an uncompressed form. The proposed watermarking scheme is very flexible, and can be tailored to meet the requirements of different real applications. In order to attain a real-time watermarking capability, the proposed system avoids many of the computation steps associated with JPEG compression. Specifically, the forward and inverse DCT do not require to be calculated, nor do any of the computations associated with quantization. Robustness against JPEG compression and additive noise attacks is achieved with the proposed system. A further advantage of the suggested technique is that it allows a watermark to be detected in an image without referencing to the original image, or to any other information used in the watermark embedding process. At the decoder, only entropy decoding is enough to detect watermark and other steps of image decoding are not necessary for detection. The experimental results show how different capacity can be achieved in the range of 1 to 4096 bits for a grayscale 512×512×8 bit image. The watermarking algorithm reduces the quality about 0.65 dB, which is excellent for a watermarking system in compressed domain.
{"title":"Flexible image watermarking in JPEG domain","authors":"Mehdi Fallahpour, D. Megías","doi":"10.1109/ISSPIT.2016.7886055","DOIUrl":"https://doi.org/10.1109/ISSPIT.2016.7886055","url":null,"abstract":"In contrast to many image watermarking schemes, the suggested method is implemented in the JPEG compressed domain with no transcoding or decompression. Therefore, this scheme is highly efficient in real-time applications and suitable for multimedia information, which is rarely available in an uncompressed form. The proposed watermarking scheme is very flexible, and can be tailored to meet the requirements of different real applications. In order to attain a real-time watermarking capability, the proposed system avoids many of the computation steps associated with JPEG compression. Specifically, the forward and inverse DCT do not require to be calculated, nor do any of the computations associated with quantization. Robustness against JPEG compression and additive noise attacks is achieved with the proposed system. A further advantage of the suggested technique is that it allows a watermark to be detected in an image without referencing to the original image, or to any other information used in the watermark embedding process. At the decoder, only entropy decoding is enough to detect watermark and other steps of image decoding are not necessary for detection. The experimental results show how different capacity can be achieved in the range of 1 to 4096 bits for a grayscale 512×512×8 bit image. The watermarking algorithm reduces the quality about 0.65 dB, which is excellent for a watermarking system in compressed domain.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125632808","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
扫码关注我们
求助内容：
应助结果提醒方式：