ORCID Profile
0000-0001-7790-6423
Current Organisation
University of Adelaide
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 | Computer Vision | Adaptive Agents and Intelligent Robotics | Pattern Recognition and Data Mining | Mining Engineering | Neural, Evolutionary and Fuzzy Computation |
Expanding Knowledge in the Information and Computing Sciences | Application Software Packages (excl. Computer Games) | Computer Software and Services not elsewhere classified | Plant Production and Plant Primary Products not elsewhere classified | Information Processing Services (incl. Data Entry and Capture) | Coal Mining and Extraction | Understanding Australia's Past | Emerging Defence Technologies | Mineral Exploration not elsewhere classified | Manufacturing not elsewhere classified
Publisher: IEEE
Date: 05-2011
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2018
Publisher: Springer International Publishing
Date: 2018
Publisher: IEEE
Date: 10-2016
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11744047_31
Publisher: Springer Science and Business Media LLC
Date: 04-1996
DOI: 10.1007/BF00126139
Publisher: Springer Science and Business Media LLC
Date: 05-2006
Publisher: IEEE
Date: 12-2013
Publisher: Springer International Publishing
Date: 2018
Publisher: IEEE
Date: 10-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: IEEE
Date: 06-2020
Publisher: IEEE
Date: 05-2017
Publisher: Elsevier BV
Date: 08-2009
Publisher: Elsevier BV
Date: 04-1992
Publisher: IEEE
Date: 06-2019
Publisher: Springer International Publishing
Date: 2019
Publisher: IEEE
Date: 06-2008
Publisher: Elsevier BV
Date: 05-2016
Publisher: IEEE
Date: 09-2017
Publisher: IEEE
Date: 2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2016
Publisher: IEEE
Date: 09-2017
Publisher: IEEE
Date: 06-2019
Publisher: Springer Science and Business Media LLC
Date: 2000
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2018
Publisher: Springer Berlin Heidelberg
Date: 1996
Publisher: IEEE
Date: 05-2010
Publisher: IEEE
Date: 12-2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: British Machine Vision Association
Date: 2007
DOI: 10.5244/C.21.8
Publisher: Springer Science and Business Media LLC
Date: 11-06-2014
Publisher: IEEE
Date: 06-2019
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Elsevier BV
Date: 08-1996
Publisher: IEEE
Date: 06-2018
Publisher: IEEE
Date: 05-2017
Publisher: Springer International Publishing
Date: 2015
Publisher: IEEE
Date: 10-2019
Publisher: Springer International Publishing
Date: 2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Springer International Publishing
Date: 2019
Publisher: IEEE
Date: 10-2013
Publisher: British Machine Vision Association
Date: 2009
DOI: 10.5244/C.23.54
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: IEEE
Date: 06-2019
Publisher: IEEE
Date: 05-2020
Publisher: British Machine Vision Association
Date: 2009
DOI: 10.5244/C.23.47
Publisher: IEEE
Date: 09-2009
Publisher: Springer Science and Business Media LLC
Date: 23-12-2020
DOI: 10.1007/S11263-020-01393-0
Abstract: Standardized benchmarks have been crucial in pushing the performance of computer vision algorithms, especially since the advent of deep learning. Although leaderboards should not be over-claimed, they often provide the most objective measure of performance and are therefore important guides for research. We present MOTChallenge , a benchmark for single-camera Multiple Object Tracking (MOT) launched in late 2014, to collect existing and new data and create a framework for the standardized evaluation of multiple object tracking methods. The benchmark is focused on multiple people tracking, since pedestrians are by far the most studied object in the tracking community, with applications ranging from robot navigation to self-driving cars. This paper collects the first three releases of the benchmark: (i) MOT15 , along with numerous state-of-the-art results that were submitted in the last years, (ii) MOT16 , which contains new challenging videos, and (iii) MOT17 , that extends MOT16 sequences with more precise labels and evaluates tracking performance on three different object detectors. The second and third release not only offers a significant increase in the number of labeled boxes, but also provide labels for multiple object classes beside pedestrians, as well as the level of visibility for every single object of interest. We finally provide a categorization of state-of-the-art trackers and a broad error analysis. This will help newcomers understand the related work and research trends in the MOT community, and hopefully shed some light into potential future research directions.
Publisher: IEEE
Date: 05-2018
Publisher: Springer International Publishing
Date: 2016
Publisher: Elsevier BV
Date: 12-2019
DOI: 10.1016/J.MEDIA.2019.101562
Abstract: We propose a new method for breast cancer screening from DCE-MRI based on a post-hoc approach that is trained using weakly annotated data (i.e., labels are available only at the image level without any lesion delineation). Our proposed post-hoc method automatically diagnosis the whole volume and, for positive cases, it localizes the malignant lesions that led to such diagnosis. Conversely, traditional approaches follow a pre-hoc approach that initially localises suspicious areas that are subsequently classified to establish the breast malignancy - this approach is trained using strongly annotated data (i.e., it needs a delineation and classification of all lesions in an image). We also aim to establish the advantages and disadvantages of both approaches when applied to breast screening from DCE-MRI. Relying on experiments on a breast DCE-MRI dataset that contains scans of 117 patients, our results show that the post-hoc method is more accurate for diagnosing the whole volume per patient, achieving an AUC of 0.91, while the pre-hoc method achieves an AUC of 0.81. However, the performance for localising the malignant lesions remains challenging for the post-hoc method due to the weakly labelled dataset employed during training.
Publisher: IEEE
Date: 06-2018
Publisher: IEEE
Date: 05-2011
Publisher: IEEE
Date: 06-2019
Publisher: IEEE
Date: 04-2019
Publisher: IEEE
Date: 06-2010
Publisher: IEEE
Date: 06-2011
Publisher: IEEE
Date: 08-2010
Publisher: IEEE
Date: 10-2016
DOI: 10.1109/3DV.2016.6
Publisher: IEEE
Date: 05-2019
Publisher: IEEE
Date: 06-2020
Publisher: IEEE
Date: 07-2017
Publisher: Elsevier BV
Date: 06-2008
Publisher: IEEE
Date: 2005
DOI: 10.1109/CVPR.2005.75
Publisher: IEEE
Date: 05-2019
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: SAGE Publications
Date: 04-05-2010
Abstract: In this paper we describe a relative approach to simultaneous localization and mapping, based on the insight that a continuous relative representation can make the problem tractable at large scales. First, it is well known that bundle adjustment is the optimal non-linear least-squares formulation for this problem, in that its maximum-likelihood form matches the definition of the Cramer—Rao lower bound. Unfortunately, computing the maximum-likelihood solution is often prohibitively expensive: this is especially true during loop closures, which often necessitate adjusting all parameters in a loop. In this paper we note that it is precisely the choice of a single privileged coordinate frame that makes bundle adjustment costly, and that this expense can be avoided by adopting a completely relative approach. We derive a new relative bundle adjustment which, instead of optimizing in a single Euclidean space, works in a metric space defined by a manifold. Using an adaptive optimization strategy, we show experimentally that it is possible to solve for the full maximum-likelihood solution incrementally in constant time, even at loop closure. Our approach is, by definition, everywhere locally Euclidean, and we show that the local Euclidean estimate matches that of traditional bundle adjustment. Our system operates online in realtime using stereo data, with fast appearance-based loop closure detection. We show results on over 850,000 images that indicate the accuracy and scalability of the approach, and process over 330 GB of image data into a relative map covering 142 km of Southern England. To demonstrate a baseline sufficiency for navigation, we show that it is possible to find shortest paths in the relative maps we build, in terms of both time and distance. Query images from the web of popular landmarks around London, such as the London Eye or Trafalgar Square, are matched to the relative map to provide route planning goals.
Publisher: Elsevier BV
Date: 03-2012
Publisher: Elsevier BV
Date: 04-1994
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2001
DOI: 10.1109/3468.903865
Publisher: IEEE
Date: 06-2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2012
Publisher: British Machine Vision Association
Date: 2010
DOI: 10.5244/C.24.50
Publisher: IEEE
Date: 07-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-1997
DOI: 10.1109/34.584099
Publisher: Elsevier BV
Date: 11-1994
Publisher: IEEE
Date: 06-2011
Publisher: Springer Science and Business Media LLC
Date: 10-01-2012
Publisher: Springer Science and Business Media LLC
Date: 2011
DOI: 10.1155/2011/530325
Publisher: IEEE
Date: 10-2017
Publisher: IEEE
Date: 12-2015
Publisher: IEEE
Date: 12-2019
Publisher: IEEE
Date: 05-2019
Publisher: IEEE
Date: 07-2017
Publisher: IEEE
Date: 06-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2011
Publisher: IEEE
Date: 05-2017
Publisher: IEEE
Date: 05-2015
Publisher: British Machine Vision Association
Date: 2008
DOI: 10.5244/C.22.117
Publisher: IEEE
Date: 09-2200
Publisher: IEEE
Date: 03-2011
Publisher: SAGE Publications
Date: 21-07-2009
Abstract: In this paper we describe a body of work aimed at extending the reach of mobile navigation and mapping. We describe how running topological and metric mapping and pose estimation processes concurrently, using vision and laser ranging, has produced a full six-degree-of-freedom outdoor navigation system. It is capable of producing intricate three-dimensional maps over many kilometers and in real time. We consider issues concerning the intrinsic quality of the built maps and describe our progress towards adding semantic labels to maps via scene de-construction and labeling. We show how our choices of representation, inference methods and use of both topological and metric techniques naturally allow us to fuse maps built from multiple sessions with no need for manual frame alignment or data association.
Publisher: IEEE
Date: 05-2018
Publisher: Springer Nature Switzerland
Date: 2023
Publisher: IEEE
Date: 05-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2009
Publisher: Elsevier BV
Date: 10-1996
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2019
Publisher: Information Processing Society of Japan
Date: 2009
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: IEEE
Date: 05-2018
Publisher: IEEE
Date: 10-2017
Publisher: Elsevier BV
Date: 10-1995
Publisher: Springer Science and Business Media LLC
Date: 10-06-2005
Publisher: Elsevier BV
Date: 07-2016
Publisher: IEEE
Date: 06-2013
Publisher: IEEE
Date: 12-2019
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer Science and Business Media LLC
Date: 11-1995
DOI: 10.1007/BF01539627
Publisher: Springer Science and Business Media LLC
Date: 2002
Publisher: IEEE
Date: 11-2016
Publisher: IEEE
Date: 2005
DOI: 10.1109/ICCV.2005.47
Publisher: British Machine Vision Association
Date: 2005
DOI: 10.5244/C.19.91
Publisher: Springer International Publishing
Date: 2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Springer Science and Business Media LLC
Date: 2001
Publisher: IEEE
Date: 11-2011
Publisher: IEEE
Date: 12-2015
DOI: 10.1109/3DV.2014.39
Publisher: SAGE Publications
Date: 12-1997
DOI: 10.1068/P261519
Abstract: This paper demonstrates the use of active fixation on both fixed and moving fixation points to guide a robot vehicle by means of a steering rule which, at large distances, sets the steering angle directly proportional to the deviation of gaze direction from translation direction. Steering a motor vehicle around a winding but otherwise uncluttered road has been observed by Land and Lee to involve repeated periods of visual fixation upon the tangent point of the inside of each bend. We suggest that proportional rule devised for steering in the robotic ex le appears applicable to the observed human performance data, providing an alternative explanation to the quadratic rule proposed by Land and Lee.
Publisher: SAGE Publications
Date: 25-09-2010
Abstract: This paper first describes the workflow of the Pathfinder image-guided surgical robot that has been designed to replace the stereotactic frame in neurosurgery, and then details the calibration stages employed in order to achieve submillimetre positioning accuracy of a tool tip. The process uses non-linear parameter identification techniques in conjunction with some procedures for camera calibration, which exploit the fact that the camera is mounted to a calibrated robot arm that executes precise motions.
Publisher: IEEE
Date: 05-2010
Publisher: Springer Science and Business Media LLC
Date: 17-12-2019
DOI: 10.1007/S11263-019-01280-3
Abstract: Feature matching aims at generating correspondences across images, which is widely used in many computer vision tasks. Although considerable progress has been made on feature descriptors and fast matching for initial correspondence hypotheses, selecting good ones from them is still challenging and critical to the overall performance. More importantly, existing methods often take a long computational time, limiting their use in real-time applications. This paper attempts to separate true correspondences from false ones at high speed. We term the proposed method (GMS) grid-based motion Statistics, which incorporates the smoothness constraint into a statistic framework for separation and uses a grid-based implementation for fast calculation. GMS is robust to various challenging image changes, involving in viewpoint, scale, and rotation. It is also fast, e.g., take only 1 or 2 ms in a single CPU thread, even when 50 K correspondences are processed. This has important implications for real-time applications. What’s more, we show that incorporating GMS into the classic feature matching and epipolar geometry estimation pipeline can significantly boost the overall performance. Finally, we integrate GMS into the well-known ORB-SLAM system for monocular initialization, resulting in a significant improvement.
Publisher: IEEE
Date: 10-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: IEEE
Date: 10-2017
DOI: 10.1109/ICCV.2017.71
Publisher: British Machine Vision Association
Date: 2007
DOI: 10.5244/C.21.110
Publisher: Springer Science and Business Media LLC
Date: 17-09-2020
Publisher: Springer Science and Business Media LLC
Date: 11-06-2011
Publisher: SAGE Publications
Date: 2011
Publisher: IEEE
Date: 12-2013
Publisher: IEEE
Date: 11-2011
Publisher: Springer International Publishing
Date: 2015
Publisher: IEEE
Date: 05-2019
Publisher: IEEE
Date: 10-2019
Publisher: Springer International Publishing
Date: 2017
Publisher: IEEE
Date: 06-2020
Publisher: Springer International Publishing
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: IEEE
Date: 06-2018
Publisher: IEEE
Date: 06-2008
Publisher: IEEE
Date: 05-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2016
Publisher: IEEE
Date: 06-2019
Publisher: British Machine Vision Association
Date: 2010
DOI: 10.5244/C.24.103
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2022
Publisher: Springer Science and Business Media LLC
Date: 1998
Publisher: Elsevier BV
Date: 06-1999
Publisher: IEEE
Date: 10-2011
Publisher: British Machine Vision Association
Date: 2009
DOI: 10.5244/C.23.14
Publisher: British Machine Vision Association
Date: 2008
DOI: 10.5244/C.22.49
Publisher: IEEE
Date: 05-2018
Publisher: IEEE
Date: 10-2018
Publisher: Elsevier BV
Date: 06-2010
Publisher: Springer Science and Business Media LLC
Date: 02-2005
Publisher: IEEE
Date: 05-2010
Publisher: IEEE
Date: 05-2016
Publisher: IEEE
Date: 02-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2022
Publisher: Elsevier BV
Date: 12-2009
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2015
Publisher: IEEE
Date: 05-2017
Publisher: IEEE
Date: 09-2014
Publisher: IEEE
Date: 05-2018
Publisher: Association for Computing Machinery (ACM)
Date: 06-06-2020
DOI: 10.1145/3388887
Abstract: Edge-preserving image smoothing is a fundamental procedure for many computer vision and graphic applications. There is a tradeoff between the smoothing quality and the processing speed: the high smoothing quality usually requires a high computational cost, which leads to the low processing speed. In this article, we propose a new global optimization based method, named iterative least squares (ILS), for efficient edge-preserving image smoothing. Our approach can produce high-quality results but at a much lower computational cost. Comprehensive experiments demonstrate that the proposed method can produce results with little visible artifacts. Moreover, the computation of ILS can be highly parallel, which can be easily accelerated through either multi-thread computing or the GPU hardware. With the acceleration of a GTX 1080 GPU, it is able to process images of 1080p resolution (1920 × 1080) at the rate of 20fps for color images and 47fps for gray images. In addition, the ILS is flexible and can be modified to handle more applications that require different smoothing properties. Experimental results of several applications show the effectiveness and efficiency of the proposed method. The code is available at liusjtu/Real-time-Image-Smoothing-via-Iterative-Least-Squares.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Wiley
Date: 13-02-2018
Publisher: IEEE
Date: 03-2020
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer Berlin Heidelberg
Date: 1998
DOI: 10.1007/BFB0054783
Publisher: IEEE
Date: 06-2018
Publisher: IEEE
Date: 06-2007
Publisher: IEEE
Date: 10-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2020
Publisher: IEEE
Date: 04-2007
Publisher: British Machine Vision Association
Date: 2008
DOI: 10.5244/C.22.32
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: IEEE
Date: 03-2019
Publisher: Springer International Publishing
Date: 2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2007
Publisher: IEEE
Date: 06-2018
Publisher: IEEE
Date: 06-2018
Publisher: IEEE
Date: 11-2019
Publisher: IEEE
Date: 05-2012
Publisher: IEEE
Date: 05-2017
Publisher: Springer Science and Business Media LLC
Date: 11-01-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2022
Publisher: Elsevier BV
Date: 03-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Springer International Publishing
Date: 2020
Publisher: IEEE
Date: 2019
Publisher: IEEE
Date: 05-2010
Publisher: Elsevier BV
Date: 11-2006
Publisher: British Machine Vision Association
Date: 2007
DOI: 10.5244/C.21.65
Publisher: Springer International Publishing
Date: 2021
Publisher: Elsevier BV
Date: 08-1993
Publisher: IEEE
Date: 05-2020
Publisher: IEEE
Date: 11-2017
Publisher: IEEE
Date: 06-2008
Publisher: IEEE
Date: 06-2010
Location: United Kingdom of Great Britain and Northern Ireland
Start Date: 07-2013
End Date: 12-2017
Amount: $150,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 10-2022
End Date: 09-2025
Amount: $515,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 08-2020
End Date: 12-2024
Amount: $450,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 08-2021
End Date: 02-2025
Amount: $643,565.00
Funder: Australian Research Council
View Funded ActivityStart Date: 10-2013
End Date: 03-2020
Amount: $3,179,946.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2013
End Date: 12-2016
Amount: $358,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 04-2016
End Date: 12-2017
Amount: $250,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2019
End Date: 12-2019
Amount: $726,921.00
Funder: Australian Research Council
View Funded ActivityStart Date: 01-2014
End Date: 12-2017
Amount: $345,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2013
End Date: 12-2013
Amount: $210,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 07-2014
End Date: 03-2021
Amount: $19,000,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2015
End Date: 06-2018
Amount: $240,000.00
Funder: Australian Research Council
View Funded Activity