Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Item TypeItem Type
-
SubjectSubject
-
YearFrom:-To:
-
More FiltersMore FiltersSourceLanguage
Done
Filters
Reset
430
result(s) for
"Pattern Recognition, Automated - statistics "
Sort by:
Deep convolutional networks do not classify based on global object shape
2018
Deep convolutional networks (DCNNs) are achieving previously unseen performance in object classification, raising questions about whether DCNNs operate similarly to human vision. In biological vision, shape is arguably the most important cue for recognition. We tested the role of shape information in DCNNs trained to recognize objects. In Experiment 1, we presented a trained DCNN with object silhouettes that preserved overall shape but were filled with surface texture taken from other objects. Shape cues appeared to play some role in the classification of artifacts, but little or none for animals. In Experiments 2-4, DCNNs showed no ability to classify glass figurines or outlines but correctly classified some silhouettes. Aspects of these results led us to hypothesize that DCNNs do not distinguish object's bounding contours from other edges, and that DCNNs access some local shape features, but not global shape. In Experiment 5, we tested this hypothesis with displays that preserved local features but disrupted global shape, and vice versa. With disrupted global shape, which reduced human accuracy to 28%, DCNNs gave the same classification labels as with ordinary shapes. Conversely, local contour changes eliminated accurate DCNN classification but caused no difficulty for human observers. These results provide evidence that DCNNs have access to some local shape information in the form of local edge relations, but they have no access to global object shapes.
Journal Article
Aneurysm Recurrence Volumetry Is More Sensitive than Visual Evaluation of Aneurysm Recurrences
by
Kang, H.-S.
,
Goebell, E.
,
Cho, Y.D.
in
Aneurysms
,
Clinical Competence - statistics & numerical data
,
Female
2016
Purpose
Considerable inter-observer variability in the visual assessment of aneurysm recurrences limits its use as an outcome parameter evaluating new coil generations. The purpose of this study was to compare visual assessment of aneurysm recurrences and aneurysm recurrence volumetry with an example dataset of HydroSoft coils (HSC) versus bare platinum coils (BPC).
Methods
For this retrospective study, 3-dimensional time-of-flight magnetic resonance angiography datasets acquired 6 and 12 months after endovascular therapy using BPC only or mainly HSC were analyzed. Aneurysm recurrence volumes were visually rated by two observersas well as quantified by subtraction of the datasets after intensity-based rigid registration
.
Results
A total of 297 aneurysms were analyzed (BPC: 169, HSC: 128). Recurrences were detected by aneurysm recurrence volumetry in 9 of 128 (7.0 %) treated with HSC and in 24 of 169 (14.2 %) treated with BPC (odds ratio: 2.39, 95 % confidence interval: 1.05–5.48;
P
= 0.039). Aneurysm recurrence volumetry revealed an excellent correlation between observers (Cronbach’s alpha = 0.93). In contrast, no significant difference in aneurysm recurrence was found for visual assessment (3.9 % in HSC cases and 4.7 % in BPC cases). Recurrences were observed in aneurysms smaller than the sample median in 10 of 33 (30.3 %) by aneurysm recurrence volumetry and in 1 of 13 (7.7 %) by visual assessment.
Conclusions
Aneurysm recurrences were detected more frequently by aneurysm recurrence volumetry when compared with visual assessment. By using aneurysm recurrence volumetry, differences between treatment groups were detected with higher sensitivity and inter-observer validity probably because of the higher detection rate of recurrences in small aneurysms.
Journal Article
Screening for Dyslexia Using Eye Tracking during Reading
by
Öqvist Seimyr, Gustaf
,
Nilsson Benfatto, Mattias
,
Rydberg, Agneta
in
Accuracy
,
Analysis
,
Artificial intelligence
2016
Dyslexia is a neurodevelopmental reading disability estimated to affect 5-10% of the population. While there is yet no full understanding of the cause of dyslexia, or agreement on its precise definition, it is certain that many individuals suffer persistent problems in learning to read for no apparent reason. Although it is generally agreed that early intervention is the best form of support for children with dyslexia, there is still a lack of efficient and objective means to help identify those at risk during the early years of school. Here we show that it is possible to identify 9-10 year old individuals at risk of persistent reading difficulties by using eye tracking during reading to probe the processes that underlie reading ability. In contrast to current screening methods, which rely on oral or written tests, eye tracking does not depend on the subject to produce some overt verbal response and thus provides a natural means to objectively assess the reading process as it unfolds in real-time. Our study is based on a sample of 97 high-risk subjects with early identified word decoding difficulties and a control group of 88 low-risk subjects. These subjects were selected from a larger population of 2165 school children attending second grade. Using predictive modeling and statistical resampling techniques, we develop classification models from eye tracking records less than one minute in duration and show that the models are able to differentiate high-risk subjects from low-risk subjects with high accuracy. Although dyslexia is fundamentally a language-based learning disability, our results suggest that eye movements in reading can be highly predictive of individual reading ability and that eye tracking can be an efficient means to identify children at risk of long-term reading difficulties.
Journal Article
Kernel Manifold Alignment for Domain Adaptation
2016
The wealth of sensory data coming from different modalities has opened numerous opportunities for data analysis. The data are of increasing volume, complexity and dimensionality, thus calling for new methodological innovations towards multimodal data processing. However, multimodal architectures must rely on models able to adapt to changes in the data distribution. Differences in the density functions can be due to changes in acquisition conditions (pose, illumination), sensors characteristics (number of channels, resolution) or different views (e.g. street level vs. aerial views of a same building). We call these different acquisition modes domains, and refer to the adaptation problem as domain adaptation. In this paper, instead of adapting the trained models themselves, we alternatively focus on finding mappings of the data sources into a common, semantically meaningful, representation domain. This field of manifold alignment extends traditional techniques in statistics such as canonical correlation analysis (CCA) to deal with nonlinear adaptation and possibly non-corresponding data pairs between the domains. We introduce a kernel method for manifold alignment (KEMA) that can match an arbitrary number of data sources without needing corresponding pairs, just few labeled examples in all domains. KEMA has interesting properties: 1) it generalizes other manifold alignment methods, 2) it can align manifolds of very different complexities, performing a discriminative alignment preserving each manifold inner structure, 3) it can define a domain-specific metric to cope with multimodal specificities, 4) it can align data spaces of different dimensionality, 5) it is robust to strong nonlinear feature deformations, and 6) it is closed-form invertible, which allows transfer across-domains and data synthesis. To authors' knowledge this is the first method addressing all these important issues at once. We also present a reduced-rank version of KEMA for computational efficiency, and discuss the generalization performance of KEMA under Rademacher principles of stability. Aligning multimodal data with KEMA reports outstanding benefits when used as a data pre-conditioner step in the standard data analysis processing chain. KEMA exhibits very good performance over competing methods in synthetic controlled examples, visual object recognition and recognition of facial expressions tasks. KEMA is especially well-suited to deal with high-dimensional problems, such as images and videos, and under complicated distortions, twists and warpings of the data manifolds. A fully functional toolbox is available at https://github.com/dtuia/KEMA.git.
Journal Article
Influence of Curvature, Growth, and Anisotropy on the Evolution of Turing Patterns on Growing Manifolds
by
Krause, Andrew L
,
Ellis, Meredith A
,
Van Gorder, Robert A
in
Anisotropy
,
Approximation
,
Biological evolution
2019
We study two-species reaction–diffusion systems on growing manifolds, including situations where the growth is anisotropic yet dilational in nature. In contrast to the literature on linear instabilities in such systems, we study how growth and anisotropy impact the qualitative properties of nonlinear patterned states which have formed before growth is initiated. We produce numerical solutions to numerous reaction–diffusion systems with varying reaction kinetics, manner of growth (both isotropic and anisotropic), and timescales of growth on both planar elliptical and curved ellipsoidal domains. We find that in some parameter regimes, some of these factors have a negligible effect on the long-time patterned state. On the other hand, we find that some of these factors play a role in determining the patterns formed on surfaces and that anisotropic growth can produce qualitatively different patterns to those formed under isotropic growth.
Journal Article
Fully-automated atrophy segmentation in dry age-related macular degeneration in optical coherence tomography
2021
Age-related macular degeneration (AMD) is a progressive retinal disease, causing vision loss. A more detailed characterization of its atrophic form became possible thanks to the introduction of Optical Coherence Tomography (OCT). However, manual atrophy quantification in 3D retinal scans is a tedious task and prevents taking full advantage of the accurate retina depiction. In this study we developed a fully automated algorithm segmenting Retinal Pigment Epithelial and Outer Retinal Atrophy (RORA) in dry AMD on macular OCT. 62 SD-OCT scans from eyes with atrophic AMD (57 patients) were collected and split into train and test sets. The training set was used to develop a Convolutional Neural Network (CNN). The performance of the algorithm was established by cross validation and comparison to the test set with ground-truth annotated by two graders. Additionally, the effect of using retinal layer segmentation during training was investigated. The algorithm achieved mean Dice scores of 0.881 and 0.844, sensitivity of 0.850 and 0.915 and precision of 0.928 and 0.799 in comparison with Expert 1 and Expert 2, respectively. Using retinal layer segmentation improved the model performance. The proposed model identified RORA with performance matching human experts. It has a potential to rapidly identify atrophy with high consistency.
Journal Article
An optimized digital watermarking algorithm in wavelet domain based on differential evolution for color image
by
Cui, Xinchun
,
Zheng, Xiangwei
,
Han, Yingshuai
in
Adaptive algorithms
,
Algorithms
,
Biology and Life Sciences
2018
In this paper, a new color watermarking algorithm based on differential evolution is proposed. A color host image is first converted from RGB space to YIQ space, which is more suitable for the human visual system. Then, apply three-level discrete wavelet transformation to luminance component Y and generate four different frequency sub-bands. After that, perform singular value decomposition on these sub-bands. In the watermark embedding process, apply discrete wavelet transformation to a watermark image after the scrambling encryption processing. Our new algorithm uses differential evolution algorithm with adaptive optimization to choose the right scaling factors. Experimental results show that the proposed algorithm has a better performance in terms of invisibility and robustness.
Journal Article
User experience of controlling the DEKA Arm with EMG pattern recognition
by
Resnik, Linda J.
,
Acluche, Frantzy
,
Lieberman Klinger, Shana
in
Acclimation
,
Acclimatization
,
Adult
2018
A commercially available EMG Pattern Recognition (EMG-PR) control system was adapted to interface with the multi-degree of freedom (DOF) DEKA Arm.
To describe users' experience of controlling the DEKA Arm using EMG-PR.
Sample: Twelve persons with upper limb amputation participated, 10 with transradial (TR), 2 with transhumeral (TH) level amputation. Ten were male, and 11 were users of a prosthesis at baselines. Design: This was a two-part study consisting of in-laboratory prosthetic training (Part A) and up to 12 weeks of home use of the prosthesis (Part B). Data collection: Qualitative data were collected through open-ended survey questions and semi-structured interviews. Data Analysis: The study used a qualitative case series design with a constant comparative approach to identify common categories of experience. Coding categories were iteratively refined until saturation of categories was achieved. The data were organized in a primary category, major categories of experience, factors impacting experience, and broader contextual factors.
Users had mixed perspectives on the desirability of the EMG-PR control system in combination with the DEKA Arm. Major aspects of user experience related to the system complexity, process of calibrating, and functional benefits. Factors influencing user experience included training and acclimation, fatigue, prosthesis design, technical issues and control changes. Broader contextual factors, both personal and environmental, also impacted users' experience.
This study provided an in-depth description of user experience operating the DEKA Arm using EMG-PR control. The majority of participants expressed a preference for the controls of their personal prosthesis and controls rather than the iteration of EMG-PR controlled DEKA Arm used in this study. Most were positive about the future potential of EMG-PR as a control method. An understanding of patient experience will assist clinicians and patients choosing prosthetic options.
Journal Article
Segmentation and Classification of Bone Marrow Cells Images Using Contextual Information for Medical Diagnosis of Acute Leukemias
2015
Morphological identification of acute leukemia is a powerful tool used by hematologists to determine the family of such a disease. In some cases, experienced physicians are even able to determine the leukemia subtype of the sample. However, the identification process may have error rates up to 40% (when classifying acute leukemia subtypes) depending on the physician's experience and the sample quality. This problem raises the need to create automatic tools that provide hematologists with a second opinion during the classification process. Our research presents a contextual analysis methodology for the detection of acute leukemia subtypes from bone marrow cells images. We propose a cells separation algorithm to break up overlapped regions. In this phase, we achieved an average accuracy of 95% in the evaluation of the segmentation process. In a second phase, we extract descriptive features to the nucleus and cytoplasm obtained in the segmentation phase in order to classify leukemia families and subtypes. We finally created a decision algorithm that provides an automatic diagnosis for a patient. In our experiments, we achieved an overall accuracy of 92% in the supervised classification of acute leukemia families, 84% for the lymphoblastic subtypes, and 92% for the myeloblastic subtypes. Finally, we achieved accuracies of 95% in the diagnosis of leukemia families and 90% in the diagnosis of leukemia subtypes.
Journal Article
A constrained singular value decomposition method that integrates sparsity and orthogonality
by
Gloaguen, Arnaud
,
Tenenhaus, Arthur
,
Löfstedt, Tommy
in
Algorithms
,
Analysis
,
Biology and Life Sciences
2019
We propose a new sparsification method for the singular value decomposition-called the constrained singular value decomposition (CSVD)-that can incorporate multiple constraints such as sparsification and orthogonality for the left and right singular vectors. The CSVD can combine different constraints because it implements each constraint as a projection onto a convex set, and because it integrates these constraints as projections onto the intersection of multiple convex sets. We show that, with appropriate sparsification constants, the algorithm is guaranteed to converge to a stable point. We also propose and analyze the convergence of an efficient algorithm for the specific case of the projection onto the balls defined by the norms L1 and L2. We illustrate the CSVD and compare it to the standard singular value decomposition and to a non-orthogonal related sparsification method with: 1) a simulated example, 2) a small set of face images (corresponding to a configuration with a number of variables much larger than the number of observations), and 3) a psychometric application with a large number of observations and a small number of variables. The companion R-package, csvd, that implements the algorithms described in this paper, along with reproducible examples, are available for download from https://github.com/vguillemot/csvd.
Journal Article