Publications

Zhang, J 2006, 'Error Resilience for Video Coding Service' in Wu, HR & Rao, KR (eds), Digital Video Image Quality and Perceptual Coding, CRC, Taylor & Francis group, USA, pp. 503-527.
View description>>

This is part of my thesis

Barakat, C, Iannaccone, G, Kurose, J & Veitch, D 2006, 'Sampling the Internet: Techniques and applications'.

Barakat, C, Iannaccone, G, Kurose, JIM, Veitch, D & Low, S 2006, 'Guest Editorial Sampling the Internet: Techniques and Applications', IEEE Journal on Selected Areas in Communications, vol. 24, no. 12, pp. 2165-2167.
View/Download from: Publisher's site

Du, C, Yang, J, Wu, Q, Zhang, T, Wang, H, Chen, L & Wu, Z 2006, 'Extended Fitting Methods of Active Shape Model for the Location of Facial Feature Points', Lecture notes in computer science, vol. 4338, pp. 610-618.
View/Download from: Publisher's site
View description>>

In this study, we propose three extended fitting methods to the standard ASM(active shape model). Firstly, profiles are extended from ID to 2D; Secondly, profiles of different landmarks are constructed individually; Thirdly, length of the profiles is determined adaptively with the change of level during searching, and the displacements in the last level are constrained. Each method and the combination of three methods are tested on the SJTU(Shanghai Jiaotong University) face database. In all cases, compared to the standard ASM, each method improves the accuracy or speed in a way, and the combination of three methods improves the accuracy and speed greatly.

Ge, Y, Esselle, KP & Bird, TS 2006, 'A Compact E-Shaped Patch Antenna With Corrugated Wings', IEEE Transactions on Antennas and Propagation, vol. 54, no. 8, pp. 2411-2413.
View/Download from: Publisher's site

Ge, Y, Esselle, KP & Bird, TS 2006, 'A wideband probe-fed stacked dielectric resonator antenna', Microwave and Optical Technology Letters, vol. 48, no. 8, pp. 1630-1633.
View/Download from: Publisher's site

Gunes, H & Piccardi, M 2006, 'Assessing facial beauty through proportion analysis by image processing and supervised learning', INTERNATIONAL JOURNAL OF HUMAN-COMPUTER STUDIES, vol. 64, no. 12, pp. 1184-1199.
View/Download from: Publisher's site

He, X, Jia, W, Wu, Q & Hintz, T 2006, 'Description of the cardiac movement using hexagonal image structures', Computerized Medical Imaging and Graphics, vol. 30, no. 6-7, pp. 377-382.
View/Download from: Publisher's site
View description>>

The most notable characteristic of the heart is its movement. Detection of dynamic information describing cardiac movement such as amplitude, speed and acceleration facilitates interpretation of normal and abnormal function. In recent years, the Omni-directional M-mode Echocardiography System (OMES) has been developed as a process that builds moving information from a sequence of echocardiography image frames. OMES detects cardiac movement through construction and analysis of Position-Time Grey Waveform (PTGW) images on some feature points of the boundaries of the ventricles. Image edge detection plays an important role in determining the feature boundary points and their moving directions as the basis for extraction of PTGW images-Spiral Architecture (SA) has proved efficient for image edge detection. SA is a hexagonal image structure in which an image is represented as a collection of hexagonal pixels. There are two operations called spiral addition and spiral multiplication defined on SA. They correspond to image translation and rotation, respectively. In this paper, we perform ventricle boundary detection based on SA using various defined chain codes. The gradient direction of each boundary point is determined at the same time. PTGW images at each boundary point are obtained through a series of spiral additions according to the directions of boundary points. Unlike the OMES system, our new approach is no longer affected by the translation movement of the heart. As its result, three curves representing the amplitude, speed and acceleration of cardiac movement can be easily drawn from the PTGW images obtained. Our approach is more efficient and accurate than OMES, and our results contain a more robust and complete description of cardiac motion. © 2006 Elsevier Ltd. All rights reserved.

Hohn, N & Veitch, D 2006, 'Inverting sampled traffic', IEEE/ACM Transactions on Networking, vol. 14, no. 1, pp. 68-80.
View/Download from: Publisher's site
View description>>

Routers have the ability to output statistics about packets and flows of packets that traverse them. Since, however, the generation of detailed traffic statistics does not scale well with link speed, increasingly routers and measurement boxes implement sampling strategies at the packet level. In this paper, we study both theoretically and practically what information about the original traffic can be inferred when sampling, or "thinning", is performed at the packet level. While basic packet level characteristics such as first order statistics can be fairly directly recovered, other aspects require more attention. We focus mainly on the spectral density, a second-order statistic, and the distribution of the number of packets per flow, showing how both can be exactly recovered, in theory. We then show in detail why in practice this cannot be done using the traditional packet based sampling, even for high sampling rate. We introduce an alternative flow-based thinning, where practical inversion is possible even at arbitrarily low sampling rate. We also investigate the theory and practice of fitting the parameters of a Poisson cluster process, modeling the full packet traffic, from sampled data. © 2006 IEEE.

Huang, X & Li, Y 2006, 'Performance of Impulse-Train-Modulated Ultra-Wideband Systems', IEEE Transactions on Communications, vol. 54, no. 11, pp. 1933-1936.
View/Download from: Publisher's site

Janapsatya, J, Esselle, KP & Bird, TS 2006, 'Compact wideband dielectric-resonator-on-patch antenna', Electronics Letters, vol. 42, no. 19, pp. 1071-1071.
View/Download from: Publisher's site

Liu, S, Xu, M, Yi, H, Chia, L-T & Rajan, D 2006, 'Multimodal Semantic Analysis and Annotation for Basketball Video', EURASIP Journal on Advances in Signal Processing, vol. 2006, no. 1, pp. 1-13.
View/Download from: Publisher's site
View description>>

This paper presents a new multiple-modality method for extracting semantic information from basketball video. The visual, motion, and audio information are extracted from video to first generate some low-level video segmentation and classification. Domain knowledge is further exploited for detecting interesting events in the basketball video. For video, both visual and motion prediction information are utilized for shot and scene boundary detection algorithm; this will be followed by scene classification. For audio, audio keysounds are sets of specific audio sounds related to semantic events and a classification method based on hidden Markov model (HMM) is used for audio keysound identification. Subsequently, by analyzing the multimodal information, the positions of potential semantic events, such as "foul" and "shot at the basket," are located with additional domain knowledge. Finally, a video annotation is generated according to MPEG-7 multimedia description schemes (MDSs). Experimental results demonstrate the effectiveness of the proposed method. Copyright © 2006 Hindawi Publishing Corporation. All rights reserved.

Novak, A, Taylor, P & Veitch, D 2006, 'The distribution of the number of arrivals in a subinterval of a busy period of a single server queue', Queueing Systems, vol. 53, no. 3, pp. 105-114.
View/Download from: Publisher's site

Weily, AR, Bird, TS, Esselle, KP & Sanders, BC 2006, 'Woodpile EBG phase shifter', ELECTRONICS LETTERS, vol. 42, no. 25, pp. 1463-1464.
View/Download from: Publisher's site

Weily, AR, Bird, TS, Esselle, KP & Sanders, BC 2006, 'Woodpile EBG phase shifter', Electronics Letters, vol. 42, no. 25, pp. 1463-1463.
View/Download from: Publisher's site
View description>>

A phase shifter in an alumina woodpile electromagnetic bandgap (EBG) defect waveguide that operates at microwave frequencies is demonstrated. The phase shift is introduced by sequentially adding low dielectric constant rods to the voids directly above the defect waveguide. The addition of the extra rods creates selected phase delay without significantly affecting the transmission performance of the woodpile waveguide. Measured and computed results in Ku-band are presented to confirm the performance of the device. © The Institution of Engineering and Technology 2006.

Weily, AR, Esselle, KP, Bird, TS & Sanders, BC 2006, 'Experimental woodpile EBG waveguides, bends and power dividers at microwave frequencies', Electronics Letters, vol. 42, no. 1, pp. 32-32.
View/Download from: Publisher's site

Weily, AR, Esselle, KP, Bird, TS & Sanders, BC 2006, 'High gain circularly polarised 1-D EBG resonator antenna', Electronics Letters, vol. 42, no. 18, pp. 1012-1012.
View/Download from: Publisher's site

Weily, AR, Esselle, KP, Bird, TS & Sanders, BC 2006, 'Linear Array of Woodpile EBG Sectoral Horn Antennas', IEEE Transactions on Antennas and Propagation, vol. 54, no. 8, pp. 2263-2274.
View/Download from: Publisher's site

Wu, Q, He, S, Hintz, TB & Ye, Y 2006, 'A novel and uniform image partitioning on spiral architecture', International journal of computational science and engineering, vol. 2, no. 1, pp. 57-63.

Wu, Q, He, X, Hintz, T & Ye, Y 2006, 'A novel and uniform image partitioning on spiral architecture', International Journal of Computational Science and Engineering, vol. 2, no. 1/2, pp. 57-57.
View/Download from: Publisher's site
View description>>

Uniform image partitioning based on spiral architecture plays an important role in parallel image processing in many aspects such as uniform data partitioning, load balancing, zero data exchange between the processing nodes et al. However, when the number of partitions is not the power of seven like 7, 49, every sub-image except one is split into a few fragments which are mixed together. We could not tell which fragments belong to which subimage. It is an unacceptable flaw to parallel image processing. This paper proposes a method to resolve the problem mentioned above. From the experimental results, it is shown that the proposed method correctly identifies the fragments belonging to the same subimage and successfully collects them together to be a complete subimage. Then, these subimages can be distributed into the different processing nodes for further processing. Copyright © 2006, Inderscience Publishers.

Zhang, H, He, S & Wu, Q 2006, 'Generic Object Detection', Journal of Yunnan Nationalities University, vol. 15, no. 4, pp. 261-267.

Abolhasan, M & Lipman, J 1970, 'Self-selection route discovery strategies for reactive routing in ad hoc networks', Proceedings of the first international conference on Integrated internet ad hoc and sensor networks - InterSense '06, the first international conference, ACM Press, Nice, France.
View/Download from: Publisher's site
View description>>

