Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360850
Zhaopeng Meng, Lianfang Zhang, J. Zhou
Admission control and routing are two key mechanisms for advanced Quality of Service (QoS) and Traffic engineering (TE) support in the data networks. However, traditional QoS and TE solutions usually focus exclusively on routing to achieve network resource usage optimization, while often neglect to give adequate attention to admission control. To provide a more comprehensive solution, a novel approach for admission control in MPLS network was proposed in Ref. [2], which can be applied at network edges to provide the necessary QoS. However, the previously proposed admission control algorithm favors the QoS traffic without considering the influence on the huge amount of existing best-effort traffics. In this paper, we propose a new approach of computing admission thresholds, which takes into account both the best-effort traffic's performance and QoS traffic's constraints. Simulation results show that our new framework can provide additional performance protection for best effort traffic and improve throughput performance of the entire network.
{"title":"Edge admission control in MPLS network","authors":"Zhaopeng Meng, Lianfang Zhang, J. Zhou","doi":"10.1109/ICNIDC.2009.5360850","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360850","url":null,"abstract":"Admission control and routing are two key mechanisms for advanced Quality of Service (QoS) and Traffic engineering (TE) support in the data networks. However, traditional QoS and TE solutions usually focus exclusively on routing to achieve network resource usage optimization, while often neglect to give adequate attention to admission control. To provide a more comprehensive solution, a novel approach for admission control in MPLS network was proposed in Ref. [2], which can be applied at network edges to provide the necessary QoS. However, the previously proposed admission control algorithm favors the QoS traffic without considering the influence on the huge amount of existing best-effort traffics. In this paper, we propose a new approach of computing admission thresholds, which takes into account both the best-effort traffic's performance and QoS traffic's constraints. Simulation results show that our new framework can provide additional performance protection for best effort traffic and improve throughput performance of the entire network.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116301150","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360817
Haiyan Sun, Wenwen Wang
A new algorithm for unsupervised image segmentation is proposed in this paper, which is based on the D-MRF model and ANOVA. Firstly, ANOVA is incorporated to determine the number of clusters combining with several statistics. Compared with models based on information criteria, ANOVA avoids the parameter estimation error, which reduces time consumption. Secondly, histogram is adopted to verify the validity of the new algorithm. Secondly, D-MRF is adopted to setup modeling. Thirdly, based on MRF-MAP, image segmentation is realized through using ICM. In model fitting, DAEM is used to estimate parameters in image field; on the other hand, local entropy is simulated as parameters in label field. Finally, the validity and practicability of the new algorithm are verified by two experiments.
{"title":"A new algorithm for unsupervised image segmentation based on D-MRF model and ANOVA","authors":"Haiyan Sun, Wenwen Wang","doi":"10.1109/ICNIDC.2009.5360817","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360817","url":null,"abstract":"A new algorithm for unsupervised image segmentation is proposed in this paper, which is based on the D-MRF model and ANOVA. Firstly, ANOVA is incorporated to determine the number of clusters combining with several statistics. Compared with models based on information criteria, ANOVA avoids the parameter estimation error, which reduces time consumption. Secondly, histogram is adopted to verify the validity of the new algorithm. Secondly, D-MRF is adopted to setup modeling. Thirdly, based on MRF-MAP, image segmentation is realized through using ICM. In model fitting, DAEM is used to estimate parameters in image field; on the other hand, local entropy is simulated as parameters in label field. Finally, the validity and practicability of the new algorithm are verified by two experiments.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125905659","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360942
Xianyu Meng, Jihong Zhu, Guanglin Li, Xuyan Tu
The unmanned combat aerial vehicle(UCAV) is a intelligent weapon. Based on artificial brain theory, its autonomous control system was divided into three layers which are perception fusion layer, cognition and decision layer, and behavior control layer. In perception fusion layer, information was transmitted from multi-sensors system to relative system and was fused ultimately. In cognition and decision layer, a cognitive model was designed based on three-phase memory mechanisms which were ultra short-time memory and long-time memory. In behavior control layer, planning function was added that increased behavior intelligence. The flight control was simulated using dynamic inversion method. And the result showed the design of execution sub-system was reasonable through tracking the mobile trajectory.
{"title":"Research on autonomous control system structure of UCAV based on cognitive science","authors":"Xianyu Meng, Jihong Zhu, Guanglin Li, Xuyan Tu","doi":"10.1109/ICNIDC.2009.5360942","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360942","url":null,"abstract":"The unmanned combat aerial vehicle(UCAV) is a intelligent weapon. Based on artificial brain theory, its autonomous control system was divided into three layers which are perception fusion layer, cognition and decision layer, and behavior control layer. In perception fusion layer, information was transmitted from multi-sensors system to relative system and was fused ultimately. In cognition and decision layer, a cognitive model was designed based on three-phase memory mechanisms which were ultra short-time memory and long-time memory. In behavior control layer, planning function was added that increased behavior intelligence. The flight control was simulated using dynamic inversion method. And the result showed the design of execution sub-system was reasonable through tracking the mobile trajectory.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125950182","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360969
Tianling Xu, Kaiguo Yuan, Jingzhong Wang, Xinxin Niu, Yixian Yang
Based on the structure of HTTP protocol, a real-time information hiding algorithm was proposed in this paper, to solve the problem that embedding a mass of data in the TCP/IP packet. The secret information is embedded in HTTP protocol header fields. It's proved that the capacity of the algorithm is perfect by experiments, and more than 1000 bytes of data could be embedded in a HTTP request-packet (Get-packet), while the transparency is very well. At the same time, the information hidden will not affect on packets transmitting.
{"title":"A real-time information hiding algorithm based on HTTP protocol","authors":"Tianling Xu, Kaiguo Yuan, Jingzhong Wang, Xinxin Niu, Yixian Yang","doi":"10.1109/ICNIDC.2009.5360969","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360969","url":null,"abstract":"Based on the structure of HTTP protocol, a real-time information hiding algorithm was proposed in this paper, to solve the problem that embedding a mass of data in the TCP/IP packet. The secret information is embedded in HTTP protocol header fields. It's proved that the capacity of the algorithm is perfect by experiments, and more than 1000 bytes of data could be embedded in a HTTP request-packet (Get-packet), while the transparency is very well. At the same time, the information hidden will not affect on packets transmitting.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129410533","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360859
Yun Liu, Q. Peng, H. Shao, Xingfeng Chen, Ling Wang
In this paper, a new approach of blind estimation of subcarrier number based on mutiple signal classfication (MUSIC) algorithm is proposed for MB-OFDM ultra-wide band (UWB) communications system. The proposed eigenvalue-construct method only using signal autocorrelation of orthogonal frequency-division multiplexing (OFDM) symbols estimates the number of subcarriers. The computer simulations show that the proposed approach has a good performance whether it is used in AWGN channel or frequency selective fading channel.
{"title":"Blind estimation of subcarrier numberin in MB-OFDM ultra-wide band communications system","authors":"Yun Liu, Q. Peng, H. Shao, Xingfeng Chen, Ling Wang","doi":"10.1109/ICNIDC.2009.5360859","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360859","url":null,"abstract":"In this paper, a new approach of blind estimation of subcarrier number based on mutiple signal classfication (MUSIC) algorithm is proposed for MB-OFDM ultra-wide band (UWB) communications system. The proposed eigenvalue-construct method only using signal autocorrelation of orthogonal frequency-division multiplexing (OFDM) symbols estimates the number of subcarriers. The computer simulations show that the proposed approach has a good performance whether it is used in AWGN channel or frequency selective fading channel.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129766013","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360915
P. Lau, Hee-Jun Kang, Sungkwon Park, Taekyoon Kim
The present work proposes a new strategy to analyze videos which incorporates viewer's interest to the studies of video content in the selection for intra-coded frames. This new approach studies the low-level video features to extract commonly browsed frames to enable random access while avoiding the overhead in transmitting periodic intra-coded frames. A tri-step process is proposed, where the first step discriminates of the original video stream by detecting the shot boundary and checking adjacent frame characteristics using low level features. The second step refines the initial frame selection by eliminating non-commonly browsed frames. The final step verifies the remaining frames if they are within a time stamp apart to maintain the efficiency of video delivery over low bit rate channel. A framework, named the Video Browsing and Retrieval (VBaR), is developed to analyze the original video stream and allows viewers to analyze the videos at their full control. Experimental results show the ability to effectively select intra-coded frames for video delivery, which could maximizes the resources available while fitting the viewer's browsing requirements.
{"title":"VBaR: Content-sensitive variable GOP length scheme","authors":"P. Lau, Hee-Jun Kang, Sungkwon Park, Taekyoon Kim","doi":"10.1109/ICNIDC.2009.5360915","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360915","url":null,"abstract":"The present work proposes a new strategy to analyze videos which incorporates viewer's interest to the studies of video content in the selection for intra-coded frames. This new approach studies the low-level video features to extract commonly browsed frames to enable random access while avoiding the overhead in transmitting periodic intra-coded frames. A tri-step process is proposed, where the first step discriminates of the original video stream by detecting the shot boundary and checking adjacent frame characteristics using low level features. The second step refines the initial frame selection by eliminating non-commonly browsed frames. The final step verifies the remaining frames if they are within a time stamp apart to maintain the efficiency of video delivery over low bit rate channel. A framework, named the Video Browsing and Retrieval (VBaR), is developed to analyze the original video stream and allows viewers to analyze the videos at their full control. Experimental results show the ability to effectively select intra-coded frames for video delivery, which could maximizes the resources available while fitting the viewer's browsing requirements.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127063929","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360967
Hao Ji, Fei Su, Geng Du
In this paper, we present a robust implementation of multi-face tracker using Joint Feature Model, Kalman filter-based Mean-shift and Speeded-Up Robust Features (SURF), which can tolerate interference caused by objects of similar color, partial occlusion, total occlusion, rotation and scale change. The Joint Feature Model for each person combines the non-parametric distribution of colors in the face region and gradient information of face, Mean-shift based on Kalman filter is adopted to update the position and velocity of the object in real-time and predict the locations in the subsequent frame, and SURF solves the object-recovery problem in occlusion. Experimental results demonstrate the efficiency of the tracking algorithm and the recovery capability even in case of total occlusion.
{"title":"Multiple faces tracking based on joint kernel density estimation and robust feature descriptors","authors":"Hao Ji, Fei Su, Geng Du","doi":"10.1109/ICNIDC.2009.5360967","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360967","url":null,"abstract":"In this paper, we present a robust implementation of multi-face tracker using Joint Feature Model, Kalman filter-based Mean-shift and Speeded-Up Robust Features (SURF), which can tolerate interference caused by objects of similar color, partial occlusion, total occlusion, rotation and scale change. The Joint Feature Model for each person combines the non-parametric distribution of colors in the face region and gradient information of face, Mean-shift based on Kalman filter is adopted to update the position and velocity of the object in real-time and predict the locations in the subsequent frame, and SURF solves the object-recovery problem in occlusion. Experimental results demonstrate the efficiency of the tracking algorithm and the recovery capability even in case of total occlusion.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127335918","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360970
Yanni Li, Dongmei Zhang, G. Wei
CR technology enables CR users the capability to share the wireless channel with licensed users in an opportunistic manner. In cognitive network, once the primary user appears on the spectrum during the entire communication of the CR user, the CR user has to vacate the channel and switch to another one. In this paper, a Spectrum Decision based on Up-Time Ratio of spectrum (SDUTR) is presented, which puts key focus on reducing collision on the licensed spectrum between the primary user and the secondary one. Moreover, the SDUTR algorithm can be operated over heterogeneous spectrum bands. Simulations show that total broadcasting delay and information redundancy of the network are reduced as compared to selective broadcasting [7].
{"title":"Spectrum decision based on Up-Time Radio of spectrum","authors":"Yanni Li, Dongmei Zhang, G. Wei","doi":"10.1109/ICNIDC.2009.5360970","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360970","url":null,"abstract":"CR technology enables CR users the capability to share the wireless channel with licensed users in an opportunistic manner. In cognitive network, once the primary user appears on the spectrum during the entire communication of the CR user, the CR user has to vacate the channel and switch to another one. In this paper, a Spectrum Decision based on Up-Time Ratio of spectrum (SDUTR) is presented, which puts key focus on reducing collision on the licensed spectrum between the primary user and the secondary one. Moreover, the SDUTR algorithm can be operated over heterogeneous spectrum bands. Simulations show that total broadcasting delay and information redundancy of the network are reduced as compared to selective broadcasting [7].","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130607546","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360883
Ying Jiang, Xiaojun Jing
By analyzing the characteristics of degree zerotree, both the EZW wavelet coder and SPIHT wavelet coder have advantages and disadvantages. Combined with the characteristics of wavelet coefficients, a zerotree based on hybrid encoder program was found. With the wavelet zerotree definition, taking the pre-processing zerotree before the zerotree coding, the identification of suitable programs of zerotree encoder comes out. The simulation results show that comparing with the separate use of EZW or SPIHT encoder, the hybrid encoder's encoding algorithm can effectively enhance the efficiency of code compression PSNR.
{"title":"Improved zero-tree coder research based on wavelet coefficients","authors":"Ying Jiang, Xiaojun Jing","doi":"10.1109/ICNIDC.2009.5360883","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360883","url":null,"abstract":"By analyzing the characteristics of degree zerotree, both the EZW wavelet coder and SPIHT wavelet coder have advantages and disadvantages. Combined with the characteristics of wavelet coefficients, a zerotree based on hybrid encoder program was found. With the wavelet zerotree definition, taking the pre-processing zerotree before the zerotree coding, the identification of suitable programs of zerotree encoder comes out. The simulation results show that comparing with the separate use of EZW or SPIHT encoder, the hybrid encoder's encoding algorithm can effectively enhance the efficiency of code compression PSNR.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132047874","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360874
Yanjun Liu
As optical networking becomes a promising choice to meet the ever-increasing demands on bandwidth, constructing multicast wavelength division multiplexing (WDM) switching networks with cheap components and low complexity is a key issue. On the basis of three-stage Clos network, we propose an optimal model of strictly nonblocking multicast (SNBM) WDM optical switching networks. Our analysis shows that the hardware complexity of the proposed model compares favorably to that of existing architectures while the performance is kept high. In addition, compared with wide-sense nonblocking (WSNB) networks, the new model does not need specific routing algorithm which consumes large space and time and is relatively easy to be implemented. Therefore, our model is much more cost-effective and thus practical for both optical circuit-switching and optical packet/burst switching.
{"title":"A new model of nonblocking multicast WDM optical switching network with reduced complexity","authors":"Yanjun Liu","doi":"10.1109/ICNIDC.2009.5360874","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360874","url":null,"abstract":"As optical networking becomes a promising choice to meet the ever-increasing demands on bandwidth, constructing multicast wavelength division multiplexing (WDM) switching networks with cheap components and low complexity is a key issue. On the basis of three-stage Clos network, we propose an optimal model of strictly nonblocking multicast (SNBM) WDM optical switching networks. Our analysis shows that the hardware complexity of the proposed model compares favorably to that of existing architectures while the performance is kept high. In addition, compared with wide-sense nonblocking (WSNB) networks, the new model does not need specific routing algorithm which consumes large space and time and is relatively easy to be implemented. Therefore, our model is much more cost-effective and thus practical for both optical circuit-switching and optical packet/burst switching.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132200058","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
扫码关注我们
求助内容：
应助结果提醒方式：