Abolhasan, M & Wysocki, TA 2007, 'Dynamic zone topology routing protocol for MANETs', EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, vol. 18, no. 4, pp. 351-368.
View/Download from: Publisher's site
View description>>
The limited scalability of the proactive and reactive routing protocols have resulted in the introduction of new generation of routing in mobile ad hoc networks, called hybrid routing. These protocols aim to extend the scalability of such networks beyond several hundred to thousand of nodes by defining a virtual infrastructure in the network. However, many of the hybrid routing protocols proposed to date are designed to function using a common pre-programmed static zone map. Other hybrid protocols reduce flooding by grouping nodes into clusters, governed by a cluster-head, which may create performance bottlenecks or a single point of failures at each cluster-head node.We propose a new routing strategy in which zones are created dynamically, using a dynamic zone creation algorithm. Therefore, nodes are not restricted to a specific region. Additionally, nodes perform routing and data forwarding in a cooperative manner, which means that in the case failure, route recalculation is minimised. Routing overheads are also further reduced by introducing a number of GPS-based location tracking mechanisms, which reduces the route discovery area and the number of nodes queried to find the required destination.
Arya, V, Duffield, NG & Veitch, D 2007, 'Multicast inference of temporal loss characteristics', Performance Evaluation, vol. 64, no. 9-12, pp. 1169-1180.
View/Download from: Publisher's site
Chiang, F, Braun, R & Agbinya, JI 2007, 'Self-Configuration of Network Services with Biologically Inspired Learning and Adaptation', Journal of Network and Systems Management, vol. 15, no. 1, pp. 87-116.
View/Download from: Publisher's site
View description>>
This paper proposes a self-organizing scheme based on ant metaheuristics to optimize the operation of multiple classes of managed elements on an Operations Support Systems (OSSs) for mobile pervasive communications. Ant metaheuristics are characterized by learning and adaptation capabilities against dynamic environment changes and uncertainties. As an important division of swarm agent intelligence, it distinguishes itself from centralized management schemes due to its features of robustness and scalability. We have successfully applied ant metaheuristics to the network service configuration process, which is simply redefined as: the managed elements represented as graphic nodes, and ants traverse by selecting nodes with the minimum cost constraints until the eligible network elements are located along near-optimal paths-the located elements are those needed for the configuration or activation of a particular product and service. Although the configuration process is non-transparent to end users, the negotiated SLAs between users and providers affect the overall process. This proposed self-organized learning and adaptation scheme using Ant Colony Optimization (ACO) is evaluated by simulation in Java. A performance comparison is also made with a class of Genetic Algorithm known as PBIL. Finally, the simulation results show the scalability and robustness capability of autonomous ant-like agents able to adapt to dynamic networks. © Springer Science+Business Media, LLC 2007.
Chiang, F, Braun, R & Hughes, J 2007, 'A biologically‐inspired multi‐agent framework for autonomic service management', International Journal of Pervasive Computing and Communications, vol. 2, no. 3, pp. 261-276.
View/Download from: Publisher's site
View description>>
This paper describes the design of a scalable bio‐mimetic framework that addresses several key issues of autonomous agents in the functional 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 autonomic objects. These objects are called TeleService Solons (TSSs) as elements of TeleService Holons (TSHs), analoguous to individual insects as members of the whole colony. A single TSS is only able to pursue simple behaviors and interactions with local neighbors, on the contrary, a group of TSSs have the capabilitiesof fulfilling the complex tasks relating to service discovery and service activation.We simulate a service configuration process for a 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.
Du, C 2007, 'Integrating affinity propagation clustering method with linear discriminant analysis for face recognition', Optical Engineering, vol. 46, no. 11, pp. 110501-110501.
View/Download from: Publisher's site
View description>>
The Fisherface method suffers from the problem of using all training face images to recognize a test face image. To tackle this problem, we propose combining a novel clustering method, affinity propagation (AP), recently reported in the journal Science, with linear discriminant analysis (LDA) to form a new method, AP-LDA, for face recognition. By using AP, a representative face image for each subject can be obtained. Our AP-LDA method uses only these representative face images rather than all training images for recognition. Thus, it is more computationally efficient than Fisherface. Experimental results on several benchmark face databases also show that AP-LDA outperforms Fisherface in terms of recognition rate. © 2007 Society of Photo-Optical Instrumentation Engineers.
Gunes, H & Piccardi, M 2007, 'Bi-modal emotion recognition from expressive face and body gestures', JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, vol. 30, no. 4, pp. 1334-1345.
View/Download from: Publisher's site
View description>>
Psychological research findings suggest that humans rely on the combined visual channels of face and body more than any other channel when they make judgments about human communicative behavior. However, most of the existing systems...
He, S, Wang, H, Jia, W, Wu, Q, Hur, N, Kim, J & Hintz, TB 2007, 'Uniform Image Partitioning for Fractal Compression on Virtual Hexagonal Structure', International Journal of Information and Systems Science, vol. 3, no. 3, pp. 492-509.
View description>>
Hexagonal structure is different from the traditional square structure for image representation. The geometrical arrangement of pixels on hexag-onal structure can be described in terms of a hexagonal grid. Uniformly sepa-rating image into seven similar copies with a smaller scale has commonly been used for parallel and accurate image processing including image compression 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 uni-form image separation are presented. The virtual hexagonal structure retains image resolution during the process of image separation, and does not intro-duce 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. As an application of image partitioning, we present a Fractal Image Compression (FIC) method on the virtual image struc- ture by adopting Fisher's basic FIC method on the traditional square image structure. The modifcation on the definition of range block and domain block is implemented in order to utilize the enhanced image structure. The results of the FIC approach applied to testing images are analyzed and show higher fidelity.
Henderson-Sellers, B & Qumer, A 2007, 'Using method engineering to make a traditional environment agile', Cutter IT Journal, vol. 20, no. 5, pp. 30-37.
Izquierdo, E 2007, 'Editorial: Knowledge Engineering, Semantics, and Signal Processing in Audio–Visual Information Retrieval', IEEE Transactions on Circuits and Systems for Video Technology, vol. 17, no. 3, pp. 257-260.
View/Download from: Publisher's site
Jia, W, Zhang, H & He, X 2007, 'Region-based license plate detection', Journal of Network and Computer Applications, vol. 30, no. 4, pp. 1324-1333.
View/Download from: Publisher's site
View description>>
Automatic license plate recognition (ALPR) is one of the most important aspects of applying computer techniques towards intelligent transportation systems. In order to recognize a license plate efficiently, however, the location of the license plate, in most cases, must be detected in the first place. Due to this reason, detecting the accurate location of a license plate from a vehicle image is considered to be the most crucial step of an ALPR system, which greatly affects the recognition rate and speed of the whole system. In this paper, a region-based license plate detection method is proposed. In this method, firstly, mean shift is used to filter and segment a color vehicle image in order to get candidate regions. These candidate regions are then analyzed and classified in order to decide whether a candidate region contains a license plate. Unlike other existing license plate detection methods, the proposed method focuses on regions, which demonstrates to be more robust to interference characters and more accurate when compared with other methods. © 2006 Elsevier Ltd. All rights reserved.
Li, Y, Sharp, I, Hedley, M, Ho, P & Guo, Y 2007, 'Single- and double-difference algorithms for position and time-delay calibration of transducer-elements in a sparse array', IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control, vol. 54, no. 6, pp. 1188-1198.
View/Download from: Publisher's site
View description>>
A method for the calibration of the position and time delay of transducer elements in a large, sparse array used for underwater, high-resolution, ultrasound imaging has been described in a previous work. This algorithm is based on the direct algorithm used in the global positioning system (GPS), but the wave propagation speed is treated as one of the to-be-calibrated parameters. In this article, the performance of two other commonly used GPS algorithms, namely the single-difference algorithm and the double-difference algorithm, is evaluated. The calibration of the propagation speed also is integrated into these two algorithms. Furthermore, a novel, least-squares method is proposed to calibrate the time delay associated with each transducer element for these two algorithms. The performances of these algorithms are theoretically analyzed and evaluated using numerical analysis and simulation study. The performance of the direct algorithm, the single-difference algorithm, and the double-difference algorithm is compared. It was found that the single-difference algorithm has the best performance among the three algorithms for the current application, and it is capable of calibrating the position and time delay of transducer elements to an accuracy of one-tenth of a wavelength.
Liu, RP, Rogers, G, Zhou, S & Zic, J 2007, 'Topology control with Hexagonal Tessellation', International Journal of Sensor Networks, vol. 2, no. 1/2, pp. 91-91.
View/Download from: Publisher's site
View description>>
Geographic Adaptive Fidelity (GAF) is an important topology control approach in Wireless Sensor Networks. It extends the system lifetime by exploiting node redundancy However, the properties of the square grid in GAF have not been fully studied. This pape shows that there exists an unreachable corner in the GAF grid architecture. Using an analytica model, we are able to calculate the unreachable probability and analyse its impacts on dat delivery. We propose to replace the square grid of GAF with Hexagonal Tessellation (GAF-h) We then proceed to prove that GAF-h is able to achieve zero loss with little extra cost when compared to the original scheme. A node association algorithm is also proposed for efficien implementation. This algorithm is proved to integrate with the original GAF protocol with little computing overhead. © 2007 Inderscience Enterprises Ltd.
Lu, S, Zhang, J & Dagan Feng, D 2007, 'Detecting unattended packages through human activity recognition and object association', Pattern Recognition, vol. 40, no. 8, pp. 2173-2184.
View/Download from: Publisher's site
View description>>
This paper provides a novel approach to detect unattended packages in public venues. Different from previous works on this topic which are mostly limited to detecting static objects where no human is nearby, we provide a solution which can detect an unat
Machiraju, S, Veitch, D, Baccelli, F & Bolot, JC 2007, 'Adding definition to active probing', ACM SIGCOMM Computer Communication Review, vol. 37, no. 2, pp. 17-28.
View/Download from: Publisher's site
View description>>
Active probing techniques have overwhelmingly been based on a few key heuristics. To progress to the next level a more powerful approach is needed, which is capable of filtering noise effectively, designing (and defining) optimal probing strategies, and understanding fundamental limitations. We provide a probabilistic, queueing-theoretic treatment that contributes to this program in the single hop case. We provide an exact inversion method for cross traffic distributions, rigorous system identifiability results to help determine what active probing can and can't achieve, a new approach for treating queueing theoretic 'noise' based on conditioning, and cross traffic estimators with enhanced properties
Madden, C, Cheng, ED & Piccardi, M 2007, 'Tracking people across disjoint camera views by an illumination-tolerant appearance representation', Machine Vision and Applications, vol. 18, no. 3-4, pp. 233-247.
View/Download from: Publisher's site
View description>>
Tracking single individuals as they move across disjoint camera views is a challenging task since their appearance may vary significantly between views. Major changes in appearance are due to different and varying illumination conditions and the deformable geometry of people. These effects are hard to estimate and take into account in real-life applications. Thus, in this paper we propose an illumination-tolerant appearance representation, which is capable of coping with the typical illumination changes occurring in surveillance scenarios. The appearance representation is based on an online k-means colour clustering algorithm, a data-adaptive intensity transformation and the incremental use of frames. A similarity measurement is also introduced to compare the appearance representations of any two arbitrary individuals. Post-matching integration of the matching decision along the individuals' tracks is performed in order to improve reliability and robustness of matching. Once matching is provided for any two views of a single individual, its tracking across disjoint cameras derives straightforwardly. Experimental results presented in this paper from a real surveillance camera network show the effectiveness of the proposed method. © Springer-Verlag 2007.
Roughan, M & Veitch, D 2007, 'Some remarks on unexpected scaling exponents', ACM SIGCOMM Computer Communication Review, vol. 37, no. 5, pp. 71-74.
View/Download from: Publisher's site
Wang, S, Dash, M, Chia, L-T & Xu, M 2007, 'Efficient sampling of training set in large and noisy multimedia data', ACM Transactions on Multimedia Computing, Communications, and Applications, vol. 3, no. 3, pp. 14-14.
View/Download from: Publisher's site
View description>>
As the amount of multimedia data is increasing day-by-day thanks to less expensive storage devices and increasing numbers of information sources, machine learning algorithms are faced with large-sized and noisy datasets. Fortunately, the use of a good sampling set for training influences the final results significantly. But using a simple random sample (SRS) may not obtain satisfactory results because such a sample may not adequately represent the large and noisy dataset due to its blind approach in selecting samples. The difficulty is particularly apparent for huge datasets where, due to memory constraints, only very small sample sizes are used. This is typically the case for multimedia applications, where data size is usually very large. In this article we propose a new and efficient method to sample of large and noisy multimedia data. The proposed method is based on a simple distance measure that compares the histograms of the sample set and the whole set in order to estimate the representativeness of the sample. The proposed method deals with noise in an elegant manner which SRS and other methods are not able to deal with. We experiment on image and audio datasets. Comparison with SRS and other methods shows that the proposed method is vastly superior in terms of sample representativeness, particularly for small sample sizes although time-wise it is comparable to SRS, the least expensive method in terms of time.
Weily, AR, Esselle, KP, Bird, TS & Sanders, BC 2007, 'Dual resonator 1-D EBG antenna with slot array feed for improved radiation bandwidth', IET MICROWAVES ANTENNAS & PROPAGATION, vol. 1, no. 1, pp. 198-203.
View/Download from: Publisher's site
Weily, AR, Esselle, KP, Bird, TS & Sanders, BC 2007, 'Dual resonator 1-D EBG antenna with slot array feed for improved radiation bandwidth', IET Microwaves, Antennas & Propagation, vol. 1, no. 1, pp. 198-198.
View/Download from: Publisher's site
View description>>
A one-dimensional (1-D) electromagnetic bandgap (EBG) resonator antenna with both high gain and wide radiation bandwidth is described. The use of dual resonators in combination with an array of sources leads to a dramatic increase in the radiation bandwidth of the antenna. The effect of the dual resonators is to increase the bandwidth over which the EBG material acts as a spatial filter, while the array feed increases both the directivity and radiation bandwidth. Theoretical results for a prototype designed to operate at Ku-band are presented and shown to be in good agreement with measured results. The effect of increasing the number of array elements on directivity and radiation bandwidth is examined, and the improvements of the proposed configuration compared with a classical 1-D EBG resonator antenna with single source is presented. © 2007 The Institution of Engineering and Technology.
Zhang, H, Jia, W, He, X & Wu, Q 2007, 'Learning-based license plate detection in vehicle image database', International Journal of Intelligent Information and Database Systems, vol. 1, no. 2, pp. 228-228.
View/Download from: Publisher's site
View description>>
This paper proposes a learning-based algorithm to detect license plates of vehicles from vehicle image database. There are three main contributions in this paper. The first contribution is to define a novel vertical edge map, which makes the image processing more effectively. The second contribution is to propose a learning-based cascade classifier composing of two kinds of sub-classifiers, which makes the system very robust. The third contribution is to experimentally estimate the parameter of scaling factor and chose an optimal one for the algorithm to seek a good balance between detection rate and processing time. © 2007 Inderscience Enterprises Ltd.
Abolhasan, M, Wang, JC-P & Franklin, DR 1970, 'On Indoor Multi-hopping capacity of Wireless Ad-Hoc Mesh Networks.', MASS, MASS 2007, IEEE Computer Society, Pisa, Italy, pp. 1-6.
View/Download from: Publisher's site
View description>>
The capacity and multi-hopping performance of ad hoc mesh networks in dynamic environment still remains an open research issue. Previous theoretical studies suggest that they do not scale in densely distributed networks. However, a study has shown that scalability and hence the multi- hopping capacity of mesh network is not only bound by the number of nodes in the network but also the number of hops [3]. In this paper we investigate the performance of multi- hop ad hoc mesh networks, using both simulation studies and an experimental test-bed, and monitor the performance of the network as the number of hops in the network increases. Our results show that the drop in performance in multi-hopping is much more significant when the traffic levels are high. Furthermore our test-bed study shows that ad hoc mesh networks can maintain high levels of packet delivery and throughput when traffic levels are low, however, the delay experienced continues to increase after each hop.
Abolhasan, M, Wang, JC-P, Franklin, DR & IEEE 1970, 'On indoor multi-hopping capacity of wireless ad-hoc mesh networks', 2007 IEEE INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR SYSTEMS, VOLS 1-3, IEEE International Conference on Mobile Adhoc and Sensor Systems, IEEE, Pisa, ITALY, pp. 917-922.
Agbinya, JI, Reisenfeld, S, Malaney, R, Dutkiewicz, E, Challa, S, Al-Jumaily, A, Ahmed, AA, Lal, S, Braun, R, Chaczko, Z, Sevimli, O, Sithamparanathan, K & Manteuffel, D 1970, 'General Organising Committee', The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), IEEE.
View/Download from: Publisher's site
Ahmad, MR, Dutkiewicz, E & Xiaojing Huang 1970, 'BER-delay characteristics analysis of IEEE 802.15.4 wireless sensor networks with cooperative MIMO', 2007 Asia-Pacific Conference on Applied Electromagnetics, 2007 Asia-Pacific Conference on Applied Electromagnetics (APACE), IEEE.
View/Download from: Publisher's site
View description>>
This paper presents a study of the impact of transmission delay differences between co-operating nodes on bit error rate performance and energy consumption of wireless sensor networks. We consider a wireless sensor network using an Alamouti virtual MIMO (multiple-input multiple-output) configuration between collaborating nodes operating in quasi-static Rayleigh flat-fading channels. Our results show that above certain delay difference (in the range above 0.75Tb), the traditional non-cooperative approach is more energy-efficient than the cooperative strategy and that the transmission delay difference has the most significant on the transmission energy consumption in the delay range of below 0.75Tb. © 2007 IEEE.
Al-Obaisat, Y & Braun, R 1970, 'A Multi-Agent Flexible Architecture for Autonomic Services and Network Management', 2007 IEEE/ACS International Conference on Computer Systems and Applications, 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA '07, IEEE, Amman, JORDAN, pp. 124-+.
View/Download from: Publisher's site
Al-Obasiat, Y & Braun, R 1970, 'A Multi-Agent Flexible Architecture for Autonomic Services and Network Management', 2007 IEEE/ACS International Conference on Computer Systems and Applications, 2007 IEEE/ACS International Conference on Computer Systems and Applications, IEEE, Amman, JORDAN, pp. 132-+.
View/Download from: Publisher's site
Baccelli, F, Machiraju, S, Veitch, D & Bolot, JC 1970, 'On optimal probing for delay and loss measurement', Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, IMC07: Internet Measurement Conference, ACM, ACM, pp. 291-302.
View/Download from: Publisher's site
Chaczko, Z, Chiang, F & Braun, R 1970, 'Active MIB: Addressing Challenges of Wireless Mesh Networks', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), International Conference on Computer Aided Systems Theory, Springer Berlin Heidelberg, Las Palmas de Gran Canaria, Spain, pp. 1199-1207.
View/Download from: Publisher's site
View description>>
There is a list of very much needed object-oriented and autonomous paradigms that are currently absent from traditional implementations of MIBs in telecommunication systems. We argue that some of autonomous features can be inherent in an application otf an Active MIB mechanism itself, and thus this type of application would be a more appropriate substrate in which to model, develop and integrate the benefits brought by the object-oriented approach. In our work, we claim that active networks are such an application area, in which the object-oriented and autonomous system ideas can be successfully applied. The objective of this research paper is to demonstrate applicability and compatibility of the AMIB concept with functional and architectural requirements of wireless mesh networks. This paper introduces new approaches for using AMIB-based mechanisms in telecommunication networks as well as discusses autonomic processes and algorithms that can be used to manage such networks. © Springer-Verlag Berlin Heidelberg 2007.
Chaczko, Z, Klempous, R, Nikodem, J & Nikodem, M 1970, 'Methods of Sensors Localization in Wireless Sensor Networks', 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07), 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07), IEEE, pp. 145-152.
View/Download from: Publisher's site
View description>>
In recent years there has been a growing interest in wireless sensor networks (WSN) applications. Such sensor networks can be used to control temperature, humidity, contamination, pollution etc. Self-organization and routing algorithms dedicated to wireless sensor networks usually assume that sensors absolute positions are unknown and all decisions are based on sensor's own local information. This assumption makes wireless sensor networks more flexible and energy conserve because making decisions locally is faster and energy efficient. But sooner or later sensors positions have to be found (when sensor sends a message about some event we of course would like to know where this event takes place). In this paper we describe different solutions of finding transceivers positions in wireless networks and we discuss localization in wireless sensor networks. We propose to transfer localization function from base stations to every sensor. We evaluate presented method using simulations. © 2007 IEEE.
Chen, Y, Wu, Q & He, X 1970, 'Study on human behaviour retrieval', Proceedings of the 2007 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2007, International Conference on Image Processing, Computer Vision and Pattern Recognition, CSREA Press, Las Vegas, pp. 448-454.
View description>>
Human behavior analysis is a hot topic in computer vision and is applied widely in many applications. Human behavior retrieval is another frontier technology in the area of multimedia information retrieval, which is related to human behavior analysis but holds several differences because of its special application purpose. Human behaviour retrieval to some extent is similar to human behaviour analysis, but the technology used for human behavior analysis cannot be used for human behavior directly. This paper will address such kind of differences and review several technologies including video retrieval, feature extraction, similarity measure and human behavior analysis. This paper will also address the importance of human behaviour retrieval. The ideas unveiled by this paper will benefit the research community and indicate a direction of human behavior retrieval research.
Chen, Y, Wu, Q, He, S, Jia, W & Hintz, TB 1970, 'Pixel Structure Based on Hausdorff Distance for Human Detection in Outdoor Environments', Digital Image Computing Techniques and Applications, Digital Image Computing Techniques and Applications, IEEE Computer Society, Glenelg, Australia, pp. 67-72.
View/Download from: Publisher's site
View description>>
This paper proposes a novel method for human detection from static images based on pixel structure of input images. In training stage, all sample images consisting of human images and non-human images are used to construct a Hausdorff distance map based on statistically analyzing the difference between the different blocks on each original image. A projection matrix will be created with Linear Discriminant Method (LDM) based on the Hausdorff distance map. This projection matrix will be used to transform multidimensional feature vectors (distance maps of testing images) into a feature in a one-dimensional domain. The decision will be made on the simple one dimensional feature domain according to a precalculated threshold to distinguish human figures from non-human figures. In comparison with the common method based on Mahalanobis distance maps, the proposed method based on Hausdorff distance maps performs much better. Encouraging experimental results have been obtained using 800 human images and 800 non-human images.
Chen, Y, Wu, Q, He, X, Jia, W & Hintz, T 1970, 'Pixel Structure Based on Hausdorff Distance for Human Detection in Outdoor Environments', 9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007), 9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007), IEEE, pp. 67-72.
View/Download from: Publisher's site
View description>>
This paper proposes a novel method for human detection from static images based on pixel structure of input images. In training stage, all sample images consisting of human images and non-human images are used to construct a Hausdorff distance map based on statistically analyzing the difference between the different blocks on each original image. A projection matrix will be created with Linear Discriminant Method (LDM) based on the Hausdorff distance map. This projection matrix will be used to transform multi-dimensional feature vectors (distance maps of testing images) into a feature in a one-dimensional domain. The decision will be made on the simple one-dimensional feature domain according to a precalculated threshold to distinguish human figures from non-human figures. In comparison with the common method based on Mahalanobis distance maps, the proposed method based on Hausdorff distance maps performs much better. Encouraging experimental results have been obtained using 800 human images and 800 non-human images. © 2007 IEEE.
Chiang, F & Braun, R 1970, 'Self-adaptability and Vulnerability Assessment of Secure Autonomic Communication Networks', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Asia-Pacific Network Operations and Management Symposium, Springer Berlin Heidelberg, Sapporo, Japan, pp. 112-122.
View/Download from: Publisher's site
View description>>
Risk and Vulnerability Analysis (RVA) aims at identifying the weaknesses of the networks that may be exploited to compromise the normal functions, such as service deployment, file system access permissions, applications activations and so on. Autonomic Communication Networks (ACNs) are recently proposed as business-objective driven high-level self-managed telecommunication networks with the adaptation capability to cope with increasing dynamics. Adaptation capability termed as adaptability becomes the premise of realizing thorough autonomy. As a theoretic foundation, we firstly propose an innovative Object-oriented Management Information Base (O:MIB). Secondly, a new information-theoretic security awareness strategy inspired from human immune system is proposed to reconfigure file access right, which has a direct relation with adaptability. The experimental results validate this methodology and find out a statistical bound for operators to set a vulnerability level of warning in practice. © Springer-Verlag Berlin Heidelberg 2007.
Chiang, F & Braun, R 1970, 'Towards a Management Paradigm with a Constrained Benchmark for Autonomic Communications', Computational Intelligence and Security: International Conference - CIS 06, International Conference on Computational Intelligence and Security, Springer Berlin Heidelberg, Guangzhou, China, pp. 250-258.
View/Download from: Publisher's site
View description>>
This paper describes a management paradigm to give effect to autonomic activation, monitoring and control of services or products in the future converged telecommunications networks. It suggests an architecture that places the various management functions into a structure that can then be used to select those functions which may yield to autonomic management, as well as guiding the design of the algorithms. The validation of this architecture, with particular focus on service configuration, is done via a genetic algorithm -- Population Based Incremental Learning (PBIL). Even with this centralized adaptation strategy, the simulation results show that the proposed architecture and benchmark can be applied to this constrained benchmark, produces effective convergence performance in terms of finding nearly optimal configurations under multiple constraints.
Chiang, F, Agbinya, J & Braun, R 1970, 'Risk and Vulnerability Assessment of Secure Autonomic Communication Networks', The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), IEEE, Sydney, Australia, pp. 40-45.
View/Download from: Publisher's site
View description>>
Risk and Vulnerability Analysis (RVA) aims at identifying the weaknesses of the networks that may be exploited to compromise the normal functions, such as service deployment, file system access permissions, applications activations and so on. Autonomic Communication Networks (ACNs) are recently proposed as business-objective driven high-level self-managed telecommunication networks with the adaptation capability to cope with increasing dynamics. Adaptation capability termed as adaptability becomes the premise of realizing thorough autonomy. As a theoretic foundation, we firstly propose an innovative Object-oriented Management Information Base (O:MIB). Secondly, a new information-theoretic security awareness strategy inspired from human immune system is proposed to reconfigure file access right, which has a direct relation with adaptability. The experimental results validate this methodology and find out a statistical bound for operators to set a vulnerability level of warning in practice. © 2007 IEEE.
Chiang, F, Fernandez, H, Braun, R & Agbinya, J 1970, 'Integrating object-oriented O:XML semantics into autonomic decentralised functionalities', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, Darling Harbour, Sydney, pp. 768-773.
View/Download from: Publisher's site
View description>>
Autonomic Communications have attracted huge attention recently for telecommunication network management in the European Network Research Community. The aim of this research is to propose an Object- oriented hybrid O:MIB structure to replace current MIB architecture and establish a way of enabling O:XML technology into autonomic communications more efficiently with such abilities as autonomy, scalability, adaptation as well as simplicity for autonomic management application in complex networks. This paper presents an experiment that evaluates the performances of O:MIBs in terms of the loss rate, link utilization, management polling with regards to the congestion avoidance process. Simulation results show that O:MIBs provide compatibility with existing MIBs and proved to be an efficient extension over traditional SNMP MIB approach in a view that the workload of manager is greatly reduced. Ve conclude this end- to- end approach maintains self- managing capability, easy- to- implement scalability involving heterogeneous smart algorithms for variant tasks. © 2007 IEEE.
Conder, P, Gao, J, Abolhasan, M & IEEE 1970, 'Distributed MIMO systems using Asterism decoding', 2007 INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES, VOLS 1-3, International Symposium on Communications and Information Technologies, IEEE, Sydney, Australia, pp. 269-272.
View/Download from: Publisher's site
View description>>
Multiple Input Multiple Output (MIMO) systems have received enormous attention by researchers as they can provide a roughly linear increase in capacity of wireless communications systems by using multiple transmit and receive antennas. Even with the larger raw data rates provided by MIMO, the throughput of these systems can be limited by the number of users (or networks) sharing the medium. This paper shows how multiple users (or networks) transmitting simultaneously can be represented as a MIMO system with a lager number of transmit than receive antennas. After reviewing existing decoders for such a MIMO system, this paper then proposes applying an Asterism based decoder to distinguish between multiple users transmitting simultaneously. This produces a new multi-user access scheme that can be applied in addition to a primary access method, such as CSMA-CA.
Du, C, Yang, J, Wu, Z, Yuan, Q & Wu, Q 1970, 'Improved neural network based manifold learning method for face recognition with less face images per individual', Proceedings of the 2007 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2007, pp. 444-447.
View description>>
In this paper, a novel neural network based manifold learning method(NNBML)[1] recently appeared in the Journal of Science is introduced. It can effectively convert high-dimensional data into low-dimensional codes, which are then used for classification. However, it performs not well while dealing with small size face database used for face recognition. We propose a solution generating more samples data based on the existing data. The proposed method is implemented on two well-known face databases, viz. ORL and Yale face databases. The experimental results show that NNBML is able to deal with the task of face recognition after more data samples generated using the proposed method, and also that NNBML outperforms LDA in terms of recognition rate.
Eissa, MM, Chaczko, Z & Alrahali, E 1970, 'Interactive Protection System for Operator Training Simulator Using New Wavelet Techniques', The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), IEEE, Sydney, Australia, pp. 11-18.
View/Download from: Publisher's site
View description>>
An increase in complexity of relays and power systems makes the relay settings and the process of coordination quite difficult. The changes of operating conditions in power systems also adversely affect the installed relays. There is a strong requirement to avoid protection relay maloperation and to ensure continuing optimal relay coordination and operation. It is rather difficult to determine which of the protective relays will operate as specified or whether the coordination of the relays is maintained due to complexity of the system. This paper introduces a reliable and secure interactive framework system for investigation, calculation of relay settings and relay coordination using wavelet based techniques. The interactive system allows an engineer in the control room to assign the location, the type of fault and the relay data set pattern; then the operating time of the protective devices is generated. The system framework introduces a dynamic, interactive transient of the relay models for the power system.
Gandia Sanchez, R, Xiaojing Huang & Kwan-Wu Chin 1970, 'Viability of concurrent transmission and reception for UWB radios over multipath channels', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, Sydney, AUSTRALIA, pp. 1241-1246.
View/Download from: Publisher's site
Gao, J & Xu, RY 1970, 'Mixture of the Robust L1 Distributions and Its Applications', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Berlin Heidelberg, pp. 26-35.
View/Download from: Publisher's site
View description>>
Recently a robust probabilistic L1-PCA model was introduced in [1] by replacing the conventional Gaussian noise model with the Laplacian L1 model. Due to the heavy tail characteristics of the L1 distribution, the proposed model is more robust against data outliers. In this paper, we generalized the L1-PCA into a mixture of L1-distributions so that the model can be used for possible multiclustering data. For the model learning we use the property that the L1 density can be expanded as a superposition of infinite number of Gaussian densities to include a tractable Bayesian learning and inference based on the variational EM-type algorithm. © Springer-Verlag Berlin Heidelberg 2007.
Ge, Y, Esselle, KP & Bird, TS 1970, 'Wideband Stacked Dielectric Resonator Antennas', 2007 International workshop on Antenna Technology: Small and Smart Antennas Metamaterials and Applications, 2007 International workshop on Antenna Technology: Small and Smart Antennas Metamaterials and Applications, IEEE, Cambridge, ENGLAND, pp. 303-306.
View/Download from: Publisher's site
Geng, X, Wang, L, Li, M, Wu, Q & Smith-Miles, K 1970, 'Distance-driven Fusion of Gait and Face for Human Identification in Video', Proceedings of Image and Vision Computing New Zealand 2007, Image and Vision Computing Conference, Image and Vision Computing New Zealand, Hamilton, New Zealand, pp. 19-24.
Gill, AQ & Henderson-Sellers, B 1970, 'Six aspects of an agile software development methodology', Online Proceedings of the European and Mediterranean Conference on Information Systems (EMCIS) 2007, European, Mediterranean and Middle Eastern Conference on Information Systems, Polytechnic university of Valencia, Valencia, spain, pp. 1-11.
View description>>
A shared vision of an agile methodology can play a vital role in adaptive agile software development environments as the absence of a shared or common vision is one of the main factors of software project failures. This paper presents six aspects of an agile software development methodology: agility, abstraction, process, people, product and tools. This set of aspects is an attempt to provide a guiding vision or mental-model for an agile methodology. The purpose of this paper is to explicitly describe in detail these aspects that are part of our agile software solution framework (ASSF). These six aspects can be combined to generate various situation-specific configurations of agile methodologies by using a method engineering approach.
Gill, AQ, Henderson-Sellers, B & McBride, TM 1970, 'Agile adoption and improvement model', Online Proceedings of the European and Mediterranean Conference on Information Systems (EMCIS) 2007, European, Mediterranean and Middle Eastern Conference on Information Systems, Polytechnic University of Valencia, Valencia, Spain, pp. 1-9.
View description>>
Agile software development methods focus on the rapid and iterative delivery of a software product in small increments. Over the last decade, the software industry has shown a substantial interest in agile practices but there is no standard guiding vision model or framework to adopt and then use to assess or improve the agile method in a software development organization; indeed, the absence of a guiding vision model could result in the failure of the agile implementation. The purpose of this paper is to present an Agile Adoption and Improvement Model (AAIM) for the adoption, assessment and improvement of an agile software development process. We have analysed the results of several agile software process assessments, industrial case studies on the adoption of an agile approach and feedback from both researchers and the software industry for the construction of the AAIM. The AAIM can be used as a gradual road map for the adoption of an agile approach so that the required agile level can be achieved and improved over a period of time. The AAIM has been organized in three agile blocks, six agile stages (AS) and an embedded agility measurement model (to quantitatively measure the degree of agility). In AAIM, each stage specifies goals that must be achieved to attain a particular business value through the use of an agile software development approach.
He, S, Zhang, H, Jia, W, Wu, Q & Hintz, TB 1970, 'Combining Global and Local Features for Detection of License Plates in Video', Proceedings of Image and Vision Computing New Zealand 2007, Image and Vision Computing Conference, Image and Vision Computing New Zealand, Hamilton, New Zealand, pp. 288-293.
He, X, Hintz, T, Li, J, Zhang, H, Wu, Q & Jia, W 1970, 'Local binary pattern on hexagonal structure for face matching', Proceedings of the 2007 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2007, International Conference on Image Processing, Computer Vision and Pattern Recognition, CSREA Press, Las Vegas, USA, pp. 455-460.
View description>>
Principal Components Analysis (PCA), Independent Component Analysis (ICA) and Linear Discriminant Analysis (LDA), have been widely used for 2D face recognition. Local Binary Pattern (LBP), however, provides a simpler and more effective way to represent faces. With LBP, face image is divided into small regions from which LBP histograms are extracted and concatenated into a single and global feature histogram representing the face image. The recognition is performed using Chi square and other commonly used dissimilarity measures. In this paper, we construct LBP codes together with three dissimilarity measures on hexagonal structure. We show that LBPs defined on hexagonal structure will lead to a faster and more accurate scheme for face recognition.
He, X, Jia, W, Li, J, Wu, Q & Hintz, T 1970, 'An Approach to Edge Detection on a Virtual Hexagonal Structure', 9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007), 9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007), IEEE, Glenelg, Australia, pp. 340-345.
View/Download from: Publisher's site
View description>>
Hexagonal structure is another image structure alternative to traditional square image structure for image processing and computer vision. The geometrical arrangement of pixels on a hexagonal structure can be described as a collection of hexagonal pixels. Because all the existing hardware for capturing image and for displaying image are produced based on square structure, it becomes important to find a proper software approach to mimic hexagonal structure so that images represented on the traditional square structure can be smoothly converted from or to the images on hexagonal structure. For accurate image processing, it is critical to best maintain the image resolution during the image conversion. In this paper, a bilinear interpolation algorithm that is used to convert an image from square structure to hexagonal structure is presented. Based on this, an edge detection method is proposed. Our experimental results show that the bilinear interpolation improves the edge detection accuracy. © 2007 IEEE.
He, X, Jia, W, Wu, Q & Hintz, T 1970, 'Advances in Grid and Pervasive Computing', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), International Conference on Grid and Pervasive Computing, Springer Berlin Heidelberg, Paris, France, pp. 751-756.
View/Download from: Publisher's site
View description>>
This paper presents an edge detection method based on bilateral filtering taking into account both spatial closeness and intensity similarity of pixels 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. We also present a parallel implementation for edge detection on the virtual hexagonal structure that significantly increases the computation speed. © Springer-Verlag Berlin Heidelberg 2007.
He, X, Li, J, Chen, Y, Wu, Q & Jia, W 1970, 'Local Binary Patterns for Human Detection on Hexagonal Structure', Ninth IEEE International Symposium on Multimedia (ISM 2007), Ninth IEEE International Symposium on Multimedia (ISM 2007), IEEE, Taichung, Taiwan, pp. 65-71.
View/Download from: Publisher's site
View description>>
Local Binary Pattern (LBP) was designed and has been widely used for efficient texture classification. LBP provides a simple and effective way to represent texture patterns. Uniform LBPs play an important role for LBP-based pattern/object recognition as they include majority of LBPs. On the other hand, Human detection based on Mahalanobis Distance Map (MDM) recognizes appearance of human based on geometrical structure. Each MDM shows a clear texture pattern that can be classified using LBPs. In this paper, we compute LBPs of MDMs on a hexagonal structure. The circular pixel arrangement in hexagonal structure results in higher accuracy for LBP representation than on square structure. Chi-square as a measure is used for human detection based on uniform LBPs obtained. We show that our method using LBPs built on MDMs has a higher human detection rate and a lower false positive rate compared to the method merely based on MDMs. We will also show using experimental results that LBPs on hexagonal structure lead to more robust human classification.
He, X, Li, J, Chen, Y, Wu, Q & Jia, W 1970, 'Local binary patterns for human detection on hexagonal structure', Proceedings - 9th IEEE International Symposium on Multimedia, ISM 2007, pp. 65-71.
View/Download from: Publisher's site
View description>>
Local Binary Pattern (LBP) was designed and has been widely used for efficient texture classification. LBP provides a simple and effective way to represent texture patterns. Uniform LBPs play an important role for LBP-based pattern/object recognition as they include majority of LBPs. On the other hand, Human detection based on Mahalanobis Distance Map (MDM) recognizes appearance of human based on geometrical structure. Each MDM shows a clear texture pattern that can be classified using LBPs. In this paper, we compute LBPs of MDMs on a hexagonal structure. The circular pixel arrangement in hexagonal structure results in higher accuracy for LBP representation than on square structure. Chi-square as a measure is used for human detection based on uniform LBPs obtained. We show that our method using LBPs built on MDMs has a higher human detection rate and a lower false positive rate compared to the method merely based on MDMs. We will also show using experimental results that LBPs on hexagonal structure lead to more robust human classification. © 2007 IEEE.
He, X, Li, J, Jia, W, Wu, Q & Hintz, T 1970, 'Local Binary Patterns on Hexagonal Image Structure', 7th IEEE International Conference on Computer and Information Technology (CIT 2007), 7th IEEE International Conference on Computer and Information Technology (CIT 2007), IEEE, Aizu-Wakamatsu City, Fukushima, Japan, pp. 639-644.
View/Download from: Publisher's site
View description>>
Local binary pattern (LBP) was designed and widely used for efficient texture classification. It has been used for face recognition and has potential applications in many other research areas such as human detection. LBP provides a simple and effective way to represent patterns. Uniform LBPs play an important role for LBP-based pattern /object recognition as they include majority of LBPs. In this paper, we present LBP codes on hexagonal image structure. We show that LBPs defined on hexagonal structure have higher percentages of uniform LBPs that will lead to a more efficient and accurate recognition scheme for image classification.
He, X, Wu, Q, Zhang, H & Hintz, T 1970, 'A trend for face recognition', Fourth International Conference on Information Technology and Applications, ICITA 2007, International Conference on Information Technology and Applications, Macquarie Scientific Publishing, Harbin, China, pp. 254-257.
View description>>
Face recognition has many applications in law enforcement, crowd surveillance, security access control and human computer interaction. However, the applications have been, greatly constrained by the limitations of the currently available recognition tools because these tools are either too slow, sensitive to pose, illumination and facial expression, or too expensive, and hence are impractical. Face recognition is difficult and still has a long way to go before it really becomes practical. The aim of this paper is to present how a system for real-time, robust and inexpensive face recognition may be approached. The system contains the following components: Low cost CCTV video cameras or simple digital, cameras to quickly locate faces on 2D face images captured. A constructor of 3D face images using the captured 2D images. Algorithms that accurately match the constructed 3D face images to the 2D face images preciously existing in a gallery in real-time for pose and illumination invariant face recognition.
Henderson-Sellers, B, Serour, MK, Gonzalez-Perez, C & Qumer, A 1970, 'Improving agile software development by the application of method engineering practices', PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, IASTED International Conference on Software Engineering, ACTA Press, Innsbruck, Austria, pp. 55-60.
View description>>
Despite the vast attention and wide acceptance of the newly engineered agile methods for software development, those methods are seldom linked to the goals of software process improvement (SPI), an approach that aims to provide support for significant improvement of both the quality of those methods as well as the resultant software products. In this paper, we propose an extension to agile methods by adding extra characteristics in order for agile methods to better support SPI. We explain how agile methods can gain those extra attributes through the application of a method engineering approach along with our new tool (4-DAT) that assists method engineers and managers in selecting the most appropriate method fragments for their needed agile methods. Finally, we summarize a number of industrial case studies carried out over several years in order to test and improve the efficiency of our theory of adding SPI to an agile methodological approach.
Jay Guo, Y 1970, 'Cover', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE.
View/Download from: Publisher's site
Jia, W & Tien, D 1970, 'Discovering local cooccurring patterns from aerial images', Fourth International Conference on Information Technology and Applications, ICITA 2007, International Conference on Information Technology and Applications, Macquarie Scientific Publishing, Sydney, Australia, Harbin, China, pp. 300-305.
View description>>
Developing a spatial searching engine to enhance the search capabilities of large spatial repositories for GIS update has attracted more and more attention. Existing methods are usually designed to extract limited types of objects and use only one aspect of features of Images. In this paper, we propose to use the local cooccurring patterns to disclose the cooccurring relationships among each dominant local features and use this local cooccurring patterns to recognize an object from aerial images. For this purpose, we investigate three types of local features: colour-based features, texture-based features, and edgebased shape features. In order to facilitate the feature extraction procedure, we first use discontinuity-preserving smoothing methods to filter the input image. Two popular smoothing techniques are tested and compared. Experimental results are presented in this paper.
Jia, W, He, S, Zhang, H & Wu, Q 1970, 'Combining Edge and Colour Information for Number Plate Detection', Proceedings of Image and Vision Computing New Zealand 2007, Image and Vision Computing Conference, Image and Vision Computing New Zealand, Hamilton, New Zealand, pp. 227-232.
View description>>
This paper presents a method for vehicle number plate detection which combines edge and colour features of number plates. We concentrate on two key issues of this application: speed and robustness. Our focus is put on detecting parts of a number plate, instead of the number plate itself as a whole. To achieve the target of real-time detection, two simple features based on a rede¯ned vertical edge map are constructed. To address the illumination-sensitive problem of using colour information, a Gaussian weighted histogram intersection (GWHI) method is proposed. The above new ideas compose the major part of the algorithm. Our experimental results demonstrate a promising preliminary result on detecting yellow number plates in terms of detection speed and robustness, which shows the feasibility of the proposed method.
Jia, W, Tien, D, He, X, Hope, BA & Wu, Q 1970, 'Advances in Visual Information Systems', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), International Conference on Visual Information Systems, Springer Berlin Heidelberg, Shanghai, China, pp. 478-489.
View/Download from: Publisher's site
View description>>
Developing a spatial searching tool to enhance the search car pabilities of large spatial repositories for Geographical Information System (GIS) update has attracted more and more attention. Typically, objects to be detected are represented by many local features or local parts. Testing images are processed by extracting local features which are then matched with the object's model image. Most existing work that uses local features assumes that each of the local features is independent to each other. However, in many cases, this is not true. In this paper, a method of applying the local cooccurring patterns to disclose the cooccurring relationships between local features for object detection is presented. Features including colour features and edge-based shape features of the interested object are collected. To reveal the cooccurring patterns among multiple local features, a colour cooccurrence histogram is constructed and used to search objects of interest from target images. The method is demonstrated in detecting swimming pools from aerial images. Our experimental results show the feasibility of using this method for effectively reducing the labour work in finding man-made objects of interest from aerial images. © Springer-Verlag Berlin Heidelberg 2007.
Jie Zhao, Xiaojing Huang & Dutkiewicz, E 1970, 'Dynamic bandwidth MCIDS - a cognitive solution for MCIDS based UWB communications', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, Sydney, Australia, pp. 1502-1506.
View/Download from: Publisher's site
View description>>
Dynamic bandwidth multicode interleaved direct sequence (MCIDS), an enhanced MCIDS based Ultra-wideband (UWB) application is proposed in this paper, featuring a cognitive transmission bandwidth adaptation without any adverse effect on the data rate. By introducing a specific lowpass filtering and down-sampling into the traditional MCIDS algorithm, this system can decrease the transmission bandwidth into part of its original bandwidth but still be able to recover all the transmitted data from the reduced bandwidth. This solution can efficiently improve the coexistence ability of UWB devices in a cognitive manner without increasing hardware complexity. © 2007 IEEE.
Lebbe, MA, Agbinya, JI, Chaczko, Z & Chiang, F 1970, 'Self-organized classification of dangers for secure Wireless Mesh Networks', 2007 Australasian Telecommunication Networks and Applications Conference, 2007 Australasian Telecommunication Networks and Applications Conference (ATNAC 2007), IEEE, Christchurch, New Zealand, pp. 1-6.
View/Download from: Publisher's site
View description>>
This paper introduces danger theory in artificial immune system as a method of responding to danger in wireless mesh networks. It identifies the challenges in deploying Wireless Mesh networks (WMNs) and focus on secure routing as one of the key challenges in deploying WMNs. In order to implement a secure routing system, various Artificial Immune System (AIS) models were analysed. These models have been used in Intrusion Detection System (IDS) and computer security in the literature. In this paper, the authors propose to use Danger models to secure routing in WMNs. The first step in secure routing process is to identify and classify the network dangers and take necessary actions to overcome those dangers. For the classification task, we apply Self-organizing Maps (SOMs) as the classifier to classify the danger levels in WMNs. These identified danger conditions are further deployed as the warning signals for the design of secure routing protocol. The experimental results validate the proposal of applying the Danger Theory (DT) into security area and good performance is also reported by the use of Artificial Neural Network (ANN) classifier.
Li, Y, Archer, JW, Rosolen, G, Hay, SG, Timms, GP & Guo, YJ 1970, 'Fringe Management for a T-Shaped Millimeter-Wave Imaging System', IEEE Transactions on Microwave Theory and Techniques, Institute of Electrical and Electronics Engineers (IEEE), pp. 1246-1254.
View/Download from: Publisher's site
View description>>
Two methods, the modulated scene method and modulated beam method, are proposed in this paper to manage the fringe in a T-shaped correlating millimeter-wave imaging system. The modulated scene method incorporates the fringe into the scene to form a fringe-modulated scene. The pencil beam that corresponds to the beam of the system with a zero baseline scans the modulated scene to form an image. To recover the image of the original scene, an algorithm that involves demodulation and spectrum patching is used to process the original image after deconvolution. The resulting image is a super-resolution image of the scene. The advantage of the modulated scene method is that a phase shifter is not required. The modulated beam method incorporates the fringe into the beam. By dynamically adjusting the phase of a local oscillator, the fringe scans together with the beam. The advantages of this method are that demodulation is unnecessary and only a single output (real or imaginary) from the complex correlator is necessary to generate a super-resolution image. A disadvantage is that a rapidly adjustable phase shifter is needed. The performance of these methods is theoretically analyzed and tested with simulated data. © 2007 IEEE.
Li, Y, Timms, G, Archer, J, Rosolen, G, Tello, J, Brothers, M, Hellicar, A & Guo, YJ 1970, 'Passive mm-wave imaging using two scanning fan-beam antennas', SPIE Proceedings, Defense and Security Symposium, SPIE.
View/Download from: Publisher's site
View description>>
A prototype cross-correlating 190 GHz passive mm-wave imaging system has been developed. This system is based on the Mills Cross system used for radio astronomical imaging. It uses two pillbox antennas arranged in a T configuration. Each antenna generates a fan beam and the two fan beams are orthogonal to each other. By cross-correlating signals received from the two antennas, an output is obtained which is proportional to the millimeter-wave intensity radiated from the target at the intersection of the two fan beams. Beam scanning is generated by rotating a small sub-reflector inside each antenna. As a result, these relatively heavy antennas are stable during scanning and a high frame rate can be achieved. Another advantage of this approach is that only two receivers are required. The baseline (the displacement between phase centers of the two antennas) of this system is not zero, because the phase centers of the two antennas are not located at the same position. The baseline generates a fringe in the imaging system and its influence on the performance of the system is analyzed in this paper. The scanning speed of this system is also much faster than that of the Mills Cross imaging system and its influence on the resolution is also analyzed. It is found that the effect of the scanning speed is minimized when the beam scans along the equal-phase line of the fringe. This system can also be used as an active imaging system and this is discussed in another paper.
Lowe, D & Huang, X 1970, 'Adaptive Time-Frequency Codes for Ultra-Wideband', 2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07), 2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07), IEEE, pp. 38-44.
View/Download from: Publisher's site
View description>>
This paper investigates inter-piconet interference (IPI) in the multi-band orthogonal frequency division multiplexing (MB-OFDM) ultra-wideband (UWB) standard. IPI is caused when the time-frequency codes (TFCs) that delineate MB-OFDM piconets collide. An upper-bound on the severity of the IPI problem is obtained through a theoretical analysis of data-rate-specific punctured convolutional codes. Using these results, several methods for adaptive TFCs are proposed and analyzed. Comprehensive simulation results show how packet error rates (PERs) for simultaneous operating piconets (SOPs) can be improved by up to 2 dB by enabling adaptive TFCs at the transmitter. Several combinations of data rate, TFC, channel model and interferer power are studied. © 2007 IEEE.
Lowe, D & Huang, X 1970, 'Complementary Channel Estimation and Synchronization for OFDM', The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), IEEE, pp. 23-28.
View/Download from: Publisher's site
View description>>
In this paper, we present a new type of packet preamble for orthogonal frequency division multiplexing (OFDM) systems that is based on a complementary sequence pair. It is shown how this approach permits a receiver to dynamically choose between frequency-domain equalization (FDE) and time-domain equalization (TDE). With FDE offering a low-complexity zero-forcing (ZF) equalization and TDE facilitating easy minimum mean square error (MMSE) estimation, it is concluded that a spectrally-flattened complementary sequence pair offers an outstanding combination of flexibility and performance. © 2007 IEEE.
Lowe, D & Huang, X 1970, 'Hybrid Automatic Repeat Requests for MB-OFDM Ultra-Wideband', 2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07), 2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07), IEEE.
View/Download from: Publisher's site
View description>>
This paper analyzes the design and performance of hybrid automatic repeat request (HARQ) extensions to the multi- n band orthogonal frequency division multiplexing (MB-OFDM) ultra-wideband (UWB) standard. It is shown how both Type-I and Type-III HARQ can significantly reduce the packet error rate (PER) in realistic frequency-selective channels. An exhaustive search is used to find an optimal low-complexity Type-III HARQ scheme by deriving the distance spectra and bit error upper-bound for all sets of complementary puncturing matrices. The consequences of selecting sub-optimal puncturing matrices are also quantified. © 2007 IEEE.
Lowe, D & Huang, X 1970, 'Optimal Adaptive Hyperbolic Companding for OFDM', The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), IEEE.
View/Download from: Publisher's site
View description>>
In this paper, we derive and analyze a companding algorithm based on the hyperbolic tangent and inverse hyperbolic tangent functions for use in orthogonal frequency division multiplexing (OFDM) transceivers. Probability density functions (PDFs) that approximate the transmitted and received OFDM signals in the presence of additive white Gaussian noise (AWGN) are derived and used to analyze the degree of companding relative to the signal-to-noise ratio (SNR) and clipping level. A set of optimal companding linearity coefficients for the multiband OFDM (MB-OFDM) ultra-wideband (UWB) standard are presented. © 2007 IEEE.
Madden, C & Piccardi, M 1970, 'A framework for track matching across disjoint cameras using robust shape and appearance features', 2007 IEEE Conference on Advanced Video and Signal Based Surveillance, 2007 IEEE Conference on Advanced Video and Signal Based Surveillance, IEEE, London, UK, pp. 188-193.
View/Download from: Publisher's site
View description>>
This paper presents a framework based on robust shape and appearance features for matching the various tracks generated by a single individual moving within a surveillance system. Each track is first automatically analysed in order to detect and remove the frames affected by large segmentation errors and drastic changes in illumination. The object's features computed over the remaining frames prove more robust and capable of supporting correct matching of tracks even in the case of significantly disjointed camera views. The shape and appearance features used include a height estimate as well as illumination-tolerant colour representation of the individual's global colours and the colours of the upper and lower portions of clothing. The results of a test from a real surveillance system show that the combination of these four features can provide a probability of matching as high as 91 percent with 5 percent probability of false alarms under views which have significantly differing illumination levels and suffer from significant segmentation errors in as many as 1 in 4 frames. © 2007 IEEE.
Madden, C & Piccardi, M 1970, 'Detecting Major Segmentation Errors for a Tracked Person Using Colour Feature Analysis', 14th International Conference on Image Analysis and Processing (ICIAP 2007), 14th International Conference on Image Analysis and Processing (ICIAP 2007), IEEE, Modena, ITALY, pp. 524-+.
View/Download from: Publisher's site
Madden, C, Piccardi, M & Zuffi, S 1970, 'Comparison of Techniques for Mitigating the Effects of Illumination Variations on the Appearance of Human Targets', Lecture Notes in Computer Science vol.4842,Advances in Visual Computing, International Symposium on Visual Computing, Springer Berlin Heidelberg, Lake Tahoe, USA, pp. 116-127.
View/Download from: Publisher's site
View description>>
Several techniques have been proposed to date to build colour invariants between camera views with varying illumination conditions. In this paper, we propose to improve colour invariance by using data-dependent techniques. To this aim, we compare the effectiveness of histogram stretching, illumination filtration, full histogram equalisation and controlled histogram equalisation in a video surveillance domain. All such techniques have limited computational requirements and are therefore suitable for real time implementation. Controlled histogram equalisation is a modified histogram equalisation operating under the influence of a control parameter [1]. Our empirical comparison looks at the ability of these techniques to make the global colour appearance of single human targets more matchable under illumination changes, whilst still discriminating between different people. Tests are conducted on the appearance of individuals from two camera views with greatly differing illumination conditions and invariance is evaluated through a similarity measure based upon colour histograms. In general, our results indicate that these techniques improve colour invariance; amongst them, full and controlled equalisation consistently showed the best performance.
Madden, CS & Piccardi, M 1970, 'Detecting Major Segmentation Errors for a Tracked Person Using Colour Feature Analysis', Proceedings of 14th International Conference on Image Analysis and Processing 2007, International Conference on Image Analysis and Processing, IEEE Computer Society, Modena, Italy, pp. 524-529.
View/Download from: Publisher's site
View description>>
This paper presents a method to identify frames with significant segmentation errors in an individuals track by analysing the changes in appearance and size features along the frame sequence. The features used and compared include global colour histograms, local histograms and the bounding box size. Experiments were carried out on 26 tracks from 4 different people across two cameras with differing illumination conditions. By fusing two local colour features with a global colour feature, probabilities of segmentation error detection as high as 83 percent of human expert-identified major segmentation errors are achieved with false alarm rates of only 3 percent. This indicates that the analysis of such features along a track can be useful in the automatic detection of significant segmentation errors. This can improve the final results of many applications that wish to use robust segmentation results from a tracked person.
Otoom, AF, Gunes, H & Piccardi, M 1970, 'Towards Automatic Abandoned Object Classification in Visual Surveillance Systems', Proceedings of Asia-Pacific Workshop 2007 on Visual Information Processing, Asia-Pacific Workshop on Visual Information Processing, National Cheng Kung University, Tainan, Taiwan, pp. 143-149.
View description>>
One of the core components of any visual surveillance system is object classification, where detected objects are classified into different categories of interest. Although in airports or train stations, abandoned objects are mainly luggage or trolleys, none of the existing works in the literature have attempted to classify or recognize trolleys. In this paper, we analyze and classify images of trolleys, bags, persons, and groups of people by using various shape features. We conducted a set of experiments with a number of uncluttered (images collected from the Internet with clear background) and cluttered images (images segmented out from the background in real videos) using various criteria. Our experimental results show that the features extracted enable 100% recognition accuracy for the trolley category. For our four-class object recognition problem, we achieved an overall recognition accuracy of 83.3% and an average false positive rate of 6%.
Paisitkriangkrai, S, Shen, C & Zhang, J 1970, 'An Experimental Evaluation of Local Features for Pedestrian Classification', 9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007), 9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007), IEEE, Glenelg, SA, pp. 53-60.
View/Download from: Publisher's site
View description>>
The ability to detect pedestrians is a first important step in many computer vision applications such as video surveillance. This paper presents an experimental study on pedestrian detection using state-of-the-art local feature extraction and support vec
Pérez, Ó, Piccardi, M, García, J & Molina, JM 1970, 'Comparison of Classifiers for Human Activity Recognition', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), International Work-Conference on the Interplay, Springer Berlin Heidelberg, La Manga del Mar Menor, Spain, pp. 192-201.
View/Download from: Publisher's site
View description>>
The human activity recognition in video sequences is a field where many types of classifiers have been used as well as a wide range of input features that feed these classifiers. This work has a double goal. First of all, we extracted the most relevant features for the activity recognition by only utilizing motion features provided by a simple tracker based on the 2D centroid coordinates and the height and width of each person's blob. Second, we present a performance comparison among seven different classifiers (two Hidden Markov Models (HMM), a J.48 tree, two Bayesian classifiers, a classifier based on rules and a Neuro-Fuzzy system). The video sequences under study present four human activities (inactive, active, walking and running) that have been manual labeled previously. The results show that the classifiers reveal different performance according to the number of features employed and the set of classes to sort. Moreover, the basic motion features are not enough to have a complete description of the problem and obtain a good classification. © Springer-Verlag Berlin Heidelberg 2007.
Pérez, Ó, Piccardi, M, García, J, Patricio, MÁ & Molina, JM 1970, 'Comparison Between Genetic Algorithms and the Baum-Welch Algorithm in Learning HMMs for Human Activity Classification', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Evo Workshops, Springer Berlin Heidelberg, Valencia, Spain, pp. 399-406.
View/Download from: Publisher's site
View description>>
A Hidden Markov Model (HMM) is used as an efficient and robust technique for human activities classification. The HMM evaluates a set of video recordings to classify each scene as a function of the future, actual and previous scenes. The probabilities of transition between states of the HMM and the observation model should be adjusted in order to obtain a correct classification. In this work, these matrixes are estimated using the well known Baum-Welch algorithm that is based on the definition of the real observations as a mixture of two Gaussians for each state. The application of the GA follows the same principle but the optimization is carried out considering the classification. In this case, GA optimizes the Gaussian parameters considering as a fitness function the results of the classification application. Results show the improvement of GA techniques for human activities recognition. © Springer-Verlag Berlin Heidelberg 2007.
Piccardi, M & Perez, O 1970, 'Hidden Markov Models with Kernel Density Estimation of Emission Probabilities and their Use in Activity Recognition', 2007 IEEE Conference on Computer Vision and Pattern Recognition, 2007 IEEE Conference on Computer Vision and Pattern Recognition, IEEE, Minneapolis, pp. 1-8.
View/Download from: Publisher's site
View description>>
In this paper, we present a modified hidden Markov model with emission probabilities modelled by kernel density estimation and its use for activity recognition in videos. In the proposed approach, kernel density estimation of the emission probabilities is operated simultaneously with that of all the other model parameters by an adapted Baum-Welch algorithm. This allows us to retain maximum-likelihood estimation while overcoming the known limitations of mixture of Gaussions in modelling certain probability distributions. Experiments on activity recognition have been performed on groundtruthed data from the CAVIAR video surveillance database and reported in the paper. The error on the training and validation sets with kernel density estimation remains around 14-16% while for the conventional Gaussian mixture approach varies between 15 and 24%, strongly depending on the initial values chosen for the parameters. Overall, kernel density estimation proves capable of providing more flexible modelling of the emission probabilities and, unlike Gaussian mixtures, does not suffer from being highly parametric and of difficult initialisation. © 2007 IEEE.
Piccardi, M & Perez, O 1970, 'Hidden Markov models with kernel density estimation of emission probabilities and their use in activity recognition', 2007 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-8, IEEE Conference on Computer Vision and Pattern Recognition, IEEE, Minneapolis, MN, pp. 3774-+.
Pingzhou Tu, Xiaojing Huang & Dutkiewicz, E 1970, 'Diversity performance of interleaved spread spectrum OFDM signals over frequency selective multipath fading channels', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, Sydney, Australia, pp. 184-189.
View/Download from: Publisher's site
View description>>
In this paper we propose an interleaved spread spectrum orthogonal frequency division multiplexing (ISS-OFDM) system for achieving both frequency diversity and time diversity and investigate the system performance over frequency selective fading channels. The purpose is to exploit the diversity capability of OFDM systems, develop efficienct spectrum spreading technique and improve the system performance against frequency selective channel fading. At the transmitter, the ISS-OFDM signal is generated by employing spread spectrum modulation and interleaving techniques. At the receiver, the received signals are combined by using maximum ratio combining (MRC) technique. The simulation indicates that the ISS-OFDM system has improved performance in multipath fading channels. Another unique characteristic is that the spectrum spreading factor and diversity order provided by the system are reconfigurable to achieve cognitive communications. © 2007 IEEE.
Pingzhou Tu, Xiaojing Huang & Dutkiewicz, E 1970, 'Peak-to-average power ratio performance of interleaved spread spectrum OFDM signals', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, Sydney, AUSTRALIA, pp. 82-86.
View/Download from: Publisher's site
Qumer, A 1970, 'Defining an Integrated Agile Governance for Large Agile Software Development Environments.', XP, Agile Processes in Software Engineering and Extreme Programming, Springer, Como, Italy, pp. 157-160.
View/Download from: Publisher's site
View description>>
This paper highlights the important aspect of IT governance, with the objective of defining an unaddressed aspect of agile governance, by the application of an iterative, inductive, instantaneous analysis and emergent interpretation of appropriate data-grounded conceptual categories of IT governance. An effective agile governance approach will facilitate the achievement of desired discipline, rationale, business value, improved performance, monitoring, as well as control of large agile software development environments by aligning business goals and agile software development goals. © Springer-Verlag Berlin Heidelberg 2007.
Qumer, A & Henderson-Sellers, B 1970, 'An agile toolkit to support agent-oriented and service-oriented computing mechanisms', Product-Focused Software Process Improvement, Proceedings, Product Focused Software Process Improvement, Springer, Riga, Latvia, pp. 222-236.
View/Download from: Publisher's site
View description>>
The complex nature of the software development paradigm and the rapid acceptance of emerging abstraction mechanisms, such as agent-oriented and service-oriented computing, highlight the increasing need for re-evaluation of existing software development approaches that focus on agile software development methodologies (primarily originating in object-oriented technology); since existing object-oriented, structure-oriented and component-oriented approaches embodied in an agile approach cannot be applied immediately to agent and service-oriented computing. Therefore, we present here, an agile toolkit (Java-based) to facilitate the construction of multi-abstraction or mabstraction situation-specific agile processes for software development projects. This paper only presents the newly emergent abstraction concepts of agent and service, and does not discuss the well-established object-oriented mechanism used in current agile approaches. © Springer-Verlag Berlin Heidelberg 2007.
Qumer, A & Henderson-Sellers, B 1970, 'ASOP: An Agile Service-Oriented Process', NEW TRENDS IN SOFTWARE METHODOLOGIES, TOOLS AND TECHNIQUES, International Conference on Software Methods and Tools, IOS Press, Rome, Italy, pp. 83-92.
View description>>
The increasing prevalence of service-oriented architecture (SOA) has introduced another layer of abstraction (service-oriented) on top of already well-known object-oriented and component-oriented layers of abstractions. However, it has been found that the current traditional phase-based approach towards the development of SOA-based applications, contrarily, lacks agility, which mitigates against the needed ability to quickly respond to changes in business processes. Therefore, here, we suggest an agile approach to implement a flexible SOA. This paper, based on our industrial experience and case studies, presents the agile service-oriented process (ASOP) that had been constructed by using the agile software solution framework (ASSF), agile toolkit (ATK), situational method engineering (SME) and agile adoption and improvement model (AAIM) for the development of one of our industry (case study) service-oriented e-health project.
Qumer, A & Henderson-Sellers, B 1970, 'ASOP: An Agile Service-Oriented Process', Frontiers in Artificial Intelligence and Applications, pp. 83-92.
View description>>
The increasing prevalence of service-oriented architecture (SOA) has introduced another layer of abstraction (service-oriented) on top of already well-known object-oriented and component-oriented layers of abstractions. However, it has been found that the current traditional phase-based approach towards the development of SOA-based applications, contrarily, lacks agility, which mitigates against the needed ability to quickly respond to changes in business processes. Therefore, here, we suggest an agile approach to implement a flexible SOA. This paper, based on our industrial experience and case studies, presents the agile service-oriented process (ASOP) that had been constructed by using the agile software solution framework (ASSF), agile toolkit (ATK), situational method engineering (SME) and agile adoption and improvement model (AAIM) for the development of one of our industry (case study) service-oriented e-health project.
Qumer, A & Henderson-Sellers, B 1970, 'Construction of an agile software product-enhancement process by using an agile software solution framework (ASSF) and situational method engineering', COMPSAC 2007: THE THIRTY-FIRST ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE, VOL I, PROCEEDINGS, International Computer Software and Applications Conference, IEEE Computer Society, Beijing, China, pp. 539-542.
View/Download from: Publisher's site
View description>>
Introducing a change in any software development organization is challenging; as this paper demonstrates by means of a case study for the adoption of agile practices in a large software development organization. The case study research findings indicate that a situational method engineering approach together with an agile software solution framework (ASSF) can be used to create a feasible and usable hybrid software development method by combining agile practices and formal practices for a particular situation in large software development organizations. ©2007 IEEE.
Raad, IS & Xiaojing Huang 1970, 'A new approach to BSOFDM - parallel concatenated spreading matrices OFDM', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, Sydney, Australia, pp. 77-81.
View/Download from: Publisher's site
View description>>
This paper proposes a new approach to Block Spread OFDM called Parallel Concatenated Spreading Matrices OFDM (PCSM-OFDM). While BSOFDM improved the overall BER performance on OFDM in frequency selective channels, this new approach further improves the BER of BSOFDM by a 3dB gain. This is achieved through increasing the diversity of the transmitted samples by concatenating two spreading matrices in parallel to BSOFDM. © 2007 IEEE.
Raad, IS, Huang, X & Lowe, D 1970, 'A Study of Different Angles for the New Spread Matrix for BSOFDM in UWB Channels', 2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07), 2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07), IEEE, Guadeloupe, French Caribbean.
View/Download from: Publisher's site
View description>>
This paper presents a study into different angles for the New spread matrix developed for BSOFDM. It varies the angles for the matrix to develop different constellation schemes which are useful in overcoming the frequency selective channels which are encountered in mobile communication systems. Previously it has been discussed that this new matrix (the rotation matrix) has some advantages over Hadamard and the rotated Hadamard matrix in certain channels. This paper presents a study of varies angles with this new matrix over the UWB channels CM1 to CM4.1 © 2007 IEEE.
Raad, IS, Huang, X & Lowe, D 1970, 'A study of different decoders for the new rotation spreading matrix for block spread OFDM in UWB channels', 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, IEEE, Penang, MALAYSIA, pp. 372-376.
View/Download from: Publisher's site
Raad, IS, Huang, X & Lowe, D 1970, 'Higher order rotation spreading matrix for block spread OFDM', 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, IEEE, Penang, MALAYSIA, pp. 377-381.
View/Download from: Publisher's site
Raad, IS, Huang, X & Raad, R 1970, 'A Study of Different Angles for Higher Order Rotation Spreading Matrix for BSOFDM in UWB Channels', The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), IEEE, pp. 18-23.
View/Download from: Publisher's site
View description>>
This paper presents a study into different angles for higher order Rotation spreading matrix developed for BSOFDM. It was shown previously that for block size M = 2 that the angle α = π/3 achieved the best result in terms of BER in UWB channels. It was discovered that this was no longer the case when the higher order Rotation spreading matrix was used for larger M sized blocks and that other angles produced better results which proves that the Rotation spreading matrix advantage over existing spreading matrices such as the Hadamard is its flexibility to be adapted to different communication systems. © 2007 IEEE.
Raad, IS, Huang, X & Raad, R 1970, 'New Higher Order Rotation Spreading Matrix for BSOFDM', The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), IEEE, pp. 17-22.
View/Download from: Publisher's site
View description>>
Previously a new matrix called the Rotation spreading matrix was proposed for Block Spread OFDM which had advantages over other well known spreading matrices such as the Hadamard in frequency selective channels such the UWB channels. Then a new paper discussed a method to expand this Rotation spreading matrix into higher order allowing the system BSOFDM to achieve higher order matrices which still showed excellent orthogonal properties which can be used in these frequency selective channels. This work is continued on the Rotation spreading matrix and this paper presents another method to expand the Rotation spreading matrix based on Complete Complementary Sets of Sequences which the authors have shown to have excellent properties in higher order matrices. This paper discusses the new method and presents a comparison between the two mentioned methods. © 2007 IEEE.
Rengasamy, M, Dutkiewicz, E & Hedley, M 1970, 'MAC design and analysis for wireless sensor networks with co-operative localisation', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, pp. 942-947.
View/Download from: Publisher's site
View description>>
Co-operative localisation in wireless sensor networks (WSNs) is a method in which wireless sensor nodes interact with each other as peers to determine their physical position. In such networks it is crucial for communication between nodes to be contention free to meet the strict timing requirements. Medium Access Control (MAC) protocols provide the strongest influence over contention control in WSNs. The focus of this work is the design and analysis of a WSN MAC protocol suitable for supporting co-operative localisation. This paper presents a design overview of the MAC protocol and details its control structure. Preliminary simulation results are also presented to evaluate network formation aspects of the protocol. © 2007 IEEE.
Ridoux, J & Veitch, D 1970, 'A Methodology for Clock Benchmarking', 2007 3rd International Conference on Testbeds and Research Infrastructure for the Development of Networks and Communities, 2007 3rd International Conference on Testbeds and Research Infrastructure for the Development of Networks and Communities, IEEE, IEEE, pp. 1-10.
View/Download from: Publisher's site
Ridoux, J & Veitch, D 1970, 'Ten Microseconds Over LAN, for Free', 2007 IEEE International Symposium on Precision Clock Synchronization for Measurement, Control and Communication, 2007 IEEE International Symposium on Precision Clock Synchronization for Measurement, Control and Communication, IEEE, IEEE, pp. 105-109.
View/Download from: Publisher's site
Sijun Lu, Jian Zhang & David Feng 1970, 'An efficient method for detecting ghost and left objects in surveillance video', 2007 IEEE Conference on Advanced Video and Signal Based Surveillance, 2007 IEEE Conference on Advanced Video and Signal Based Surveillance, AVSS 2007, IEEE, London, pp. 540-545.
View/Download from: Publisher's site
View description>>
This paper proposes an efficient method for detecting ghost and left objects in surveillance video, which, if not identified, may lead to errors or wasted computation in background modeling and object tracking in surveillance systems. This method contain
Sinha, S & Chaczko, Z 1970, 'MAGNA: Middleware for dynamic and resource constrained sensor networks', The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007), IEEE, pp. 62-71.
View/Download from: Publisher's site
View description>>
Traditionally sensor networks have been typically enterprise architecture driven, where a dedicated server is used to collect data and record in a database for analysis and historical reference. While modern day computing capabilities allow drilling through megabytes of information, it is not always the most costeffective solution. The other alternative is the use of smart sensors, whereby each node is capable of routing data to any destination using a HTTP server. This not only escalates the cost of each node but also imposes severe strain on the network - thus necessitating developers and architects to evaluate the impact of swarming and "lazy routing". The notion of the proposed middleware solution (MAGNA) is to bring about context-based processing and intelligent data capture and/or filter right up to the sensor nodes through the use of powerful "sub-net" controllers. The paper will explore the application of MAGNA as a platform capable of offering ambient intelligence in a typical sensor network environment, integrating everyday appliances and our life-style together. In doing so, two primary methodologies will be discussed on which MAGNA is essentially based, namely the Soft Systems Methodology and the Banking Model approach. © 2007 IEEE.
Sun, Y, Feng, B, Zhang, Y, Fang, G, Shi, J & Dutkiewicz, E 1970, 'Fast RSVP: A Cross Layer Resource Reservation Scheme for Mobile IPv6 Networks', 2007 IEEE Symposium on Computers and Communications, 2007 IEEE Symposium on Computers and Communications, IEEE, pp. 691-697.
View/Download from: Publisher's site
View description>>
This paper proposes a new cross layer scheme (Fast RSVP) to reserve resources in mobile IPv6 networks. Through the cooperation of mobile IP and RSVP modules, Fast RSVP includes a number of mechanisms such as advanced resource reservation on neighbor tunnels, resource reservation on optimized routes, resource reservation for handover sessions, path merge etc. Network simulation results show that our scheme, compared with other traditional ways to reserve resources in mobile environments, has the following advantages: (1) it allows a mobile node to realize fast handover with QoS guarantees; (2) it avoids resource wasting caused by triangular routes and duplicate reservations; (3) it distinguishes different types of reservation requests, greatly reducing the handover session forced termination rate while maintaining high performance of the network. © 2007 IEEE.
Sun, Y, Zhang, Y, Song, Y, Shi, J & Dutkiewicz, E 1970, 'Extensions to Resource Reservation Protocol (RSVP) with Guard Channel for Mobile IPv6', 2007 IEEE 66th Vehicular Technology Conference, 2007 IEEE 66th Vehicular Technology Conference, IEEE, Baltimore, MD, pp. 1528-1532.
View/Download from: Publisher's site
Tian, L, Yang, Y, Shi, J, Dutkiewicz, E & Fang, G 1970, 'Energy Efficient Integrated Scheduling of Unicast and Multicast Traffic in 802.16e WMANs', IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference, IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference, IEEE, Washington, DC, pp. 3478-+.
View/Download from: Publisher's site
Tien, D & Jia, W 1970, 'Automatic road extraction from aerial images: A contemporary survey', Fourth International Conference on Information Technology and Applications, ICITA 2007, International Conference on Information Technology and Applications, Macquarie Scientific Publishing, Sydney, Australia, Harbin, China, pp. 294-299.
View description>>
Wenjing Jia is currently a part-time Research Associate at the Charles Sturt University, Australia This paper describes a contemporary literature review outcomes on automatic road extraction from aerial images. The main focus is on automatic road extraction, but it also discusses the possible extension on automatic extraction of other man-made objects, such as buildings, dams, swimming pools, etc.. This paper first discusses the background of the topic, including the difficulties of the problem and the evaluation methods. Then Ave typical method currently proposed for road extraction are reviewed. Technical details are critically reviewed for future reference and comparison. The advantages and disadvantages of each approach are discussed. Based on this discussion, future work and possible methods are suggested.
Tran, LC, Mertins, A, Dutkiewicz, E & Huang, X 1970, 'Space-Time-Frequency Codes in MB-OFDM UWB communications: advanced order-8 STFC and its performance', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, Sydney, AUSTRALIA, pp. 380-+.
View/Download from: Publisher's site
Wang, JC-P, Abolhasan, M, Franklin, DR, Safaei, F & Lipman, J 1970, 'On Separating Route Control and Data Flows in Multi-radio Multi-hop Ad Hoc Network.', ICON, IEEE International Conference on Networks, IEEE, Adelaide, Australia, pp. 19-24.
View/Download from: Publisher's site
View description>>
Ad hoc networks typically require a significant amount of routing and control information to be distributed in a timely and reliable manner throughout the network, particularly in dynamic environments. As traffic levels increase and the network becomes more heavily congested, there is an increased probability that these critical packets are lost, resulting in obsolete control information being used to make important decisions. This would further compound the problem of network congestion and lead to a very rapid loss of connectivity and throughput. Given this, we argue the solutions to these problems should not rely on putting extra bandwidth on a radio interface. Instead, we should exploit the use of multiple radios to ensure the route can be firmly established. In this paper, we propose a multi-radio solution which reserves one radio channel exclusively for routing. Our simulation results have demonstrated that using a separate radio for routing protocol would dramatically improve reliability in heavily loaded ad hoc wireless networks, thereby effectively alleviating the impact of network congestion. © 2007 IEEE.
Wang, JC-P, Abolhasan, M, Franklin, DR, Safaei, F, Lipman, J & IEEE 1970, 'On separating route control and data flows in multi-radio multi-hop ad hoc network', 2007 15TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS, 15th IEEE International Conference on Networks, IEEE, Adelaide, AUSTRALIA, pp. 114-119.
View/Download from: Publisher's site
Wang, JC-P, Abolhasan, M, Safaei, F, Franklin, D & IEEE 1970, 'A survey on control separation techniques in multi-radio multi-channel MAC protocols', 2007 INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES, VOLS 1-3, International Symposium on Communications and Information Technologies, IEEE, Sydney, Australia, pp. 854-859.
View/Download from: Publisher's site
View description>>
The rapid diminishing in the cost of commodity wireless hardware in recent years has prompted the use of multiple radios to improve the capacity of wireless networks. However, the research has shown that the improvement obtained from using multiple radios does not solely depend on the number of radios, but primarily on how these radios can be integrated in a constructive manner. A common way of integration multiple radios is to use a dedicated radio for control. To date, a number of multi-radio MAC protocol are employing a dedicated radio to control and coordinate the other radios, though the approaches are varied from one to another. In this paper, the control separation techniques in the multi-radio multi-channel MAC have been surveyed, and a classification of control separation techniques is provided. Moreover, this study points out the open research issues and intends to spark new interests and developments in this field.
Weily, AR & Guo, YJ 1970, 'An aperture coupled patch antenna system with MEMS-based reconfigurable polarization', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, pp. 325-328.
View/Download from: Publisher's site
View description>>
An aperture coupled patch antenna suitable for IEEE 802.11b/g WLAN applications is described. The antenna system enables the polarization of the device to be dynamically reconfigured, where the reconfiguration is actuated by an RF microelectromechanical system (MEMS) single-pole double-throw (SPDT) switch. An equivalent circuit model of the RF MEMS switch is used In the electromagnetic simulations of the antenna. This enables an accurate analysis of the antenna cross-polarization, which is highly dependent on the switch isolation. Theoretical results are given for the return loss, radiation patterns and gain of the antenna In both vertical and horizontal polarization states. © 2007 IEEE.
Wu, Q, Wang, L, Geng, X, Li, M & He, S 1970, 'Dynamic Biometrics Fusion at Feature Level for Video-Based Human Recognition', Proceedings of Image and Vision Computing New Zealand 2007, Image and Vision Computing Conference, Image and Vision Computing New Zealand, Hamilton, New Zealand, pp. 152-157.
Xianyi Rui, Ronghong, Junping Geng & Xiaojing Huang 1970, 'The largest eigenvalue characteristic of correlated complex wishart matrices and its application to MIMO MRC systems', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, Sydney, Australia, pp. 375-379.
View/Download from: Publisher's site
View description>>
In this paper, we analyze statistical properties of the largest eigenvalue of correlated complex Wishart matrices. The results provide an analytical tool for the study of multipleinput multiple-output (MIMO) maximal ratio combining (MRC) systems in the presence of spatial fading correlation at the transmitter or receiver. Based on them, the exact closed-form expressions for the cumulative distribution function and the probability density function of the output signal-to-noise ratio are presented. The analytical results are validated by Monte Carlo simulations. © 2007 IEEE.
Xiaojing Huang 1970, 'Diversity performance of precoded OFDM with MMSE equalization', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, Sydney, AUSTRALIA, pp. 802-807.
View/Download from: Publisher's site
Xiaojing Huang & Leong Keong Kwoh 1970, '3D building reconstruction and visualization for single high resolution satellite image', 2007 IEEE International Geoscience and Remote Sensing Symposium, 2007 IEEE International Geoscience and Remote Sensing Symposium, IEEE, Barcelona, SPAIN, pp. 5009-5012.
View/Download from: Publisher's site
Xu, M, Luo, S & Jin, J 1970, 'Video Adaptation based on Affective Content with MPEG-21 DIA Framework', 2007 IEEE Symposium on Computational Intelligence in Image and Signal Processing, 2007 IEEE Symposium on Computational Intelligence in Image and Signal Processing, IEEE, pp. 386-390.
View/Download from: Publisher's site
View description>>
We present a video adaptation system which takes account of users' preference on video Affective Content (AC) and limited network resource. AC directly causes an user's attention, evaluation and memory which also provides feasible entry for video highlight. According to user's preference, the proposed adaptation insures the video parcels with AC are allocated as much as possible network resource. The system is implemented with MPEG-21 Digital Item Adaptation (DIA) framework which provides a generic video adaptation solution for all video formats and various usage environments by manipulating on XML files. XML file based adaptation avoids complex video computation. 30 students from various departments were invited to test the system and their responses were positive. © 2007 IEEE.
Yang, J & Zhang, J 1970, 'Offline Swimmer Cap Tracking Using Trajectory Interpolation', 9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007), 9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007), IEEE, pp. 579-585.
View/Download from: Publisher's site
View description>>
In this paper, we present a preliminary attempt to solve the difficult problem of tracking swimmer cap in swimming videos to facilitate swimmer performance assessment. Due to the great challenges posed by moving camera and severe figure-background occlusions, an offline approach based on trajectory interpolation is adopted. Firstly, each frame is searched for hypothesized positions of the target cap using mean shift mode seeking. Secondly, most outliers due to ambiguities and noise are eliminated using lane constraints, and the hypothesis in the space-time volume are clustered into trajectory segments based on a spatial and temporal closeness criteria. Finally, cubic spline trajectory interpolation is used to infer the target cap position in occluded frames. Experiments show that satisfying tracking results are achieved by our approach. © 2007 IEEE.
Yu, K & Guo, YJ 1970, 'Efficient Location Estimators in NLOS Environments', 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications, 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications, IEEE.
View/Download from: Publisher's site
View description>>
In the paper we consider location estimation in an non-line-of-sight (NLOS) environment. A constrained optimization based location algorithm is proposed to jointly estimate the unknown location and bias by using the sequential quadratic programming (SQP) algorithm. This method does not rely on any prior statistics information, and simulation results show that the proposed method outperforms the existing related methods considerably. To reduce the complexity of the SQP based algorithm, we further propose a Taylor-series expansion based linear quadratic programming (TS-LQP) algorithm. Simulation results demonstrate that the computational complexity of the TS-LQP algorithm is only a fraction of that of the SQP algorithm while the accuracy loss is marginal. © 2007 IEEE.
Yu, K & Guo, YJ 1970, 'NLOS Error Mitigation for Mobile Location Estimation in Wireless Networks', 2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring, 2007 IEEE 65th Vehicular Technology Conference, IEEE, pp. 1071-1075.
View/Download from: Publisher's site
View description>>
Most radio positioning methods are based on the measurements of distance between different wireless nodes. Owing to the existence of non-line-of-sight (NLOS) radio propagation, unfortunately, not all the measured distances are reliable. One way to tackle the problem of positioning is therefore to take two-steps: (i) identifying the NLOS measurements; (ii) smart signal processing of the mixed LOS and NLOS measurements. This paper is focused on the second issue. Under the assumption that the NLOS measurements have been identified, we first propose a simple method to suppress the effect of the NLOS error. Simulation results demonstrate that the proposed method achieves similar or better accuracy than several other known methods and the computational complexity is reduced considerably. We also present an optimal location estimator under the assumption of Gaussian distributed measurement noise and Rayleigh distributed NLOS error. Although it is difficult to achieve the optimal performance in practice due to modeling uncertainties, the optimal estimator provides a performance benchmark. © 2007 IEEE.
Yuehe Ge, Esselle, KP & Bird, TS 1970, 'A high-gain low-profile EBG resonator antenna', 2007 IEEE Antennas and Propagation Society International Symposium, 2007 IEEE Antennas and Propagation Society International Symposium, IEEE, pp. 1301-1304.
View/Download from: Publisher's site
View description>>
We propose a low-profile high-gain electromagnetic band-gap (EBG) resonator antenna that utilizes a double-sliced frequency-selective surface (FSS) on a single superstrate. In this design, a microgenetic algorithm is employed to optimise the FSS so that the EBG resonator antenna can achieve a directivity of 22 dBi, which is normally achieved by EBG antennas with multiple dielectric layers. © 2007 IEEE.
Zhang, Z & Piccardi, M 1970, 'A review of tracking methods under occlusions', Proceedings of IAPR Conference on Machine Vision Applications, MVA 2007, Machine Vision Applications, Institute of Industrial Science, The University of Tokyo, Tokyo, Japan, pp. 146-149.
View description>>
Object tracking in computer vision refers to the task of tracking individual moving objects accurately from one frame to another in an image sequence. Several tracking methods have been proposed in the recent literature capable of coping with a certain degree of occlusions of the objects. However, no comparative analysis of such methods has been presented to date and both the expert and the newcomer to this area may be confused about the relative effectiveness of each method when compared under the same level of complexity of the dynamic scene. In order to fulfill this need, this paper proposes a set of analysis criteria and provides a comparative review of the main recent tracking methods, in particular with respect to their capability of tracking objects under occlusions.
Zheng, L, He, S, Wu, Q & Hintz, TB 1970, 'Number Plate Recognition without Segmentation', Proceedings of Image and Vision Computing New Zealand 2007, Image and Vision Computing Conference, Image and Vision Computing New Zealand, Hamilton, New Zealand, pp. 164-168.
Zhou, S, Liu, R, Everitt, D & Zic, J 1970, 'A<sup>2</sup>-MAC: an application adaptive medium access control protocol for data collections in wireless sensor networks', 2007 International Symposium on Communications and Information Technologies, 2007 International Symposium on Communications and Information Technologies, IEEE, Sydney, AUSTRALIA, pp. 1131-1136.
View/Download from: Publisher's site