Routing in Ad hoc Networks has received a significant amount of attention. In recent years, the focus of research has been in on-demand (or reactive) routing protocols due to the recognition that these protocols have the potential to achieve higher levels of scalability than proactive routing strategies. However, most on-demand routing protocols proposed to date attempt to increase routing efficiency by using existing knowledge about the destination or by increasing the stability of the routes. Little research has been done to reduce route discovery overhead when no previous destination information is available. We present a number of different strategies, which encourage a more distributed and localised approach to route discovery by allowing each intermediate node during route discovery to make forwarding decisions using localised knowledge and self-selection. The use of self-selection for route discovery enables nodes to independently make route request (RREQ) forwarding decisions based upon a selection criterion or by satisfying certain conditions. The nodes which do not satisfy the selection criterion do not rebroadcast the RREQs. This provides a more effective and efficient search strategy than the use of traditional brute force blind flooding. We implemented our self-selecting route discovery strategies over AODV using the GloMoSim network simulation package, and compared the performance with existing routing protocols. Our simulation results show that a significant drop in the number of control packets can be achieved by giving each intermediate node more authority for self-selection during route discovery. Furthermore, a significant increase in routing performance is achieved as the number of nodes in the network is increased. © 2006 ACM.

Abolhasan, M, Wysocki, T, Franklin, DR & Lipman, J 1970, 'Capacity of Single-Radio Ad-hoc Networks for Handling High Bit Rate Real-time Internet Applications', Proceedings of the 5th Workshop on the Internet, Telecommunications and Signal Processing, WITSP '06, University of Nebraska - Lincoln, Hobart, Tasmania, pp. 1-6.
View description>>

Until now, the main focus in ad hoc networking has been improving Routing and Medium Access Control (MAC) Strategies. As a result, a diverse range of routing and MAC protocols have been proposed. To evaluate these protocols, much of the existing research has been based on simulation scenarios which assume ideal channel conditions and low node and traffic densities. Therefore, despite a few studies which have shown the performance limitations of ad hoc networks theoretically, there has not been many simulation studies performed which investigate the performance of ad hoc networks under a high node and traffic density. This paper investigates the performance of ad hoc networks under a high node density and high-bit rate real-time traffic such as VoIP. Our results show that the performane of single radio ad hoc networks drops significantly as traffic density is increased. To improve the performance of ad hoc networks, a number of different strategies and research areas are described.

Al-Obaisat, Y & Braun, R 1970, 'On wireless sensor networks: Architectures, protocols, applications, and management', Proceedings of the 1st IEEE International Conference on Wireless Broadband and Ultra Wideband Communications, AusWireless 2006, IEEE, Sydney, Australia, pp. 73-59.
View description>>

With the recent technological advances in wireless communications, integrated digital circuits, and micro electro mechanical systems (MEMS); development of wireless sensor networks has been enabled and become dramatically feasible. Wireless sensor networks (WSNs) are large networks madeof a numerous number of sensor nodes with sensing, computation, and wireless communications capabilities. Many various routing, power management, and data disseminationprotocols have been designed for wireless sensor networks (WSNs) dependent on both the network architecture and the applications that it is designed for. In this paper, we present the state of the art of wireless sensor networks' architecture and design features. Also, in this paper, we introduce recent work on routing protocols for WSNs and their design goals and challenges. Also, an overview of the applicationthat WSNs assist in is presented. Finally, several open research questions of wireless sensor networks management and issues are suggested and put forward.

Baccelli, F, Machiraju, S, Veitch, D & Bolot, JC 1970, 'The role of PASTA in network measurement', ACM SIGCOMM Computer Communication Review, Association for Computing Machinery (ACM), ACM, pp. 231-242.
View/Download from: Publisher's site
View description>>

Poisson Arrivals See Time Averages (PASTA) is a well known property applicable to many stochastic systems. In active probing, PASTA is invoked to justify the sending of probe packets (or trains) at Poisson times in a variety of contexts. However, due to the diversity of aims and analysis techniques used in active probing, the benefits of Poisson based measurement, and the utility and role of PASTA, are unclear. Using a combination of rigorous results and carefully constructed examples and counter-examples, we map out the issues involved, and argue that PASTA is of very limited use in active probing. In particular, Poisson probes are not unique in their ability to sample without bias. Furthermore, PASTA ignores the issue of estimation variance, and the central need for an inversion phase to estimate the quantity of interest ased on what is directly observable. We give concrete examples of when Poisson probes should not be used, and explain why, and offer initial guidelines on suitable alternative sending processes.

Braun, R 1970, 'Objectives', 2006 7th International Conference on Information Technology Based Higher Education and Training, 2006 7th International Conference on Information Technology Based Higher Education and Training, IEEE.
View/Download from: Publisher's site

Chaczko, Z, Klempous, R, Nikodem, J & Rozenblit, J 1970, '24/7 Software Development in Virtual Student Exchange Groups: Redefining the Work and Study Week', 2006 7th International Conference on Information Technology Based Higher Education and Training, 2006 7th International Conference on Information Technology Based Higher Education and Training, IEEE, pp. 698-705.
View/Download from: Publisher's site
View description>>

A concept of time zone driven, 24/7-week software development in a Virtual Student Exchange (VSX) environment is being defined, developed and applied to explore reliable and efficient continuous modes of work/study processes. The overall goal is to assess the suitability and benefits of this innovative approach to teaching and learning in order to increase the efficiency and effectiveness of these processes. This new methodology aims to address industry needs for training in international teaming, to enrich students' experience, and to improve the quality of education in the participating institutions. The techniques and tools discussed here create an integrated framework for international collaboration among teaming groups of students in practice and team oriented engineering education. This paper also aims to justify the need, merits, and feasibility of the virtual collaboration student exchange teaching program between educational institutions separated by three 8-hour time zones: the Faculty of Electronic Engineering of the Wroclaw University of Technology in Poland (WUT), the Faculty of Electrical and Computer Engineering at the University of Arizona, Tucson, USA (UA) and the Faculty of Engineering, Software Engineering Group at University of Technology, Sydney, Australia (UTS). The paper defines the proposed methodology, reviews the tools and processes involved, and finally reports preliminary results. © 2006 IEEE.

Chaczko, Z, Klempous, R, Nikodem, J, Nikodem, M & Rozenblit, J 1970, 'An improvement of energy aware routing in wireless sensors network', International Mediterranean Modelling Multiconference, I3M, International Mediterranean Modelling Multiconference, EMSS, Barcelona, Spain, pp. 599-604.
View description>>

This paper presents results of wireless sensors networks protocols simulations. In such an infrastructure set-up sensors are left unattended, form network and its main goal is to increase network operation lifetime. At first we discuss the role and importance of a clustering protocol in setting up communication routes between cluster heads in wireless sensors networks. Then we propose effective routing algorithms that increase network lifetime, improve its security and robustness to sensor's faults.

Chaczko, ZC & Sinha, SN 1970, 'Innovative Strategies of Teaching Software Analysis and Design - Interactive Digital Television Games', 7th International Conference on Information Technology Based Higher Education and Training, 7th Internationalk Conference on Information Technology Based Higher Education and Training. ITHET '06, IEEE, Sydney, Australia, pp. 38-56.
View description>>

The essence of a University is realized through the quality of education it delivers to the students and how useful they find it in their lives. To fulfil this quest recently the University of Technology, Sydney added a new subject to the existing curriculum for Master of Software Engineering - Software Analysis and Design. The primary goal of the subject was to promote skills and understanding about software engineering practices, project management, and scheduling and resource management. In doing so the students were also exposed to a hands-on learning experience in development of Interactive Digital TV application in collaboration with the Australian Broadcasting Corporation - using the MHP middleware. The response to this program has proven to be very encouraging as it provides a very effective approach to increasing the software development capability.

Chen, J, Shen, J-L, Zhang, J & Wangsa, K 1970, 'A Novel Multimedia Database System for Efficient Image/Video Retrieval Based on Hybrid-Tree Structure', 2006 International Conference on Machine Learning and Cybernetics, 2006 International Conference on Machine Learning and Cybernetics, IEEE, Dalian, pp. 4353-4358.
View/Download from: Publisher's site
View description>>

With recent advances in computer vision, image processing and analysis, a retrieval process based on visual content has became a key component in achieving high efficiency image query for large multimedia databases. In this paper, we propose and develop

Chen, S, Yan, B, Zic, J, Liu, R & Ng, A 1970, 'Evaluation and Modeling of Web Services Performance', 2006 IEEE International Conference on Web Services (ICWS'06), 2006 IEEE International Conference on Web Services (ICWS'06), IEEE, Chicago, IL, pp. 437-444.
View/Download from: Publisher's site

Cheng, E & Piccardi, M 1970, 'Matching Moving Objects by parts with a maximum likelihood criterion', Proceedings of Image and Vision Computing New Zealand 2006, Image and Vision Computing Conference, University of Auckland, New Zealand, pp. 373-378.

Cheng, ED & Piccardi, M 1970, 'Matching of Objects Moving Across Disjoint Cameras', 2006 International Conference on Image Processing, 2006 International Conference on Image Processing, IEEE, Atlanta, USA, pp. 1769-1772.
View/Download from: Publisher's site
View description>>

Matching of single individuals as they move across disjoint camera views is a challenging task in video surveillance. In this paper, we present a novel algorithm capable of matching single individuals in such a scenario based on appearance features. In order to reduce the variable illumination effects in a typical disjoint camera environment, a cumulative color histogram transformation is first applied to the segmented moving object. Then, an incremental major color spectrum histogram representation (IMCSHR) is used to represent the appearance of a moving object and cope with small pose changes occurring along the track. An IMCHSR-based similarity measurement algorithm is also proposed to measure the similarity of any two segmented moving objects. A final step of post-matching integration along the object's track is eventually applied. Experimental results show that the proposed approach proved capable of providing correct matching in typical situations. ©2006 IEEE.

Cheng, ED, Madden, C & Piccardi, M 1970, 'Mitigating the Effects of Variable Illumination for Tracking across Disjoint Camera Views', 2006 IEEE International Conference on Video and Signal Based Surveillance, 2006 IEEE International Conference on Video and Signal Based Surveillance, IEEE, Sydney, Australia, pp. 32-37.
View/Download from: Publisher's site
View description>>

Tracking people by their appearance across disjoint camera views is challenging since appearance may vary significantly across such views. This problem has been tackled in the past by computing intensity transfer functions between each camera pair during an initial training stage. However, in real-life situations, intensity transfer functions depend not only on the camera pair, but also on the actual illumination at pixel-wise resolution and may prove impractical to estimate to a satisfactory extent. For this reason, in this paper we propose an appearance representation for people tracking capable of coping with the typical illumination changes occurring in a surveillance scenario. Our appearance representation is based on an online K-means color clustering algorithm, a fixed, data-dependent intensity transformation, and the incremental use of frames. Moreover, a similarity measurement is proposed to match the appearance representations of any two given moving objects along sequences of frames. Experimental results presented in this paper show that the proposed methods provides a viable while effective approach for tracking people across disjoint camera views in typical surveillance scenarios. © 2006 IEEE.

