{"title":"Energy-aware image aggregation in wireless visual sensor networks","authors":"Hong-Hsu Yen","doi":"10.1109/PACRIM.2011.6032957","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032957","url":null,"abstract":"VSN is different from traditional WSN that collect and transmit images/video instead of scalar data to the sink. Images provide richer information than scalar data that enable VSN to be a promising technology on security monitoring and surveillance. Image transmission in VSN is expansive due to its large image size and significant energy consumption. One possible way to reduce the image size is to aggregate the received images on the sensor nodes before transmission. By eliminating the redundant image, image aggregation in VSN could transmit the overlapped region of the images only once to reduce the total energy consumption. However, image aggregation requires image processing at the aggregator node that incurs additional node processing energy. In this paper, we study the energy consumption tradeoff between node image processing and image aggregation. We derive the image aggregation energy consumption model that considers the image processing and image transmission. From the simulation results, image aggregation scheme does help lowering the energy consumption. As compared to the non-aggregation scheme, image aggregation scheme consumes only 46% of the energy consumption. In addition, we also find that the threshold for the number of aggregated nodes. Above this threshold, increasing the number aggregated nodes does not help on reducing the energy consumption. This could help determining the number of aggregated nodes under different degree of aggregation to achieve minimum energy consumption.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125508883","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":"Square root update acceleration of the EM algorithm in Gaussian mixture processes","authors":"I. Shioya, T. Miura","doi":"10.1109/PACRIM.2011.6032887","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032887","url":null,"abstract":"This paper presents a new expectation maximization (EM) algorithm, which employees Square-root Update method combined by conventional Gaussian mixture EM algorithm, to accelerate the parameter learning of Gaussian mixture models. The algorithm enables us to improve poor convergence, avoids us unstable implementation and removes unnecessary iterations by employing inexact searches during the maximization processes. The convergence is faster compared to conventional EM algorithm. Furthermore, our proposal algorithm can be applied to autoregressive Gaussian mixture stationary processes.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121261359","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":"Area spectral efficiency of infrastructure-relay enhanced single-cell wireless systems","authors":"Lei Zhang, Hong-Chuan Yang, M. Hasna","doi":"10.1109/PACRIM.2011.6032994","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032994","url":null,"abstract":"This paper investigates the area spectral efficiency (ASE) of infrastructure-relay enhanced single-cell wireless system. ASE serves as an attractive alternative performance metric by taking into account of the relatively smaller spatial footprint of relay transmission steps. We extend the notion of ASE into relay transmission scenario and derive its accurate mathematical expressions as a function of the coverage distances and transmitting power of both the BS and RSs with the consideration of the random user locations and the impact of path loss and fading effect. We show through selected numerical examples that the relay enhanced systems have the potential to achieve much better ASE performance over the conventional systems.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116521911","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":"Multihop routing and resource allocation for multimedia applications in dynamic spectrum access networks","authors":"Jingkai Su, A. Wyglinski","doi":"10.1109/PACRIM.2011.6032990","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032990","url":null,"abstract":"In this paper, we propose a distributed routing mechanism in dynamic spectrum access (DSA) networks based on a pricing mechanism, in which each node put prices on their relaying services and adjust the price according to the interference condition and the spectrum availability. The proposed mechanism tries to provide required bandwidth for multimedia transmissions in DSA networks. DSA networks employing cognitive radios enable agile transmissions and provide additional transmission capacity that would otherwise be unavailable. Although the technologies applied in DSA networks provide more information than traditional contention-based networks, conventional resource allocation mechanisms cannot fully use these measurements from the MAC layers to regulate the network. The interference pattern in distributed DSA networks is also not the same as it is in contention-based TDMA networks. Consequently, spectrum allocation mechanisms must cooperate with routing algorithms in order to adapt to the rapidly varying environment of distributed wireless networks. Routing decision is made based on the price offered and price for relaying. Resources are allocated during the routing process according to interference predictions based on spectrum measurements. Simulation results show that the proposed approach increased the throughput of the network by approximately 100% in heavy traffic situation relative to an AODV based direct resource allocation approach.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125479161","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":"On the performance of AF opportunistic relaying with adaptive transmission over Rayleigh fading channels","authors":"M. Torabi, D. Haccoun, J. Frigon","doi":"10.1109/PACRIM.2011.6032888","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032888","url":null,"abstract":"We analyze the performance of the amplify-and-forward (AF) opportunistic relaying technique in cooperative systems with adaptive transmission over Rayleigh fading channels. We first consider four adaptive transmission techniques: optimal power and rate adaptation, constant power with optimal rate adaptation, truncated channel inversion with fixed rate, and total channel inversion with fixed rate. We present closed-form expressions for the average channel capacity and outage probability for each adaptation policy. We then consider a rate-adaptive M-QAM modulation technique and we derive closed-form expressions for the average spectral efficiency, outage probability and the average bit error rate. Using numerical evaluations the performances of different cases are compared to show the advantages of each adaptive modulation policy in conjunction with the opportunistic relaying in a cooperative communication over Rayleigh fading channels.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128116441","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 new method for classification of events in noisy hydrophone data","authors":"F. Sattar, P. Driessen, G. Tzanetakis, W. Page","doi":"10.1109/PACRIM.2011.6032972","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032972","url":null,"abstract":"In this paper a new method for classifying events in noisy hydrophone data is developed. The method takes an image processing approach to the 1D hydrophone data by first converting it into a log-frequency spectrogram image (cepstrum). This image is then filtered by reconstructing it based on mutual information (MI) criteria of the dominant orientation map. The features of the reconstructed cepstrum are then enhanced using a combination of edge-tracking and noise smoothing. Feature classification on the processed cepstrum is performed using a least-squares support vector machine (LS-SVM). The method showed event detection sensitivity in excess of 99% for rare events such as whale calls from noisy hydrophone recordings from the NEPTUNE Canada project, with in excess of 97% specificity and 98% overall accuracy. With relatively low computational cost and high accuracy, the proposed method is useful for automated long-term monitoring of a wide variety of marine mammals and human related activities from hydrophone data.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131815082","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":"Vector image retrieval based on approximation of Bezier curves with line segments","authors":"Ryosuke Fujita, Takahiro Hayashi","doi":"10.1109/PACRIM.2011.6032932","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032932","url":null,"abstract":"This paper presents a similarity retrieval system for vector images such as trademarks. The proposed system retrieves vector images from a database using a sketch given by user as a query. The sketch is converted into a vector image format as a pre-processing step for the similarity retrieval. The similarity evaluation is proceeded by the following three steps: (1) approximating Bezier curves representing contours into line-segments, (2) extracting feature points from the line-segments, and (3) measuring the similarity between the sketch and each vector image in the database by computing the difference between the spatial distributions of feature points with the EMD (Earth Mover's Distance). In order to evaluate the retrieval performance of the proposed system, we have conducted experiments using 32 sketches for querying a database containing 1141 trademarks. The retrieval results have shown that to 23 queries in the 32 queries, the correct trademarks are 1st-ranked.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131834488","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":"Hybrid temporal/spatial error concealment strategy robust to scene transitions","authors":"A. Midya, S. Sengupta","doi":"10.1109/PACRIM.2011.6032929","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032929","url":null,"abstract":"Error Concealment (EC) techniques attempt to reconstruct the lost area of a frame in a video sequence using spatial and/or temporal correlation. Temporal error concealment (TEC) performs better than the spatial error concealment (SEC) in terms of PSNR of the reconstructed macroblocks. However, the performance of TEC deteriorates drastically in presence of scene transitions due to lack of temporal correlation. In this paper, we propose an encoder driven scene transition detection which would facilitate error resilience at the encoder and concealment at the decoder. A new edge-direction based spatial error concealment scheme termed DEBSEC is also proposed.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133211248","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":"Matching 3D objects using principle curvatures descriptors","authors":"M. Mousa","doi":"10.1109/PACRIM.2011.6032935","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032935","url":null,"abstract":"The ability to identify similarities between shapes is important for applications such as medical diagnosis, object registration and alignment, and shape retrieval. This paper focuses on handling this issue using one of the well-known features that describe the local intrinsic properties of the shape. This feature is the principle curvatures (k1, k2) of the 3D shape. We introduce a framework of stable mathematical calculations to approximate these geometric properties. Once the principle curvatures are calculated, we can construct, for each shape, a matrix that represents two dimensional distribution of these curvatures as a shape descriptor for further searching operation. This descriptor is invariant to shape orientation and reflects the geometric properties of the surface. Experimental results are presented and it proves the robustness of the descriptor.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131432649","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":"3D object compression using enhanced stripification technique","authors":"Fatma Khairy, M. Mousa, H. Nassar, M. S. Yasein","doi":"10.1109/PACRIM.2011.6032936","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032936","url":null,"abstract":"3D meshes are one of the most common representations of 3D objects that have been used in graphics applications. They often require a huge amount of data for storage and/or transmission. In this paper, we present a new compression algorithm based on stripification of the geometric models that enables us to progressively visualize the 3D models during their transmission. The proposed algorithm encodes the geometry and the connectivity of the input model in an interwoven fashion. The main idea is to store 3D objects as strips files. The algorithm achieves compression ratios above 61 : 1 over ASCII encoded formats resulting in faster transmission and rendering of complex graphical objects.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114967272","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}