Pub Date : 2017-12-01DOI: 10.1109/ICSPCS.2017.8270490
N. Miki, Yusaku Kanehira, Hiroaki Tokoshima
In order to support the continuous growth in the amount of mobile traffic, small cell deployments, that increase the base station (BS) density, are promising. In small cell deployments, combined usage of user association and inter-cell interference coordination (ICIC) is inevitable. This paper investigates the joint optimization of user association and ICIC in the downlink. We first formulate the joint optimization problem as a utility maximization problem. We then employ the logarithmic utility function known as the proportional fair criteria. The optimum user association and the ICIC are derived by solving a convex optimization problem based on the average spectral efficiencies of all users. We propose an iterative algorithm to obtain the optimum solution to this problem. We evaluate the performance of the proposed algorithm in the small cell deployments and shows that the proposed algorithm works well. Furthermore, we show that the combined usage of the inter-tier ICIC and intra-tier ICIC enhances the throughput performance compared to schemes employing either the inter-or intra-tier ICIC scheme.
{"title":"Investigation on joint optimization for user association and inter-cell interference coordination based on proportional fair criteria","authors":"N. Miki, Yusaku Kanehira, Hiroaki Tokoshima","doi":"10.1109/ICSPCS.2017.8270490","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270490","url":null,"abstract":"In order to support the continuous growth in the amount of mobile traffic, small cell deployments, that increase the base station (BS) density, are promising. In small cell deployments, combined usage of user association and inter-cell interference coordination (ICIC) is inevitable. This paper investigates the joint optimization of user association and ICIC in the downlink. We first formulate the joint optimization problem as a utility maximization problem. We then employ the logarithmic utility function known as the proportional fair criteria. The optimum user association and the ICIC are derived by solving a convex optimization problem based on the average spectral efficiencies of all users. We propose an iterative algorithm to obtain the optimum solution to this problem. We evaluate the performance of the proposed algorithm in the small cell deployments and shows that the proposed algorithm works well. Furthermore, we show that the combined usage of the inter-tier ICIC and intra-tier ICIC enhances the throughput performance compared to schemes employing either the inter-or intra-tier ICIC scheme.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127431253","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 : 2017-12-01DOI: 10.1109/ICSPCS.2017.8305448
K. S. Khan, Saud Khan, A. Jamalipour
Smart user association methods can have tremendous advantages when it comes to caching. It is anticipated that, in future, small cell deployment will be such that there will be at least one small cell for every user. This comes with a great advantage of maximizing the hit probability for cache-enabled networks. In this work, we investigate a multi-link user association model for Ultra Dense Networks (UDN) in which a user associates with multiple caching entities to retrieve its requested content. The user has a chance to search for the requested file at multiple locations, which will increase the chances of getting the request fulfilled, subsequently increasing the cache hit ratio of the user. We let the user select its preferences based on the received SINR from the available caches and leverage the basic user association methods to fully exploit the resources available to the user. Consequently, we derive analytical expressions to study the data rate and achieved cache hit ratio by the proposed method. Through simulation results, we illustrate that the performance of our proposed multi-link cache data retrieval method is distinctively different from present schemes and shed new insight on serving users in a cache-enabled UDN.
{"title":"Multi-link cache data retrieval for delivery phase in ultra dense small cell networks","authors":"K. S. Khan, Saud Khan, A. Jamalipour","doi":"10.1109/ICSPCS.2017.8305448","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8305448","url":null,"abstract":"Smart user association methods can have tremendous advantages when it comes to caching. It is anticipated that, in future, small cell deployment will be such that there will be at least one small cell for every user. This comes with a great advantage of maximizing the hit probability for cache-enabled networks. In this work, we investigate a multi-link user association model for Ultra Dense Networks (UDN) in which a user associates with multiple caching entities to retrieve its requested content. The user has a chance to search for the requested file at multiple locations, which will increase the chances of getting the request fulfilled, subsequently increasing the cache hit ratio of the user. We let the user select its preferences based on the received SINR from the available caches and leverage the basic user association methods to fully exploit the resources available to the user. Consequently, we derive analytical expressions to study the data rate and achieved cache hit ratio by the proposed method. Through simulation results, we illustrate that the performance of our proposed multi-link cache data retrieval method is distinctively different from present schemes and shed new insight on serving users in a cache-enabled UDN.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132763865","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 : 2017-12-01DOI: 10.1109/ICSPCS.2017.8270485
T. Chu, H. Zepernick
In this paper, we study a hybrid amplify-and-forward (AF) and decode-and-forward (DF) scheme for two-way cognitive cooperative radio networks (CCRNs). The proposed scheme applies the AF scheme when the signal-to-interference-plus-noise ratio (SINR) at the relay is below a predefined threshold such that the relay cannot successfully decode the signal. On the other hand, when the SINR at the relay is greater than the predefined threshold, it decodes the signal and then forwards it to the destination, i.e. avoids noise and interference amplification at the relay. An analytical expression of the outage probability of the hybrid AF-DF two-way CCRN is derived based on the probability density function and cumulative distribution function of the SINR in AF and DF mode. Numerical results are provided to illustrate the influence of network parameters such as transmit power, interference power constraint of the primary network, fading conditions, and link distances on the outage probability. Finally, the numerical results show that the hybrid strategy is able to improve system performance significantly compared to conventional AF or DF relaying.
{"title":"Outage probability of a hybrid AF-DF protocol for two-way underlay cognitive cooperative radio networks","authors":"T. Chu, H. Zepernick","doi":"10.1109/ICSPCS.2017.8270485","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270485","url":null,"abstract":"In this paper, we study a hybrid amplify-and-forward (AF) and decode-and-forward (DF) scheme for two-way cognitive cooperative radio networks (CCRNs). The proposed scheme applies the AF scheme when the signal-to-interference-plus-noise ratio (SINR) at the relay is below a predefined threshold such that the relay cannot successfully decode the signal. On the other hand, when the SINR at the relay is greater than the predefined threshold, it decodes the signal and then forwards it to the destination, i.e. avoids noise and interference amplification at the relay. An analytical expression of the outage probability of the hybrid AF-DF two-way CCRN is derived based on the probability density function and cumulative distribution function of the SINR in AF and DF mode. Numerical results are provided to illustrate the influence of network parameters such as transmit power, interference power constraint of the primary network, fading conditions, and link distances on the outage probability. Finally, the numerical results show that the hybrid strategy is able to improve system performance significantly compared to conventional AF or DF relaying.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131533030","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 : 2017-12-01DOI: 10.1109/ICSPCS.2017.8270473
A. Rafiei, M. Abolhasan, D. Franklin, F. Safaei, Stephen Smith, Wei Ni
Large scale coverage holes (CHs) resulting from correlated node failures, can significantly degrade quality of service and also jeopardise the integrity of WSNs. In the absence of centralised control, the distributed relocation of deployed nodes becomes a promising solution especially in harsh and hostile environments. In this paper, a distributed method is proposed that enables a network to partially or entirely repair itself through a collection of distributed movements of disjoint spanned trees (DS-Trees) towards the CHs. DS-Trees are spanned based on the nodes distances from the CHs, which are autonomously perceived by the nodes and their one-hop neighbours. DS-Trees around the CHs are spanned in a downstream style outwards from the holes, as nodes select their parents based on the minimum distance to the CH from their neighbours; nodes then decide whether or not to follow the movements of their DS-Trees parents. To examine the efficiency of the proposed model, its performance is compared with two Voronoi-based and one force-based node relocation algorithms. Results show that the proposed DS-Tree model either outperforms or matches the alternative approaches across a wide range of scenarios.
{"title":"Cooperative recovery of coverage holes in WSNs via disjoint spanning trees","authors":"A. Rafiei, M. Abolhasan, D. Franklin, F. Safaei, Stephen Smith, Wei Ni","doi":"10.1109/ICSPCS.2017.8270473","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270473","url":null,"abstract":"Large scale coverage holes (CHs) resulting from correlated node failures, can significantly degrade quality of service and also jeopardise the integrity of WSNs. In the absence of centralised control, the distributed relocation of deployed nodes becomes a promising solution especially in harsh and hostile environments. In this paper, a distributed method is proposed that enables a network to partially or entirely repair itself through a collection of distributed movements of disjoint spanned trees (DS-Trees) towards the CHs. DS-Trees are spanned based on the nodes distances from the CHs, which are autonomously perceived by the nodes and their one-hop neighbours. DS-Trees around the CHs are spanned in a downstream style outwards from the holes, as nodes select their parents based on the minimum distance to the CH from their neighbours; nodes then decide whether or not to follow the movements of their DS-Trees parents. To examine the efficiency of the proposed model, its performance is compared with two Voronoi-based and one force-based node relocation algorithms. Results show that the proposed DS-Tree model either outperforms or matches the alternative approaches across a wide range of scenarios.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132968102","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 : 2017-12-01DOI: 10.1109/ICSPCS.2017.8270468
Jinhyun Ahn, T. Sung, J. Park, Kwang-Eog Lee, Joonhyuk Kang
We consider a network that the transmitters are located as Poisson point process and each has its receiver at a given distance. Additionally, a packet arrives at the transmitter following Bernoulli distribution and departs with medium access probability. The success of transmission is only when the SINR is greater than a given threshold. In this situation, we improve the previous work by considering varying multi-traffic class and general kind of fading in the network. With these additional assumptions for practical situation, we investigate the stability condition, success probability, and the mean delay of a packet.
{"title":"Analysis of stability and delay in Random-Access network modeled by poisson point process with queueing theory","authors":"Jinhyun Ahn, T. Sung, J. Park, Kwang-Eog Lee, Joonhyuk Kang","doi":"10.1109/ICSPCS.2017.8270468","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270468","url":null,"abstract":"We consider a network that the transmitters are located as Poisson point process and each has its receiver at a given distance. Additionally, a packet arrives at the transmitter following Bernoulli distribution and departs with medium access probability. The success of transmission is only when the SINR is greater than a given threshold. In this situation, we improve the previous work by considering varying multi-traffic class and general kind of fading in the network. With these additional assumptions for practical situation, we investigate the stability condition, success probability, and the mean delay of a packet.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124037753","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 : 2017-12-01DOI: 10.1109/ICSPCS.2017.8270462
J. Maranhao, J. Costa, Rafael Timóteo de Sousa Júnior, A. Braga, G. D. Galdo
Array signal processing schemes can provide accurate estimates for the number of received signal components and their direction of arrival (DoA) at a sensor array. This paper proposes a high resolution framework with multipath mitigation for detecting and locating a signal emitter randomly positioned within a region of interest. First our proposed framework detects the signal of interest and provides the number of line-of-sight (LOS) plus non-line-of-sight (NLOS) components by applying model order selection schemes. Next our approach mitigates the multipaths by exploiting the signal structure and estimating the DoA of each component. Finally, our framework triangulates the estimated DoAs providing the source position. Simulation results are compared to the well known time of arrival (ToA) and DoA based positioning systems illustrating the effectiveness of the proposed framework.
{"title":"Antenna array based framework with multipath mitigation for signal emitter detection and localization","authors":"J. Maranhao, J. Costa, Rafael Timóteo de Sousa Júnior, A. Braga, G. D. Galdo","doi":"10.1109/ICSPCS.2017.8270462","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270462","url":null,"abstract":"Array signal processing schemes can provide accurate estimates for the number of received signal components and their direction of arrival (DoA) at a sensor array. This paper proposes a high resolution framework with multipath mitigation for detecting and locating a signal emitter randomly positioned within a region of interest. First our proposed framework detects the signal of interest and provides the number of line-of-sight (LOS) plus non-line-of-sight (NLOS) components by applying model order selection schemes. Next our approach mitigates the multipaths by exploiting the signal structure and estimating the DoA of each component. Finally, our framework triangulates the estimated DoAs providing the source position. Simulation results are compared to the well known time of arrival (ToA) and DoA based positioning systems illustrating the effectiveness of the proposed framework.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127934484","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 : 2017-12-01DOI: 10.1109/ICSPCS.2017.8270487
Simon Faulkner, S. D. Elton, T. Lamahewa, David Roberts
This paper describes the design and implementation of a reconfigurable, software-defined spectral channeliser for radio frequency (RF) spectrum sensing applications. The software-based design targets a parallel, multi-core processor architecture in the form of a graphics processing unit (GPU) and incorporates a polyphase filter bank design. Our implementation provides continuous channelisation of RF intercept data across a scalable number of GPU processing engines. On modern generation GPUs, such as the Tesla K40c, we found that our GPU-hosted channeliser satisfies real-time processing requirements for a current microwave intercept receiver with electronic warfare applications. Specifically, a system with an instantaneous collection bandwidth of 500 MHz and a digital sample rate of 1.333 GSa/s. The configurable nature of our channeliser was not done at the expense of performance, in that a similar computational efficiency was achieved across multiple channel sizes. Our analysis also includes a profiling of the computational load on the GPU and comparing it to that of a single core, high performance, CPU implementation. We found that we were able to achieve up to 40x improvement in performance with our implementation on a single GPU and this result scaled linearly when additional GPU resources were utilised.
{"title":"A reconfigurable wideband streaming channeliser for RF sensing applications: A multiple GPU-based implementation","authors":"Simon Faulkner, S. D. Elton, T. Lamahewa, David Roberts","doi":"10.1109/ICSPCS.2017.8270487","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270487","url":null,"abstract":"This paper describes the design and implementation of a reconfigurable, software-defined spectral channeliser for radio frequency (RF) spectrum sensing applications. The software-based design targets a parallel, multi-core processor architecture in the form of a graphics processing unit (GPU) and incorporates a polyphase filter bank design. Our implementation provides continuous channelisation of RF intercept data across a scalable number of GPU processing engines. On modern generation GPUs, such as the Tesla K40c, we found that our GPU-hosted channeliser satisfies real-time processing requirements for a current microwave intercept receiver with electronic warfare applications. Specifically, a system with an instantaneous collection bandwidth of 500 MHz and a digital sample rate of 1.333 GSa/s. The configurable nature of our channeliser was not done at the expense of performance, in that a similar computational efficiency was achieved across multiple channel sizes. Our analysis also includes a profiling of the computational load on the GPU and comparing it to that of a single core, high performance, CPU implementation. We found that we were able to achieve up to 40x improvement in performance with our implementation on a single GPU and this result scaled linearly when additional GPU resources were utilised.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"418 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115995980","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 : 2017-12-01DOI: 10.1109/ICSPCS.2017.8270467
P. Vishnu, C. S. Ramalingam
In this paper we consider the problem of notch filtering of short data records to remove interference. We show that the recently proposed cascaded matrix notch filtering method of Tseng and Lee is, for real-valued data, approximately the same as subtracting the maximum likelihood estimate of the interfering sinusoid; in the case of complex data, the equivalence is exact. Furthermore, we show that the well-known technique of forward-backward filtering can be used for effective interference suppression, whose computational burden does not increase with data length (unlike in conventional matrix filter methods).
{"title":"On the connection between matrix notch filter and maximum likelihood estimation of sinusoidal parameters","authors":"P. Vishnu, C. S. Ramalingam","doi":"10.1109/ICSPCS.2017.8270467","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270467","url":null,"abstract":"In this paper we consider the problem of notch filtering of short data records to remove interference. We show that the recently proposed cascaded matrix notch filtering method of Tseng and Lee is, for real-valued data, approximately the same as subtracting the maximum likelihood estimate of the interfering sinusoid; in the case of complex data, the equivalence is exact. Furthermore, we show that the well-known technique of forward-backward filtering can be used for effective interference suppression, whose computational burden does not increase with data length (unlike in conventional matrix filter methods).","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116872183","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 : 2017-12-01DOI: 10.1109/ICSPCS.2017.8270479
D. Umehara, Shuhei Ueno, Ryota Akagi
Let us consider that space division multiplexing (SDM) signal is transmitted at a base station (BS) with a number of antennas to a mobile terminal (MT) with fewer antennas. It will be intractable for the MT to demultiplex the received SDM signal by spatial linear filtering in the case of less degrees of freedom at the MT. Receiver cooperative multiple-input and multiple output (RC-MIMO) is applied to demultiplex the received SDM signal frame with the enhancement of degrees of freedom at the MT by sharing the other SDM signal frames received at the surrounding MTs with higher-frequency radio forwarding called radio over higher-frequency radio (RoHR). In this paper, we show the performances of pulse-code-modulated RoHR (PCM-RoHR) and pulse-amplitude-modulated RoHR (PAM-RoHR) for a two-antenna BS and several single-antenna cooperative MTs with computer simulations.
{"title":"Receiver cooperative MIMO-OFDM with higher-frequency radio forwarding","authors":"D. Umehara, Shuhei Ueno, Ryota Akagi","doi":"10.1109/ICSPCS.2017.8270479","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270479","url":null,"abstract":"Let us consider that space division multiplexing (SDM) signal is transmitted at a base station (BS) with a number of antennas to a mobile terminal (MT) with fewer antennas. It will be intractable for the MT to demultiplex the received SDM signal by spatial linear filtering in the case of less degrees of freedom at the MT. Receiver cooperative multiple-input and multiple output (RC-MIMO) is applied to demultiplex the received SDM signal frame with the enhancement of degrees of freedom at the MT by sharing the other SDM signal frames received at the surrounding MTs with higher-frequency radio forwarding called radio over higher-frequency radio (RoHR). In this paper, we show the performances of pulse-code-modulated RoHR (PCM-RoHR) and pulse-amplitude-modulated RoHR (PAM-RoHR) for a two-antenna BS and several single-antenna cooperative MTs with computer simulations.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127150880","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 : 2017-12-01DOI: 10.1109/ICSPCS.2017.8270456
Alexandre Gomes, Tiago Rosa Maria Paula Queluz, F. Pereira
In this paper, a simple, yet effective method for TV commercials detection is proposed, that exploits the presence or absence, in the screen, of the broadcaster logo (or TV channel logo). The approach is based on a digital on-screen graphics (DoG) detection and classification mechanism, targeting to detect and distinguish TV channel logos from other types of DoGs. No pre-built database is required, as the proposed solution is able to gather its own collection of DoGs from the broadcasted videos. A continuous update and control of the DoGs database is performed, thus allowing to conclude about the nature of each DoG and to classify each video segment as Regular Program or Commercial Block. For the used test video dataset, corresponding to recordings from three Portuguese TV channels, a minimum accuracy of 93,9% on commercials detection was achieved; furthermore, the measured processing time suggests that the proposed solution should enable real-time (i.e., while recording) detection of commercial blocks.
{"title":"Automatic detection of TV commercial blocks: A new approach based on digital on-screen graphics classification","authors":"Alexandre Gomes, Tiago Rosa Maria Paula Queluz, F. Pereira","doi":"10.1109/ICSPCS.2017.8270456","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270456","url":null,"abstract":"In this paper, a simple, yet effective method for TV commercials detection is proposed, that exploits the presence or absence, in the screen, of the broadcaster logo (or TV channel logo). The approach is based on a digital on-screen graphics (DoG) detection and classification mechanism, targeting to detect and distinguish TV channel logos from other types of DoGs. No pre-built database is required, as the proposed solution is able to gather its own collection of DoGs from the broadcasted videos. A continuous update and control of the DoGs database is performed, thus allowing to conclude about the nature of each DoG and to classify each video segment as Regular Program or Commercial Block. For the used test video dataset, corresponding to recordings from three Portuguese TV channels, a minimum accuracy of 93,9% on commercials detection was achieved; furthermore, the measured processing time suggests that the proposed solution should enable real-time (i.e., while recording) detection of commercial blocks.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126979476","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
扫码关注我们
求助内容：
应助结果提醒方式：