Chiang, F & Braun, R 1970, 'A Nature Inspired Multi-Agent Framework for Autonomic Service Management in Pervasive Computing Environments', 2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006, 2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006, IEEE, Vancouver, Canada, pp. 1-4.
View/Download from: Publisher's site
View description>>

This paper describes the design of a scalable biomimetic framework that addresses several key issues of autonomous agents in the management domain of complex Ubiquitous Service-Oriented Networks. We propose an autonomous network service management platform - SwarmingNet, which is motivated by observations of the swarm intelligence in biological systems (e.g., Termite, Ant/Bees colonies, or Locusts). In this SwarmingNet architecture, the required network service processes are implemented by a group of highly diverse and autonomie objects. These objects are called TeleService Solons (TSSs) as elements of TeleService Holons (TSHs), analogue to individual insects as particles of the whole colony. A single TSS is only able to pursue simple behaviors and interactions with local neighbors, however, 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 between the bio-agents and normal agents is analyzed. Finally, we conclude that through bio-swarming intelligence behaviors, this infrastructure develops the enhanced self-X capabilities which give IP networks advantages of instinctive compatibility, efficiency and scalability.

Chiang, F & Braun, R 1970, 'A nature inspired multi-agent framework for autonomic service management in pervasive computing environments', IEEE Symposium Record on Network Operations and Management Symposium.
View/Download from: Publisher's site
View description>>

This paper describes the design of a scalable biomimetic 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 TeleService 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. © 2006 IEEE.

Chiang, F & Braun, R 1970, 'A Nature Inspired Multi-Agent Framework for Autonomic Service Management in Pervasive Computing Environments', 2006 IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM, VOLS 1 AND 2, IEEE/IFIP Network Operations and Management Symposium, IEEE, Vancouver, CANADA, pp. 979-982.

Chiang, F, Braun, R & He, S 1970, 'Towards a Management Paradigm with a Constrained Benchmark for Autonomic Communications', 2006 International Conference on Computational Intelligence and Security, 2006 International Conference on Computational Intelligence and Security, IEEE, Guangzhou, PEOPLES R CHINA, pp. 520-523.
View/Download from: Publisher's site

Fang, G, Sun, Y, Zhou, J, Shi, J, Li, Z & Dutkiewicz, E 1970, 'WLC27-2: Subcarrier Allocation for OFDMA Wireless Channels Using Lagrangian Relaxation Methods', IEEE Globecom 2006, IEEE Globecom 2006, IEEE.
View/Download from: Publisher's site
View description>>

In this paper, we propose a practically efficient Subcarrier Allocation scheme based on Lagrangian relaxation to solve the problem of subcarrier allocation in OFDMA wireless channels. The problem of subcarrier allocation is formulated into an Integer Programming (IP) problem, which is relaxed by replacing complicating constraints with Lagrange multipliers using Lagrangian Relaxation. A subgradient method is used to optimize the Lagrangian dual function and a heuristic is designed to obtain the feasible solution. Lagrangian Relaxation Subcarrier Allocation (LRSA) is proven to be of polynomial complexity and it provides bounds on the value of channel efficiency. Numerical results show that compared with other algorithms proposed in the literature, LRSA can result in a significant improvement in channel efficiency, while at the same time guaranteeing minimum data rates of users. ©2006 IEEE.

Ge, Y, Esselle, KP & Bird, TS 1970, 'An ultra-wide-band dielectric resonator antenna', Antem/URSI 2006 - 12th International Symposium on Antenna Technology and Applied Electromagnetics and Canadian Radio Sciences Conference, Proceedings.
View description>>

In this paper, the broadband concept in stacked patch antennas is applied to designing broadband rectangular dielectric resonator antennas (DRAs) with a small patch feed. Unlike the previous multi-segment DRA designs that have a DRA of a lower permittivity above one or more thin segments of higher permittivity, the top DR in this antenna has a higher permittivity than the lower segment. Theoretical and experimental results exhibit good agreement.

Gill, AQ & Henderson-Sellers, B 1970, 'Measuring agility and adaptibility of agile methods: A 4 dimensional analytical tool', Proceedings of the IADIS international conference on applied computing 2006, The IADIS international conference on applied computing 2006, IADIS Press, San Sebastian Spain, pp. 503-507.

Gunes, H & Piccardi, M 1970, 'A bimodal face and body gesture database for automatic analysis of human nonverbal affective behavior', 18th International Conference on Pattern Recognition, Vol 1, Proceedings, International Conference on Pattern Recognition, IEEE Computer Soc, Hong Kong, China, pp. 1148-1153.
View/Download from: Publisher's site
View description>>

To be able to develop and test robust affective multimodal systems, researchers need access to novel databases containing representative samples of human multi-modal expressive behavior. The creation of such databases requires a major effort in the defin

Gunes, H & Piccardi, M 1970, 'Observer Annotation of Affective Display and Evaluation of Expressivity: Face vs. Face-and-body', Use of Vision in Human-Computer Interaction: Proceedings of the HCSNet Workshop on the use of vision in human-computer interaction, the HCSNet Workshop on the use of vision in human-computer interaction, Australian Computer Society, Canberra, Australia, pp. 35-42.
View description>>

A first step in developing and testing a robust affective multimodal system is to obtain or access data representing human multimodal expressive behaviour. Collected affect data has to be further annotated in order to become usable for the automated systems. Most of the existing studies of emotion or affect annotation are monomodal. Instead, in this paper, we explore how independent human observers annotate affect display from monomodal face data compared to bimodal face-and-body data. To this aim we collected visual affect data by recording the face and face-and-body simultaneously. We then conducted a survey by asking human observers to view and label the face and face-and-body recordings separately. The results obtained show that in general, viewing face-and-body simultaneously helps with resolving the ambiguity in annotating emotional behaviours.

Gunes, H, Piccardi, M & IEEE 1970, 'Creating and annotating affect Databases from face and body display: A contemporary survey', 2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, IEEE Conference on Systems, Man and Cybernetics, IEEE, Taipei, Taiwan, pp. 2426-2433.
View/Download from: Publisher's site
View description>>

Databases containing representative samples of human multi-modal expressive behavior are needed for the development of affect recognition systems. However, at present publicly-available databases exist mainly for single expressive modalities such as facial expressions, static and dynamic hand postures, and dynamic hand gestures. Only recently, a first bimodal affect database consisting of expressive face and upper-body display has been released. To foster development of affect recognition systems, this paper presents a comprehensive survey of the current state-of-the art in affect database creation from face and body display and elicits the requirements of an ideal multi-modal affect database

He, X, Hintz, T, Wu, Q, Wang, H & Jia, W 1970, 'A new simulation of spiral architecture', Proceedings of the 2006 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV'06, International Conference on Image Processing, Computer Vision and Pattern Recognition, CSREA Press, Las Vegas, USA, pp. 570-575.
View description>>

Spiral Architecture is a relatively new and powerful approach to machine vision system. The geometrical arrangement of pixels on Spiral architecture can be described in terms of a hexagonal grid. However, all the existing hardware for capturing image and for displaying image are produced based on rectangular architecture. It has become a serious problem affecting the advanced research on Spiral Architecture. In this paper, a new approach to mimicking Spiral Architecture is presented. This mimic Spiral Architecture almost retains image resolution and does not introduce distortion. Furthermore, images can be smoothly and easily transferred between the traditional square structure and this new hexagonal structure. In this paper, we also perform a fast way to locate hexagonal pixels. Another contribution in this paper is a novel construction of hexagonal pixels that are four times as big as the virtual hexagonal pixels. This construction of larger hexagonal pixels does not change the axes of symmetry, and does not create any spaces or overlaps between hexagons.

He, X, Jia, W, Hur, N, Wu, Q & Kim, J 1970, 'Image Translation and Rotation on Hexagonal Structure', The Sixth IEEE International Conference on Computer and Information Technology (CIT'06), The Sixth IEEE International Conference on Computer and Information Technology (CIT'06), IEEE, Seoul, Korea, pp. 1-6.
View/Download from: Publisher's site
View description>>

Image translation and rotation are becoming essential operations in many application areas such as image processing, computer graphics and pattern recognition. Conventional translation moves image from pixels to pixels and conventional rotation usually comprises of computation-intensive CORDIC operations. Traditionally, images are represented on a square pixel structure. In this paper, we perform reversible and fast image translation and rotation based on a hexagonal structure. An image represented on the hexagonal structure is a collection of hexagonal pixels of equal size. The hexagonal structure provides a more flexible and efficient way to perform image translation and rotation without losing image information. As there is not yet any available hardware for capturing image and for displaying image on a hexagonal structure, we apply a newly developed virtual hexagonal structure. The virtual hexagonal structure retains image resolution during the process of image transformations, and almost does not introduce distortion. Furthermore, images can be smoothly and easily transferred between the traditional square structure and the hexagonal structure. © 2006 IEEE.

He, X, Jia, W, Hur, N, Wu, Q, Kim, J & Hintz, T 1970, 'Bilateral Edge Detection on a Virtual Hexagonal Structure', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), International Symposium on Visual Computing, Springer Berlin Heidelberg, United States, pp. 176-185.
View/Download from: Publisher's site
View description>>

Edge detection plays an important role in image processing area. This paper presents an edge detection method based on bilateral filtering which achieves better performance than single Gaussian filtering. In this form of filtering, both spatial closeness and intensity similarity of pixels are considered in order to preserve important visual cues provided by edges and reduce the sharpness of transitions in intensity values as well. In addition, the edge detection method proposed in this paper is achieved on sampled images represented on a newly developed virtual hexagonal structure. Due to the compact and circular nature of the hexagonal lattice, a better quality edge map is obtained on the hexagonal structure than common edge detection on square structure. Experimental results using proposed methods exhibit encouraging performance. © Springer-Verlag Berlin Heidelberg 2006.

He, X, Wang, H, Hur, N, Jia, W, Wu, Q, Kim, J & Hintz, T 1970, 'Uniformly Partitioning Images on Virtual Hexagonal Structure', 2006 9th International Conference on Control, Automation, Robotics and Vision, 2006 9th International Conference on Control, Automation, Robotics and Vision, IEEE, Singapore, pp. 891-896.
View/Download from: Publisher's site
View description>>

