Query: Stochastic Variational Deep Kernel Learning

Relevant passages:
Manifold Gaussian Processes for regression <=SEP=> Off-the-shelf Gaussian Process (GP) covariance functions encode smoothness assumptions on the structure of the function to be modeled. To model complex and non-differentiable functions, these smoothness assumptions are often too restrictive. One way to alleviate this limitation is to find a different representation of the data by introducing a feature space. This feature space is often learned in an unsupervised way, which might lead to data representations that are not useful for the overall regression task. In this paper, we propose Manifold Gaussian Processes, a novel supervised method that jointly learns a transformation of the data into a feature space and a GP regression from the feature space to observed space. The Manifold GP is a full GP and allows to learn data representations, which are useful for the overall regression task. As a proof-of-concept, we evaluate our approach on complex non-smooth functions where standard GPs perform poorly, such as step functions and robotics tasks with contacts.

Deep Gaussian Processes <=SEP=> In this paper we introduce deep Gaussian process (GP) models. Deep GPs are a deep belief network based on Gaussian process mappings. The data is modeled as the output of a multivariate GP. The inputs to that Gaussian process are then governed by another GP. A single layer model is equivalent to a standard GP or the GP latent variable model (GP-LVM). We perform inference in the model by approximate variational marginalization. This results in a strict lower bound on the marginal likelihood of the model which we use for model selection (number of layers and nodes per layer). Deep belief networks are typically applied to relatively large data sets using stochastic gradient descent for optimization. Our fully Bayesian treatment allows for the application of deep models even when data is scarce. Model selection by our variational bound shows that a five layer hierarchy is justified even when modelling a digit data set containing only 150 examples.

Variational Auto-encoded Deep Gaussian Processes <=SEP=> We develop a scalable deep non-parametric generative model by augmenting deep Gaussian processes with a recognition model. Inference is performed in a novel scalable variational framework where the variational posterior distributions are reparametrized through a multilayer perceptron. The key aspect of this reformulation is that it prevents the proliferation of variational parameters which otherwise grow linearly in proportion to the sample size. We derive a new formulation of the variational lower bound that allows us to distribute most of the computation in a way that enables to handle datasets of the size of mainstream deep learning tasks. We show the efficacy of the method on a variety of challenges including deep unsupervised learning and deep Bayesian optimization.

A Unifying View of Sparse Approximate Gaussian Process Regression <=SEP=> We provide a new unifying view, including all existing prope r probabilistic sparse approximations for Gaussian process regression. Our approach relies on exp ressing theeffective priorwhich the methods are using. This allows new insights to be gained, and highlights the relationship between existing methods. It also allows for a clear theoretically j ustified ranking of the closeness of the known approximations to the corresponding full GPs. Finall y we point directly to designs of new better sparse approximations, combining the best of the exi sting strategies, within attractive computational constraints.

Caffe: Convolutional Architecture for Fast Feature Embedding <=SEP=> Caffe provides multimedia scientists and practitioners with a clean and modifiable framework for state-of-the-art deep learning algorithms and a collection of reference models. The framework is a BSD-licensed C++ library with Python and MATLAB bindings for training and deploying general-purpose convolutional neural networks and other deep models efficiently on commodity architectures. Caffe fits industry and internet-scale media needs by CUDA GPU computation, processing over 40 million images a day on a single K40 or Titan GPU (approx 2 ms per image). By separating model representation from actual implementation, Caffe allows experimentation and seamless switching among platforms for ease of development and deployment from prototyping machines to cloud environments.
 Caffe is maintained and developed by the Berkeley Vision and Learning Center (BVLC) with the help of an active community of contributors on GitHub. It powers ongoing research projects, large-scale industrial applications, and startup prototypes in vision, speech, and multimedia.

Multilayer networks: an architecture framework <=SEP=> We present an architecture framework for the control and management of multilayer networks and associated advanced network services. This material is identified as an "architecture framework" to emphasize its role in providing guidance and structure to our subsequent detailed architecture, design, and implementation activities. Our work is motivated by requirements from the Department of Energy science application community for real-time on-demand science-domain-specific network services and resource provisioning. We also summarize the current state of deployments and use of network services based on this multilayer network architecture framework.

