{"title":"A new method of networked video surveillance with privacy area protection","authors":"Jiang Yibo, Yao Xin-wei, Wang Wanliang","doi":"10.1109/ICBNMT.2009.5348462","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348462","url":null,"abstract":"Privacy area protection has become more important than before in networked video surveillance. In this paper, we address privacy area protection related issues. First, the characteristics of security camera with pan/tilt rotation mechanism are introduced and the privacy problems of video surveillance in public areas are analyzed. Then, a new method of protecting privacy areas is proposed to automatically adapt the panning rotation and tilting rotation of security camera. This method contains two steps to calculate the masked area matrix from predetermined privacy area matrix and some static/dynamic basic parameters. Experimental results have shown that the proposed method could work well in real-systems and protect the privacy areas efficiently.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130680681","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}
{"title":"Web document retrieval using manifold learning and ACO algorithm","authors":"Ziqiang Wang, Sun Xia","doi":"10.1109/ICBNMT.2009.5348468","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348468","url":null,"abstract":"To efficiently deal with high dimensionality and precision problems in document retrieval, a novel document retrieval algorithm based on manifold learning and ant colony optimization(ACO) algorithm is proposed. The high-dimensional document data are first projected into lower-dimensional feature space with neighborhood preserving embedding (NPE) algorithm, the ACO algorithm is then applied to retrieve relevant documents in the reduced lower-dimensionality document feature space. Extensive experiments on real-world data set demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132978960","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}
{"title":"HBSIP: A SIP-based mobility management for seamless handover","authors":"K. Qiang, C. Yewen","doi":"10.1109/ICBNMT.2009.5347778","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347778","url":null,"abstract":"In the next generation mobile network, real-time multimedia applications need better network performance, such as lower handoff delay and packet loss rate. This paper proposes a new protocol named HBSIP, which is Hierarchical Bicasing based SIP. HBSIP is an improvement to the traditional mobile SIP, and the core idea is using the bicasting mechanism and hierarchical structure. Although HBSIP brings about additional network traffic load, in return it significantly enhances the network performance, including reducing handoff delay and packet loss rate. Due to the characters and performance of HBSIP, it is very suitable for the future seamless communication.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132028894","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}
{"title":"A survey on the chronological evolution of timestamp schedulers in packet switching networks","authors":"Yaser Miaji, S. Hassan","doi":"10.1109/ICBNMT.2009.5348469","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348469","url":null,"abstract":"The interest in solving the issue of congestion or flow control in network established from the first discovery and increase popularity of the Internet in 1967 or earlier. As the use of the network deployed and the popularity increase, the issue grows and the demand for an optimal or tentative solution becomes obvious. Since that time there has been an intensive effort from the scholars and researchers to solve the congestion control problem. The problem get worse by the engagement of novel traffic with different characteristics for application called realtime applications such as video and voice applications. Another cause of this demand is the user himself. The attempt in solving the congestion problem in network layer was popular in 90's. This article will demonstrate chronologically how the attempts toward timestamp based scheduling in the packet-switch network have been evolved. Furthermore, the benefit and the drawbacks of using a mechanism will be presented. Also, a brief explanation of the mathematical, conceptual or implementation issue of a mechanism is given. The key success of the scheduler in the market will be highlighted. This paper will stimulate the research thinking to identify the importance and the ability of scheduling in routers to enhance quality of service (QoS) for real time application over other solution in several layers. In addition it will assist the researcher to distinguish the key failure of other proposed mechanisms which have not been implemented in real routers.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129627047","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}
{"title":"Budget constrained optimal time scheduling algorithm in grid","authors":"Lv Yi, Liu Chuan, Huang Sheng, Jiang Qing","doi":"10.1109/ICBNMT.2009.5347794","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347794","url":null,"abstract":"Tasks' smallest completion time is a fundamental goal of the grid scheduling, however, the completion time of tasks and cost are often anti-correlated. In this paper, A Budget Constrained Optimal Time Scheduling on the grid computing platforms is discussed, where resources have different speeds of computation and Prices. The task scheduling problem is converted into a linear programming problem. Each resource gains the optimal execution time and the smallest completion time of the task were obtained, under the condition of the budget constraint, using of the simplex algorithm to obtain the optimal solution. The simulation results show that the performance of the algorithm is superior to other similar algorithms.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116291416","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}
Junqiang Zhou, L. Xia, S. Aditya, P. Ping, B. P. Parhusip
{"title":"Nonlinearly chirped grating based continuously tunable high notch rejection microwave photonic filter","authors":"Junqiang Zhou, L. Xia, S. Aditya, P. Ping, B. P. Parhusip","doi":"10.1109/ICBNMT.2009.5347806","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347806","url":null,"abstract":"We propose a continuously tunable high notch rejection microwave photonic filter which is based on a nonlinearly chirped fibre Bragg grating (NLCFBG). The filter response is caused by the dispersion induced by the NLCFBG and tunability is realized through changing the operating optical wavelength. Measured results demonstrating notch frequency tuning of 4.7 GHz with more than 45 dB notch rejection are presented.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128289692","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}
{"title":"Analyzing the technologies of search algorithm based on P2P","authors":"Shen Zhiwei, Ma Shao-wu, W. Jianan, Tang Xiongyan","doi":"10.1109/ICBNMT.2009.5347835","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347835","url":null,"abstract":"The Search engine based P2P give a new solution for internet information search. The best advantage of P2P search engine at using the advanced peer search idea that completely search the internet without through center server and don't limit for information document format and host equipment. The paper introduces the current technology development of P2P search, analyzes the mainstream P2P search algorithm in detail, and give some suggest for the future P2P search work.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133281680","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}
Liao Shiyong, Lin Fuhong, Wu Hengkui, Qin Yajuan, Zhang Hongke
{"title":"An adaptive distributed hybrid search scheme for unstructured peer-to-peer networks","authors":"Liao Shiyong, Lin Fuhong, Wu Hengkui, Qin Yajuan, Zhang Hongke","doi":"10.1109/ICBNMT.2009.5347775","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347775","url":null,"abstract":"We consider a distributed hybrid search scheme for peer-to-peer network in this paper and introduce one link statement function, which is decreasing with the round trip time (RTT) of link. Link statement function is reasonable because they can reflect how well the link worked, for example, overloaded or not. The transition probability function between two nodes is redefined, which depend on not only the association of these two nodes but also the link statement between them. So one node can choose its best neighbor based on the transition probability between them to forward the query message. This algorithm is more robust and adaptive to the dynamic networks.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121854749","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}
{"title":"A novel objective method for evaluating the quality of streaming audio","authors":"Yang Yue, Xie Xiang, Wei Yaodu","doi":"10.1109/ICBNMT.2009.5347854","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5347854","url":null,"abstract":"The goal of this paper is to present a new objective method for evaluating the quality of streaming audio — PESAQ (Perceptual Evaluation of Streaming Audio Quality). According to our experiments, we found that the ITU recommended objective evaluation method — PEAQ(Perceptual Evaluation of Audio Quality) can not fit the subjective quality of streaming audio accurately. To develop the new method PESAQ, firstly, the jitters in the streaming audio are removed by the alignment algorithm, so that we get the aligned streaming audio. Secondly, the degradation between reference audio and the aligned streaming audio is measured by PEAQ, and its result is called ODG (Objective Difference Grade). Thirdly, the degradation between the original streaming audio and the aligned streaming audio is also measured by the DTW (Dynamic Time Warping) minimum distance, which then is mapped to a quality score, DTW-ODG. Finally, the objective score of the quality of streaming audio IP-ODG is computed by adding the two scores of ODG and DTW-ODG together. Our results prove that the proposed method — PESAQ is effective for the objective evaluation of the streaming audio quality and performs better than PEAQ.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124955243","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}
{"title":"The reasearch of hierarchy model for ad hoc network monitoring based on clustering","authors":"Z. Yanping, J. Yue-hui, Cui Yidong, Que Xirong","doi":"10.1109/ICBNMT.2009.5348482","DOIUrl":"https://doi.org/10.1109/ICBNMT.2009.5348482","url":null,"abstract":"Ad hoc network has dynamic topology and large-scale nodes, for the purpose of monitoring and measurement in Ad hoc network, this paper proposes a new frame method of hierarchy model for monitoring, i.e., clusterhead selection mechanism. The mechanism designed a weight formula to handle the comprehensive update considering several factors such as distance, mobile rate, energy during the model establishment period, and three kinds of partial update means in real-time attributes management. It enhances load balance and structure stability in monitor hierarchy model and reduces calculation cost for unnecessary update. The simulation results show that the model using clusterhead selection mechanism was stable and efficient, which could apply to muti-scale networks, achieve conveniently and flexible deployment in Ad hoc network measurement system.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"28 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125468536","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}