Hexagonal structure is different from the traditionnal square structure for image representation. The geometrical arrangement of pixels on hexagonal structure can be described in terms of a hexagonal grid. Uniformly separating image into seven similar copies with a smaller scale has commonly been used for parallel and accurate image processing on hexagonal structure. However, all the existing hardware for capturing image and for displaying image are produced based on square architecture. It has become a serious problem affecting the advanced research based on hexagonal structure. Furthermore, the current techniques used for uniform separation of images on hexagonal structure do not coincide with the rectangular shape of images. This has been an obstacle in the use of hexagonal structure for image processing. In this paper, we briefly review a newly developed virtual hexagonal structure that is scalable. Based on this virtual structure, algorithms for uniform image separation are presented. The virtual hexagonal structure retains image resolution during the process of image separation, and does not introduce distortion. Furthermore, images can be smoothly and easily transferred between the traditional square structure and the hexagonal structure while the image shape is kept in rectangle. © 2006 IEEE.

He, X, Zhang, H, Hur, N, Kim, J, Kim, T & Wu, Q 1970, 'Complete Camera Calibration Using Line-Shape Objects', TENCON 2006 - 2006 IEEE Region 10 Conference, TENCON 2006 - 2006 IEEE Region 10 Conference, IEEE, Honk Kong, China, pp. 1-4.
View/Download from: Publisher's site
View description>>

Most of object-based calibration methods used 3D or 2D pattern. A novel and more flexible 1D object-based calibration was introduced only a couple of years ago, and merely for estimation of intrinsic parameters without consideration camera distortion. Estimation of extrinsic papers is essential when multiple cameras are involved for simultaneously taking images from different view angles and when the knowledge of relative locations between the cameras is required. Estimation of distortion parameters is critical for precise estimation of all calibration parameters. In this paper, we will perform a multi-layer camera calibration involving both intrinsic and extrinsic parameters including distortion parameters based on a line-shape calibration object. © 2006 IEEE.

He, X, Zhang, H, Hur, N, Kim, J, Wu, Q & Kim, T 1970, 'Estimation of Internal and External Parameters for Camera Calibration Using 1D Pattern', 2006 IEEE International Conference on Video and Signal Based Surveillance, 2006 IEEE International Conference on Video and Signal Based Surveillance, IEEE, Sydney, Australia, pp. 93-98.
View/Download from: Publisher's site
View description>>

Camera calibration is to estimate the intrinsic and extrinsic parameters of a camera. Most of object-based calibration methods used 3D or 2D pattern. A novel and more flexible 1D object-based calibration was introduced only a couple of years ago, but merely for estimation of intrinsic parameters. The estimation of extrinsic papers is essential when multiple cameras are involved for simultaneously taking images from different view angles and when the knowledge of relative locations between the cameras is required. Though it is relatively simple using 2D or 3D calibration pattern, the estimation of extrinsic parameters is not obvious using 1D pattern. In this paper, we will perform a 1D camera calibration involving both intrinsic and extrinsic parameters. © 2006 IEEE.

Huaifeng Zhang, Wenjing Jia, Xiangjian He & Qiang Wu 1970, 'Learning-Based License Plate Detection Using Global and Local Features', 18th International Conference on Pattern Recognition (ICPR'06), 18th International Conference on Pattern Recognition (ICPR'06), IEEE, Hong Kong, pp. 1102-1105.
View/Download from: Publisher's site
View description>>

This paper proposes a license plate detection algorithm using both global statistical features and local Haar-like features. Classifiers using global statistical features are constructed firstly through simple learning procedures. Using these classifiers, more than 70% of background area can be excluded from further training or detecting. Then the AdaBoost learning algorithm is used to build up the other classifiers based on selected local Haar-like features. Combining the classifiers using the global features and the local features, we obtain a cascade classifier. The classifiers based on global features decrease the complexity of the system. They are followed by the classifiers based on local Haar-like features, which makes the final classifier invariant to the brightness, color, size and position of license plates. The encouraging detection rate is achieved in the experiments. © 2006 IEEE.

Huang, X 1970, 'Arbitrary ratio sample rate conversion using B-Spline interpolation for software defined radio', Proceedings of the 1st IEEE International Conference on Wireless Broadband and Ultra Wideband Communications, AusWireless 2006, pp. 402-407.
View description>>

Arbitrary ratio sampling rate conversion (SRC) structure using B-spline interpolation is proposed for software defined radio (SDR) in this paper. By combining SRC with SDR's transmitter/receiver filter, the constraint on SRC reconstruction filter can be relaxed, and an overall computational reduction can be achieved. The mixed-width B-spline is introduced so that both antiimaging and anti-aliasing requirements for SRC are satisfied. The passband droop introduced by the B-spline interpolation is compensated by a linear phase digital filter incorporated in the SRC structure so that the overall frequency response approaches the desired frequency response of the SDR's transmitter/receiver filter. To make the proposed SRC structure applicable in practice, the mixed-width B-spline is further converted into uni-width B-spline, and the simplified implementation of the uniwidth B-spline interpolation is also derived. A design example of the linear phase digital filter for the proposed SRC structure is given for an IEEE 802.11g wireless local area network (WLAN) SDR receiver, and the overall SRC complexity is analyzed.

Huang, X 1970, 'Complementary Properties of Hadamard Matrices', 2006 International Conference on Communications, Circuits and Systems, 2006 International Conference on Communications, Circuits and Systems, IEEE, Guilin, PEOPLES R CHINA, pp. 588-592.
View/Download from: Publisher's site

Huang, X 1970, 'Effect of DC Offset on OFDM System with Zero-Padded Suffix', 2006 International Symposium on Communications and Information Technologies, 2006 International Symposium on Communications and Information Technologies, IEEE, pp. 503-506.
View/Download from: Publisher's site
View description>>

The effect of direct current (DC) offset on orthogonal frequency division multiplexing (OFDM) system with zero-padded (ZP) suffix is analysed in this paper. It is found that the ZP appended OFDM system suffers more from DC offset than a cyclic prefix inserted OFDM system and even demonstrates bit error flooring if the DC power exceeds a maximum allowed threshold. Simple algorithms are also proposed for DC offset estimation and compensation. The analysis is confirmed by simulation using multiband OFDM specification for ultra-wideband application. © 2006 IEEE.

Huang, X 1970, 'Effect of DC offset on OFDM system with zero-padded suffix', 2006 INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES,VOLS 1-3, International Symposium on Communications and Information Technologies, IEEE, Bangkok, THAILAND, pp. 553-556.

Huang, X, Dutkiewicz, E, Gandia, R & Lowe, D 1970, 'Ultra-Wideband Technology for Video Surveillance Sensor Networks', 2006 IEEE International Conference on Industrial Informatics, 2006 IEEE International Conference on Industrial Informatics, IEEE, pp. 1012-1017.
View/Download from: Publisher's site
View description>>

Wireless sensor networks have received a lot of attention in recent years both in the research community and in standards organizations. The emphasis of most sensor network research activities has been on the development of low cost and low power technologies for low bit rate applications. In this paper, we describe our work on ultra-wideband (UWB) sensor network technology targeted for video surveillance applications that require high immunity to noise, interference and jamming, high bit rate, and quality of service support. Such sensor networks are expected to find primary applications in the public safety and military fields. Our emphasis in this paper is on the design of the physical layer that can support such requirements and provide high end-to-end throughput when multi-hopping is used. ©2006 IEEE.

Huang, X, Kwoh, L, Yuan, B & Tan, Y 1970, 'An Efficient Platform for 3D City Model Visualization', 2006 IEEE International Symposium on Geoscience and Remote Sensing, 2006 IEEE International Symposium on Geoscience and Remote Sensing, IEEE, Denver, CO, pp. 917-920.
View/Download from: Publisher's site

Huang, X, Lowe, D, Gandia, R & Dutkiewicz, E 1970, 'An Impulse Ultra-wideband System Capable of Concurrent Transmission and Reception, Part I: Requirements and Innovations', 2006 International Conference on Communications, Circuits and Systems, 2006 International Conference on Communications, Circuits and Systems, IEEE, Guilin, PEOPLES R CHINA, pp. 1251-+.
View/Download from: Publisher's site

Huang, X, Lowe, D, Gandia, R & Dutkiewicz, E 1970, 'An Impulse Ultra-wideband System Capable of Concurrent Transmission and Reception, Part II: Design and Performance', 2006 International Conference on Communications, Circuits and Systems, 2006 International Conference on Communications, Circuits and Systems, IEEE, Guilin, PEOPLES R CHINA, pp. 1256-+.
View/Download from: Publisher's site

Huaqing Wang, Qiang Wu, Xiangjian He & Hintz, T 1970, 'A Novel Interactive Progressive Decoding Method for Fractal Image Compression', First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06), First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06), IEEE, Beijing, PEOPLES R CHINA, pp. 613-616.
View/Download from: Publisher's site
View description>>

Fractal image compression is an efficient and effective technique in image coding. This paper presents a novel interactive progressive fractal decoding method, with which the compressed file can be transmitted incrementally and reconstructed progressivel

Huaqing Wang, Xiangjian He, Qiang Wu & Hintz, T 1970, 'A New Approach for Fractal Image Compression on a Virtual Hexagonal Structure', 18th International Conference on Pattern Recognition (ICPR'06), 18th International Conference on Pattern Recognition (ICPR'06), IEEE, Hong Kong, China, pp. 909-912.
View/Download from: Publisher's site
View description>>

In this paper, we propose a Fractal Image Compression method on a virtual hexagonal image structure by adopting Fisher's basic method on the traditional square image structure. The modification on the definition of range block and domain block is implemented in order to utilize the enhanced image structure. The results of the proposed approach applied to testing images are analyzed and higher fidelity is obtained. The further research directions are discussed.

Jia, W, He, X & Tien, D 1970, 'Automatically Detecting Road Sign Text from Natural Scene Video', TENCON 2006 - 2006 IEEE Region 10 Conference, TENCON 2006 - 2006 IEEE Region 10 Conference, IEEE, Hong Kiong, pp. 1-4.
View/Download from: Publisher's site
View description>>

Automatic detection of text on road signs can help drivers keep aware of the traffic situation and surrounding environments by reminding them of the signs ahead. Current systems can only detect constrained road signs or produce unsatisfying performance when dealing with complex scenes in practical use. This paper firstly reviews the existing techniques used for text detection from natural scene. A novel system which detects text on road signs from natural scene video is then proposed. Our detailed approaches and methodology give a promising solution to this problem in order to reduce the running time and improve the recognition rate. © 2006 IEEE.

Jia, W, He, X & Tien, D 1970, 'Automatically detecting road sign text from natural scene video', TENCON 2006 - 2006 IEEE REGION 10 CONFERENCE, VOLS 1-4, IEEE Region 10 Conference (TENCON 2006), IEEE, Hong Kong, PEOPLES R CHINA, pp. 1660-+.