IoT for Healthcare <=SEP=> The Internet of Things (IoT) is the network of physical objects or things embedded with electronics, software, sensors, and network connectivity, which enables these objects to collect and exchange data. The Internet of Things allows objects to be sensed and controlled remotely across existing network infrastructure. The IoT is enabled by the latest developments in RFID, smart sensors, communication technologies, and Internet protocols. The basic premise is to have smart sensors collaborate directly without human involvement to deliver a new class of applications. The current revolution in Internet, mobile, and machine-to-machine (M2M) technologies can be seen as the first phase of the IoT. In the coming years, the IoT is expected to bridge diverse technologies to enable new applications by connecting physical objects together in support of intelligent decision making. Smart healthcare plays a significant role in healthcare applications through embedding sensors and actuators in patients and their medicine for monitoring and tracking purposes. The IoT is used by clinical care to monitor physiological statuses of patients through sensors by collecting and analyzing their information and then sending analyzed patient’s data remotely to processing centers to make suitable actions. Not only for patients, it also useful for normal people to check the health status by using wearable devices with sensors.

User Experience in Service Design: A Case Study from Algeria <=SEP=> The design of crisis management services is crucial for emerging countries such as Algeria. It must take into account the experiences of diverse stakeholders. The authors investigate user experience (UX) practices from a service design perspective and describe a case study from Algeria exploring UX-driven service design for crisis management.

Towards Accurate Predictions of Customer Purchasing Patterns <=SEP=> A range of algorithms was used to classify online retail customers of a UK company using historical transaction data. The predictive capabilities of the classifiers were assessed using linear regression, Lasso and regression trees. Unlike most related studies, classifications were based upon specific and marketing focused customer behaviours. Prediction accuracy on untrained customers was generally better than 80%. The models implemented (and compared) for classification were: Logistic Regression, Quadratic Discriminant Analysis, Linear SVM, RBF SVM, Gaussian Process, Decision Tree, Random Forest and Multi-layer Perceptron (Neural Network). Postcode data was then used to classify solely on demographics derived from the UK Land Registry and similar public data sources. Prediction accuracy remained better than 60%.

Discriminative learning of visual words for 3D human pose estimation <=SEP=> This paper addresses the problem of recovering 3D human pose from a single monocular image, using a discriminative bag-of-words approach. In previous work, the visual words are learned by unsupervised clustering algorithms. They capture the most common patterns and are good features for coarse-grain recognition tasks like object classification. But for those tasks which deal with subtle differences such as pose estimation, such representation may lack the needed discriminative power. In this paper, we propose to jointly learn the visual words and the pose regressors in a supervised manner. More specifically, we learn an individual distance metric for each visual word to optimize the pose estimation performance. The learned metrics rescale the visual words to suppress unimportant dimensions such as those corresponding to background. Another contribution is that we design an appearance and position context (APC) local descriptor that achieves both selectivity and invariance while requiring no background subtraction. We test our approach on both a quasi-synthetic dataset and a real dataset (HumanEva) to verify its effectiveness. Our approach also achieves fast computational speed thanks to the integral histograms used in APC descriptor extraction and fast inference of pose regressors.

A graph-based recommender system for digital library <=SEP=> Research shows that recommendations comprise a valuable service for users of a digital library [11]. While most existing recommender systems rely either on a content-based approach or a collaborative approach to make recommendations, there is potential to improve recommendation quality by using a combination of both approaches (a hybrid approach). In this paper, we report how we tested the idea of using a graph-based recommender system that naturally combines the content-based and collaborative approaches. Due to the similarity between our problem and a concept retrieval task, a Hopfield net algorithm was used to exploit high-degree book-book, user-user and book-user associations. Sample hold-out testing and preliminary subject testing were conducted to evaluate the system, by which it was found that the system gained improvement with respect to both precision and recall by combining content-based and collaborative approaches. However, no significant improvement was observed by exploiting high-degree associations.

Real-time people counting system using video camera <=SEP=> In this MTech thesis experiments will be tried out on a people counting system in an effort to enhance the accuracy when separating counting groups of people, and nonhuman objects. This system features automatic color equalization, adaptive background subtraction, shadow detection algorithm and Kalman tracking. The aim is to develop a reliable and accurate computer vision alternative to sensor or contact based mechanisms. The problem for many computer vision based systems are making good separation between the background and foreground, and teaching the computers what parts make up a scene. We also want to find features to classify the foreground moving objects, an easy task for a human, but a complex task for a computer. Video has been captured with a birds eye view close to one of the entrances at the school about ten meters above the floor. From this video troublesome parts have been selected to test the changes done to the algorithms and program code.

