ORCID Profile
0000-0002-9965-9483
Current Organisation
University of New South Wales
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Data Format | Signal Processing | Signal Processing | Simulation And Modelling | Electrical and Electronic Engineering | Coding and Information Theory | Coding And Information Theory | Computer Graphics | Medical Devices | Computer Software | Wireless Communications | Software Engineering | Distributed and Grid Systems | Image Processing | Numerical Computation | Concurrent Programming | Computer-Human Interaction | Communications Technologies | Simulation and Modelling | Radio Communications And Broadcasting Not Elsewhere Classified | Communications Technologies Not Elsewhere Classified | Data Communications
Telecommunications | Communication equipment not elsewhere classified | Broadcasting equipment | Application tools and system utilities | Application packages | Information Services not elsewhere classified | Expanding Knowledge in the Medical and Health Sciences | Mathematical sciences | Computer software and services not elsewhere classified | Fixed Line Data Networks and Services | Satellite Communication Networks and Services | Electronic Information Storage and Retrieval Services | Mobile Data Networks and Services | Expanding Knowledge in Engineering |
Publisher: IEEE
Date: 04-2016
Publisher: ETH Zurich
Date: 2010
Publisher: MDPI AG
Date: 11-01-2022
DOI: 10.3390/E24010109
Abstract: This paper studies how to attain fairness in communication for omniscience that models the multi-terminal compress sensing problem and the coded cooperative data exchange problem where a set of users exchange their observations of a discrete multiple random source to attain omniscience—the state that all users recover the entire source. The optimal rate region containing all source coding rate vectors that achieve omniscience with the minimum sum rate is shown to coincide with the core (the solution set) of a coalitional game. Two game-theoretic fairness solutions are studied: the Shapley value and the egalitarian solution. It is shown that the Shapley value assigns each user the source coding rate measured by their remaining information of the multiple source given the common randomness that is shared by all users, while the egalitarian solution simply distributes the rates as evenly as possible in the core. To avoid the exponentially growing complexity of obtaining the Shapley value, a polynomial-time approximation method is proposed which utilizes the fact that the Shapley value is the mean value over all extreme points in the core. In addition, a steepest descent algorithm is proposed that converges in polynomial time on the fractional egalitarian solution in the core, which can be implemented by network coding schemes. Finally, it is shown that the game can be decomposed into subgames so that both the Shapley value and the egalitarian solution can be obtained within each subgame in a distributed manner with reduced complexity.
Publisher: IEEE
Date: 08-2019
Publisher: IEEE
Date: 2016
Publisher: IEEE
Date: 07-2019
Publisher: IEEE
Date: 10-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2010
Publisher: IEEE
Date: 02-2014
Publisher: IEEE
Date: 12-2011
Publisher: IEEE
Date: 11-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: IEEE
Date: 09-2008
Publisher: IEEE
Date: 05-2011
Publisher: IEEE
Date: 08-2017
Publisher: IEEE
Date: 12-2016
Publisher: IEEE
Date: 12-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2012
Publisher: Institution of Engineering and Technology (IET)
Date: 10-2013
Publisher: IEEE
Date: 06-2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2018
Publisher: Elsevier BV
Date: 07-2017
DOI: 10.1016/J.YEXCR.2017.03.030
Abstract: The hypoxia inducible factors (HIFs) promote changes in gene expression in response to hypoxia, and mediate key physiological responses such as angiogenesis. They play important roles in development and normal physiology, as well as in ischaemic and other pathologies. The human eye is a complex organ, with tight regulation of vascularisation and oxygen delivery, with the highly specialised retina containing both highly vascularised and avascular regions. This review, written to honour the significant contribution of Lorenz Poellinger to this field, covers the role of the HIFs in normal development of the eye, specifically the vasculature, as well as their roles in numerous retinal pathologies, including ischaemic retinopathies, and age-related macular degeneration (AMD). The characterisation of the HIFs in the eye has improved our understanding of the development, function, and numerous pathologies of the eye, and should inform future therapeutic approaches.
Publisher: IEEE
Date: 2010
Publisher: IEEE
Date: 12-2016
Publisher: IEEE
Date: 06-2009
Publisher: IEEE
Date: 2009
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2014
Publisher: Elsevier BV
Date: 08-2010
DOI: 10.1016/J.CMPB.2009.11.004
Abstract: Due to processing constraints, automatic image-based registration of medical images has been largely used as a pre-operative tool. We propose a novel method named sort and count for efficient parallelization of mutual information (MI) computation designed for massively multi-processing architectures. Combined with a parallel transformation implementation and an improved optimization algorithm, our method achieves real-time (less than 1s) rigid registration of 3D medical images using a commodity graphics processing unit (GPU). This represents a more than 50-fold improvement over a standard implementation on a CPU. Real-time registration opens new possibilities for development of improved and interactive intraoperative tools that can be used for enhanced visualization and navigation during an intervention.
Publisher: IEEE
Date: 04-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2016
Publisher: Springer Science and Business Media LLC
Date: 06-11-2015
Publisher: IEEE
Date: 2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2012
Publisher: Institution of Engineering and Technology (IET)
Date: 2012
Publisher: IEEE
Date: 2003
Publisher: IEEE
Date: 04-2007
Publisher: IEEE
Date: 2005
Publisher: Springer Science and Business Media LLC
Date: 17-11-2015
Publisher: IEEE
Date: 11-2019
Publisher: IEEE
Date: 07-2011
Publisher: IEEE
Date: 03-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2013
Publisher: IEEE
Date: 12-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2021
Publisher: IEEE
Date: 04-2009
Publisher: IEEE
Date: 11-2019
Publisher: IEEE
Date: 12-2007
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2023
Publisher: IEEE
Date: 12-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2021
Publisher: IEEE
Date: 2005
Publisher: IEEE
Date: 06-2011
Publisher: IEEE
Date: 03-2012
Publisher: IEEE
Date: 2012
Publisher: Cambridge University Press
Date: 05-03-2013
Abstract: This lively and accessible book describes the theory and applications of Hilbert spaces and also presents the history of the subject to reveal the ideas behind theorems and the human struggle that led to them. The authors begin by establishing the concept of 'countably infinite', which is central to the proper understanding of separable Hilbert spaces. Fundamental ideas such as convergence, completeness and dense sets are first demonstrated through simple familiar ex les and then formalised. Having addressed fundamental topics in Hilbert spaces, the authors then go on to cover the theory of bounded, compact and integral operators at an advanced but accessible level. Finally, the theory is put into action, considering signal processing on the unit sphere, as well as reproducing kernel Hilbert spaces. The text is interspersed with historical comments about central figures in the development of the theory, which helps bring the subject to life.
Publisher: IEEE
Date: 2007
Publisher: IEEE
Date: 12-2011
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2012
Publisher: IEEE
Date: 2009
Publisher: IEEE
Date: 05-2011
Publisher: IEEE
Date: 06-2014
Publisher: IEEE
Date: 06-2013
Publisher: IEEE
Date: 06-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2019
Publisher: IEEE
Date: 06-2017
Publisher: IEEE
Date: 11-2009
Publisher: Ovid Technologies (Wolters Kluwer Health)
Date: 06-2011
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2007
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: IEEE
Date: 12-2011
Publisher: IEEE
Date: 04-2018
Publisher: IEEE
Date: 06-2007
Publisher: IEEE
Date: 09-2011
Publisher: IEEE
Date: 10-2010
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2011
Publisher: IEEE
Date: 06-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2014
Publisher: IEEE
Date: 11-2014
Publisher: IEEE
Date: 06-2018
Publisher: IEEE
Date: 06-2014
Publisher: IEEE
Date: 2003
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2005
Publisher: IEEE
Date: 2010
Publisher: SPIE
Date: 26-09-2013
DOI: 10.1117/12.2023932
Publisher: SPIE
Date: 26-09-2013
DOI: 10.1117/12.2026126
Publisher: IEEE
Date: 10-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2011
Publisher: IEEE
Date: 06-2009
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2016
Publisher: IEEE
Date: 06-2014
Publisher: IEEE
Date: 10-2007
Publisher: IEEE
Date: 12-2016
Publisher: IEEE
Date: 06-2010
Publisher: IEEE
Date: 06-2015
Publisher: IEEE
Date: 11-2009
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2009
Publisher: IEEE
Date: 09-2012
Publisher: IEEE
Date: 05-2014
Publisher: IEEE
Date: 09-2012
Publisher: IEEE
Date: 05-2016
Publisher: IEEE
Date: 04-2012
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: IEEE
Date: 12-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2017
Publisher: IEEE
Date: 04-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2009
Publisher: IEEE
Date: 06-2014
Publisher: IEEE
Date: 2016
Publisher: IEEE
Date: 06-2015
Publisher: IEEE
Date: 11-2014
Publisher: IEEE
Date: 2006
Publisher: IEEE
Date: 09-2011
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2012
Publisher: IEEE
Date: 06-2011
Publisher: IEEE
Date: 2003
Publisher: IEEE
Date: 09-2012
Publisher: IEEE
Date: 06-2015
Publisher: MDPI AG
Date: 18-04-2023
DOI: 10.3390/E25040679
Abstract: This paper investigates lift, the likelihood ratio between the posterior and prior belief about sensitive features in a dataset. Maximum and minimum lifts over sensitive features quantify the adversary’s knowledge gain and should be bounded to protect privacy. We demonstrate that max- and min-lifts have a distinct range of values and probability of appearance in the dataset, referred to as lift asymmetry. We propose asymmetric local information privacy (ALIP) as a compatible privacy notion with lift asymmetry, where different bounds can be applied to min- and max-lifts. We use ALIP in the watchdog and optimal random response (ORR) mechanisms, the main methods to achieve lift-based privacy. It is shown that ALIP enhances utility in these methods compared to existing local information privacy, which ensures the same (symmetric) bounds on both max- and min-lifts. We propose subset merging for the watchdog mechanism to improve data utility and subset random response for the ORR to reduce complexity. We then investigate the related lift-based measures, including ℓ1-norm, χ2-privacy criterion, and α-lift. We reveal that they can only restrict max-lift, resulting in significant min-lift leakage. To overcome this problem, we propose corresponding lift-inverse measures to restrict the min-lift. We apply these lift-based and lift-inverse measures in the watchdog mechanism. We show that they can be considered as relaxations of ALIP, where a higher utility can be achieved by bounding only average max- and min-lifts.
Publisher: IEEE
Date: 06-2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2012
Publisher: IEEE
Date: 06-2007
Publisher: IEEE
Date: 04-2015
Publisher: IEEE
Date: 04-2012
Publisher: IEEE
Date: 07-2013
Publisher: Springer Science and Business Media LLC
Date: 08-01-2016
Publisher: IEEE
Date: 07-2013
Publisher: IEEE
Date: 07-2006
Publisher: IEEE
Date: 09-2012
Publisher: IEEE
Date: 09-2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2016
Publisher: Elsevier BV
Date: 12-2015
Publisher: IEEE
Date: 2005
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: IEEE
Date: 2010
Publisher: IEEE
Date: 2010
Publisher: IEEE
Date: 06-2014
Publisher: IEEE
Date: 12-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2013
Publisher: IEEE
Date: 03-2012
Publisher: IEEE
Date: 05-2009
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2018
Publisher: ETH Zurich
Date: 2020
Publisher: IEEE
Date: 02-2009
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2009
Publisher: IEEE
Date: 04-2015
Publisher: IEEE
Date: 02-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2021
Publisher: IEEE
Date: 06-2018
Publisher: IEEE
Date: 06-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2009
Publisher: IEEE
Date: 06-2009
Publisher: Springer Science and Business Media LLC
Date: 14-04-2010
DOI: 10.1155/2010/618016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2017
Publisher: IEEE
Date: 2011
Publisher: IEEE
Date: 06-2015
Publisher: IEEE
Date: 04-2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2013
Publisher: IEEE
Date: 09-2018
Publisher: IEEE
Date: 07-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2010
Publisher: IEEE
Date: 09-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2016
Publisher: Elsevier BV
Date: 04-2011
Publisher: IEEE
Date: 11-2008
Start Date: 11-2020
End Date: 11-2024
Amount: $996,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2010
End Date: 06-2014
Amount: $240,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 03-2017
End Date: 06-2020
Amount: $381,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2007
End Date: 12-2010
Amount: $315,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 02-2012
End Date: 12-2016
Amount: $360,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 03-2010
End Date: 12-2014
Amount: $805,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2009
End Date: 12-2012
Amount: $240,000.00
Funder: Australian Research Council
View Funded Activity