Jia, W, Zhang, H, He, X & Wu, Q 1970, 'A Comparison on Histogram Based Image Matching Methods', 2006 IEEE International Conference on Video and Signal Based Surveillance, 2006 IEEE International Conference on Video and Signal Based Surveillance, IEEE, Sydney, Australia, pp. 1-6.
View/Download from: Publisher's site
View description>>

Using colour histogram as a stable representation over change in view has been widely used for object recognition. In this paper, three newly proposed histogram-based methods are compared with other three popular methods, including conventional histogram intersection (HI) method, Wong and Cheung's merged palette histogram matching (MPHM) method, and Gevers' colour ratio gradient (CRG) method. These methods are tested on vehicle number plate images for number plate classification. Experimental results disclose that, the CRG method is the best choice in terms of speed, and the GWHI method can give the best classification results. Overall, the CECH method produces the best performance when both speed and classification performance are concerned. © 2006 IEEE.

Jia, W, Zhang, H, He, X & Wu, Q 1970, 'Image Matching Using Colour Edge Cooccurrence Histograms', 2006 IEEE International Conference on Systems, Man and Cybernetics, 2006 IEEE International Conference on Systems, Man and Cybernetics, IEEE, Taipei, Taiwan, pp. 2413-2419.
View/Download from: Publisher's site
View description>>

In this paper, a novel colour edge cooccurrence histogram (CECH) method is proposed to match images by measuring similarities between their CECH histograms. Unlike the previous colour edge cooccurrence histogram proposed by Crandall et al. in [2], we only investigate those pixels which are located at the two sides of edge points in their gradient direction lines and at a distance away from the edge points. When measuring similarities between two CECH histograms, a newly proposed Gaussian weighted histogram intersection (GWHI) method is extended for this purpose. Both identical colour pairs and similar colour pairs are taken into account in our algorithm, and the weights are decided by the larger distance between two colour pairs involved in matching. The proposed algorithm is tested for matching vehicle number plate images captured under various illumination conditions. Experimental results demonstrate that the proposed algorithm can be used to compare images in real-time, and is robust to illumination variations and insensitive to the model images selected. © 2006 IEEE.

Jia, W, Zhang, H, He, X & Wu, Q 1970, 'Symmetric Color Ratio in Spiral Architecture', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Asian Conference on Computer Vision, Springer Berlin Heidelberg, Hyderabad, India, pp. 204-213.
View/Download from: Publisher's site
View description>>

Color ratio gradient (CRG) is a robust method used for color image retrieval and object recognition. It has been proven to be illumination-independent and geometry-insensitive when tested on scenery images. However, the color ratio gradient produces unsatisfying matching results when dealing with an object which appears rotated by a certain relative angle in the model and target images. In this paper, we adopt the idea of color ratio gradient and develop a new method called Symmetric Color Ratio (SCR) based on a hexagonal image structure, the Spiral Architecture (SA). We focus on license plate images and our aim is to achieve a higher matching rate between the SCR histogram of the images within same class in order to separate different classes of images. Our experimental results demonstrate that the proposed SCR is robust to changes over view angles. © Springer-Verlag Berlin Heidelberg 2006.

Le Chung Tran, Xiaojing Huang, Dutkiewicz, E & Chicharo, J 1970, 'STC-MIMO Block Spread OFDM in Frequency Selective Rayleigh Fading Channels', 11th IEEE Symposium on Computers and Communications (ISCC'06), 11th IEEE Symposium on Computers and Communications (ISCC'06), IEEE, pp. 277-282.
View/Download from: Publisher's site
View description>>

In this paper, we expand the idea of spreading the transmitted symbols in OFDM systems by unitary spreading matrices based on the rotated Hadamard or rotated Discrete Fourier Transform (DFT) matrices proposed in the literature to apply to Space-Time Coded Multiple-Input Multiple-Output OFDM (STC-MIMO-OFDM) systems. We refer the resulting systems to as STC-MIMO Block Spread OFDM (STC-MIMO-BOFDM) systems. In the proposed systems, a multi-dimensional diversity, including time, frequency, space and modulation diversities, can be used, resulting in better bit error performance in frequency selective Rayleigh fading channels compared to the conventional OFDM systems with or without STCs. Simulations carried out with the Alamouti code confirm the advantage of the proposed STC-MIMO-BOFDM systems. © 2006 IEEE.

Liu, M, Li, Z-C, Guo, X-B, Dutkiewicz, E & Wang, M-H 1970, 'WLC14-4: SAVA: A Novel Self-Adaptive Vertical Handoff Algorithm for Heterogeneous Wireless Networks', IEEE Globecom 2006, IEEE Globecom 2006, IEEE.
View/Download from: Publisher's site
View description>>

The next generation wireless networking (4G) is envisioned as a convergence of different wireless access technologies with diverse levels of performance. Vertical handoff (VHO) is the basic requirement for convergence of different access technologies and has received tremendous attention from the academia and industry all over the world. During the VHO procedure, handoff decision is the most important step that affects the normal working of communication. In this paper, we propose a novel vertical handoff decision algorithm, Self-Adaptive VHO Algorithm (SAVA), and compare its performance with conventional algorithms. SAVA synthetically considers the long term movement region and short term movement trend of mobile hosts, and achieves a good integrative handoff performance. © 2006 IEEE.

Liu, M, Li, Z-C, Guo, X-B, Dutkiewicz, E & Zhang, D-K 1970, 'WLC14-1: Performance Evaluation of Vertical Handoff Decision Algorithms in Heterogeneous Wireless Networks', IEEE Globecom 2006, IEEE Globecom 2006, IEEE.
View/Download from: Publisher's site
View description>>

In recent years, many research works have focused on vertical handoff (VHO) decision algorithms. However, evaluation scenarios in different papers are often quite different and there is no consensus on how to evaluate performance of VHO algorithms. In this paper, we address this important issue by proposing an approach for systematic and thorough performance evaluation of VHO algorithms. Firstly we define the evaluation criteria for VHO with two metrics: matching ratio and average ping-pong number. Subsequently we analyze the general movement characteristics of mobile hosts and identify a set of novel performance evaluation models for VHO algorithms. Equipped with these models and evaluation criteria, we evaluate and analyze two types of decision algorithms: hysteresis based and dwelling-timer based algorithms. The results show a good match between simulation and analytical results. © 2006 IEEE.

Liu, RP, Rogers, G & Zhou, S 1970, 'WSN14-3: Honeycomb Architecture for Energy Conservation in Wireless Sensor Networks', IEEE Globecom 2006, IEEE Globecom 2006, IEEE, San Francisco, CA.
View/Download from: Publisher's site

Lowe, D & Huang, X 1970, 'Adaptive low-complexity MMSE channel estimation for OFDM', 2006 INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES,VOLS 1-3, International Symposium on Communications and Information Technologies, IEEE, Bangkok, THAILAND, pp. 688-+.

Lowe, D & Huang, X 1970, 'Adaptive Low-Complexity MMSE Channel Estimation for OFDM', 2006 International Symposium on Communications and Information Technologies, 2006 International Symposium on Communications and Information Technologies, IEEE, pp. 638-643.
View/Download from: Publisher's site
View description>>

In this paper we present extremely low-complexity adaptive infinite impulse response (IIR) filters that approximate minimum mean square error (MMSE) channel estimation in orthogonal frequency-division multiplexing (OFDM) systems. We show how the packet error rate (PER) can be significantly improved over conventional zero-forcing (ZF) estimation without incurring a significant increase in computational complexity. All quantitative results are provided in the context of multi-band OFDM (MB-OFDM) ultra-wideband (UWB) with standard IEEE channel models. © 2006 IEEE.

Lowe, D & Huang, X 1970, 'Adaptive Overlap-Add Equalization for MB-OFDM Ultra-Wideband', 2006 International Symposium on Communications and Information Technologies, 2006 International Symposium on Communications and Information Technologies, IEEE, pp. 644-648.
View/Download from: Publisher's site
View description>>

A zero-pad can be used with orthogonal frequency division multiplexing (OFDM) for low-complexity robustness against multipath interference. In this paper, we use adaptive overlap-add (OLA) equalization for improvements of up to 1 dB when used with multi-band OFDM (MB-OFDM) ultra-wideband. A theoretical model that relates the size of OLA window to post-equalizer signal-to-noise ratio is derived. An approximating algorithm is then developed that is suitable for low-complexity implementation, with Monte Carlo simulations used to quantify the performance improvements. We conclude that adaptive OLA equalization is computationally simple and can be implemented while remaining fully compliant with the MB-OFDM standard. © 2006 IEEE.

Lowe, D & Huang, X 1970, 'Adaptive overlap-add equalization for MB-OFDM ultra-wideband', 2006 INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES,VOLS 1-3, International Symposium on Communications and Information Technologies, IEEE, Bangkok, THAILAND, pp. 694-+.

Lowe, D & Huang, X 1970, 'Low-complexity generation of scalable complete complementary sets of sequences', 2006 INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES,VOLS 1-3, International Symposium on Communications and Information Technologies, IEEE, Bangkok, THAILAND, pp. 941-+.

Lowe, D & Huang, X 1970, 'Low-Complexity Generation of Scalable Complete Complementary Sets of Sequences', 2006 International Symposium on Communications and Information Technologies, 2006 International Symposium on Communications and Information Technologies, IEEE, pp. 73-77.
View/Download from: Publisher's site
View description>>

This paper presents extremely low-complexity boolean logic for the generation of coefficients suitable for filtering or correlation of scalable complete complementary sets of sequences (SCCSS). As the unique auto- and cross-correlation properties of SCCSS are of broad interest, the simplicity of the proposed coefficient generation technique allows arbitrarily long SCCSS to be used in resource constrained applications. © 2006 IEEE.

Lowe, D & Huang, X 1970, 'Ultra-Wideband MB-OFDM Channel Estimation with Complementary Codes', 2006 International Symposium on Communications and Information Technologies, 2006 International Symposium on Communications and Information Technologies, IEEE, pp. 623-628.
View/Download from: Publisher's site
View description>>

In this paper, we design complementary codesets that significantly improve the quality of channel estimation in orthogonal frequency division multiplexing (OFDM) communication systems, with a focus on the recent MB-OFDM ultrawideband (UWB) standard. The proposed time-domain OFDM channel estimation technique incurs only a nominal increase in computational complexity and is able to be readily retrofitted into the existing MB-OFDM standard. The underlying complementary codesets, found via an evolutionary algorithm, combine with the existing preamble synchronization sequences to yield asymptotically ideal auto-correlation functions (ACFs). We show how improvements exceeding 1 dB can be achieved in end-to-end packet error rate relative to conventional zero-forcing OFDM equalization. © 2006 IEEE.

