ORCID Profile
0000-0001-7225-5449
Current Organisations
University of Science and Technology of China
,
University of London
,
University of Sydney
,
Chinese University of Hong Kong
,
The Hong Kong Polytechnic University
,
Nanyang Technological University
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.
Artificial Intelligence and Image Processing | Pattern Recognition and Data Mining | Computer Vision | Statistics | Computer Hardware not elsewhere classified | Knowledge Representation and Machine Learning | Artificial Intelligence and Image Processing not elsewhere classified | Applied Statistics | Computer Hardware | Microelectromechanical Systems (MEMS) | Natural Resource Management | Business Information Management (incl. Records, Knowledge and Information Management, and Intelligence)
Film and Video Services (excl. Animation and Computer Generated Imagery) | Intelligence | Information Processing Services (incl. Data Entry and Capture) | Electronic Information Storage and Retrieval Services | Expanding Knowledge in the Information and Computing Sciences | Environmental Management Systems | Road Safety | Plant Production and Plant Primary Products not elsewhere classified | Social Structure and Health | Mental Health | Expanding Knowledge in Technology | Application Software Packages (excl. Computer Games) | Fisheries - Aquaculture not elsewhere classified | Application Tools and System Utilities | Information and Communication Services not elsewhere classified | Precious (Noble) Metal Ore Exploration | Property, Business Support Services and Trade not elsewhere classified | Mining Land and Water Management |
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2020
Publisher: Association for Computing Machinery (ACM)
Date: 13-07-2023
DOI: 10.1145/3576918
Abstract: With the development of convolutional neural networks, hundreds of deep learning–based dehazing methods have been proposed. In this article, we provide a comprehensive survey on supervised, semi-supervised, and unsupervised single image dehazing. We first discuss the physical model, datasets, network modules, loss functions, and evaluation metrics that are commonly used. Then, the main contributions of various dehazing algorithms are categorized and summarized. Further, quantitative and qualitative experiments of various baseline methods are carried out. Finally, the unsolved issues and challenges that can inspire the future research are pointed out. A collection of useful dehazing materials is available at github.com/Xiaofeng-life/AwesomeDehazing .
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Research Square Platform LLC
Date: 25-09-2020
DOI: 10.21203/RS.3.RS-80242/V1
Abstract: Quantum neural network (QNN), or equivalently, the variational quantum circuits with a gradient-based classical optimizer, has been broadly applied to many experimental proposals for noisy intermediate scale quantum (NISQ) devices. However, the learning capability of QNN remains largely unknown due to the non-convex optimization landscape, the measurement error, and the unavoidable gate noise introduced by NISQ machines. In this study, we theoretically explore the learnability of QNN from the perspective of the trainability and generalization. Particularly, we derive the convergence performance of QNN under the NISQ setting, and identify classes of computationally hard concepts that can be efficiently learned by QNN. Our results demonstrate that large gate noise, few quantum measurements, and deep circuit depth will lead to poor convergence rates of QNN towards the empirical risk minimization. Moreover, we prove that any concept class, which is efficiently learnable by a restricted quantum statistical query (QSQ) learning model, can also be efficiently learned by QNN. Since the restricted QSQ learning model can tackle certain problems such as parity learning with a runtime speedup, our result suggests that QNN established on NISQ devices will retain the quantum advantage. Our work provides the theoretical guidance for developing advanced QNNs and opens up avenues for exploring quantum advantages using NISQ devices.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2021
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2020
Publisher: Springer Science and Business Media LLC
Date: 07-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2023
Publisher: American Physical Society (APS)
Date: 14-03-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Springer Science and Business Media LLC
Date: 19-08-2021
Publisher: Springer Science and Business Media LLC
Date: 04-01-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: ACM
Date: 27-04-2242
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Springer Science and Business Media LLC
Date: 04-01-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2022
Publisher: Association for Computing Machinery (ACM)
Date: 20-04-2017
DOI: 10.1145/2987379
Abstract: Image annotation assigns relevant tags to query images based on their semantic contents. Since Non-negative Matrix Factorization (NMF) has the strong ability to learn parts-based representations, recently, a number of algorithms based on NMF have been proposed for image annotation and have achieved good performance. However, most of the efforts have focused on the representations of images and annotations. The properties of the semantic parts have not been well studied. In this article, we revisit the sparseness-constrained NMF (sNMF) proposed by Hoyer [2004]. By endowing the sparseness constraint with a geometric interpretation and sNMF with theoretical analyses of the generalization ability, we show that NMF with such a sparseness constraint has three advantages for image annotation tasks: (i) The sparseness constraint is more ℓ 0 -norm oriented than the ℓ 1 -norm-based sparseness, which significantly enhances the ability of NMF to robustly learn semantic parts. (ii) The sparseness constraint has a large cone interpretation and thus allows the reconstruction error of NMF to be smaller, which means that the learned semantic parts are more powerful to represent images for tagging. (iii) The learned semantic parts are less correlated, which increases the discriminative ability for annotating images. Moreover, we present a new efficient large sparse cone NMF (LsCNMF) algorithm to optimize the sNMF problem by employing the Nesterov’s optimal gradient method. We conducted experiments on the PASCAL VOC07 dataset and demonstrated the effectiveness of LsCNMF for image annotation.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 15-03-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2022
Publisher: Association for Computing Machinery (ACM)
Date: 21-10-2023
DOI: 10.1145/3625558
Publisher: ACM
Date: 26-10-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2019
Publisher: Springer Science and Business Media LLC
Date: 05-07-2023
DOI: 10.1007/S11263-023-01837-3
Abstract: Recent studies have shown promising results on joint learning of local feature detectors and descriptors. To address the lack of ground-truth keypoint supervision, previous methods mainly inject appropriate knowledge about keypoint attributes into the network to facilitate model learning. In this paper, inspired by traditional corner detectors, we develop an end-to-end deep network, named Deep Corner, which adds a local similarity-based keypoint measure into a plain convolutional network. Deep Corner enables finding reliable keypoints and thus benefits the learning of the distinctive descriptors. Moreover, to improve keypoint localization, we first study previous multi-level keypoint detection strategies and then develop a multi-level U-Net architecture, where the similarity of features at multiple levels can be exploited effectively. Finally, to improve the invariance of descriptors, we propose a feature self-transformation operation, which transforms the learned features adaptively according to the specific local information. The experimental results on several tasks and comprehensive ablation studies demonstrate the effectiveness of our method and the involved components.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2018
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2019
Publisher: ACM
Date: 30-04-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2018
Publisher: Springer Science and Business Media LLC
Date: 23-05-2022
DOI: 10.1038/S41534-022-00570-Y
Abstract: Variational quantum algorithms (VQAs) are expected to be a path to quantum advantages on noisy intermediate-scale quantum devices. However, both empirical and theoretical results exhibit that the deployed ansatz heavily affects the performance of VQAs such that an ansatz with a larger number of quantum gates enables a stronger expressivity, while the accumulated noise may render a poor trainability. To maximally improve the robustness and trainability of VQAs, here we devise a resource and runtime efficient scheme termed quantum architecture search (QAS). In particular, given a learning task, QAS automatically seeks a near-optimal ansatz (i.e., circuit architecture) to balance benefits and side-effects brought by adding more noisy quantum gates to achieve a good performance. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks. In the problems studied, numerical and experimental results show that QAS cannot only alleviate the influence of quantum noise and barren plateaus but also outperforms VQAs with pre-selected ansatze.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2019
Publisher: Springer Science and Business Media LLC
Date: 12-08-2022
DOI: 10.1007/S11263-022-01659-9
Abstract: In this paper, we propose a unified information theoretic framework for learning-motivated methods aimed at odometry estimation, a crucial component of many robotics and vision tasks such as navigation and virtual reality where relative camera poses are required in real time. We formulate this problem as optimizing a variational information bottleneck objective function, which eliminates pose-irrelevant information from the latent representation. The proposed framework provides an elegant tool for performance evaluation and understanding in information-theoretic language. Specifically, we bound the generalization errors of the deep information bottleneck framework and the predictability of the latent representation. These provide not only a performance guarantee but also practical guidance for model design, s le collection, and sensor selection. Furthermore, the stochastic latent representation provides a natural uncertainty measure without the needs for extra structures or computations. Experiments on two well-known odometry datasets demonstrate the effectiveness of our method.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: ACM
Date: 26-10-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Springer Science and Business Media LLC
Date: 15-10-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 15-09-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 15-05-2021
Publisher: Springer Nature Switzerland
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2020
Publisher: Springer International Publishing
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Association for Computing Machinery (ACM)
Date: 15-02-2019
DOI: 10.1145/3301274
Abstract: As JPEG is the most widely used image format, the importance of t ering detection for JPEG images in blind forensics is self-evident. In this area, extracting effective statistical characteristics from a JPEG image for classification remains a challenge. Effective features are designed manually in traditional methods, suggesting that extensive labor-consuming research and derivation is required. In this article, we propose a novel image t ering detection method based on deep multi-scale discriminative networks (MSD-Nets). The multi-scale module is designed to automatically extract multiple features from the discrete cosine transform (DCT) coefficient histograms of the JPEG image. This module can capture the characteristic information in different scale spaces. In addition, a discriminative module is also utilized to improve the detection effect of the networks in those difficult situations when the first compression quality ( QF 1) is higher than the second one ( QF 2). A special network in this module is designed to distinguish the small statistical difference between authentic and t ered regions in these cases. Finally, a probability map can be obtained and the specific t ering area is located using the last classification results. Extensive experiments demonstrate the superiority of our proposed method in both quantitative and qualitative metrics when compared with state-of-the-art approaches.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: ACM
Date: 04-08-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: ACM
Date: 26-10-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Association for Computing Machinery (ACM)
Date: 04-09-2017
DOI: 10.1145/3090311
Abstract: Automatic age estimation is an important yet challenging problem. It has many promising applications in social media. Of the existing age estimation algorithms, the personalized approaches are among the most popular ones. However, most person-specific approaches rely heavily on the availability of training images across different ages for a single subject, which is usually difficult to satisfy in practical application of age estimation. To address this limitation, we first propose a new model called Orthogonal Gaussian Process (OGP), which is not restricted by the number of training s les per person. In addition, without sacrifice of discriminative power, OGP is much more computationally efficient than the standard Gaussian Process. Based on OGP, we then develop an effective age estimation approach, namely anisotropic OGP (A-OGP), to further reduce the estimation error. A-OGP is based on an anisotropic noise level learning scheme that contributes to better age estimation performance. To finally optimize the performance of age estimation, we propose a multifeature A-OGP fusion framework that uses multiple features combined with a random s ling method in the feature space. Extensive experiments on several public domain face aging datasets (FG-NET, MORPH Album1, and MORPH Album 2) are conducted to demonstrate the state-of-the-art estimation accuracy of our new algorithms.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2020
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2019
Publisher: Association for Computing Machinery (ACM)
Date: 27-09-2023
DOI: 10.1145/3568679
Publisher: Springer Science and Business Media LLC
Date: 31-01-2022
Publisher: Springer Science and Business Media LLC
Date: 10-01-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: American Physical Society (APS)
Date: 25-02-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2023
Publisher: Springer International Publishing
Date: 2020
Publisher: Springer Science and Business Media LLC
Date: 22-03-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2018
Location: United Kingdom of Great Britain and Northern Ireland
Start Date: 2014
End Date: 12-2017
Amount: $916,144.00
Funder: Australian Research Council
View Funded ActivityStart Date: 09-2015
End Date: 10-2015
Amount: $510,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2018
End Date: 12-2025
Amount: $3,208,192.00
Funder: Australian Research Council
View Funded ActivityStart Date: 06-2016
End Date: 12-2019
Amount: $550,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2014
End Date: 12-2017
Amount: $400,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 06-2018
End Date: 06-2021
Amount: $392,893.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2012
End Date: 11-2015
Amount: $378,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 03-2019
End Date: 03-2024
Amount: $5,000,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2014
End Date: 07-2015
Amount: $1,000,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 08-2020
End Date: 08-2025
Amount: $3,973,202.00
Funder: Australian Research Council
View Funded Activity