-, BM, -, ZC & -, MK 2009, 'Updating Electronic Health Records with Information from Sensor Systems: Considerations Relating To Standards and Architecture Arising From the Development of a Prototype System', Journal of Convergence Information Technology, vol. 4, no. 4, pp. 21-26.
View/Download from: Publisher's site
View description>>
Several countries around the globe are moving towards national and international standards for Electronic Health Records (EHRs). One function of the standards is to guide the long-term convergence of local systems into integrated evolving national health information systems. The Australian commonwealth government is implementing a nationwide EHR system whereby every Australian will be able to upload data to his or her EHR. Thus Australians, if they wish, will eventually be able to upload data from on-body sensors and in-home monitoring systems to their EHRs. This article explores issues associated with the architecture of systems which allow medical records to be updated with information from monitoring/sensor systems. A prototype was developed to determine some of the key architectural considerations. A sensor simulator was implemented for testing purposes which allows a user of the simulator to impersonate a bed or group of in-home or on-body sensors connected with a person who is in a hospital, retirement home or private home. Findings are discussed relating to key architectural considerations including security, maintainability and modularity.
Baccelli, F, Kauffmann, B & Veitch, D 2009, 'Inverse problems in queueing theory and Internet probing', Queueing Systems, vol. 63, no. 1-4, pp. 59-107.
View/Download from: Publisher's site
Baccelli, F, Kauffmann, B & Veitch, D 2009, 'Towards multihop available bandwidth estimation', ACM SIGMETRICS Performance Evaluation Review, vol. 37, no. 2, pp. 83-84.
View/Download from: Publisher's site
View description>>
We evaluate the algorithm proposed in [1], which estimates the residual bandwidth on each hop of an Internet path using a para-metric model which consists of a Kelly queueing network. The evaluation is driven by simulation based on real network traces over a two node path. Correction factors are proposed and evaluated to cope with deviations from model assumptions.
Baccelli, F, Machiraju, S, Veitch, D & Bolot, J 2009, 'The Role of PASTA in Network Measurement', IEEE/ACM Transactions on Networking, vol. 17, no. 4, pp. 1340-1353.
View/Download from: Publisher's site
Bird, TS 2009, 'Definition and Misuse of Return Loss [Report of the Transactions Editor-in-Chief]', IEEE Antennas and Propagation Magazine, vol. 51, no. 2, pp. 166-167.
View/Download from: Publisher's site
Broomhead, T, Ridoux, J & Veitch, D 2009, 'Counter availability and characteristics for feed-forward based synchronization', 2009 International Symposium on Precision Clock Synchronization for Measurement, Control and Communication, pp. 29-34.
View/Download from: Publisher's site
Du, C, Yang, J, Wu, Q & Zhang, T 2009, 'Face recognition using message passing based clustering method', Journal of Visual Communication and Image Representation, vol. 20, no. 8, pp. 608-613.
View/Download from: Publisher's site
View description>>
Traditional subspace analysis methods are inefficient and tend to be affected by noise as they compare the test image to all training images, especifically when there are large numbers of training images. To solve such problem, we propose a fast face recognition (FR) technique called APLDA by combining a novel clustering method affinity propagation (AP) with linear discriminant analysis (LDA). By using AP on the reduced features derived from LDA, a representative face image for each subject can be reached. Thus, our APLDA uses only the representative images rather than all training images for identification. Obviously, APLDA is much more computationally efficient than Fisherface. Also, unlike Fisherface who uses pattern classifier for identification, APLDA performs the identification using AP once again to cluster the test image into one of the representative images. Experimental results also indicate that APLDA outperforms Fisherface in terms of recognition rate. © 2009 Elsevier Inc.
Gunes, H & Piccardi, M 2009, 'Automatic Temporal Segment Detection and Affect Recognition From Face and Body Display', IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, vol. 39, no. 1, pp. 64-84.
View/Download from: Publisher's site
View description>>
Psychologists have long explored mechanisms with which humans recognize other humans' affective states from modalities, such as voice and face display. This exploration has led to the identification of the main mechanisms, including the important role played in the recognition process by the modalities' dynamics. Constrained by the human physiology, the temporal evolution of a modality appears to be well approximated by a sequence of temporal segments called onset, apex, and offset. Stemming from these findings, computer scientists, over the past 15 years, have proposed various methodologies to automate the recognition process. We note, however, two main limitations to date. The first is that much of the past research has focused on affect recognition from single modalities. The second is that even the few multimodal systems have not paid sufficient attention to the modalities' dynamics: The automatic determination of their temporal segments, their synchronization to the purpose of modality fusion, and their role in affect recognition are yet to be adequately explored. To address this issue, this paper focuses on affective face and body display, proposes a method to automatically detect their temporal segments or phases, explores whether the detection of the temporal phases can effectively support recognition of affective states, and recognizes affective states based on phase synchronization/alignment. The experimental results obtained show the following: 1) affective face and body displays are simultaneous but not strictly synchronous; 2) explicit detection of the temporal phases can improve the accuracy of affect recognition; 3) recognition from fused face and body modalities performs better than that from the face or the body modality alone; and 4) synchronized feature-level fusion achieves better performance than decision-level fusion.
Guo, YJ, Liu, D & Bird, NC 2009, 'Guest Editorial for the Special Issue on Antennas and Propagation Aspects of 60–90 GHz Wireless Communications', IEEE Transactions on Antennas and Propagation, vol. 57, no. 10, pp. 2817-2819.
View/Download from: Publisher's site
Hohn, N, Papagiannaki, K & Veitch, D 2009, 'Capturing Router Congestion and Delay', IEEE/ACM Transactions on Networking, vol. 17, no. 3, pp. 789-802.
View/Download from: Publisher's site
Liu, RP, Rosberg, Z, Collings, IB, Wilson, C, Dong, AY & Jha, S 2009, 'Energy Efficient Reliable Data Collection in Wireless Sensor Networks with Asymmetric Links.', Int. J. Wirel. Inf. Networks, vol. 16, no. 3, pp. 131-141.
View/Download from: Publisher's site
View description>>
Field measurements reveal that radio link asymmetry has a severe impact on reliable data delivery. We analyze the energy efficiencies of selected reliability schemes for asymmetric radio links using theoretical models. The analysis provides guidelines for retransmission control so as to balance between reliability and energy consumption. We also design two enhancements to the "implicit" ARQ scheme addressing the negative effects of asymmetric radio links. The energy efficiencies of these algorithms are explicitly derived using our theoretical model and validated by simulations and field trials. Based on the analysis of the two enhanced algorithms, we propose an improvement, referred to as Energy Efficient Reliable Data Collection (EERDC) that controls the retransmissions of the enhanced ARQ schemes. Simulations and field trials confirm our theoretical findings and demonstrate that our proposed EERDC algorithm alleviates the impact of link asymmetry and achieves energy savings. © 2009 Springer Science+Business Media, LLC.
LU, S, ZHANG, J & FENG, DD 2009, 'DETECTING GHOST AND LEFT OBJECTS IN SURVEILLANCE VIDEO', International Journal of Pattern Recognition and Artificial Intelligence, vol. 23, no. 07, pp. 1503-1525.
View/Download from: Publisher's site
View description>>
This paper proposes an efficient method for detecting ghost and left objects in surveillance video, which, if not identified, may lead to errors or wasted computational power in background modeling and object tracking in video surveillance systems. This method contains two main steps: the first one is to detect stationary objects, which narrows down the evaluation targets to a very small number of regions in the input image; the second step is to discriminate the candidates between ghost and left objects. For the first step, we introduce a novel stationary object detection method based on continuous object tracking and shape matching. For the second step, we propose a fast and robust inpainting method to differentiate between ghost and left objects by reconstructing the real background using the candidate's corresponding regions in the current input and background image. The effectiveness of our method has been validated by experiments over a variety of video sequences and comparisons with existing state-of-art methods.
Ridoux, J & Veitch, D 2009, 'Ten Microseconds Over LAN, for Free (Extended)', IEEE Transactions on Instrumentation and Measurement, vol. 58, no. 6, pp. 1841-1848.
View/Download from: Publisher's site
SHANG, F, ABOLHASAN, M & WYSOCKI, T 2009, 'AN ENERGY-EFFICIENT ADAPTIVE CLUSTERING ALGORITHM FOR WIRELESS SENSOR NETWORKS', International Journal of Information Acquisition, vol. 06, no. 02, pp. 117-126.
View/Download from: Publisher's site
View description>>
In this paper, we consider a network of energy constrained sensors deployed over a region. Each sensor node in such a network is systematically gathering and transmitting sensed data to a base station (via clusterheads). This paper focuses on reducing the power consumption of wireless sensor networks. We first extend LEACH's stochastic clusterhead selection algorithm by an average energy-based (LEACH-AE) deterministic component to reduce energy consumption. And then an unequal clustering idea is introduced to further reduce energy consumption of clusterheads. Simulation results show that our modified scheme can extend the network life by up to 38% before the first node dies in the network. Through both theoretical analysis and numerical results, it is shown that the proposed algorithm achieves better performance than the existing clustering algorithms such as LEACH, DCHS, LEACH-C.
Shang, FJ, Abolhasan, M & Wysocki, T 2009, 'Distributed energy efficient unequal clustering algorithm for wireless sensor networks', Tongxin Xuebao/Journal on Communications, vol. 30, no. 10, pp. 34-43.
View description>>
A distributed energy-efficient unequal clustering (DEEUC) algorithm was proposed for wireless sensor networks by research current routing algorithms. The core of DEEUC has three parts. Firstly, when tentative clusterheads are selected, an average energy factor was introduced to balance the residual energy of the whole network nodes so that it may improve the network energy efficiency. Secondly, an energy consumption ratio function was proposed to balance energy-efficient of each node. Finally, an unequal clustering algorithm was proposed for single-hop homogeneous networks. Through both theoretical analysis and numerical results, it is shown that DEEUC prolongs the network lifetime significantly against the other clustering protocols such as LEACH-C and EECS. Under general instance, DEEUC may prolong the lifetime up to 30% against EECS.
Sharp, I, Kegen Yu & Guo, YJ 2009, 'GDOP Analysis for Positioning System Design', IEEE Transactions on Vehicular Technology, vol. 58, no. 7, pp. 3371-3382.
View/Download from: Publisher's site
View description>>
Geometric dilution of precision (GDOP) has been widely used as an accuracy metric for navigation and tracking systems. Since high accuracy in a positioning system requires both accurate measurement of the range and a good geometric relationship between the mobile device and the measuring points, the analysis of GDOP is an essential feature in determining the performance of a positioning system. In this paper, we perform GDOP analysis to obtain concise analytical expressions for a number of scenarios, which are generally applicable to geometries where the mobile device is surrounded by base stations. Comparison of the analytical results with simulations using the typical geometries of indoor positioning systems shows good agreement, except when the mobile position is close to a base station. This effect is a consequence of the ranging errors being a significant proportion of the range in short-range tracking systems and discontinuities in GDOP at the base station. The results provide useful information for the design and testing of tracking systems, as well as for the determination of the geometric deployment of base stations for good GDOP in the coverage area. © 2009 IEEE.
Sharp, I, Yu, K & Guo, YJ 2009, 'Peak and leading edge detection for time-of-arrival estimation in band-limited positioning systems', IET Communications, vol. 3, no. 10, pp. 1616-1616.
View/Download from: Publisher's site
View description>>
The performance of the peak and leading edge detection methods for time-of-arrival (TOA) estimation in band-limited systems is examined. Analytical expressions for the detection performance in the presence of both random noise and multipath interference are derived. A dimensionless performance factor is presented that allows simple comparisons of the TOA estimation algorithms. These equations allow the performance tradeoff analysis to be undertaken without the need for simulations. It is shown that the leading edge detection method has significantly better multipath mitigation characteristics than the peak detection one, but at the expense of inferior noise performance. © 2009, The Institution of Engineering and Technology.
Shen, C, Paisitkriangkrai, S & Zhang, J 2009, 'Efficiently Learning a Detection Cascade with Sparse Eigenvectors', IEEE Transactions on Image Processing, vol. 20, no. 1, pp. 22-35.
View/Download from: Publisher's site
View description>>
In this work, we first show that feature selection methods other thanboosting can also be used for training an efficient object detector. Inparticular, we introduce Greedy Sparse Linear Discriminant Analysis (GSLDA)\cite{Moghaddam2007Fast} for its conceptual simplicity and computationalefficiency; and slightly better detection performance is achieved compared with\cite{Viola2004Robust}. Moreover, we propose a new technique, termed BoostedGreedy Sparse Linear Discriminant Analysis (BGSLDA), to efficiently train adetection cascade. BGSLDA exploits the sample re-weighting property of boostingand the class-separability criterion of GSLDA.
Tang, X, Ma, M, Ostry, D, Jiao, B & Guo, Y 2009, 'Characterizing impulsive network traffic using truncated α-stable processes', IEEE Communications Letters, vol. 13, no. 12, pp. 980-982.
View/Download from: Publisher's site
View description>>
It has been recently recognized that aggregated traffic in a variety of networks exhibits a similar impulsiveness over a wide range of aggregation levels, but approaches a Gaussian distribution in the limit as the aggregation level grows. Although several traffic models have been proposed in the past decade, their accuracy in simultaneously characterizing the above properties still needs to be further improved. In this letter, we propose a truncated α-stable process model which is able to capture the impulsiveness of observed network traffic as well as its tendency toward the Gaussian distribution with aggregation. An inherent physical mechanism is also proposed to give insight into the underlying meaning of the proposed model. Simulation results show that the proposed process achieves close agreement with real traffic and outperforms previous models. © 2006 IEEE.
TIAN, L, YANG, Y-B, FANG, G-F, SHI, J-L & DUTKIEWICZ, E 2009, 'A Scheduling Set Based Integrated Scheduling Algorithm for Unicast and Multicast Traffic *', Journal of Software, vol. 19, no. 12, pp. 3196-3206.
View/Download from: Publisher's site
View description>>
A new problem is addressed, which is how to improve energy efficiency for both unicast and multicast services without violating QoS requirements of mobile stations in 802.16e wireless networks. To solve this problem, a scheduling set based integrated scheduling (SSBIS) algorithm is proposed. SSBIS partitions all the mobile stations into multicast scheduling sets and a unicast scheduling set. All the unicast data of the mobile stations in the multicast scheduling sets are transmitted in the adjacent intervals of their multicast data transmission periods, and for the mobile stations in the unicast scheduling set, longest sleep duration based (LSDB) scheduling scheme is obtained using convex optimization to improve energy efficiency of the whole system. Numerical results show that SSBIS can save overall energy significantly and guarantee the minimum data rates of mobile stations at the same time. © 2008 by Journal of Software.
Veitch, D 2009, 'Scale Invariance in Computer Network Traffic', Scaling, Fractals and Wavelets, pp. 413-436.
View/Download from: Publisher's site
Veitch, D, Ridoux, J & Korada, SB 2009, 'Robust Synchronization of Absolute and Difference Clocks Over Networks', IEEE/ACM Transactions on Networking, vol. 17, no. 2, pp. 417-430.
View/Download from: Publisher's site
WANG, L, WU, Q, LI, M, GONZÀLEZ, J & GENG, XIN 2009, 'EDITORIAL', International Journal of Pattern Recognition and Artificial Intelligence, vol. 23, no. 07, pp. 1221-1222.
View/Download from: Publisher's site
Wang, L, Wu, Q, Wang, H, Geng, X & Li, M 2009, 'Image/video-based pattern analysis and HCI applications', Pattern Recognition Letters, vol. 30, no. 12, pp. 1047-1047.
View/Download from: Publisher's site
Wen, H, Lin, C, Chen, Z-J, Yin, H, He, T & Dutkiewicz, E 2009, 'An Improved Markov Model for IEEE 802.15.4 Slotted CSMA/CA Mechanism', Journal of Computer Science and Technology, vol. 24, no. 3, pp. 495-504.
View/Download from: Publisher's site
View description>>
IEEE 802.15.4 protocol is proposed to meet the low latency and energy consumption needs in low-rate wireless applications, however, few analytical models are tractable enough for comprehensive evaluation of the protocol. To evaluate the IEEE 802.15.4 slotted CSMA/CA channel access mechanism in this paper, we propose a practical and accurate discrete Markov chain model, which can dynamically represent different network loads. By computing the steady-state distribution probability of the Markov chain, we obtain an evaluation formula for throughput, energy consumption, and access latency. Then we further analyze the parameters that influence performance including packet arrival rate, initial backoff exponent and maximum backoff number. Finally, NS2 simulator has been used to evaluate the performance of the 802.15.4 CSMA/CA mechanism under different scenarios and to validate the accuracy of the proposed model. © 2009 Springer.
Yu, K & Guo, YJ 2009, 'Anchor Global Position Accuracy Enhancement Based on Data Fusion', IEEE Transactions on Vehicular Technology, vol. 58, no. 3, pp. 1616-1623.
View/Download from: Publisher's site
View description>>
The location information of sensor nodes in wireless sensor networks is crucial for various applications such as emergency rescue operations, environmental monitoring, home automation, and traffic control. In this paper, a new method to improve the anchor location accuracy in wireless sensor networks is proposed based on fusion of Global Positioning System (GPS) measurements and anchor-to-anchor parameter estimates. Novel algorithms are derived to increase the accuracy of anchor locations using both anchor-to-anchor distance and angle-of-arrival (AOA) estimates for both line-of-sight (LOS) and non-LOS (NLOS) scenarios. When using anchor-to-anchor distance estimates in LOS conditions, an optimization-based algorithm is developed. The Cramer-Rao lower bound (CRLB) is derived to benchmark positioning accuracy in 3-D environments with both GPS measurements and anchor-to-anchor parameter estimates, which has not been studied in the literature. Simulation results demonstrate that the proposed algorithms can substantially improve anchor position accuracy, and the performance of the proposed algorithms approaches the CRLB. © 2008 IEEE.
Yu, K & Guo, YJ 2009, 'Anchor-free localisation algorithm and performance analysis in wireless sensor networks', IET Communications, vol. 3, no. 4, pp. 549-549.
View/Download from: Publisher's site
View description>>
A hybrid anchor-free localisation scheme for multihop wireless sensor networks is presented. First, a relatively dense group of nodes is selected as a base, which are localised by using the multidimensional scaling method. Secondly, the robust quads (RQ) method is employed to localise other nodes, following which the robust triangle and radio range (RTRR) approach is used to perform the localisation task. The RQ and the RTRR methods are used alternately until no more nodes can be localised by the two approaches. Simulation results demonstrate that the proposed hybrid localisation algorithm performs well in terms of both accuracy and the success rate of localisation. To evaluate the accuracy of anchor-free localisation algorithms, the authors derive two different accuracy measures: the Cramer-Rao lower bound (CRLB) to benchmark the coordinate estimation errors and the approximate lower bound to benchmark the distance errors. Simulation results demonstrate that both the CRLB and the distance error lower bound provide references for the accuracy of the location algorithms. © 2009 The Institution of Engineering and Technology.
Yu, K & Guo, YJ 2009, 'Statistical NLOS Identification Based on AOA, TOA, and Signal Strength', IEEE Transactions on Vehicular Technology, vol. 58, no. 1, pp. 274-286.
View/Download from: Publisher's site
View description>>
Nonline-of-sight (NLOS) propagation is one of the challenges in radio positioning. Significant attention has been drawn to the mitigation of the NLOS effect in recent years. This paper focuses on the identification of NLOS conditions by employing the statistical decision theory. A Neyman-Pearson (NP) test method is first derived for scenarios where either 1-D or 2-D angular measurements are provided. A time-of-arrival (TOA) based method is then developed under idealized conditions to provide a performance reference. In the presence of both TOA and received signal strength (RSS) measurements, a joint identification method is derived to efficiently exploit the TOA and RSS measurements. Analytical expressions of the probability of detection (POD) and the probability of false alarm (PFA) are derived for all the scenarios considered. Two theorems and one corollary regarding the line-of-sight (LOS) conditions based on the angle of arrival (AOA) are also presented, and the proofs are provided. Simulation results demonstrate that the proposed methods perform well, and the joint TOA- and RSS-based method considerably outperforms the TOA-based methods. The proposed methods are robust to the model errors, as demonstrated through simulations. It is also shown that the analytical results agree well with the simulated ones. © 2009 IEEE.
Yu, K, Guo, YJ & Hedley, M 2009, 'TOA-based distributed localisation with unknown internal delays and clock frequency offsets in wireless sensor networks', IET Signal Processing, vol. 3, no. 2, pp. 106-106.
View/Download from: Publisher's site
View description>>
Locating sensor nodes in an ad hoc wireless sensor network (WSN) is a challenging task. In general, the network nodes are not synchronised and the internal delays within the nodes are unknown. Here, time-of-arrival (TOA)-based localisation is investigated when practical parameters such as clock time offset, clock frequency offset and system internal delay are all involved. The TOA measurements are made between each pair of nodes that are within radio range. First, an efficient frequency offset (FO) estimation algorithm is derived. Then, a two-stage localisation scheme is proposed. In the first stage, localisation starts from the nodes with the largest numbers of neighbouring anchors and priority is always given to nodes with more neighbouring anchors and/or localised nodes. In the second stage, the locations of all neighbouring nodes are exploited to improve location accuracy. Two iterative algorithms are developed: the Taylor series-based least squares (TS-LS) method and the sequential quadratic programming (SQP) optimisation method. During the localisation process, a number of measures are taken to ensure the reliability of each location estimate to avoid abnormal errors and reduce error propagation. The Cramer-Rao lower bound is also derived to benchmark the location accuracy. © The Institution of Engineering and Technology 2009.
Yue Li, Archer, JW, Tello, J, Rosolen, G, Ceccato, F, Hay, SG, Hellicar, A & Guo, YJ 2009, 'Performance Evaluation of a Passive Millimeter-Wave Imager', IEEE Transactions on Microwave Theory and Techniques, vol. 57, no. 10, pp. 2391-2405.
View/Download from: Publisher's site
View description>>
A cross-correlating 186-GHz passive millimeter-wave imager has been built. The key components in the signal processing hardware are two 186-GHz receivers and a broadband complex correlator. To evaluate the performance of this imager, its point-spread function, beam pattern, baseline vector, and their variations with the scanning direction have been experimentally measured and derived. Some of these results are needed for optimizing the imager’s parameter settings. Others are required for implementing the modulated-beam and modulated-scene algorithms proposed in a previous paper dealing with the imager’s fringe in its point-spread function. These results will also reveal any problems in the construction process of the imager. The theoretical bases for these measurements are analyzed. Novel algorithms for deriving each antenna’s point-spread function and beam pattern, as well as the imager’s baseline vector from the measurement results of the imager’s point-spread function and beam pattern are proposed and successfully applied in the measurements. Experimental results are presented and discussed. © 2009 IEEE.
Abolhasan, M, Hagelstein, B & Wang, JC-P 1970, 'Real-world performance of current proactive multi-hop mesh protocols', 2009 15th Asia-Pacific Conference on Communications, 2009 15th Asia-Pacific Conference on Communications (APCC), IEEE, Shanghai, Shanghai, China, pp. 44-47.
View/Download from: Publisher's site
View description>>
The proliferation of mesh or ad hoc network protocols has lead to a push for protocol standardisation. While there are a number of both open-source and proprietary mesh routing protocols being developed, there is only a small amount of literature available that shows relative strengths and weaknesses of different protocols. This paper investigates the performance of a number of available routing protocols using a real-world testbed. Three routing protocols - optimised link state routing (OLSR), better approach to mobile ad hoc network (B.A.T.M.A.N.) and BABEL - were chosen for this study. Our investigations focus on the multi-hopping performance and the ability of each routing protocol to recover from link failures. Our results show that B.A.T.M.A.N. and BABEL outperform OLSR both in terms of multi-hopping performance and in route re-discovery latency.
Al Aamri, H, Abolhasan, M, Wysocki, T & IEEE 1970, 'On Optimising Route Discovery in Absence of Previous Route Information in MANETs', 2009 IEEE VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, 69th IEEE Vehicular Technology Conference, IEEE, Barcelona, SPAIN, pp. 63-67.
AlAamri, H, Abolhasan, M & Wysocki, T 1970, 'On Optimising Route Discovery in Absence of Previous Route Information in MANETs', VTC Spring 2009 - IEEE 69th Vehicular Technology Conference, 2009 IEEE 69th Vehicular Technology Conference Spring, IEEE, Barcelona, Spain, pp. 1-5.
View/Download from: Publisher's site
View description>>
This paper present a new routing protocol for Ad hoc networks, called On-demand Tree-based Routing Protocol (OTRP). This protocol combines the idea of hop-by-hop routing such as AODV with an efficient route discovery algorithm called Tree-based Optimized Flooding (TOF) to improve scalability of Ad hoc networks when there is no previous knowledge about the destination. To achieve this in OTRP, route discovery overheads are minimized by selectively flooding the network through a limited set of nodes, referred to as branching-nodes. The theoretical analysis and simulation results showed that OTRP outperforms AODV, DYMO, and OLSR and it reduces overheads as number of nodes and traffic increase.
AlAamri, H, Abolhasan, M & Wysocki, T 1970, 'Routing metric for multi-interface and power-aware nodes in heterogeneous MANETs', 2009 15th Asia-Pacific Conference on Communications, 2009 15th Asia-Pacific Conference on Communications (APCC), IEEE, Shanghai, Shanghai, China, pp. 372-375.
View/Download from: Publisher's site
View description>>
This paper presents heterogeneity ratio (HR) as a new routing metric for heterogeneous MANETs. This metric is the ratio of number of powerful nodes to hop count that is used to select the best path to destination. Node heterogeneity is modeled in terms of: types and number of different interfaces, power, and transmission ranges. Our proposed routing metric is based on developing route discovery algorithm that is implemented on the top of on-demand tree-based routing protocol (OTRP)[2] to accommodate nodes heterogeneity. Simulation results show that using HR with OTRP heterogeneity aware outperforms other metrics like minimal hop count and maximal number of powerful nodes.
Alsmairat, I, Shankaran, R, Orgun, M & Dutkiewicz, E 1970, 'Securing Session Initiation Protocol in Voice over IP Domain', 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, 2009 International Conference on Dependable, Autonomic and Secure Computing (DASC), IEEE, pp. 78-83.
View/Download from: Publisher's site
View description>>
Voice service is vulnerable to a number of attacks that can compromise the confidentiality, integrity and authenticity of voice communication. This paper describes the design of communication protocols for securing SIP based VOIP communication. It presents the architectural principles involved and the overall security solution comprising the design of secure extensions to SIP messages. Finally it evaluates the performance of the proposed scheme and presents some results. © 2009 IEEE.
Benter, A, Xu, R, Moore, W, Antolovich, M & Gao, J 1970, 'Fragment size detection within homogeneous material using ground penetrating radar', 2009 International Radar Conference 'Surveillance for a Safer World', RADAR 2009.
View description>>
Ground Penetrating Radar (GPR) offers the ability to observe the internal structure of a pile of rocks. Large fragments within the pile may not be visible on the surface. Determining these large fragment sizes before collection can improve mine productivity. This research has examined the potential to identify objects where the background media and the object exhibit the same dielectric properties. Preliminary results are presented which show identification is possible using standard GPR equipment.
Braun, R, Chaczko, Z & Chiang, F 1970, 'Towards a new information-centric view of Wireless Sensor Networks', BROADBANDCOM 2009 - Selected Papers on Broadband Communication, Information Technology and Biomedical Applications, International Conference of Broadband Communication, Information Technology and Biomedical Applications, BroadBandCom '09, Wroclaw, Poland, pp. 229-232.
View description>>
This paper presents a new paradigm for viewing the work of Wireless Sensor Networks. The Observed Field (OF) is described as a multi-dimensional Information Space (ISp). The Wireless Sensor Network is described as a Transformation Space (TS), while the information collector is a single point consumer of information, described as an Information Sink (ISi). Formal mathematical descriptions are suggested for the OF and the ISp. Mathematical descriptions for the TS and the ISi, based on the notion of Path Mutual Information, are proposed. Information flows from ISp to ISi via TS. TS can be formally thought of as a multi-dimensional transform function between ISp and ISi. It can be aggregated into a notional multidimensional value. This formal mathematical description can be used to create numerical optimization routines for generating TSs, against cost functions such as power consumption, and constraints such as maximum distance between sensors.
Broomhead, T, Ridoux, J & Veitch, D 1970, 'Counter availability and characteristics for feed-forward based synchronization', Precision Clock Synchronization for Measurement, Control and Communication, 2009. ISPCS 2009. International Symposium on, IEEE, pp. 1-6.
Chaczko, Z, Kohli, AS, Chiu, C & Mahadevan, V 1970, 'Patient Information Management: Application of Performance Theories for Healthcare', 2009 International Conference on Information and Multimedia Technology, 2009 International Conference on Information and Multimedia Technology, IEEE, Jeju Island, South Korea, pp. 173-178.
View/Download from: Publisher's site
View description>>
This paper conceptualises the development of a Patient Information Management system to assist health care professionals and carers in providing an enhanced level of support to patients. By focusing on throughput analysis and mission criticality the system designers can make valued judgement on the needs of the professional and system's long term requirements.
Chaczko, Z, Moses, P & Chiu, C 1970, 'Co-operative Extended Kohonen Mapping (EKM) for Wireless Sensor Networks.', EUROCAST, International Conference Las Palmas de Gran Canaria, Spain February 15-20, 2009, Springer, Spain, pp. 897-904.
View description>>
This paper discusses a methodology to manage wireless sensor networks (WSN) with self-organising feature maps, using co-operative Extended Kohonen Maps (EKMs). EKMs have been successfully demonstrated in other machine-learning contexts such as learning sensori-motor control and feedback tasks. Through a quantitative analysis of the algorithmic process, an indirect-mapping EKM can self-organise from a given input space, such as theWSNs external factors, to administer theWSNs routing and clustering functions with a control parameter space. Preliminary results demonstrate indirect mapping with EKMs provide an economical control and feedback mechanism by operating in a continuous sensory control space when compared with direct mapping techniques. By training the control parameter, a faster convergence is made with processes such as the recursive least squares method. The management of a WSNs clustering and routing procedures are enhanced by the co-operation of multiple self-organising EKMs to adapt to actively changing conditions in the environment.
Chiang, F & Braun, R 1970, 'A Biologically Inspired Service Architecture in Ubiquitous Computing Environments', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), International Working Conference on Active and Programmable Networks, Springer Berlin Heidelberg, Sophia Antopolis, France, pp. 253-258.
View/Download from: Publisher's site
View description>>
This paper describes the design of a scalable bio-mimetic framework in the management domain of complex Ubiquitous Service-Oriented Networks. An autonomous network service management platform - SwarmingNet is proposed. In this SwarmingNet architecture, the required network service processes are implemented by a group of highly diverse and autonomic objects. These objects are called Tele-Service Solons as elements of TeleService Holons, analogue to individual insects as particles of the whole colony. A group of TSSs have the capabilities of fulfilling the complex tasks relating to service discovery and service activation. We simulate a service configuration process for Multimedia Messaging Service, and a performance comparison is made between the bio-agents scheme and normal multi-agents scheme. ©IFIP International Federation for Information Processing 2009.
Clarke, J, Lethbridge, J, Liu, RP & Terhorst, A 1970, 'Integrating mobile telephone based sensor networks into the sensor web', 2009 IEEE Sensors, 2009 IEEE Sensors, IEEE, Christchurch, NEW ZEALAND, pp. 1010-+.
View/Download from: Publisher's site
Davis, D & Chaczko, Z 1970, 'Environmental monitoring system', BROADBANDCOM 2009 - Selected Papers on Broadband Communication, Information Technology and Biomedical Applications, International Conference of Broadband Communication, Information Technology and Biomedical Applications, BroadBandCom '09, Wroclaw, Poland, pp. 215-221.
View description>>
The Environmental Monitoring System's (EMS) main purpose is to monitor key environmental factors utilising incorporated wireless sensor networks (WSN) technology. While the system discussed in this paper is intended to be an integrated turnkey solution for Chemical Manufacturing Plants it is flexible enough to be adapted to static or dynamic situations that warrant environmental monitoring. Principally the discussion looks at various issues that confront the deployment of a supervisory system employing a WSN.
Dyadyuk, V, Bunton, JD & Guo, YJ 1970, 'Study on high rate long range wireless communications in the 71-76 and 81-86 GHz bands', European Microwave Week 2009, EuMW 2009: Science, Progress and Quality at Radiofrequencies, Conference Proceedings - 39th European Microwave Conference, EuMC 2009, pp. 1315-1318.
View/Download from: Publisher's site
View description>>
Performance of high data rate wireless line-of-sight communications in the E-band is analysed using an example of the spectrally efficient multi-gigabit system reported earlier. This paper discussed available technologies, potentials of a further increase of the communication range and challenges in development of the future multi-gigabit wireless networks. © 2009 EuMA.
Dyadyuk, V, Guo, YJ & Bunton, JD 1970, 'Multi-gigabit wireless communication technology in the E-band', 2009 1st International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace & Electronic Systems Technology, Electronic Systems Technology (Wireless VITAE), IEEE, pp. 137-141.
View/Download from: Publisher's site
View description>>
The enabling technologies and challenges in development of multi-gigabit wireless communication systems in the E-band are discussed. Potentials of the further improvement of the fixed wireless links performance and feasibility of development of the future ad-hoc or mobile wireless networks in the E-band are evaluated. © 2009 IEEE.
Dyadyuk, V, Guo, YJ & Bunton, JD 1970, 'Multi-Gigabit Wireless Communication Technology in the E-band', 2009 1ST INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATION, VEHICULAR TECHNOLOGY, INFORMATION THEORY AND AEROSPACE & ELECTRONIC SYSTEMS TECHNOLOGY, VOLS 1 AND 2, 1st International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace and Electronic Systems Technology, IEEE, Aalborg, DENMARK, pp. 142-146.
Eyal, A & Braun, R 1970, 'A Model for Scalable and Autonomic Network Management', ACTIVE AND PROGRAMMABLE NETWORKS, 7th International Working Conference on Active and Programmable Networks, SPRINGER-VERLAG BERLIN, Sophia Antipolis, FRANCE, pp. 194-199.
Eyal, A & Braun, R 1970, 'A Model for Scalable and Autonomic Network Management', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), International Working Conference on Active and Programmable Networks, Springer Berlin Heidelberg, Nice, France, pp. 194-199.
View/Download from: Publisher's site
View description>>
Current telecommunication network management systems rely extensively on human intervention. They are also prone to fundamental changes as the managed network evolves. These two attributes, combined with the growing complexity of networks and services, make the cost of network management very high. In recent years, we have witnessed the emergence of artificial intelligence applications. Some are aimed at the creation of autonomic network management systems. This paper offers a novel approach to the design of a network management system that incorporates intelligent agents. As a benchmark to this model, we use two approaches most widely in use in network management systems today. The focus of this paper is on synchronization issues, service discovery and policy enforcement. ©IFIP International Federation for Information Processing 2009.
Fang, G & Dutkiewicz, E 1970, 'BodyMAC: Energy efficient TDMA-based MAC protocol for Wireless Body Area Networks', 2009 9th International Symposium on Communications and Information Technology, 2009 9th International Symposium on Communications and Information Technology (ISCIT), IEEE, pp. 1455-1459.
View/Download from: Publisher's site
View description>>
Wireless Body Area Networks (WBANs) enable placement of tiny biomedical sensors on or inside the human body to monitor vital body signs. The IEEE 802.15.6 task group is developing a standard to optimize WBAN performance by defining the physical layer (PHY) and media access control (MAC) layer specifications. In this paper an energy efficient MAC protocol (BodyMAC) is proposed. It uses flexible bandwidth allocation to improve node energy efficiency by reducing the possibility of packet collisions and by reducing radio transmission times, idle listening and control packets overhead. BodyMAC is based on a Downlink and Uplink scheme in which the Contention Free Part in the Uplink subframe is completely collision free. Three types of bandwidth allocation mechanisms allow for flexible and efficient data and control communications. An efficient Sleep Mode is introduced to reduce the idle listening duration, especially for low duty cycle nodes in the network. Simulation results show superior performance of BodyMAC compared to that of the IEEE 802.15.4 MAC. ©2009 IEEE.
Gannapathy, VR, Ahmad, MR, Suaidi, MK, Johal, MS & Dutkiewicz, E 1970, 'Concurrent MAC with Short Signaling for multi-hop Wireless Mesh Networks', 2009 International Conference on Ultra Modern Telecommunications & Workshops, Workshops (ICUMT), IEEE.
View/Download from: Publisher's site
View description>>
The IEEE 802.11 Distributed Coordination Function (DCF) Medium Access Control (MAC) protocol continues to suffer from throughput degradation when directly applied in multi-hop Wireless Mesh Network (WMN). The Request-to-Send/Clear-to-Send (RTS/CTS) signaling partially solved hidden node problems however the exposed node problems remain unaddressed. The IEEE 802.11 MAC does not allow the exposed nodes to initiates its transmission for the entire duration of ongoing transmission over multi-hop network leads to throughput degradation. Moreover, the amount of needed signaling packets takes place at every hop reduces the overall multi-hop throughput significantly. This project proposes a set of enhancement to the existing IEEE 802.11 DCF MAC by enabling concurrent transmission by the exposed nodes and reduces the amount of signaling packets (CMAC-SS) required at every hop until the data packet reaches its destination. Analytical models are developed and simulated over quasi-static Rayleigh fading channel. The multi-hop network performances are evaluated in terms of throughput and delay. The CMAC-SS protocol outperforms the existing IEEE DCF MAC with more than 14% increase in overall throughput of multi-hop WMN. ©2009 IEEE.
Ge, Y, Sun, Y, Lu, S & Dutkiewicz, E 1970, 'ADSD: An Automatic Distributed Spectrum Decision method in Cognitive Radio networks', 2009 First International Conference on Future Information Networks, 2009 First International Conference on Future Information Networks (ICFIN), IEEE, pp. 253-258.
View/Download from: Publisher's site
View description>>
With the development of Cognitive Radio networks, in order to fully utilize the scarce spectrum resources, secondary users are capable of exploiting the available spectrum of primary users. However, when there are several spectrum options available, how to select an appropriate one for the secondary user according to the spectrum quality and the QoS requirements of different kinds of applications is a new challenge. In this paper, we propose a new Automatic Distributed Spectrum Decision (ADSD) method to solve this problem. ADSD considers multiple characterization parameters, in particular, the primary users' arrival probability, to estimate the quality of the available spectrum options. A weight self-generation mechanism is included to automatically determine the weights of different parameters, thus avoiding the difficulty and irrationality when relying on the users to specify the weights directly. In addition, in conjunction with the reconfiguration mechanism, ADSD can reduce the rate of spectrum handoffs by reconfiguring the transmission parameters rather than making a new decision for the existing transmission. Simulation results show that without any users' interference, ADSD can automatically select the appropriate spectrum for transmission and significantly improve the Cognitive Radio network performance in terms of throughput and the spectrum handoff rate. ©2009 IEEE.
Huang, X & Guo, Y 1970, 'Achieving higher throughput for OFDM systems with parallel packet transmission', Australia communications theory workshop, Australia communications theory workshop, Sydney, Australia.
Huang, X & Guo, YJ 1970, 'Frequency and Space Precoded MIMO OFDM with Substream Adaptation', 2009 IEEE Wireless Communications and Networking Conference, 2009 IEEE Wireless Communications and Networking Conference, IEEE.
View/Download from: Publisher's site
View description>>
A new frequency and space precoding scheme for multiple input multiple output (MIMO) orthogonal frequency division multiplexing (OFDM) systems is presented. For frequency precoding, the data symbols to be transmitted are divided into multiple substreams, and a predefined unitary matrix is applied to each substream to obtain different linear combinations of data symbols in the substream to gain frequency diversity. For space precoding, different precoding matrices selected from a predefined orthogonal matrix are used to allocate each frequency precoded data symbol to all transmit antennas to gain spatial diversity. The number of substreams and the corresponding data symbol mapping scheme are also adaptively determined at the receiver under varying received signal strength and MIMO channel conditions, and are made available to the transmitter through a low-rate feedback channel. Simulation results show that the proposed MIMO OFDM system with adaptive substream selection can effectively exploit both frequency and spatial diversity, and deliver the maximum system throughput. © 2009 IEEE.
Huang, X & Guo, YJ 1970, 'MSE Bounds for Phase Estimation in Presence of Recursive Nuisance Parameters', GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, IEEE.
View/Download from: Publisher's site
View description>>
The mean squared error (MSE) is commonly used to measure and compare the performance of various phase estimation techniques in communications and signal processing systems. When the received signal contains recursive nuisance parameters, the MSE is extremely difficult to obtain and even the conventional modified Cramér-Rao bound (MCRB) can not be readily applied. In this paper, a recursive MSE bound and its simplified calculation method are proposed to solve the problem. As an application example, an adaptive hybrid antenna array and its associated angle-of-arrival (AoA) estimation technique are presented. The MSE of the AoA estimation is simulated and compared with the recursive MSE bound and MCRB. The results show that the proposed recursive MSE bound provides a tighter lower MSE bound than the recursive MCRB.
Huang, X & Guo, YJ 1970, 'Parallel Packet Transmission Based on OFDM', 2009 IEEE Wireless Communications and Networking Conference, 2009 IEEE Wireless Communications and Networking Conference, IEEE.
View/Download from: Publisher's site
View description>>
This paper proposes a parallel packet transmission (PPT) scheme based on orthogonal frequency division multiplexing (OFDM). The principle of the PPT scheme is to divide a packet into a number of smaller parallel packets, and transmit each smaller packet over an individual subcarrier of the OFDM symbols instead of spreading the data bits in a packet across a number of different subcarriers. It is proved theoretically that the proposed PPT scheme has higher average throughput than the conventional serial packet transmission without precoding. Furthermore, simulation results show that the OFDM system with PPT outperforms the precoded OFDM system with minimum mean squared error equalization in both uncoded and coded cases in terms of average throughput. The PPT scheme provides an alternative and simpler means to combat frequency-selective fading. © 2009 IEEE.
Huang, X, Guo, YJ & Bunton, J 1970, 'Adaptive AoA Estimation and Beamforming with Hybrid Antenna Arrays', 2009 IEEE 70th Vehicular Technology Conference Fall, 2009 IEEE Vehicular Technology Conference (VTC 2009-Fall), IEEE.
View/Download from: Publisher's site
View description>>
A new type of hybrid antenna array consisting of analogue subarrays followed by a digital beamformer is proposed for practical implementation of long range high data rate millimetre wave communications systems. An adaptive algorithm, referred to as the differential beam search (DBS), is proposed for the angle of arrival (AoA) estimation to control the phase shifters in the analogue subarrays and to perform digital beamforming. This algorithm does not need the knowledge of a reference signal and effectively solves the phase ambiguity problem in AoA estimation inherent to the practical subarray configuration. The performance of the proposed DBS algorithms is demonstrated by simulations. © 2009 IEEE.
Jamdagni, A, Tan, Z, Nanda, P, He, X & Liu, R 1970, 'Intrusion Detection Using Geometrical Structure', 2009 Fourth International Conference on Frontier of Computer Science and Technology, 2009 Fourth International Conference on Frontier of Computer Science and Technology (FCST), IEEE, Shanghai, China, pp. 327-333.
View/Download from: Publisher's site
View description>>
We propose a statistical model, namely Geometrical Structure Anomaly Detection (GSAD) to detect intrusion using the packet payload in the network. GSAD takes into account the correlations among the packet payload features arranged in a geometrical structure. The representation is based on statistical analysis of Mahalanobis distances among payload features, which calculate the similarity of new data against precomputed profile. It calculates weight factor to determine anomaly in the payload. In the 1999 DARPA intrusion detection evaluation data set, we conduct several tests for limited attacks on port 80 and port 25. Our approach establishes and identifies the correlation among packet payloads in a network. © 2009 IEEE.
Jin, X, Yang, Y, Tian, L, Pang, D, Shi, J & Dutkiewicz, E 1970, 'QoS-Aware Optimal Power Allocation with Channel Inversion Regularization Precoding in MU-MIMO', 2009 IEEE International Conference on Communications, ICC 2009 - 2009 IEEE International Conference on Communications, IEEE.
View/Download from: Publisher's site
View description>>
In multiuser MIMO systems, the Channel Inversion Regularization (CIR) precoding outperforms Zero-Forcing (ZF) in the case of a small number of users and low SNR. However, unlike the zero-interference ZF, the optimal power allocation issue using CIR is a nonconvex optimization problem which will become more intractable with nonconvex QoS constraints. In this paper we focus on the challenging QoS-aware optimal power allocation problem, aiming to maximize the system sum rate and guarantee the users' minimum data rates. As a result, an "Iterative Geometric Programming" (IGP) strategy is proposed which transforms the underlying problem to a series of tractable Geometric Programming (GP) problems through an iterative convex approximation. Extensive simulations have been conducted and the results indicate that IGP is quite suitable to tackle the problem, which can achieve a good balance between the system sum rate and the individual QoS requirements. ©2009 IEEE.
Khan, MAY & Veitch, D 1970, 'Isolating Physical PER for Smart Rate Selection in 802.11', IEEE INFOCOM 2009, 2009 Proceedings IEEE INFOCOM, IEEE, IEEE, pp. 1080-1088.
View/Download from: Publisher's site
Kusakunniran, W, Li, H & Zhang, J 1970, 'A Direct Method to Self-Calibrate a Surveillance Camera by Observing a Walking Pedestrian', 2009 Digital Image Computing: Techniques and Applications, 2009 Digital Image Computing: Techniques and Applications, IEEE, Melbourne, VIC, pp. 250-255.
View/Download from: Publisher's site
View description>>
Recent efforts show that it is possible to calibrate a surveillance camera simply from observing a walking human. This procedure can be seen as a special application of the camera self-calibration technique. Several methods have been proposed along this
Kusakunniran, W, Wu, Q, Li, H & Zhang, J 1970, 'Automatic Gait Recognition Using Weighted Binary Pattern on Video', 2009 Sixth IEEE International Conference on Advanced Video and Signal Based Surveillance, 2009 Sixth IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS), IEEE, Genoa, Italy, pp. 49-54.
View/Download from: Publisher's site
View description>>
Human identification by recognizing the spontaneous gait recorded in real-world setting is a tough and not yet fully resolved problem in biometrics research. Several issues have contributed to the difficulties of this task. They include various poses, different clothes, moderate to large changes of normal walking manner due to carrying diverse goods when walking, and the uncertainty of the environments where the people are walking. In order to achieve a better gait recognition, this paper proposes a new method based on Weighted Binary Pattern (WBP). WBP first constructs binary pattern from a sequence of aligned silhouettes. Then, adaptive weighting technique is applied to discriminate significances of the bits in gait signatures. Being compared with most of existing methods in the literatures, this method can better deal with gait frequency, local spatial-temporal human pose features, and global body shape statistics. The proposed method is validated on several well known benchmark databases. The extensive and encouraging experimental results show that the proposed algorithm achieves high accuracy, but with low complexity and computational time. © 2009 IEEE.
Kusakunniran, W, Wu, Q, Li, H & Zhang, J 1970, 'Multiple views gait recognition using View Transformation Model based on optimized Gait Energy Image', 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops, IEEE, Kyoto, Japan, pp. 1058-1064.
View/Download from: Publisher's site
View description>>
Gait is one of well recognized biometrics that has been widely used for human identification. However, the current gait recognition might have difficulties due to viewing angle being changed. This is because the viewing angle under which the gait signature database was generated may not be the same as the viewing angle when the probe data are obtained. This paper proposes a new multi-view gait recognition approach which tackles the problems mentioned above. Being different from other approaches of same category, this new method creates a so called View Transformation Model (VTM) based on spatial-domain Gait Energy Image (GEI) by adopting Singular Value Decomposition (SVD) technique. To further improve the performance of the proposed VTM, Linear Discriminant Analysis (LDA) is used to optimize the obtained GEI feature vectors. When implementing SVD there are a few practical problems such as large matrix size and over-fitting. In this paper, reduced SVD is introduced to alleviate the effects caused by these problems. Using the generated VTM, the viewing angles of gallery gait data and probe gait data can be transformed into the same direction. Thus, gait signatures can be measured without difficulties. The extensive experiments show that the proposed algorithm can significantly improve the multiple view gait recognition performance when being compared to the similar methods in literature. ©2009 IEEE.
Liu, RP, Sutton, G & Collings, IB 1970, 'A 3-D Markov Chain Queueing Model of IEEE 802.11 DCF with Finite Buffer and Load', 2009 IEEE International Conference on Communications, ICC 2009 - 2009 IEEE International Conference on Communications, IEEE, Dresden, GERMANY, pp. 5320-+.
View/Download from: Publisher's site
Moghaddam, Z & Piccardi, M 1970, 'Deterministic Initialization of Hidden Markov Models for Human Action Recognition', 2009 Digital Image Computing: Techniques and Applications, 2009 Digital Image Computing: Techniques and Applications, IEEE, Melbourne, Australia, pp. 188-195.
View/Download from: Publisher's site
View description>>
Human action recognition is often approached in terms of probabilistic models such as the hidden Markov model or other graphical models. When learning such models by way of Expectation- Maximisation algorithms, arbitrary choices must be made for their initial parameters. Often, solutions for the selection of the initial parameters are based on random functions. However, in this paper, we argue that deterministic alternatives are preferable, and propose various methods. Experiments on a video dataset prove that the deterministic initialization is capable of achieving an accuracy that is comparable to or above the average from random initializations and suffers from no deviation thanks to its deterministic nature. The methods proposed naturally extend to be used with other graphical models such as dynamic Bayesian networks and conditional random fields.
Mohamed Mowjoon, D, Agbinya, JI & Chaczko, ZC 1970, 'Replicating Cytokines in Modelling Signal Exchange between Nodes in Wireless Mesh Networks', The International MultiConference of Engineers and Computer Scientists 2009, IAENG International Conference on Communication Systems and Applications, Newswood Limited, International Association of Engineers, Regal Kowloon Hotel, Kowloon, Hong Kong, pp. 315-318.
View description>>
In recent years wireless mesh network (WMN) technologies and their applications have been actively researched and developed as the promising solution for future wireless mobile networks. Conversely security of WMN is often a secondary reflection in development. In our previous work we proposed Artificial Immune System model to employ in secure routing in WMN. This paper proposes an emerging perception to model danger signal exchange between nodes in WMN by emulating the function of Cytokines in Human Immune System (HIS).
Otoom, AF, Concha, OP, Gunes, H & Piccardi, M 1970, 'Mixtures of Normalized Linear Projections', ADVANCED CONCEPTS FOR INTELLIGENT VISION SYSTEMS, PROCEEDINGS, Advanced Concepts for Intelligent Vision Systems, Springer, Bordeaux, France, pp. 66-76.
View/Download from: Publisher's site
View description>>
High dimensional spaces pose a challenge to any classification task. In fact, these spaces contain much redundancy and it becomes crucial to reduce the dimensionality of the data to improve analysis, density modeling, and classification. In this paper, we present a method for dimensionality reduction in mixture models and its use in classification. For each component of the mixture, the data are projected by a linear transformation onto a lower-dimensional space. Subsequently, the projection matrices and the densities in such compressed spaces are learned by means of an Expectation Maximization (EM) algorithm. However, two main issues arise as a result of implementing this approach, namely: 1) the scale of the densities can be different across the mixture components and 2) a singularity problem may occur. We suggest solutions to these problems and validate the proposed method on three image data sets from the UCI Machine Learning Repository. The classification performance is compared with that of a mixture of probabilistic principal component analysers (MPPCA). Across the three data sets, our accuracy always compares favourably, with improvements ranging from 2.5% to 35.4%. © 2009 Springer Berlin Heidelberg.
Paisitkriangkrai, S, Chunhua Shen & Jian Zhang 1970, 'Efficiently training a better visual detector with sparse eigenvectors', 2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Miami, FL, pp. 1129-1136.
View/Download from: Publisher's site
View description>>
Face detection plays an important role in many vision applications. Since Viola and Jones [1] proposed the first real-time AdaBoost based object detection system, much ef- fort has been spent on improving the boosting method. In this work, we first show
Paisitkriangkrai, S, Chunhua Shen & Zhang, J 1970, 'Efficiently training a better visual detector with sparse eigenvectors', 2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPR Workshops), IEEE.
View/Download from: Publisher's site
Pang, D, Tian, L, Hu, J, Zhou, J, Shi, J & Dutkiewicz, E 1970, 'Downlink Scheduling for QoS-Guaranteed Services in Multi-User MIMO Systems with Limited Feedback', 2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, IEEE International Conference on Communications (ICC 2009), IEEE, Dresden, GERMANY, pp. 4810-+.
Pang, D, Tian, L, Hu, J, Zhou, J, Shi, J & Dutkiewicz, E 1970, 'Downlink Scheduling for QoS-Guaranteed Services in Multi-User MIMO Systems with Limited Feedback', 2009 IEEE International Conference on Communications, ICC 2009 - 2009 IEEE International Conference on Communications, IEEE.
View/Download from: Publisher's site
View description>>
Significant throughput gains and system fairness can be obtained by employing scheduling schemes based on precoding techniques. However, QoS guarantee requirements are seldom taken into account. In this paper, we propose a downlink scheduling algorithm for QoS-guaranteed services in multi-user multiple-input multiple-output (MIMO) systems with limited feedback. The proposed algorithm combines stream selection with multi-user packet scheduling. To maximize the overall capacity and reduce co-channel interference, streams are selected in accordance with precoding matrices. In multi-user packet scheduling, the base station first determines the SDMA region size for the primary streams. In addition, packet scheduling for the secondary streams is performed to completely exploit spatial multiplexing gains. Numerical results show that, at the cost of slightly lower system fairness, the proposed algorithm can achieve higher spectrum efficiency, and have a noticeable improvement in guaranteeing QoS requirements in terms of data rates and delay. ©2009 IEEE.
Park, M, Jin, JS, Xu, M, Wong, WSF, Luo, S & Cui, Y 1970, 'Microscopic image segmentation based on color pixels classification', Proceedings of the First International Conference on Internet Multimedia Computing and Service, ICIMCS '09: The First International Conference on Internet Multimedia Computing and Service, ACM, pp. 53-59.
View/Download from: Publisher's site
View description>>
The computer-assisted microscopy systems can increase the accuracy of the analysis. To guarantee correct results in computer-assisted microscopy, accurate nuclei segmentation is crucially important since images segmentation is the first step towards image understanding and image analysis. In this paper, we present clustering techniques to segment homogeneous clusters in RGB color space and then label each cluster as a different region. According to the evaluation process, 97% of nuclei pixels were correctly delineated with our algorithm and on average 90% of nuclei were correctly detected. Our methods could be of value to computer-based systems designed to objectively interpret microscopic images by accurate nuclei segmentation. Copyright 2009 ACM.
Qian, M, Huang, Y, Shi, J, Yuan, Y, Tian, L & Dutkiewicz, E 1970, 'A Novel Radio Admission Control Scheme for Multiclass Services in LTE Systems', GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, IEEE.
View/Download from: Publisher's site
View description>>
In this paper, a novel radio admission control (RAC) scheme is proposed for handling multiclass services in Long Term Evolution (LTE) systems. An objective function of maximizing the number of admitted users is proposed to evaluate the system capacity. To solve the optimization problem, we present a combined complete sharing (CS) and virtual partitioning (VP) resource allocation model and develop a service degradation scheme in case of resource limitations in the proposed RAC scheme. Call blocking probability, system resource utilization and system capacity are used as performance metrics and are evaluated by using a K-dimensional Markov Chain model. Numerical results show that an optimal proportion of resource deployment for different service groups can be identified to maximize system capacity while at the same time maintaining quality of service (QoS) constraints of all admitted users.
Qian, M, Huang, Y, Shi, J, Yuan, Y, Tian, L & Dutkiewicz, E 1970, 'A Novel Radio Admission Control Scheme for Multiclass Services in LTE Systems', GLOBECOM 2009 - 2009 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-8, IEEE Global Telecommunications Conference (GLOBECOM 09), IEEE, Honolulu, HI, pp. 2230-2235.
Qin, PY, Weily, AR, Guo, YJ & Liang, CH 1970, 'A Reconfigurable Quasi-Yagi Folded Dipole Antenna', 2009 IEEE ANTENNAS AND PROPAGATION SOCIETY INTERNATIONAL SYMPOSIUM AND USNC/URSI NATIONAL RADIO SCIENCE MEETING, VOLS 1-6, IEEE Antennas and Propagation International Symposium /USNC/URSI National Radio Science Meeting, IEEE, N Charleston, SC, pp. 2092-+.
Qin, PY, Weily, AR, Guo, YJ & Liang, CH 1970, 'A reconfigurable quasi-Yagi folded dipole antenna', 2009 IEEE Antennas and Propagation Society International Symposium, 2009 IEEE Antennas and Propagation Society International Symposium (APSURSI), IEEE, IEEE, pp. 1-4.
View/Download from: Publisher's site
Qumer, A & Henderson-Sellers, B 1970, 'Agile Software Solution Framework: An Analysis of Practitioners' Perspectives', INFORMATION SYSTEMS: MODELING, DEVELOPMENT, AND INTEGRATION, Information Systems: Modeling, Development, and Integration, Springer-Verlag, Campbelltown, NSW, pp. 41-52.
View/Download from: Publisher's site
View description>>
We have developed an agile software solution framework (ASSF) to create and tailor situation-specific agile methods by using a method engineering approach. Here, we report on a questionnaire-based survey with thirty-three experts in order to determine the relevance and importance of the aspects or elements of agile software development methodology specified in ASSF. We have analysed the relevance and importance that each respondent places on the identified elements of the ASSF. © 2009 Springer Berlin Heidelberg.
Ricciato, F, Coluccia, A, D'Alconzo, A, Veitch, D, Borgnat, P & Abry, P 1970, 'On the Role of Flows and Sessions in Internet Traffic Modeling: An Explorative Toy-Model', GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, IEEE, IEEE, pp. 1-8.
View/Download from: Publisher's site
Richard Yi Da Xu & Kemp, M 1970, 'Multiple curvature based approach to human upper body parts detection with connected ellipse model fine-tuning', 2009 16th IEEE International Conference on Image Processing (ICIP), 2009 16th IEEE International Conference on Image Processing ICIP 2009, IEEE, pp. 2577-2580.
View/Download from: Publisher's site
View description>>
In this paper, we discuss an effective method for detecting human upper body parts from a 2D image silhouette using curvature analysis and ellipse fitting. First we smooth the silhouette so that we can determine just the global features: the head, hands and armpits. Next we reduce the smoothing to detect the local features of the neck and elbows. We model the human upper body by multiple connected ellipses. Thus we segment the body by the extracted features. Ellipses are fitted to each segment. Lastly, we apply a non-linear least square method to minimize the differences between the connected ellipse model and the edge of the silhouette. ©2009 IEEE.
Ruo Du, Qiang Wu, Xiangjian He, Wenjing Jia & Daming Wei 1970, 'Facial expression recognition using histogram variances faces', 2009 Workshop on Applications of Computer Vision (WACV), 2009 Workshop on Applications of Computer Vision (WACV), IEEE, Snowbird, USA, pp. 341-347.
View/Download from: Publisher's site
View description>>
In human's expression recognition, the representation of expression features is essential for the recognition accuracy. In this work we propose a novel approach for extracting expression dynamic features from facial expression videos. Rather than utilising statistical models e.g. Hidden Markov Model (HMM), our approach integrates expression dynamic features into a static image, the Histogram Variances Face (HVF), by fusing histogram variances among the frames in a video. The HVFs can be automatically obtained from videos with different frame rates and immune to illumination interference. In our experiments, for the videos picturing the same facial expression, e.g., surprise, happy and sadness etc., their corresponding HVFs are similar, even though the performers and frame rates are different. Therefore the static facial recognition approaches can be utilised for the dynamic expression recognition. We have applied this approach on the well-known Cohn-Kanade AU-Coded Facial Expression database then classified HVFs using PCA and Support Vector Machine (SVMs), and found the accuracy of HVFs classification is very encouraging. © 2009 IEEE.
Smith, D, Hanlen, L, Zhang, JA, Miniutti, D, Rodda, D & Gilbert, B 2009, 'Characterization of the Dynamic Narrowband On-Body to Off-Body Area Channel', 2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, IEEE International Conference on Communications (ICC 2009), IEEE, Dresden, GERMANY, pp. 4207-+.
Sun, Y, Ge, Y, Lu, S, Dutkiewicz, E & Zhou, J 1970, 'Automatic Flow Distribution and Management in Heterogeneous Networks', GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, IEEE.
View/Download from: Publisher's site
View description>>
With the development of heterogeneous networks, multimode terminals are becoming more and more popular. However, when there are several different kinds of sessions requiring transmission simultaneously, how to distribute these sessions among the available access networks according to the different features of the flows and the current link conditions of the candidate networks is a new challenge. In this paper, we propose a new solution to the flow distribution problem for multimode terminals. Our proposal, Automatic Flow Distribution (AFD), includes a network selection algorithm located at the terminals and an admission control algorithm located at the access points of the networks. Consequently, the terminals and the networks can cooperate with each other and realize automatic flow distribution among the different available access networks. We utilize the notion of priority, ensuring that the more important sessions have preferential use of the network resources. In addition, in order not to excessively deteriorate the transmission performance of the lower priority flows, a probabilistic suspension scheme is introduced. Finally, the AFD method utilizes the concept of "entropy" to automatically compute the weights of different attributes which influence the flow distribution decision making, thus avoiding the users' difficulty to specify the weights manually.
Thi, TH, Lu, S, Zhang, J, Cheng, L & Wang, L 1970, 'Human Body Articulation for Action Recognition in Video Sequences', 2009 Sixth IEEE International Conference on Advanced Video and Signal Based Surveillance, 2009 Sixth IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS), IEEE, Genova, pp. 92-97.
View/Download from: Publisher's site
View description>>
This paper presents a new technique for action recognition in video using human body part-based approach, combining both local feature description of each body part, and global graphical model structure of the human action. The human body is divided into elementary points from which a Decomposable Triangulated Graph will be built. The temporal variation of human activity is encoded in the velocity distribution of each node in the graph, while the graph structure shows the spatial configuration of all the nodes in the action. Tracking trajectories of unlabeled good feature points are correctly labeled using Maximum a Posterior probability. Dynamic Programming is then implemented to boost up the exhaustive search for the optimal labeling of unknown body parts and the best possible action. A simple and efficient technique for building the optimal structure of the human action graph is also implemented. Experimental results on the KTH dataset proves the success and potential applications of this proposed technique. © 2009 IEEE.
Tran, LC, Mertins, A, Dutkiewicz, E & Huang, X 1970, 'Unitary differential space-time-frequency codes for MB-OFDM UWB', 2009 9th International Symposium on Communications and Information Technology, 2009 9th International Symposium on Communications and Information Technology (ISCIT), IEEE, pp. 1161-1166.
View/Download from: Publisher's site
View description>>
In a multiple-input multiple-output (MIMO) multiband orthogonal frequency division multiplexing (MB-OFDM) ultra-wideband (UWB) system, coherent detection where the channel state information (CSI) is assumed to be exactly known at the receiver requires the transmission of a large number of symbols for channel estimation, thus reducing the bandwidth efficiency. This paper examines the use of unitary differential space-time frequency codes (DSTFCs) in MB-OFDM UWB, which increases the system bandwidth efficiency due to the fact that no CSI is required for differential detection. The proposed DSTFC MB-OFDM system would be useful when the transmission of multiple channel estimation symbols is impractical or uneconomical. Simulation results show that the application of DSTFCs can significantly improve the bit error performance of conventional differential MB-OFDM system (without MIMO). ©2009 IEEE.
Tran, LC, Mertins, A, Huang, X & Dutkiewicz, E 1970, 'Novel cooperative communication schemes for Space-Time-Frequency Coded MB-OFDM UWB', 2009 3rd International Conference on Signal Processing and Communication Systems, 2009 3rd International Conference on Signal Processing and Communication Systems (ICSPCS 2009), IEEE, Omaha, NE, USA.
View/Download from: Publisher's site
View description>>
Cooperative communication has been intensively considered for general wireless and sensor networks. However, it has been almost untouched in Space-Time-Frequency Coded Multi-band OFDM Ultra-Wideband (STFC MB-OFDM UWB) systems. This paper thus proposes two cross-layer designs for cooperative communication, namely Simple Cooperative Communication Scheme (SCCS) and Advanced Cooperative Communication Scheme (ACCS), in slow fading scenarios. In the former, nodes always cooperate with one another despite the possibly erroneous reception at the partner nodes, while in the latter, nodes cooperate only in the case of successful reception. Simulations show that these schemes may considerably improve the performance of STFC MB-OFDM UWB without any increase of transmission power. © 2009 IEEE.
Vafi, S, Wysocki, T & Abolhasan, M 1970, 'Serially Concatenated Turbo Codes', 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM), IEEE, Beijing, China, pp. 1-4.
View/Download from: Publisher's site
View description>>
The paper presents a new scheme of concatenated codes, referred to as serially concatenated turbo (SCT) codes. The code is constructed as the serial combinations of two turbo codes, i.e. turbo recursive systematic convolutional (RSC) codes and turbo Bose Ray Chaudhuri Hocquenghem (BCH) codes, linked by a pseudo-random interleaver. In comparison with the conventional turbo RSC codes, SCT codes have higher minimum distance values. Based on conducted simulations, it is found that SCT codes outperform turbo RSC codes at the waterfall and error floor regions, while they require reasonable number of iterations at their iterative decoding structure to achieve good performance.
Vafi, S, Wysocki, T, Abolhasan, M & IEEE 1970, 'Serially Concatenated Turbo Codes', 2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 5th International Conference on Wireless Communications, Networking and Mobile Computing, IEEE, Beijing, PEOPLES R CHINA, pp. 521-524.
Veitch, D, Augustin, B, Teixeira, R & Friedman, T 1970, 'Failure Control in Multipath Route Tracing', IEEE INFOCOM 2009, 2009 Proceedings IEEE INFOCOM, IEEE, IEEE, pp. 1395-1403.
View/Download from: Publisher's site
Vezzani, R, Piccardi, M & Cucchiara, R 1970, 'An efficient Bayesian framework for on-line action recognition', 2009 16th IEEE International Conference on Image Processing (ICIP), 2009 16th IEEE International Conference on Image Processing ICIP 2009, IEEE, Cairo, Egypt, pp. 3553-3556.
View/Download from: Publisher's site
View description>>
On-line action recognition from a continuous stream of actions is still an open problem with fewer solutions proposed compared to time-segmented action recognition. The most challenging task is to classify the current action while finding its time boundaries at the same time. In this paper we propose an approach capable of performing on-line action segmentation and recognition by means of batteries of HMM taking into account all the possible time boundaries and action classes. A suitable Bayesian normalization is applied to make observation sequences of different length comparable and computational optimizations are introduce to achieve real-time performances. Results on a well known action dataset prove the efficacy of the proposed method.
Wang, JC-P, Abolhasan, M, Franklin, DR & Safaei, F 1970, 'OLSR-R<sup>3</sup>: Optimised link state routing with reactive route recovery', 2009 15th Asia-Pacific Conference on Communications, 2009 15th Asia-Pacific Conference on Communications (APCC), IEEE, Shanghai, pp. 359-362.
View/Download from: Publisher's site
View description>>
The optimised link state routing (OLSR) is a proactive routing protocol which relies on periodical broadcast of routing packets. However, due to the one-to-many relationship of broadcast traffic, the delivery of these packets can not be guaranteed by underlying MAC protocol, particularly in a congested condition. In this paper, the possible routing pathologies and failures of OLSR in a congested network are explored. In addition, a hybrid routing protocol which integrates OLSR with Reactive Route Recovery (OLSR-R3) is proposed to rectify the erratic routing behaviour described in this paper. Simulation studies are presented which show that the proposed solution is effective in addressing the underlining problems.
Wang, JC-P, Abolhasan, M, Franklin, DR, Safaei, F & IEEE 1970, 'Characterising the Behaviour of IEEE 802.11 Broadcast Transmissions in Ad Hoc Wireless LANs', 2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, IEEE International Confernece on Communications, IEEE, Dresden, Germany, pp. 4934-4938.
View/Download from: Publisher's site
View description>>
This paper evaluates the performance of the IEEE 802.11 broadcast traffic under both saturation and non-saturation conditions. The evaluation highlights some important characteristics of IEEE 802.11 broadcast traffic as compared to corresponding unicast traffic. Moreover, it underlines the inaccuracy of the broadcast saturation model proposed by Ma and Chen due to the absence of backoff counter freeze process when channel is busy. Computer simulations are used to validate the accuracy of the new model and demonstrate the importance of capturing the freezing of backoff counter in the analytical study of IEEE 802.11 broadcast.
Wang, JC-P, Abolhasan, M, Franklin, DR, Safaei, F & IEEE 1970, 'End-to-End Path Stability of Reactive Routing Protocols in IEEE 802.11 Ad Hoc Networks', 2009 IEEE 34TH CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2009), IEEE Conference on Local Computer Networks, IEEE, Zurich, Switzerland, pp. 499-505.
View/Download from: Publisher's site
View description>>
Over the years, a considerable research effort has been applied to the design of ad hoc network routing protocols. However, there is still a lack of understanding of the subtle interactions between routing protocols and lower layers in the protocol stack. In this paper, the instability which may arise when reactive routing protocols interact with the IEEE 802.11 MAC protocol is investigated. In particular, several erratic behaviours of the Ad hod On-demand Distance Vector (AODV) routing protocol in a congested IEEE 802.11 ad hoc network are demonstrated. A cross-layer solution is proposed based on an Adaptive Bulk Trigger policy and a Dynamic Window Selection scheme. Simulation studies are presented which show that the proposed solution is effective in alleviating erratic behaviour of AODV and improving the end-to-end path stability.
Wang, W, Shen, C, Zhang, J & Paisitkriangkrai, S 1970, 'A Two-Layer Night-Time Vehicle Detector', 2009 Digital Image Computing: Techniques and Applications, 2009 Digital Image Computing: Techniques and Applications, IEEE, Melbourne, VIC, pp. 162-167.
View/Download from: Publisher's site
View description>>
We present a two-layer night time vehicle detector in this work. At the first layer, vehicle headlight detection [1, 2, 3] is applied to find areas (bounding boxes) where the possible pairs of headlights locate in the image, the Haar feature based AdaBoo
Xiangjian He, Jianmin Li, Daming Wei, Wenjing Jia & Qiang Wu 1970, 'Canny edge detection on a virtual hexagonal image structure', 2009 Joint Conferences on Pervasive Computing (JCPC), 2009 Joint Conferences on Pervasive Computing (JCPC), IEEE, Taipei, Taiwan, pp. 167-172.
View/Download from: Publisher's site
View description>>
Canny edge detector is the most popular tool for edge detection and has many applications in the areas of image processing, multimedia and computer vision. The Canny algorithm optimizes the edge detection through noise filtering using an optimal function approximated by the first derivative of a Gaussian. It identifies the edge points by computing the gradients of light intensity function based on the fact that the edge points likely appear where the gradient magnitudes are large. Hexagonal structure is an image structure alternative to traditional square image structure. Because all the existing hardware for capturing image and for displaying image are produced based on square structure, an approach that uses linear interpolation described for conversion between square and hexagonal structures. Gaussian filtering together with gradient computation is performed on the hexagonal structure. The pixel edge strengths on the square structure are then estimated before the thresholds of Canny algorithm are applied to determine the final edge map. The experimental results show the edge detection on hexagonal structure using static and video images, and the comparison with the results using Canny algorithm on square structure. ©2009 IEEE.
Xu, M, Luo, S, Jin, JS & Park, M 1970, 'Affective content analysis by mid-level representation in multiple modalities', Proceedings of the First International Conference on Internet Multimedia Computing and Service, ICIMCS '09: The First International Conference on Internet Multimedia Computing and Service, ACM, pp. 201-207.
View/Download from: Publisher's site
View description>>
Movie affective content detection attracts ever-increasing research efforts. However, the affective content analysis is still a challenging task due to the gap between low-level perceptual features and high-level human perception of the media. Moreover, clues from multiple modalities should be considered for affective analysis, since they were used in movies to represent emotions and romance emotional atmosphere. In this paper, mid-level representations are generated from low-level features. These mid-level representations are from multiple modalities and used for affective content inference. Besides video shots which is commonly used for video content analysis, audio sounds, dialogue and subtitle are explored to contribute to detect affective content. Since affective analysis rely on movie genres, experiments are implemented in respective genres. The results shows that audio sounds, dialogues and subtitles are effective and efficient for affective content detection. Copyright 2009 ACM.
Ye, Y, He, X, Li, J, Jia, W & Wu, Q 1970, 'Image Transformation on Hexagonal Structure Based on Conversion between 1D and 2D Coordinates', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Berlin Heidelberg, pp. 571-578.
View/Download from: Publisher's site
View description>>
Spiral Architecture, a hexagonal image structure is a novel and powerful approach to machine vision system. The pixels on Spiral architecture are geometrically arranged using a 1D (Spiral) addressing scheme in an ascending order along a spiral-like curve. Spiral addition and Spiral multiplication are defined based on the Spiral addresses on Spiral Architecture. These two fundamental operations result in fast and easy translation, rotation and separation on images, and hence play very important roles for image processing on Spiral Architecture. Moreover, 2D coordinates according to rows and columns defined on Spiral Structure provide a good mapping to the ordinary 2D coordinates defined on the common square image structure. Therefore, how to convert the 1D Spiral addresses from and to the 2D coordinates on Spiral Architecture has become very important to apply the theory developed on a hexagonal image structure for image processing (e.g., rotation). In this paper, we perform a fast way to correctly locate any hexagonal pixel when its Spiral address is known, and compute the Spiral address of any hexagonal pixel when its location is known. As an illustration of the use of conversions, we demonstrate the accurate image translation and rotation using experimental results. © 2009 Springer Berlin Heidelberg.
Yuehe Ge, Esselle, KP & Bird, TS 1970, 'Designing a partially reflective surface with increasing reflection phase for wide-band ebg resonator antennas', 2009 IEEE Antennas and Propagation Society International Symposium, 2009 IEEE Antennas and Propagation Society International Symposium (APSURSI), IEEE.
View/Download from: Publisher's site
View description>>
A simple method is proposed for obtaining a partially reflective surface with increasing reflection phase for use in wideband, low-profile electromagnetic band-gap resonator antennas. Using the proposed types of partially reflective surfaces and a perfect electric conductor ground, a wideband resonant cavity can be formed and hence a wideband resonant cavity antenna can be designed. The method to design the partially reflective surface is described and examples are given. © 2009 IEEE.
Zhang, J, Paisitkriangkrai, S & Shen, C 1970, 'An overview of fast pedestrian detection: Feature selection and cascade framework of boosted features', 2009 IEEE International Conference on Multimedia and Expo, 2009 IEEE International Conference on Multimedia and Expo (ICME), IEEE, New York, NY, pp. 1566-1567.
View/Download from: Publisher's site
Zhang, Z, Gunes, H, Piccardi, M & IEEE 1970, 'HEAD DETECTION FOR VIDEO SURVEILLANCE BASED ON CATEGORICAL HAIR AND SKIN COLOUR MODELS', 2009 16TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOLS 1-6, IEEE International Conference on Image Processing, IEEE, Cairo, Egypt, pp. 1137-1140.
View/Download from: Publisher's site
View description>>
We propose a new robust head detection algorithm that is capable of handling significantly different conditions in terms of viewpoint, tilt angle, scale and resolution. To this aim, we built a new model for the head based on appearance distributions and shape constraints. We construct a categorical model for hair and skin, separately, and train the models for four categories of hair (brown, red, blond and black) and three categories of skin representing the different illumination conditions (bright, standard and dark). The shape constraint fits an elliptical model to the candidate region and compares its parameters with priors based on human anatomy. The experimental results validate the usability of the proposed algorithm in various video surveillance and multimedia applications. ©2009 IEEE.
Zhao, C, Hu, J, Zhou, J, Shi, J & Dutkiewicz, E 1970, 'Channel Quality Dependent Rate-Limited Scheduling Algorithm for IEEE 802.16 Wireless Networks', 2009 WRI International Conference on Communications and Mobile Computing, 2009 WRI International Conference on Communications and Mobile Computing (CMC), IEEE, pp. 402-406.
View/Download from: Publisher's site
View description>>
The WiMAX technology based on IEEE 802.16 is expected to support multimedia services with guaranteed quality of service (QoS). In this paper, a scheduler structure with priority classes is designed for IEEE 802.16 wireless networks, and a channel quality dependent rate-limited (CD-RL) algorithm is proposed. CD-RL provides promised data rates while taking throughput into account. With a carefully designed "order changing" method, CD-RL can be implemented with low complexity, which makes it feasible in practical systems. Simulation results reveal that CD-RL has good performances in fairness, minimum reserved traffic rate and average packet delay. © 2009 IEEE.