Lowe, D & Huang, X 1970, 'Ultra-wideband MB-OFDM channel estimation with complementary codes', 2006 INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES,VOLS 1-3, International Symposium on Communications and Information Technologies, IEEE, Bangkok, THAILAND, pp. 673-+.

Lu, S, Zhang, J & Feng, D 1970, 'A Knowledge-Based Approach for Detecting Unattended Packages in Surveillance Video', 2006 IEEE International Conference on Video and Signal Based Surveillance, 2006 IEEE International Conference on Video and Signal Based Surveillance, IEEE, Sydney, NSW, pp. 0-0.
View/Download from: Publisher's site
View description>>

This paper describes a novel approach for detecting unattended packages in surveillance video. Unlike the traditional approach to just detecting stationary objects in monitored scenes, our approach detects unattended packages based on accumulated knowled

Machiraju, S & Veitch, D 1970, 'A measurement-friendly network (MFN) architecture', Proceedings of the 2006 SIGCOMM workshop on Internet network management, SIGCOMM06: ACM SIGCOMM 2006 Conference, ACM, ACM, pp. 53-58.
View/Download from: Publisher's site

Mahadevan, V, Agbinya, J & Braun, R 1970, 'Analyzing Usability Alternatives in Multi-criteria Decision Making During ERP Training', 2006 7TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY BASED HIGHER EDUCATION AND TRAINING, VOLS 1 AND 2, 7th International Conference on Information Technology Based Higher Education and Training, IEEE, Sydney, AUSTRALIA, pp. 314-327.

Mahadevan, V, Agbinya, J & Braun, R 1970, 'Analyzing Usability Alternatives in Multi-criteria Decision Making During ERP Training', 2006 7th International Conference on Information Technology Based Higher Education and Training, 2006 7th International Conference on Information Technology Based Higher Education and Training, IEEE, Sydney, Australia, pp. 296-309.
View/Download from: Publisher's site
View description>>

Lack of high-level usability awareness often leads the e-business communities to a missing relative assessment of capability of collaborative businesses effectively in terms of achieving strategic and competitive advantages. In this paper, we propose a new strategic framework for an evolutionary Collaborative Space of Opportunities (CSO) whilst using a Telecollaboration (TC) business system during Enterprise Resource Planning (ERF) training. Initially, we apply Callos's General System Theory (GST) with the description of logistics elements of this framework. Next, we provide a business logistics management perspective within CSO, addressing organizational effectiveness, technology integration control efficiency and user satisfaction. This includes formation of coevolutionary loops to induce the apparent system usability objectives to explore the emergence of business logistics portfolios and technology integration control profiles of the users. We then describe our proposed Collaborative Space of Opportunities Matrices (CSOM) to analyse the apparent usability alternatives in this multi-criteria decision making environment. In this context, we apply the general form of Saaty's Analytic Hierarchy Process (AHP) to demonstrate how these matrices could be used as a generic elicitation tool. It is here, we provide a set of systematic, explicit, rigorous and robust reinforcement mechanisms for quantifying and prioritizing the Decision elements (De) involved. We assume that the exposition on AHP has the Business process Reengineering (BPR) effect to measure and synthesize the often conflicting apparent usability objectives and alternatives of a TC business system during ERP training. © 2006 IEEE.

Markovits, S & Braun, R 1970, 'Information Model: a Centerpiece for Teaching Telecoms Network Management', 2006 7th International Conference on Information Technology Based Higher Education and Training, 2006 7th International Conference on Information Technology Based Higher Education and Training, IEEE, pp. 363-366.
View/Download from: Publisher's site
View description>>

Teaching Telecoms Network Mgmt can be very challenging. The aspiration is to give our students an end to end view of the Telecom Service Provider domain. The emphasis is on the understanding of the Service Provider's(SP) needs, exploring technology solution sets, and developing an integrated approach to Network Mgmt. The background knowledge required to appreciate the course content is wide. The use of an Information Model (IM) has been found to be useful in giving the students the understanding of the interaction of the components within a SP as well as the end to envision while allowing to appreciate the detail when required. This paper details our course, its content and usage of the TMF's IM to facilitate the teaching of the course. Our paper discusses one method, usage of developing industry Information Models (IM), as a method we have employed to overcome this. We discuss how we have structured the content, assessments tasks and assessment reviews to give a unified view into the course goals. ©2006 IEEE.

Markovits, S, Braun, R & IEEE 1970, 'Information model: a centerpiece for teaching telecoms network management', 2006 7th International Conference on Information Technology Based Higher Education and Training, Vols 1 and 2, pp. 381-384.

Massimo Piccardi 1970, 'Human-Focused Computer Vision Applications', International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06), International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06), IEEE, p. 5.
View/Download from: Publisher's site
View description>>

Recent years have seen an increasing number of computer vision applications focusing on humans as their objects of interest. Such applications include video surveillance, domotics, multimedia semantic annotation and indexing, human-computer interfaces, affective computing, just to cite a few. What exactly are their "objects of interest"? A broad range of human-related features: motion, gestures, actions, interactions, activities, attitudes, behaviours, identity. This keynote will offer a survey of this field and present some current work from the speaker and his collaborators in the areas of emotion recognition and people tracking within camera networks. © 2006 IEEE.

Park, C, Shen, H, Marron, JS, Hernández-Campos, F & Veitch, D 1970, 'Capturing the elusive poissonity in web traffic', Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS, IEEE, pp. 189-196.
View description>>

Numerous studies have shown that the process of packet arrivals from Web traffic exhibits strong long-range dependence, which makes it not amenable to be described using the convenient but necessarily short-range dependent framework of Poisson modeling. However, Web traffic is ultimately driven by independent human behavior, so it seems natural to search for an underlying 'seed process', consistent with Poissonity, indirectly driving the packet arrivals of Web traffic. Our study examines Web traffic at different levels of packet aggregation, using powerful statistical analysis tools for identifying the finest level that can be effectively modeled using a homogeneous Poisson process. We show that the arrivals of HTTP responses, TCP connections and Web pages do not provide a satisfactory seed process. However, we find Poissonity in the arrivals of 'navigation bursts'. A navigation burst is a tightly-spaced sequence of Web pages downloaded by the same Web client, which can be explained by fast navigation through several pages before reaching relevant content. Our analysis suggests that the start times of such navigation bursts, which we identify by detecting user think times between 12 and 30 seconds, can be effectively modeled as a homogeneous Poisson process. We believe that our methodology can be extended to other complex modeling problems where finding Poissonity can greatly simplify parsimonious modeling. © 2006 IEEE.

Piccardi, M 1970, 'Video Surveillance at the Beginning of the Third Millennium: The Viewpoint of Research, Industry, Government Bodies, Research Funding Agencies and the Community', 2006 IEEE International Conference on Video and Signal Based Surveillance, 2006 IEEE International Conference on Video and Signal Based Surveillance, IEEE.
View/Download from: Publisher's site

Piccardi, M & Cheng, ED 1970, 'Multi-Frame Moving Object Track Matching Based on an Incremental Major Color Spectrum Histogram Matching Algorithm', 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops, IEEE, New York, USA, pp. 1-6.
View/Download from: Publisher's site

Platt, G, Jones, T, James, G & Guo, Y 1970, 'Distributed energy management and control- Experiences in Australia', 41st International Conference on Large High Voltage Electric Systems 2006, CIGRE 2006.
View description>>

This paper describes CSIRO's research and deployment work in technologies for the management and control of distributed energy devices. This work is designed to provide real-time, two-way communication and decision making between distributed energy (DE) resources- loads and generators- in electricity distribution networks. The general DE management and control concept is based on a decentralised architecture, which is a significant shift from the control architectures normally employed in electrical distribution systems. This architecture has a number of advantages, including scalability, improved economics of installation, inherent reliability by removing central points of failure, and improved granularity of data gathering and control functions. The applications of our decentralised management and control architecture are many, but include improving grid reliability, allowing consumers to play a more active role in their energy usage, and benefiting the network by alleviating the effects of peak wholesale prices and network constraints. The technology is aimed deployment in the Australian National Electricity Market within the next five years, and this paper details our latest work in this area. It includes a discussion of CSIRO's theoretical and simulation research efforts into multi-agent distributed systems, whilst also detailing work trialling the distributed energy management and control system in a real-world context.

Qumer, A & Henderson-Sellers, B 1970, 'A Framework to Support Non-fragile Agile Agent-Oriented Software Development', NEW TRENDS IN SOFTWARE METHODOLOGIES, TOOLS AND TECHNIQUES, International Conference on Software Methods and Tools, IOS Press, Quebec, Canada, pp. 84-100.
View description>>

Agile software development methods support mainly object-oriented, feature-oriented and component-oriented software development and do not address agent-oriented and aspect-oriented software development. The concepts of agents and objects are in many ways dissimilar; and an object-oriented approach is not immediately suitable for the development of a multiagent system. In our current research, we extend agile software development methods originating primarily in object-oriented technology to support agent-orientation in the context of the development of multiagent systems. This research paper introduces a new agile agent-oriented framework to create or tailor situation-specific non-fragile agile agent-oriented software development processes (using a method engineering approach) to support multi-agent software development.

Qumer, A & Henderson-Sellers, B 1970, 'Comparative evaluation of XP and scrum using the 4d analytical tool (4-DAT)', Proceedings of the European and Mediterranean Conference on Information Systems, EMCIS 2006.
View description>>

The emergence of agile software development methods provides a contribution to contemporary software engineering practices. Agile methods have several benefits over traditional plan-based methods, in particular their ability to handle projects where requirements are not fixed. In the last few years, a number of agile software development methods have been developed but a detailed evaluation (which is essential) of these methods is not available. This paper presents a detailed comparative analysis of two well known agile methods (XP and Scrum), using the previously published 4- Dimensional Analytical Tool (4-DAT), based on four characterization perspectives: those of scope, agility, agile values and software process. A report generated with the help of 4-DAT will assist organizations in making decisions about the selection or adoption of an agile method.

Qumer, A, Henderson-Sellers, B & INSTICC 1970, 'Crystallization of agility - Back to basics', ICSOFT 2006: Proceedings of the First International Conference on Software and Data Technologies, Vol 2, International Conference on Software and Data Technologies, INSTICC, Setubal, Portugal, pp. 121-126.
View description>>

There are a number of agile and traditional methodologies for software development. Agilists provide agile principles and agile values to characterize the agile methods but there is no clear and inclusive definition of agile methods; subsequently it is not feasible to draw a clear distinction between traditional and agile software development methods in practice. The purpose of this paper is to explain the concept of agility in detail; and then to suggest a definition of agile methods that would help in the ranking or differentiation of agile methods from other available methods.