Bicycle dynamics and control: adapted bicycles for education and research <=SEP=> In this paper, the dynamics of bicycles is analyzed from the perspective of control. Models of different complexity are presented, starting with simple ones and ending with more realistic models generated from multibody software. Models that capture essential behavior such as self-stabilization as well as models that demonstrate difficulties with rear wheel steering are considered. Experiences using bicycles in control education along with suggestions for fun and thought-provoking experiments with proven student attraction are presented. Finally, bicycles and clinical programs designed for children with disabilities are described.

A neostriatal habit learning system in humans. <=SEP=> Amnesic patients and nondemented patients with Parkinson's disease were given a probabilistic classification task in which they learned which of two outcomes would occur on each trial, given the particular combination of cues that appeared. Amnesic patients exhibited normal learning of the task but had severely impaired declarative memory for the training episode. In contrast, patients with Parkinson's disease failed to learn the probabilistic classification task, despite having intact memory for the training episode. This double dissociation shows that the limbic-diencephalic regions damaged in amnesia and the neostriatum damaged in Parkinson's disease support separate and parallel learning systems. In humans, the neostriatum (caudate nucleus and putamen) is essential for the gradual, incremental learning of associations that is characteristic of habit learning. The neostriatum is important not just for motor behavior and motor learning but also for acquiring nonmotor dispositions and tendencies that depend on new associations.

On Removing Routing Protocol from Future Wireless Networks: A Real-time Deep Learning Approach for Intelligent Traffic Control <=SEP=> Recently, deep learning has appeared as a breakthrough machine learning technique for various areas in computer science as well as other disciplines. However, the application of deep learning for network traffic control in wireless/heterogeneous networks is a relatively new area. With the evolution of wireless networks, efficient network traffic control such as routing methodology in the wireless backbone network appears as a key challenge. This is because the conventional routing protocols do not learn from their previous experiences regarding network abnormalities such as congestion and so forth. Therefore, an intelligent network traffic control method is essential to avoid this problem. In this article, we address this issue and propose a new, real-time deep learning based intelligent network traffic control method, exploiting deep Convolutional Neural Networks (deep CNNs) with uniquely characterized inputs and outputs to represent the considered Wireless Mesh Network (WMN) backbone. Simulation results demonstrate that our proposal achieves significantly lower average delay and packet loss rate compared to those observed with the existing routing methods. We particularly focus on our proposed method's independence from existing routing protocols, which makes it a potential candidate to remove routing protocol(s) from future wired/ wireless networks.

Development of a 6-DOF manipulator actuated with a straight-fiber-type artificial muscle <=SEP=> Robots have become an integral part of human life, and the relationship between humans and robots has grown closer. Thus, it is desired that robots have characteristics similar to humans. In this context, we paid attention to an artificial muscle actuator. We used straight-fiber-type artificial muscles, derived from the McKibben type, which have excellent characteristics with respect to the contraction rate and force. We developed a 6-DOF manipulator actuated by a straight fiber artificial muscle. Furthermore, we tried to control the manipulator position by considering its characteristics.

From smart to smarter cities: Bridging the dimensions of technology and urban planning <=SEP=> This paper discusses the importance of urban form in smart cities. Development of urban form has been a major concern for urban planners, designers and policy makers. Sprawl is one way of urban development which is not considered good for a better living standard. Compact form arose as an opposed idea to urban sprawl. Form based codes (FBCs) is a tool for urban planning and design that attempts to mitigate the problem of urban sprawl, whereas conventional zoning strengthens this. This paper highlights the importance of physical place in smart city and how FBCs attempt to create better physical place than conventional zoning. Our study shows that FBCs can lead to smart growth which can be a solution to bridge technology and urban planning together in a single platform.

