99 research outputs found

    A kernel-based framework for medical big-data analytics

    Get PDF
    The recent trend towards standardization of Electronic Health Records (EHRs) represents a significant opportunity and challenge for medical big-data analytics. The challenge typically arises from the nature of the data which may be heterogeneous, sparse, very high-dimensional, incomplete and inaccurate. Of these, standard pattern recognition methods can typically address issues of high-dimensionality, sparsity and inaccuracy. The remaining issues of incompleteness and heterogeneity however are problematic; data can be as diverse as handwritten notes, blood-pressure readings and MR scans, and typically very little of this data will be co-present for each patient at any given time interval. We therefore advocate a kernel-based framework as being most appropriate for handling these issues, using the neutral point substitution method to accommodate missing inter-modal data. For pre-processing of image-based MR data we advocate a Deep Learning solution for contextual areal segmentation, with edit-distance based kernel measurement then used to characterize relevant morphology

    A generalised framework for saliency-based point feature detection

    Get PDF
    Here we present a novel, histogram-based salient point feature detector that may naturally be applied to both images and 3D data. Existing point feature detectors are often modality specific, with 2D and 3D feature detectors typically constructed in separate ways. As such, their applicability in a 2D-3D context is very limited, particularly where the 3D data is obtained by a LiDAR scanner. By contrast, our histogram-based approach is highly generalisable and as such, may be meaningfully applied between 2D and 3D data. Using the generalised approach, we propose salient point detectors for images, and both untextured and textured 3D data. The approach naturally allows for the detection of salient 3D points based jointly on both the geometry and texture of the scene, allowing for broader applicability. The repeatability of the feature detectors is evaluated using a range of datasets including image and LiDAR input from indoor and outdoor scenes. Experimental results demonstrate a significant improvement in terms of 2D-2D and 2D-3D repeatability compared to existing multi-modal feature detectors

    A family of globally optimal branch-and-bound algorithms for 2D–3D correspondence-free registration

    Get PDF
    We present a family of methods for 2D–3D registration spanning both deterministic and non-deterministic branch-and-bound approaches. Critically, the methods exhibit invariance to the underlying scene primitives, enabling e.g. points and lines to be treated on an equivalent basis, potentially enabling a broader range of problems to be tackled while maximising available scene information, all scene primitives being simultaneously considered. Being a branch-and-bound based approach, the method furthermore enjoys intrinsic guarantees of global optimality; while branch-and-bound approaches have been employed in a number of computer vision contexts, the proposed method represents the first time that this strategy has been applied to the 2D–3D correspondence-free registration problem from points and lines. Within the proposed procedure, deterministic and probabilistic procedures serve to speed up the nested branch-and-bound search while maintaining optimality. Experimental evaluation with synthetic and real data indicates that the proposed approach significantly increases both accuracy and robustness compared to the state of the art

    A generalisable framework for saliency-based line segment detection

    Get PDF
    Here we present a novel, information-theoretic salient line segment detector. Existing line detectors typically only use the image gradient to search for potential lines. Consequently, many lines are found, particularly in repetitive scenes. In contrast, our approach detects lines that define regions of significant divergence between pixel intensity or colour statistics. This results in a novel detector that naturally avoids the repetitive parts of a scene while detecting the strong, discriminative lines present. We furthermore use our approach as a saliency filter on existing line detectors to more efficiently detect salient line segments. The approach is highly generalisable, depending only on image statistics rather than image gradient; and this is demonstrated by an extension to depth imagery. Our work is evaluated against a number of other line detectors and a quantitative evaluation demonstrates a significant improvement over existing line detectors for a range of image transformation

    Looking to score: the dissociation of goal influence on eye movement and meta-attentional allocation in a complex dynamic natural scene

    Get PDF
    Several studies have reported that task instructions influence eye-movement behavior during static image observation. In contrast, during dynamic scene observation we show that while the specificity of the goal of a task influences observers’ beliefs about where they look, the goal does not in turn influence eye-movement patterns. In our study observers watched short video clips of a single tennis match and were asked to make subjective judgments about the allocation of visual attention to the items presented in the clip (e.g., ball, players, court lines, and umpire). However, before attending to the clips, observers were either told to simply watch clips (non-specific goal), or they were told to watch the clips with a view to judging which of the two tennis players was awarded the point (specific goal). The results of subjective reports suggest that observers believed that they allocated their attention more to goal-related items (e.g. court lines) if they performed the goal-specific task. However, we did not find the effect of goal specificity on major eye-movement parameters (i.e., saccadic amplitudes, inter-saccadic intervals, and gaze coherence). We conclude that the specificity of a task goal can alter observer’s beliefs about their attention allocation strategy, but such task-driven meta-attentional modulation does not necessarily correlate with eye-movement behavior

    Longitudinal MRI assessment: the identification of relevant features in the development of posterior fossa syndrome in children

    Get PDF
    Up to 25% of children who undergo brain tumour resection surgery in the posterior fossa develop posterior fossa syndrome (PFS). This syndrome is characterised by mutism and disturbance in speech. Our hypothesis is that there is a correlation between PFS and the occurrence of hypertrophic olivary degeneration (HOD) in lobes within the posterior fossa, known as the inferior olivary nuclei (ION). HOD is exhibited as an increase in size and intensity of the ION on an MR image. Intra-operative MRI (IoMRI) is used during surgical procedures at the Alder Hey Children’s Hospital, Liverpool, England, in the treatment of Posterior Fossa tumours and allows visualisation of the brain during surgery. The final MR scan on the IoMRI allows early assessment of the ION immediately after the surgical procedure. The longitudinal MRI data of 28 patients was analysed in a collaborative study with Alder Hey Children’s Hospital, in order to identify the most relevant imaging features that relate to the development of PFS, specifically related to HOD. A semi-automated segmentation process was carried out to delineate the ION on each MRI. Feature selection techniques were used to identify the most relevant features amongst the MRI data, demographics and clinical data provided by the hospital. A support vector machine (SVM) was used to analyse the discriminative ability of the selected features. The results indicate the presence of HOD as the most efficient feature that correlates with the development of PFS, followed by the change in intensity and size of the ION and whether HOD occurred bilaterally or unilaterally

    A survey of user-centred approaches for smart home transfer learning and new user home automation adaptation

    Get PDF
    Recent smart home applications enhance the quality of people's home experiences by detecting their daily activities and providing them services that make their daily life more comfortable and safe. Human activity recognition is one of the fundamental tasks that a smart home should accomplish. However, there are still several challenges for such recognition in smart homes, with the target home adaptation process being one of the most critical, since new home environments do not have sufficient data to initiate the necessary activity recognition process. The transfer learning approach is considered the solution to this challenge, due to its ability to improve the adaptation process. This paper endeavours to provide a concrete review of user-centred smart homes along with the recent advancements in transfer learning for activity recognition. Furthermore, the paper proposes an integrated, personalised system that is able to create a dataset for target homes using both survey and transfer learning approaches, providing a personalised dataset based on user preferences and feedback

    Globally optimal 2D-3D registration from points or lines without correspondences

    Get PDF
    We present a novel approach to 2D-3D registration from points or lines without correspondences. While there exist established solutions in the case where correspondences are known, there are many situations where it is not possible to reliably extract such correspondences across modalities, thus requiring the use of a correspondence-free registration algorithm. Existing correspondence-free methods rely on local search strategies and consequently have no guarantee of finding the optimal solution. In contrast, we present the first globally optimal approach to 2D-3D registration without correspondences, achieved by a Branch-and-Bound algorithm. Furthermore, a deterministic annealing procedure is proposed to speed up the nested branch-and-bound algorithm used. The theoretical and practical advantages this brings are demonstrated on a range of synthetic and real data where it is observed that the proposed approach is significantly more robust to high proportions of outliers compared to existing approaches
    • …
    corecore