Raad, IS & Huang, X 1970, 'Exploiting time diversity to improve block spread OFDM', Proceedings of the 1st IEEE International Conference on Wireless Broadband and Ultra Wideband Communications, AusWireless 2006, pp. 341-345.
View description>>

This paper presents a new method to improve on block spread OFDM by exploiting time diversity to ensure that the blocks are independent and uncorrelated. Simulation results have shown significant improvement over conventional OFDM and Block Spread OFDM.

Raad, IS & Xiaojing Huang 1970, 'Exploiting Time Diversity to Improve Block Spread OFDM in a Multipath Environment', 2006 2nd International Conference on Information & Communication Technologies, 2006 2nd International Conference on Information & Communication Technologies, IEEE, Damascus, Syria, pp. 2444-2449.
View/Download from: Publisher's site
View description>>

© 2006 IEEE. This paper presents a new method to improve on block spread OFDM by exploiting time diversity to ensure that the blocks are independent and uncorrelated in a multipath environment. While BSOFDM utilizes frequency diversity to significantly improve on OFDM in frequency selective channel, this did not improve during flat fading channel which does occur during transmission. Our work has also shown that this improvement is also true in multipath transmission. By exploiting time and frequency diversity, BSOFDM is improved significantly over conventional BSOFDM and conventional OFDM.

Raad, IS, Huang, X & Lowe, D 1970, 'Study of spread codes with block spread OFDM', Proceedings of the 1st IEEE International Conference on Wireless Broadband and Ultra Wideband Communications, AusWireless 2006, pp. 346-350.
View description>>

This paper presents the study undertaken with block spread OFDM and compares three spreading matrices. The matrices include the Hadamard, Rotated Hadamard and Mutually Orthogonal Complementary Sets of Sequences (MOCSS). The study is carried out for block lengths of M = 2, M = 4 and M = 8 and it shows that all the spreading matrices show improvement and a better performance over the conventional OFDM over frequency selective channel as expected. As the size ofM increased the spreading matrices which have better orthogonal qualities show greater improvement.

Raad, IS, Huang, X & Raad, R 1970, 'A New Spreading Matrix for Block Spread OFDM', 2006 10th IEEE Singapore International Conference on Communication Systems, 2006 10th IEEE Singapore International Conference on Communication Systems, IEEE, Singapore, SINGAPORE, pp. 541-+.
View/Download from: Publisher's site

Ridoux, J, Nucci, A & Veitch, D 1970, 'Seeing the Difference in IP Traffic: Wireless Versus Wireline', Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, IEEE.
View/Download from: Publisher's site

Shi, J, Fang, G, Sun, Y, Zhou, J, Li, Z & Dutkiewicz, E 1970, 'WLC17-5: Improving Mobile Station Energy Efficiency in IEEE 802.16e WMAN by Burst Scheduling', IEEE Globecom 2006, IEEE Globecom 2006, IEEE.
View/Download from: Publisher's site
View description>>

In this paper, we tackle the packet scheduling problem in IEEE 802.16e Wireless Metropolitan Area Network (WMAN), where the Sleep Mode is applied to save energy of Mobile Stations (MSs). Our objective is to design an energy efficient scheduling policy which works closely with the Sleep Mode mechanism so as to maximize battery lifetime in MSs. To the best of our knowledge no power saving scheduling algorithms based on Sleep Mode defined in IEEE 802.16e have been proposed so far in the literature. We propose a Longest Virtual Burst First (LVBF) scheduling algorithm which schedules packets of MSs in a virtual burst mode where there is one primary MS and multiple secondary MSs sharing the wireless link resource. LVBF prolongs MSs' lifetime by reducing the average time when MSs stay in the idle state and the number of state transitions between the awake and sleep states. Simulation results show that, in comparison with the round robin scheduling scheme, LVBF can produce significant overall energy saving, while guaranteeing the QoS requirements of MSs in terms of their minimum data rates. © 2006 IEEE.

Tran, LC, Huang, X, Dutkiewicz, E & Chicharo, J 1970, 'STC-MIMO block spread OFDM in frequency selective rayleigh fading channels', Proceedings of the 1st IEEE International Conference on Wireless Broadband and Ultra Wideband Communications, AusWireless 2006, pp. 461-466.
View description>>

In this paper, we expand the idea of spreading the transmitted symbols in OFDM systems by unitary spreading matrices based on the rotated Hadamard or rotated Discrete Fourier Transform (DFT) matrices proposed in the literature to apply to Space-Time Coded Multiple-Input Multiple-Output OFDM (STC-MIMO-OFDM) systems. We refer the resulting systems to as STC-MIMO Block Spread OFDM (STC-MIMO-BOFDM) systems. In the proposed systems, a multi-dimensional diversity, including time, frequency, space and modulation diversities, can be used, resulting in better bit error performance in frequency selective Rayleigh fading channels compared to the conventional OFDM systems with or without STCs. Simulations carried out with the Alamouti code confirm the advantage of the proposed STC-MIMO-BOFDM systems.

Tu, P, Huang, X & Dutkiewicz, E 1970, 'A Novel Approach of Spreading Spectrum in OFDM Systems', 2006 International Symposium on Communications and Information Technologies, 2006 International Symposium on Communications and Information Technologies, IEEE, pp. 487-491.
View/Download from: Publisher's site
View description>>

A method for spectrum spreading in an Orthogonal Frequency Division Multiplexing (OFDM) system is proposed in this paper, resulting in a Spread Spectrum OFDM (SS-OFDM) system suitable for ultra-wideband (UWB) applications. By modifying the IFFT module in a conventional OFDM transmitter and interleaving the modulated signal samples within an OFDM symbol, the transmitted signal spectrum is spread greatly to realize spread spectrum communications. This method of spectrum spreading is also compared with that of the Multiband OFDM (MB-OFDM) system. The SS-OFDM signal has the characteristics of a white noise, and its power spectrum density is constant within the desired bandwidth. One of the main advantages of the proposed system is that it can be used for UWB communication without the need for frequency hopping. In addition, the transmitted signal bandwidth can be selected flexibly to meet different system requirements. © 2006 IEEE.

Tu, P, Huang, X & Dutkiewicz, E 1970, 'A novel approach of spreading spectrum in OFDM systems', 2006 INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES,VOLS 1-3, International Symposium on Communications and Information Technologies, IEEE, Bangkok, THAILAND, pp. 537-+.

Wang, H, He, S, Wu, Q & Hintz, TB 1970, 'Improvement of fractual image coding base on the different image', WISTSP '06 proceedings, Workshop in Information Security Theory and Practices, DSP for communication systems, Hobert, Australia, pp. 1-5.

Wang, H, Wu, Q, He, X & Hintz, T 1970, 'A New Approach for SA-Based Fractal Image Compression', 2006 International Conference on Image Processing, 2006 International Conference on Image Processing, IEEE, Atlanta, USA, pp. 3101-3104.
View/Download from: Publisher's site
View description>>

Spiral Architecture based fractal image compression is proposed in this paper. Perceptually, a new definition of range block and domain block is presented on such enhanced image structure. Compared with the common square image architecture, spiral architecture provides higher fidelity to fractal image compression, which is demonstrated by the experimental results. ©2006 IEEE.

Wang, H, Wu, Q, He, X & Hintz, T 1970, 'Preliminary research on fractal video compression on spiral architecture', Proceedings of the 2006 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV'06, International Conference on Image Processing, Computer Vision and Pattern Recognition, CSREA Press, Las Vegas, USA, pp. 557-562.
View description>>

Fractal Video Compression (FVC) is of extensive interest for over 20 years. Instead of being implemented on square image structure, Spiral Architecture (SA) based fractal image compression is proposed in this paper to illustrate the great potential of FVC on SA. Conceptually, a new definition of range block and domain block is presented on this enhanced image structure. Compared with the conventional square image architecture, spiral architecture provides higher fidelity to fractal image compression, which is demonstrated by the experimental results.

Weily, AR, Esselle, KP, Bird, TS & Sanders, BC 1970, 'High gain antenna with improved radiation bandwidth using dual 1-D EBG resonators and array feed', 2006 IEEE Antennas and Propagation Society International Symposium, 2006 IEEE Antennas and Propagation Society International Symposium, IEEE, pp. 3-6.
View/Download from: Publisher's site
View description>>

A high gain antenna made from dual 1-D electromagnetic bandgap (EBG) resonators is described. The combination of dual resonators with an array feed achieves a wide radiation bandwidth, thereby addressing a major limitation of EBG resonator antennas in general. The proposed antenna uses an array of 32 slots and a stripline corporate feed network to deliver energy to the dual resonator structure. Preliminary theoretical results on radiation patterns and gain of the antenna are discussed. Performance is compared with a classical 1-D EBG resonator antenna containing a single source to highlight the improvement in radiation bandwidth of the proposed configuration. © 2006 IEEE.

Wen Zhang, Abhayapala, TD & Jian Zhang 1970, 'UWB Spatia - Frequency Channel Characterization', 2006 IEEE 63rd Vehicular Technology Conference, 2006 IEEE 63rd Vehicular Technology Conference, IEEE, IEEE, pp. 2732-2736.
View/Download from: Publisher's site
View description>>

This paper investigates the spatial-frequency channel characterization of Ultra-wideband (UWB) wireless communication systems. Firstly, a novel frequency dependent UWB channel model is constructed based on the theory of electromagnetic diffraction mechanism, which causes the field strength to vary with the frequency in each multipath. Secondly, we build a space-frequency model, which includes spatial characteristics such as angular power spectrum, and physical sampling points in space. The space-frequency model has two special cases (i) discrete multipath model, and (ii) cluster model, which can be readily used to generate channel data for any arbitrary set of sensor locations. The reconstruction results from channel measurements show the accurateness of the novel frequency dependent model, with reconstruction error decreasing by 40%, compared to the traditional Turin model. © 2006 IEEE.

Wenjing Jia, Huaifeng Zhang, Xiangjian He & Qiang Wu 1970, 'Gaussian Weighted Histogram Intersection for License Plate Classification', 18th International Conference on Pattern Recognition (ICPR'06), 18th International Conference on Pattern Recognition (ICPR'06), IEEE, Hong Kong, PEOPLES R CHINA, pp. 574-577.
View/Download from: Publisher's site
View description>>

The conventional histogram intersection (HI) algorithm computes the intersected section of the corresponding color histograms in order to measure the matching rate between two color images. Since this algorithm is strictly based on the matching between bins of identical colors, the final matching rate can be easily affected by color variation caused by various environment changes. In this paper, a Gaussian weighted histogram intersection (GWHI) algorithm is proposed to facilitate the histogram matching via taking into account matching of both identical and similar colors. The weight is determined by the distance between two colors. The algorithm is applied to license plate classification. Experimental results show that the proposed algorithm produces a much lower intra-class distance and a much higher inter-class distance than previous HI algorithms for tested images which are captured under various illumination conditions. © 2006 IEEE.

