Pub Date : 2012-12-01DOI: 10.1109/ICCSII.2012.6454446
R. Al-Dalky, A. Elrefaie, T. Landolsi, M. Hassan
In this paper, the impact of cascading optical filters on 100 Gb/s and 400 Gb/s systems has been studied using two types of filters: fiber Bragg grating (FBG) and thin-film filters (TFF). Simulation results indicate a smaller eye closure penalty (ECP) for TFF cascade relative to FBG filter cascade. At 3-dB ECP, the number of cascaded filters for single-carrier 100 Gb/s polarization-multiplexed quadrature phase shift keying (PM-QPSK) system is 4 TFF and 2 FBG with 3-dB bandwidth of 43 GHz at 50 GHz channel spacing. Also simulation results indicate that at 3-dB ECP, the number of cascaded filters for single-carrier 400 Gb/s polarization-multiplexed 16-ary quadrature amplitude modulation (PM-16QAM) system is 2 TFF with 3-dB bandwidth of 90 GHz at 100 GHz channel spacing. A single FBG with 3-dB bandwidth of 90 GHz at 100 GHz channel spacing results in an ECP of 4-dB for 400 Gb/s PM-16QAM system.
{"title":"Impact of cascaded optical filters on 100 Gb/s PM-QPSK and 400 Gb/s PM-16QAM coherent communication systems","authors":"R. Al-Dalky, A. Elrefaie, T. Landolsi, M. Hassan","doi":"10.1109/ICCSII.2012.6454446","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454446","url":null,"abstract":"In this paper, the impact of cascading optical filters on 100 Gb/s and 400 Gb/s systems has been studied using two types of filters: fiber Bragg grating (FBG) and thin-film filters (TFF). Simulation results indicate a smaller eye closure penalty (ECP) for TFF cascade relative to FBG filter cascade. At 3-dB ECP, the number of cascaded filters for single-carrier 100 Gb/s polarization-multiplexed quadrature phase shift keying (PM-QPSK) system is 4 TFF and 2 FBG with 3-dB bandwidth of 43 GHz at 50 GHz channel spacing. Also simulation results indicate that at 3-dB ECP, the number of cascaded filters for single-carrier 400 Gb/s polarization-multiplexed 16-ary quadrature amplitude modulation (PM-16QAM) system is 2 TFF with 3-dB bandwidth of 90 GHz at 100 GHz channel spacing. A single FBG with 3-dB bandwidth of 90 GHz at 100 GHz channel spacing results in an ECP of 4-dB for 400 Gb/s PM-16QAM system.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130226599","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-12-01DOI: 10.1109/ICCSII.2012.6454577
M. Badri, Aymen Kout, L. Badri
This paper aims at investigating empirically the effect of aspect-oriented refactoring on testability of classes in object-oriented software. We investigate testability from the perspective of unit testing. We performed an empirical analysis using (test suites and refactoring) data collected from a well-known open source Java software system (JHotdraw). We used, in fact, two versions of JHotDraw: the Java version (before aspect-oriented refactoring) and the AspectJ version (after aspect-oriented refactoring). To capture testability of classes, we used two metrics to quantify the corresponding JUnit test cases. JUnit test cases have been generated using a tool (CodePro). We also used object-oriented metrics to measure various source code attributes (coupling, cohesion, inheritance, complexity and size). In order to investigate the effect of aspect-oriented refactoring on testability of classes (characteristics of corresponding test cases), we used statistical tests. Results provide evidence that testability of the refactored classes has been improved.
{"title":"On the effect of aspect-oriented refactoring on testability of classes: A case study","authors":"M. Badri, Aymen Kout, L. Badri","doi":"10.1109/ICCSII.2012.6454577","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454577","url":null,"abstract":"This paper aims at investigating empirically the effect of aspect-oriented refactoring on testability of classes in object-oriented software. We investigate testability from the perspective of unit testing. We performed an empirical analysis using (test suites and refactoring) data collected from a well-known open source Java software system (JHotdraw). We used, in fact, two versions of JHotDraw: the Java version (before aspect-oriented refactoring) and the AspectJ version (after aspect-oriented refactoring). To capture testability of classes, we used two metrics to quantify the corresponding JUnit test cases. JUnit test cases have been generated using a tool (CodePro). We also used object-oriented metrics to measure various source code attributes (coupling, cohesion, inheritance, complexity and size). In order to investigate the effect of aspect-oriented refactoring on testability of classes (characteristics of corresponding test cases), we used statistical tests. Results provide evidence that testability of the refactored classes has been improved.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131153510","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-12-01DOI: 10.1109/ICCSII.2012.6454466
N. Ibrahim
Developing service-oriented applications is concerned with the two main areas (1) service definition and provision, and (2) service composition. Current approaches for the definition and provision of services ignore the relationship between the service contract and the conditions in which the service can guarantee its contract. These conditions are necessary to associate the related contextual information, such as the context of the service provider and the context of service requester. Current composition approaches compose only service functionality and ignore nonfunctional requirements. Thus, service contracts, and context information that are part of services are left out of the composition, and verification. The FrSeC architecture aims to remedy this situation. The architecture supports the specification, publication, discovery, selection, and composition of services, where a service with its functional and nonfunctional aspects is bound to a context-driven contract. In this paper, we discuss developing service-oriented applications using FrSeC.
{"title":"Developing context-dependent service-oriented applications","authors":"N. Ibrahim","doi":"10.1109/ICCSII.2012.6454466","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454466","url":null,"abstract":"Developing service-oriented applications is concerned with the two main areas (1) service definition and provision, and (2) service composition. Current approaches for the definition and provision of services ignore the relationship between the service contract and the conditions in which the service can guarantee its contract. These conditions are necessary to associate the related contextual information, such as the context of the service provider and the context of service requester. Current composition approaches compose only service functionality and ignore nonfunctional requirements. Thus, service contracts, and context information that are part of services are left out of the composition, and verification. The FrSeC architecture aims to remedy this situation. The architecture supports the specification, publication, discovery, selection, and composition of services, where a service with its functional and nonfunctional aspects is bound to a context-driven contract. In this paper, we discuss developing service-oriented applications using FrSeC.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114089201","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-12-01DOI: 10.1109/ICCSII.2012.6454571
Faisal Ahmad Khan, T. Ratnarajah, Z. Ding
In this paper, we investigate the outage performance of cognitive radio wireless network where secondary receiver does not suffer any interference from the primary user. In particular, we consider a system model that has a pair of primary transmitter and receiver as well as a pair of secondary transmitter and receiver, with a number of nearby idle secondary users acting as relays. Secondary relays help to maintain or even improve the outage performance of primary user while facilitating simultaneous secondary user transmission. We derive analytical results for the outage performance of primary and secondary link to prove the efficiency of proposed protocol. Simulations results demonstrate that the proposed protocol achieves large ergodic capacity and diversity gain for primary user while achieving substantial outage capacity for secondary user.
{"title":"Outage performance of cognitive radio wireless network with secondary relaying","authors":"Faisal Ahmad Khan, T. Ratnarajah, Z. Ding","doi":"10.1109/ICCSII.2012.6454571","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454571","url":null,"abstract":"In this paper, we investigate the outage performance of cognitive radio wireless network where secondary receiver does not suffer any interference from the primary user. In particular, we consider a system model that has a pair of primary transmitter and receiver as well as a pair of secondary transmitter and receiver, with a number of nearby idle secondary users acting as relays. Secondary relays help to maintain or even improve the outage performance of primary user while facilitating simultaneous secondary user transmission. We derive analytical results for the outage performance of primary and secondary link to prove the efficiency of proposed protocol. Simulations results demonstrate that the proposed protocol achieves large ergodic capacity and diversity gain for primary user while achieving substantial outage capacity for secondary user.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115951376","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-12-01DOI: 10.1109/ICCSII.2012.6454622
Meryem Uzun-Per
As social networking websites become more and more popular, the necessity to serve users of these websites is increased. Since all such social websites are user-centric, representing users with a good model directly changes the results of the applications. There are many studies which consider users in their models. In this paper, we analyzed such papers and collected different user representation models. Although there is no study which considers time parameter in user representation, we included the time parameter in one of the models. We evaluated the models for two social bookmarking website datasets by visualizing them as a graph with social network analysis, and by calculating f-measure scores for a tag recommendation system. As a result, tag property is considered as the best property to represent a user in such a website.
{"title":"User representation in social bookmarking websites","authors":"Meryem Uzun-Per","doi":"10.1109/ICCSII.2012.6454622","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454622","url":null,"abstract":"As social networking websites become more and more popular, the necessity to serve users of these websites is increased. Since all such social websites are user-centric, representing users with a good model directly changes the results of the applications. There are many studies which consider users in their models. In this paper, we analyzed such papers and collected different user representation models. Although there is no study which considers time parameter in user representation, we included the time parameter in one of the models. We evaluated the models for two social bookmarking website datasets by visualizing them as a graph with social network analysis, and by calculating f-measure scores for a tag recommendation system. As a result, tag property is considered as the best property to represent a user in such a website.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116021177","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-12-01DOI: 10.1109/ICCSII.2012.6454627
Sanaa Hamid, Aly F. Elrefaie, Mohamed S. Hassan, T. Landolsi
In this study, we evaluate the end-to-end performance of an optically pre-amplified 16-ary pulse position modulation (PPM) system for the use in free-space optical communication. Simulations were carried out to evaluate the bit-error-ratio (BER) for several scenarios. The results show that the optimum full width half maximum (FWHM) for the Fabry-Pérot filter is twice the bit rate. For the optimum FWHM of the Fabry-Pérot filter with 20 dB extinction ratio, a BER of 10-4 is achieved at Eb/N0 of 9.5 dB where Eb is the energy per bit and N0 is the effective single-sided power spectral density of the noise at the amplifier input. The results also show up to 9.7 dB improvement when compared to the case of on-off keying (OOK) with extinction ratio of 20 dB and an optimum Fabry-Pérot filter with FWHM equal to 0.7 of the bit rate for the same BER of 10-4.
{"title":"Performance evaluation of optically pre-amplified 16-ary PPM systems with Fabry-Pe´rot filters","authors":"Sanaa Hamid, Aly F. Elrefaie, Mohamed S. Hassan, T. Landolsi","doi":"10.1109/ICCSII.2012.6454627","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454627","url":null,"abstract":"In this study, we evaluate the end-to-end performance of an optically pre-amplified 16-ary pulse position modulation (PPM) system for the use in free-space optical communication. Simulations were carried out to evaluate the bit-error-ratio (BER) for several scenarios. The results show that the optimum full width half maximum (FWHM) for the Fabry-Pérot filter is twice the bit rate. For the optimum FWHM of the Fabry-Pérot filter with 20 dB extinction ratio, a BER of 10-4 is achieved at Eb/N0 of 9.5 dB where Eb is the energy per bit and N0 is the effective single-sided power spectral density of the noise at the amplifier input. The results also show up to 9.7 dB improvement when compared to the case of on-off keying (OOK) with extinction ratio of 20 dB and an optimum Fabry-Pérot filter with FWHM equal to 0.7 of the bit rate for the same BER of 10-4.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125530739","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-12-01DOI: 10.1109/ICCSII.2012.6454433
M. S. Prakash, R. Shaik
In this paper, we propose a low complex architectural design for adaptive decision feedback equalizer (ADFE). For this we recast the ADFE equations using distributed arithmetic (DA), which enables the implementation of ADFE without multipliers. The design is based on the distributed arithmetic based formulation of it. It is further shown that high order filters, which are required to implement high speed ADFEs can be realized using only look-up-tables (LUTs) and shift-accumulate operations. A novel approach was proposed to replace feed forward and feedback filters of ADFE with a single DA unit. By proper initialization, it is also shown that a low complexity ADFE architecture can be obtained.
{"title":"Low complexity hardware architectural design for adaptive decision feedback equalizer using distributed arithmetic","authors":"M. S. Prakash, R. Shaik","doi":"10.1109/ICCSII.2012.6454433","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454433","url":null,"abstract":"In this paper, we propose a low complex architectural design for adaptive decision feedback equalizer (ADFE). For this we recast the ADFE equations using distributed arithmetic (DA), which enables the implementation of ADFE without multipliers. The design is based on the distributed arithmetic based formulation of it. It is further shown that high order filters, which are required to implement high speed ADFEs can be realized using only look-up-tables (LUTs) and shift-accumulate operations. A novel approach was proposed to replace feed forward and feedback filters of ADFE with a single DA unit. By proper initialization, it is also shown that a low complexity ADFE architecture can be obtained.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126264957","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-12-01DOI: 10.1109/ICCSII.2012.6454324
N. Amdouni, M. Koubàa, T. Aguili
This paper considers rerouting and minimization of incurred disruption due to rerouting in all-optical wavelength division multiplexed (WDM) network with dynamic (random) traffic arrivals and departures. One limitation of such a network is the wavelength continuity constraint imposed by the all-optical cross-connect switches which do not allow a circuit to be placed on a non wavelength-continuous route. Rerouting is proposed to rearrange certain existing lightpaths to create a wavelength-continuous route in order to accommodate a new connection request. Recently, a wavelength rerouting scheme called “Parallel Move-To-Vacant Wavelength Retuning (MTV-WR)” with many attractive features such as shorter disruption period and simple switching control has been proposed. In this paper, we propose a new lightpath rerouting scheme based on the “Parallel MTV-WR” rerouting scheme minimizing the rejection ratio whilst keeping a little service disruption period due to rerouting. We assume that a new random lightpath demand (RLD) arrives at time t and that its routing phase fails to set up it. To establish the new RLD the proposed algorithm tries to reroute one or several RLDs by only changing the used wavelength whilst keeping the same physical path in order to reduce the disruption period. If it fails, it tries to reroute a minimum number of active RLDs by changing the physical path and then possibly the used wavelengths. Simulation results show that our proposed algorithm computes a better rejection ratio than the rerouting algorithms previously presented in the literature while keeping a minimum number of rerouted lightpaths and a very small service disruption period.
{"title":"Lightpath rerouting scheme for dynamic traffic in WDM all-optical networks","authors":"N. Amdouni, M. Koubàa, T. Aguili","doi":"10.1109/ICCSII.2012.6454324","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454324","url":null,"abstract":"This paper considers rerouting and minimization of incurred disruption due to rerouting in all-optical wavelength division multiplexed (WDM) network with dynamic (random) traffic arrivals and departures. One limitation of such a network is the wavelength continuity constraint imposed by the all-optical cross-connect switches which do not allow a circuit to be placed on a non wavelength-continuous route. Rerouting is proposed to rearrange certain existing lightpaths to create a wavelength-continuous route in order to accommodate a new connection request. Recently, a wavelength rerouting scheme called “Parallel Move-To-Vacant Wavelength Retuning (MTV-WR)” with many attractive features such as shorter disruption period and simple switching control has been proposed. In this paper, we propose a new lightpath rerouting scheme based on the “Parallel MTV-WR” rerouting scheme minimizing the rejection ratio whilst keeping a little service disruption period due to rerouting. We assume that a new random lightpath demand (RLD) arrives at time t and that its routing phase fails to set up it. To establish the new RLD the proposed algorithm tries to reroute one or several RLDs by only changing the used wavelength whilst keeping the same physical path in order to reduce the disruption period. If it fails, it tries to reroute a minimum number of active RLDs by changing the physical path and then possibly the used wavelengths. Simulation results show that our proposed algorithm computes a better rejection ratio than the rerouting algorithms previously presented in the literature while keeping a minimum number of rerouted lightpaths and a very small service disruption period.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126608160","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-12-01DOI: 10.1109/ICCSII.2012.6454459
F. Sibai, A. Sayegh, I. Al-Taie
Inspection and maintenance of aging pipelines is crucial to the reliable and continued distribution of hydrocarbons. In this paper, we describe the design and construction of a robotic platform for inspection and minor maintenance of pipelines. The 7.5 kg robotic platform was demonstrated to move straight inside 12" to 16" diameter pipes in a forward or backward direction, and either horizontally or vertically. The experimental robotic platform has three sets of two wheels, and three driving motors. The equations governing the mechanical frame's component sizes are presented and the robotic frame component dimensions derived. The paper also discusses the construction and testing of the robot. Future work includes adding sensors, controls for turning, a microcontroller board, and a robotic arm for performing maintenance tasks.
{"title":"Design and construction of an in-pipe robot for inspection and maintenance","authors":"F. Sibai, A. Sayegh, I. Al-Taie","doi":"10.1109/ICCSII.2012.6454459","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454459","url":null,"abstract":"Inspection and maintenance of aging pipelines is crucial to the reliable and continued distribution of hydrocarbons. In this paper, we describe the design and construction of a robotic platform for inspection and minor maintenance of pipelines. The 7.5 kg robotic platform was demonstrated to move straight inside 12\" to 16\" diameter pipes in a forward or backward direction, and either horizontally or vertically. The experimental robotic platform has three sets of two wheels, and three driving motors. The equations governing the mechanical frame's component sizes are presented and the robotic frame component dimensions derived. The paper also discusses the construction and testing of the robot. Future work includes adding sensors, controls for turning, a microcontroller board, and a robotic arm for performing maintenance tasks.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133426900","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-12-01DOI: 10.1109/ICCSII.2012.6454566
T. Shanableh, F. Ishtiaq
In this paper we propose the use of no-reference objective quality assessment to classify the quality of compressed surveillance video. The paper proposes a Macro-Block (MB) level no-reference objective Peak Signal to Noise Ratio (PSNR) classification based on pattern classification techniques. In the proposed system, the feature vectors are extracted from both MPEG coded videos and reconstructed images. The proposed feature extraction scheme is based on both the prediction errors of coded MBs and their prediction sources. The features are modeled using reduced multivariate polynomial classifiers, support vector machines and Bayes classifiers. The paper reports classification accuracy rates up 94%.
{"title":"Pattern classification for assessing the quality of MPEG surveillance video","authors":"T. Shanableh, F. Ishtiaq","doi":"10.1109/ICCSII.2012.6454566","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454566","url":null,"abstract":"In this paper we propose the use of no-reference objective quality assessment to classify the quality of compressed surveillance video. The paper proposes a Macro-Block (MB) level no-reference objective Peak Signal to Noise Ratio (PSNR) classification based on pattern classification techniques. In the proposed system, the feature vectors are extracted from both MPEG coded videos and reconstructed images. The proposed feature extraction scheme is based on both the prediction errors of coded MBs and their prediction sources. The features are modeled using reduced multivariate polynomial classifiers, support vector machines and Bayes classifiers. The paper reports classification accuracy rates up 94%.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131324632","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
扫码关注我们
求助内容：
应助结果提醒方式：