How to learn a graph from smooth signals <=SEP=> We propose a framework that learns the graph structure underlying a set of smooth signals. Given X ∈ Rm×n whose rows reside on the vertices of an unknown graph, we learn the edge weights w ∈ R + under the smoothness assumption that tr ( X>LX ) is small. We show that the problem is a weighted `-1 minimization that leads to naturally sparse solutions. We point out how known graph learning or construction techniques fall within our framework and propose a new model that performs better than the state of the art in many settings. We present efficient, scalable primal-dual based algorithms for both our model and the previous state of the art, and evaluate their performance on artificial and real data.

Thin-Slicing for Pose: Learning to Understand Pose without Explicit Pose Estimation <=SEP=> We address the problem of learning a pose-aware, compact embedding that projects images with similar human poses to be placed close-by in the embedding space. The embedding function is built on a deep convolutional network, and trained with triplet-based rank constraints on real image data. This architecture allows us to learn a robust representation that captures differences in human poses by effectively factoring out variations in clothing, background, and imaging conditions in the wild. For a variety of pose-related tasks, the proposed pose embedding provides a cost-efficient and natural alternative to explicit pose estimation, circumventing challenges of localizing body joints. We demonstrate the efficacy of the embedding on pose-based image retrieval and action recognition problems.

Regions, Periods, Activities: Uncovering Urban Dynamics via Cross-Modal Representation Learning <=SEP=> With the ever-increasing urbanization process, systematically modeling people’s activities in the urban space is being recognized as a crucial socioeconomic task. This task was nearly impossible years ago due to the lack of reliable data sources, yet the emergence of geo-tagged social media (GTSM) data sheds new light on it. Recently, there have been fruitful studies on discovering geographical topics from GTSM data. However, their high computational costs and strong distributional assumptions about the latent topics hinder them from fully unleashing the power of GTSM. To bridge the gap, we present CrossMap, a novel crossmodal representation learning method that uncovers urban dynamics with massive GTSM data. CrossMap first employs an accelerated mode seeking procedure to detect spatiotemporal hotspots underlying people’s activities. Those detected hotspots not only address spatiotemporal variations, but also largely alleviate the sparsity of the GTSM data. With the detected hotspots, CrossMap then jointly embeds all spatial, temporal, and textual units into the same space using two different strategies: one is reconstructionbased and the other is graph-based. Both strategies capture the correlations among the units by encoding their cooccurrence and neighborhood relationships, and learn lowdimensional representations to preserve such correlations. Our experiments demonstrate that CrossMap not only significantly outperforms state-of-the-art methods for activity recovery and classification, but also achieves much better efficiency.

A 3.4 W Digital-In Class-D Audio Amplifier in 0.14 $\mu $m CMOS <=SEP=> In this paper a class-D audio amplifier for mobile applications is presented realized in a 0.14 μm CMOS technology tailored for mobile applications. The amplifier has a simple PDM-based digital interface for audio and control that requires only two pins and enables assembly in 9-bump WL-CSP. The complete audio path is discussed that consists of a Parser, Digital PWM controller, 1-bit DA-converters, analog feedback loop and the Class-D power stage. A reconfigurable gate driver is used that reduces quiescent current consumption and radiated emission.

A new paradigm of human gait analysis with Kinect <=SEP=> Analysis of human gait helps to find an intrinsic gait signature through which ubiquitous human identification and medical disorder problems can be investigated in a broad spectrum. The gait biometric provides an unobtrusive feature by which video gait data can be captured at a larger distance without prior awareness of the subject. In this paper, a new technique has been addressed to study the human gait analysis with Kinect Xbox device. It ensures us to minimize the segmentation errors with automated background subtraction technique. The closely similar human skeleton model can be generated from background subtracted gait images, altered by covariate conditions, such as change in walking speed and variations in clothing type. The gait signatures are captured from joint angle trajectories of left hip, left knee, right hip and right knee of subject's skeleton model. The experimental verification on Kinect gait data has been compared with our in-house development of sensor based biometric suit, Intelligent Gait Oscillation Detector (IGOD). An endeavor has been taken to investigate whether this sensor based biometric suit can be altered with a Kinect device for the proliferation of robust gait identification system. The Fisher discriminant analysis has been applied on training gait signature to look into the discriminatory power of feature vector. The Naïve Bayesian classifier demonstrates an encouraging classification result with estimation of errors on limited dataset captured by Kinect sensor.

Employee Engagement From a Self-Determination Theory Perspective <=SEP=> Macey and Schneider (2008) draw on numerous theories to explain what engagement is and how it is similar to and different from related constructs in the organizational behavior literature. As a result, we now have a better understanding of some of the key ‘‘components’’ of engagement. What appears to be missing, however, is a strong unifying theory to guide research and practice. We believe that such a theory exists in the form of self-determination theory (SDT; Deci & Ryan, 1985; Ryan & Deci, 2000) and its various corollaries, self-concordance theory (SCT; Sheldon & Elliot, 1999), hierarchical theory (Vallerand, 1997), and passion theory (Vallerand et al., 2003). Although Macey and Schneider acknowledged the relevance of SDT and SCT, we believe that much greater use of these theories could be made to justify and extend their conceptual model.

Cyber and Physical Security Vulnerability Assessment for IoT-Based Smart Homes <=SEP=> The Internet of Things (IoT) is an emerging paradigm focusing on the connection of devices, objects, or "things" to each other, to the Internet, and to users. IoT technology is anticipated to become an essential requirement in the development of smart homes, as it offers convenience and efficiency to home residents so that they can achieve better quality of life. Application of the IoT model to smart homes, by connecting objects to the Internet, poses new security and privacy challenges in terms of the confidentiality, authenticity, and integrity of the data sensed, collected, and exchanged by the IoT objects. These challenges make smart homes extremely vulnerable to different types of security attacks, resulting in IoT-based smart homes being insecure. Therefore, it is necessary to identify the possible security risks to develop a complete picture of the security status of smart homes. This article applies the operationally critical threat, asset, and vulnerability evaluation (OCTAVE) methodology, known as OCTAVE Allegro, to assess the security risks of smart homes. The OCTAVE Allegro method focuses on information assets and considers different information containers such as databases, physical papers, and humans. The key goals of this study are to highlight the various security vulnerabilities of IoT-based smart homes, to present the risks on home inhabitants, and to propose approaches to mitigating the identified risks. The research findings can be used as a foundation for improving the security requirements of IoT-based smart homes.

Handshaking, gender, personality, and first impressions. <=SEP=> Although people's handshakes are thought to reflect their personality and influence our first impressions of them, these relations have seldom been formally investigated. One hundred twelve participants had their hand shaken twice by 4 trained coders (2 men and 2 women) and completed 4 personality measures. The participants' handshakes were stable and consistent across time and coders. There were also gender differences on most of the handshaking characteristics. A firm handshake was related positively to extraversion and emotional expressiveness and negatively to shyness and neuroticism; it was also positively related to openness to experience, but only for women. Finally, handshake characteristics were related to the impressions of the participants formed by the coders. These results demonstrate that personality traits, assessed through self-report, can predict specific behaviors assessed by trained observers. The pattern of relations among openness, gender, handshaking, and first impressions suggests that a firm handshake may be an effective form of self-promotion for women.

Large-Scale Network Dysfunction in Major Depressive Disorder: A Meta-analysis of Resting-State Functional Connectivity. <=SEP=> IMPORTANCE
Major depressive disorder (MDD) has been linked to imbalanced communication among large-scale brain networks, as reflected by abnormal resting-state functional connectivity (rsFC). However, given variable methods and results across studies, identifying consistent patterns of network dysfunction in MDD has been elusive.


OBJECTIVE
To investigate network dysfunction in MDD through a meta-analysis of rsFC studies.


DATA SOURCES
Seed-based voxelwise rsFC studies comparing individuals with MDD with healthy controls (published before June 30, 2014) were retrieved from electronic databases (PubMed, Web of Science, and EMBASE) and authors contacted for additional data.


STUDY SELECTION
Twenty-seven seed-based voxel-wise rsFC data sets from 25 publications (556 individuals with MDD and 518 healthy controls) were included in the meta-analysis.


DATA EXTRACTION AND SYNTHESIS
Coordinates of seed regions of interest and between-group effects were extracted. Seeds were categorized into seed-networks by their location within a priori functional networks. Multilevel kernel density analysis of between-group effects identified brain systems in which MDD was associated with hyperconnectivity (increased positive or reduced negative connectivity) or hypoconnectivity (increased negative or reduced positive connectivity) with each seed-network.


RESULTS
Major depressive disorder was characterized by hypoconnectivity within the frontoparietal network, a set of regions involved in cognitive control of attention and emotion regulation, and hypoconnectivity between frontoparietal systems and parietal regions of the dorsal attention network involved in attending to the external environment. Major depressive disorder was also associated with hyperconnectivity within the default network, a network believed to support internally oriented and self-referential thought, and hyperconnectivity between frontoparietal control systems and regions of the default network. Finally, the MDD groups exhibited hypoconnectivity between neural systems involved in processing emotion or salience and midline cortical regions that may mediate top-down regulation of such functions.


CONCLUSIONS AND RELEVANCE
Reduced connectivity within frontoparietal control systems and imbalanced connectivity between control systems and networks involved in internal or external attention may reflect depressive biases toward internal thoughts at the cost of engaging with the external world. Meanwhile, altered connectivity between neural systems involved in cognitive control and those that support salience or emotion processing may relate to deficits regulating mood. These findings provide an empirical foundation for a neurocognitive model in which network dysfunction underlies core cognitive and affective abnormalities in depression.

Greedy Function Approximation : A Gradient Boosting Machine <=SEP=> Function approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest{descent minimization. A general gradient{descent \boosting" paradigm is developed for additive expansions based on any tting criterion. Speci c algorithms are presented for least{squares, least{absolute{deviation, and Huber{M loss functions for regression, and multi{class logistic likelihood for classi cation. Special enhancements are derived for the particular case where the individual additive components are decision trees, and tools for interpreting such \TreeBoost" models are presented. Gradient boosting of decision trees produces competitive, highly robust, interpretable procedures for regression and classi cation, especially appropriate for mining less than clean data. Connections between this approach and the boosting methods of Freund and Shapire 1996, and Friedman, Hastie, and Tibshirani 1998 are discussed. 1 Function estimation In the function estimation problem one has a system consisting of a random \output" or \response" variable y and a set of random \input" or \explanatory" variables x = fx1; ; xng. Given a \training" sample fyi;xig N 1 of known (y;x){values, the goal is to nd a function F (x) that maps x to y, such that over the joint distribution of all (y;x){values, the expected value of some speci ed loss function (y; F (x)) is minimized F (x) = argmin F (x) Ey;x (y; F (x)) = argmin F (x) Ex [Ey( (y; F (x)) jx] : (1) Frequently employed loss functions (y; F ) include squared{error (y F ) and absolute error jy F j for y 2 R (regression), and negative binomial log{likelihood, log(1 + e 2yF ), when y 2 f 1; 1g (classi cation). A common procedure is to take F (x) to be a member of a parameterized class of functions F (x;P), where P = fP1; P2; g is a set of parameters. In this paper we focus on \additive" expansions of the form

FPGA implementations of fast fourier transforms for real-time signal and image processing <=SEP=> Applications based on Fast Fourier Transform (FFT) such as signal and image processing require high computational power, plus the ability to experiment with algorithms. Reconfigurable hardware devices in the form of Field Programmable Gate Arrays (FPGAs) have been proposed as a way of obtaining high performance at an economical price. At present, however, users must program FPGAs at a very low level and have a detailed knowledge of the architecture of the device being used. To try to reconcile the dual requirements of high performance and ease of development, this paper reports on the design and realisation of a High Level framework for the implementation of 1-D and 2-D FFTs for real-time applications. Results show that the parallel implementation of 2-D FFT achieves virtually linear speed-up and real-time performance for large matrix sizes. Finally, an FPGA-based parametrisable environment based on the developed parallel 2-D FFT architecture is presented as a solution for frequencydomain image filtering application.

Priors for people tracking from small training sets <=SEP=> We advocate the use of scaled Gaussian process latent variable models (SGPLVM) to learn prior models of 3D human pose for 3D people tracking. The SGPLVM simultaneously optimizes a low-dimensional embedding of the high-dimensional pose data and a density function that both gives higher probability to points close to training data and provides a nonlinear probabilistic mapping from the low-dimensional latent space to the full-dimensional pose space. The SGPLVM is a natural choice when only small amounts of training data are available. We demonstrate our approach with two distinct motions, golfing and walking. We show that the SGPLVM sufficiently constrains the problem such that tracking can be accomplished with straightforward deterministic optimization.

Three dual polarized 2.4GHz microstrip patch antennas for active antenna and in-band full duplex applications <=SEP=> This paper presents the design, implementation and interport isolation performance evaluation of three dual port, dual polarized 2.4GHz microstrip patch antennas. Input matching and interport isolation (both DC and RF) performance of implemented antennas has been compared by measuring the input return losses (Sii, S22) and interport isolation (S12) respectively at 2.4GHz. Two implemented single layer antennas provide around 40dB RF interport isolation while the multilayer antenna has 60dB isolation between transmit and receive ports at centre frequency with DC isolated ports. The multilayer antenna provides more than 55dB interport isolation for antenna's 10 dB input impedance bandwidth of 50MHz.