Wenjing Jia, HZ 1970, 'Refined Gaussian Weighted Histogram Intersection and Its Application in Number Plate Categorization', International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06), International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06), IEEE, Sydney Australia, pp. 249-254.
View/Download from: Publisher's site
View description>>

This paper proposes a refined Gaussian weighted histogram intersection for content-based image matching and applies the method for number plate categorization. Number plate images are classified into two groups based on their colour similarities with the model image of each group. The similarities of images are measured by the matching rates between their colour histograms. Histogram intersection (HI) is used to calculate the matching rates of histograms. Since the conventional histogram intersection algorithm is strictly based on the matching between bins of identical colours, the final matching rate could easily be affected by colour variation caused by various environment changes. In our recent paper [9], a Gaussian weighted histogram intersection (GWHI) algorithm has been proposed to facilitate the histogram matching via taking into account matching of both identical colours and similar colours. The weight is determined by the distance between two colours. When applied to number plate categorization, the GWHI algorithm demonstrates to be more robust to colour variations and produces a classification with much lower intra-class distance and much higher interclass distance than previous HI algorithms. However, the processing speed of this GWHI method is still not satisfying. In this paper, the GWHI method is further refined, where a colour quantization method is utilized to reduce the number of colours without introducing apparent perceptual colour distortion. New experimental results demonstrate that using the refined GWHI method, image categorization can be done more efficiently. © 2006 IEEE.

Wu, Q, Zhang, H, Jia, W, He, X, Yang, J & Hintz, T 1970, 'Car Plate Detection Using Cascaded Tree-Style Learner Based on Hybrid Object Features', 2006 IEEE International Conference on Video and Signal Based Surveillance, 2006 IEEE International Conference on Video and Signal Based Surveillance, IEEE, Sydney, Australia, pp. 1-6.
View/Download from: Publisher's site
View description>>

Car plate detection is a key component in automatic license plate recognition system. This paper adopts an enhanced cascaded tree style learner framework for car plate detection using the hybrid object features including the simple statistical features and Harr-like features. The statistical features are useful for simplifying the process on cascade classifier. The cascaded tree-style detector design will further reduce the false alarm and the false dismissal while retaining a high detection ratio. The experimental results obtained by the proposed algorithm exhibit the encouraging performance. © 2006 IEEE.

Xiangjian He, HW 1970, 'Fractal Image Compression on Spiral Architecture', International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06), International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06), IEEE, Sydney, Australia, pp. 76-81.
View/Download from: Publisher's site
View description>>

Image compression has many applications. For example, it is an important step for distributed and network based pattern recognition. For real time object recognition or reconstruction, image compression can greatly reduce the image size, and hence increase the processing speed and enhance performance. Fractal image compression is a relatively recent image compression method. Its basic idea is to represent images as a fixed point of a contractive Iterated Function System (IFS). Spiral Architecture (SA) is a novel image structure on which images are displayed as a collection of hexagonal pixels. The efficiency and accuracy of image processing on SA have been demonstrated in many recently published papers. We have shown the existence of contractive IFS's through the construction of a Complete Metric Space on SA. The selection of range and domain blocks for fractal image compression is highly related to the uniform image separation specific to SA. In this paper, we will review the current research work on fractal image compression based on SA. We will compare the results obtained on SA and the traditional square structure in terms of compression ratio and PSNR. © 2006 IEEE.

Xiangjian He, WJ 1970, 'Basic Transformations on Virtual Hexagonal Structure', International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06), International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06), IEEE, Sydney, Australia, pp. 243-248.
View/Download from: Publisher's site
View description>>

Hexagonal structure is different from the traditional square structure for image representation. The geometrical arrangement of pixels on hexagonal structure can be described in terms of a hexagonal grid. Hexagonal structure provides an easy way for image translation and rotation transformations. However, all the existing hardware for capturing image and for displaying image are produced based on square architecture. It has become a serious problem affecting the advanced research based on hexagonal structure. In this paper, we introduce a new virtual hexagonal structure. Based on this virtual structure, a more flexible and powerful image translation and rotation are performed. The virtual hexagonal structure retains image resolution during the process of image transformations, and does not introduce distortion. Furthermore, images can be smoothly and easily transferred between the traditional square structure and the hexagonal structure. © 2006 IEEE.

Ying Chen, Jian Zhang & Jayalath, ADS 1970, 'Multiband-OFDM UWB vs IEEE802.11n: System Level Design Considerations', 2006 IEEE 63rd Vehicular Technology Conference, 2006 IEEE 63rd Vehicular Technology Conference, IEEE, IEEE, pp. 1972-1976.
View/Download from: Publisher's site

Yu, K, Hedley, M, Sharp, I & Guo, Y 1970, 'Node Positioning in Ad Hoc Wireless Sensor Networks', 2006 IEEE International Conference on Industrial Informatics, 2006 IEEE International Conference on Industrial Informatics, IEEE, pp. 641-646.
View/Download from: Publisher's site
View description>>

Locating the sensor nodes in an ad hoc wireless sensor network (WSN) is a very challenging task. In general, the network nodes are not synchronised and the internal delays within the sensor nodes may be unknown. As a result, the positioning problem can not be solved by simply using the triangulation method and certain prior information must be provided. In this paper, we consider a scenario where there are a number of nodes whose positions are known, and it is required to locate the other mobile or static sensor nodes within the radio range of each other by measuring the time of arrival (TOA) in the whole system. Two algorithms are employed, the direct method and the linear least squares (LS) estimator. The performance of the two algorithms is investigated. In particular an analytical formula is derived to estimate the performance of the LS estimator. Simulation results agree well with theoretical predictions. © 2006 IEEE.

Yuehe Ge, Esselle, KP & Bird, TS 1970, 'Compact Triple-Arm Multi-Band Monopole Antenna', IEEE International Workshop on Antenna Technology Small Antennas and Novel Metamaterials, 2006., IEEE International Workshop on Antenna Technology Small Antennas and Novel Metamaterials, 2006., IEEE, White Plains, NY, pp. 172-+.
View/Download from: Publisher's site

Zhang, H, Jia, W, He, X & Wu, Q 1970, 'A Fast Algorithm for License Plate Detection in Various Conditions', 2006 IEEE International Conference on Systems, Man and Cybernetics, 2006 IEEE International Conference on Systems, Man and Cybernetics, IEEE, Taibei, China, pp. 2420-2425.
View/Download from: Publisher's site
View description>>

This paper proposes a fast algorithm detecting license plates in various conditions. There are three main contributions in this paper. The first contribution is that we define a new vertical edge map, with which the license plate detection algorithm is extremely fast. The second contribution is that we construct a cascade classifier which is composed of two kinds of classifiers. The classifiers based on statistical features decrease the complexity of the system. They are followed by the classifiers based on Haar-features, which make it possible to detect license plate in various conditions. Our algorithm is robust to the variance of the illumination, view angle, the position, size and color of the license plates when working in complex environment. The third contribution is that we experimentally analyze the relations of the scaling factor with detection rate and processing time. On the basis of the analysis, we select the optimal scaling factor in our algorithm. In the experiments, both high detection rate (with low false positive rate) and high speed are achieved when the algorithm is used to detect license plates in various complex conditions. © 2006 IEEE.

Zhang, H, Jia, W, He, X & Wu, Q 1970, 'Real-Time License Plate Detection Under Various Conditions', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), International Conference on Ubiquitous and Intelligence Computing, Springer Berlin Heidelberg, Wuhan, China, pp. 192-199.
View/Download from: Publisher's site
View description>>

This paper proposes an algorithm for real-time license plate detection. In this algorithm, the relatively easy car plate features are adopted including the simple statistical feature and Harr-like feature. The simplicity of the object features used is very helpful to real-time processing. The classifiers based on statistical features decrease the complexity of the system. They are followed by the classifiers based on Haar-like features, which makes the final classifier invariant to the brightness, color, size and position of license plates. The experimental results obtained by the proposed algorithm exhibit the encouraging performance. © Springer-Verlag Berlin Heidelberg 2006.

Zheng, L, He, X, Wu, Q & Hintz, T 1970, 'Learning-Based Number Recognition on Spiral Architecture', 2006 9th International Conference on Control, Automation, Robotics and Vision, 2006 9th International Conference on Control, Automation, Robotics and Vision, IEEE, Grand Hyatt, Singapore, pp. 897-901.
View/Download from: Publisher's site
View description>>

In this paper, a number recognition algorithm is proposed on Spiral Architecture, a hexagonal image structure. This algorithm employs RULES-3 inductive learning method to recognize numbers. The algorithm starts from a collection of samples of numbers from number plates. Edge maps of the samples are then detected based on Spiral Architecture. A set of rules are extracted using these samples by RULES-3. The rules describe the frequencies of 9 different edge masks appearing in the samples. Each mask is a cluster of 7 hexagonal pixels. In order to recognize a number plate, all numbers are tested one by one using the extracted rules. The number recognition is achieved by counting the frequencies of the 9 masks. In this paper, a comparison between results based on rectangular structure and the results based on Spiral Architecture is given. From the experimental results, we can make the conclusion that Spiral Architecture is better than rectangular structure for inductive learning-based number recognition. © 2006 IEEE.

Zheng, L, He, X, Wu, Q & Hintz, T 1970, 'Learning-based number recognition on spiral architecture', 2006 9TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION, VOLS 1- 5, 9th International Conference on Control, Automation, Robotics and Vision, IEEE, Singapore, SINGAPORE, pp. 2148-+.

Zhou, S, Liu, R & Guo, Y 1970, 'Energy Efficient Networking Protocols for Wireless Sensor Networks', 2006 IEEE International Conference on Industrial Informatics, 2006 IEEE International Conference on Industrial Informatics, IEEE, pp. 1006-1011.
View/Download from: Publisher's site
View description>>

Energy efficiency is widely regarded as one of the major challenges for wireless sensor networks. In the literature, the issue is normally addressed from the viewpoint of a specific protocol layer or functionality, such as medium access control (MAC) or routing. In this paper, energy conservation in wireless sensor networks is treated with a holistic approach and examined across all protocol layers and functionalities including MAC, topology management, routing and sensor protocols. The advantages and disadvantages of different protocols for different layers are reviewed and discussed. Some recommendations on the employment of protocols for small, medium and large scale wireless sensor networks are presented. © 2006 IEEE.