Accelerated development of cerebral small vessel disease in young stroke patients.

OBJECTIVE: To study the long-term prevalence of small vessel disease after young stroke and to compare this to healthy controls. METHODS: This prospective cohort study comprises 337 patients with an ischemic stroke or TIA, aged 18-50 years, without a history of TIA or stroke. In addition, 90 age- and sex-matched controls were included. At follow-up, lacunes, microbleeds, and white matter hyperintensity (WMH) volume were assessed using MRI. To investigate the relation between risk factors and small vessel disease, logistic and linear regression were used. RESULTS: After mean follow-up of 9.9 (SD 8.1) years, 337 patients were included (227 with an ischemic stroke and 110 with a TIA). Mean age of patients was 49.8 years (SD 10.3) and 45.4% were men; for controls, mean age was 49.4 years (SD 11.9) and 45.6% were men. Compared with controls, patients more often had at least 1 lacune (24.0% vs 4.5%, p < 0.0001). In addition, they had a higher WMH volume (median 1.5 mL [interquartile range (IQR) 0.5-3.7] vs 0.4 mL [IQR 0.0-1.0], p < 0.001). Compared with controls, patients had the same volume WMHs on average 10-20 years earlier. In the patient group, age at stroke (β = 0.03, 95% confidence interval [CI] 0.02-0.04) hypertension (β = 0.22, 95% CI 0.04-0.39), and smoking (β = 0.18, 95% CI 0.01-0.34) at baseline were associated with WMH volume. CONCLUSIONS: Patients with a young stroke have a higher burden of small vessel disease than controls adjusted for confounders. Cerebral aging seems accelerated by 10-20 years in these patients, which may suggest an increased vulnerability to vascular risk factors.This is the final version of the article. It first appeared from Wolters Kluwer via https://doi.org/10.​1212/​WNL.​0000000000003123

Tissue Classification in T1-weighted MR Brain Images

this report only T1-weighted MR images shall be used for the classi cation, because of the relatively good contrast between the three main tissue types in these image

α Scale Spaces on a Bounded Domain

We consider alpha scale spaces, a parameterized class (alpha is an element of (0, 1]) of scale space representations beyond the well-established Gaussian scale space, which are generated by the alpha-th power of the minus Laplace operator on a bounded domain using the Neumann boundary condition. The Neumann boundary condition ensures that there is no grey-value flux through the boundary. Thereby no artificial grey-values from outside the image affect the evolution proces, which is the case for the alpha scale spaces on an unbounded domain. Moreover, the connection between the a scale spaces which is not trivial in the unbounded domain case, becomes straightforward: The generator of the Gaussian semigroup extends to a compact, self-adjoint operator on the Hilbert space L-2(Omega) and therefore it has a complete countable set of eigen functions. Taking the alpha-th power of the Gaussian generator simply boils down to taking the alpha-th power of the corresponding eigenvalues. Consequently, all alpha scale spaces have exactly the same eigen-modes and can be implemented simultaneously as scale dependent Fourier series. The only difference between them is the (relative) contribution of each eigen-mode to the evolution proces. By introducing the notion of (non-dimensional) relative scale in each a scale space, we are able to compare the various alpha scale spaces. The case alpha = 0.5, where the generator equals the square root of the minus Laplace operator leads to Poisson scale space, which is at least as interesting as Gaussian scale space and can be extended to a (Clifford) analytic scale space

Object matching in the presence of non-rigid deformations close to similarities

In this paper we address the problem of object retrieval based on scale-space interest points, namely top-points. The original retrieval algorithm can only cope with scale-Euclidean transformations. We extend the algorithm to the case of non-rigid transformations like affine and perspective transformations and investigate its robustness. The proposed algorithm is proven to be highly robust under various degrading factors, such as noise, occlusion, rendering artifacts, etc. and can deal with multiple occurrences of the object

Content based image retrieval using multiscale top points : a feasiblity study

A feasibility study for a new method for content based image retrieval is presented. First, an image representation using multiscale top points is introduced. This representation is validated using a minimal variance reconstruction algorithm. The image retrieval problem can now be translated into comparing distances between point sets. For this purpose the proportional transportation distance (PTD) is used. A method is proposed using multiscale top points and their reconstruction coefficients in the PTD to define these distances between images. We present some experiments with promising results on a database with face images

The representation and matching of images using top points

In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a novel construction that encodes the scale space description of top points in the form of a directed acyclic graph. This representation allows us to utilize coarse-to-fine graph matching algorithms for comparing images represented in terms of top point configurations instead of using solely the top points and their features in a point matching algorithm, as was done previously. The nodes of the graph represent the critical paths together with their top points. The edge set captures the neighborhood distribution of vertices in scale space, and is constructed through a hierarchical tessellation of scale space using a Delaunay triangulation of the top points. We present a coarse-to-fine many-to-many matching algorithm for comparing such graph-based representations. The algorithm is based on a metric-tree representation of labeled graphs and their low-distortion embeddings into normed vector spaces via spherical encoding. This is a two-step transformation that reduces the matching problem to that of computing a distribution-based distance measure between two such embeddings. To evaluate the quality of our representation, four sets of experiments are performed. First, the stability of this representation under Gaussian noise of increasing magnitude is examined. Second, a series of recognition experiments is run on a face database. Third, a set of clutter and occlusion experiments is performed to measure the robustness of the algorithm. Fourth, the algorithm is compared to a leading interest point-based framework in an object recognition experiment

Classification of breast lesions in automated 3D breast ultrasound

In this paper we investigated classification of malignant and benign lesions in automated 3D breast ultrasound (ABUS). As a new imaging modality, ABUS overcomes the drawbacks of 2D hand-held ultrasound (US) such as its operator dependence and limited capability in visualizing the breast in 3D. The classification method we present includes a 3D lesion segmentation stage based on dynamic programming, which effectively deals with limited visibility of lesion boundaries due to shadowing and speckle. A novel aspect of ABUS imaging, in which the breast is compressed by means of a dedicated membrane, is the presence of spiculation in coronal planes perpendicular to the transducer. Spiculation patterns, or architectural distortion, are characteristic for malignant lesions. Therefore, we compute a spiculation measure in coronal planes and combine this with more traditional US features related to lesion shape, margin, posterior acoustic behavior, and echo pattern. However, in our work the latter features are defined in 3D. Classification experiments were performed with a dataset of 40 lesions including 20 cancers. Linear discriminant analysis (LDA) was used in combination with leaveone- patient-out and feature selection in each training cycle. We found that spiculation and margin contrast were the most discriminative features and that these features were most often chosen during feature selection. An Az value of 0.86 was obtained by merging all features, while an Az value of 0.91 was obtained by feature selection. © 2011 SPIE.SCOPUS: cp.pinfo:eu-repo/semantics/publishe

Stability of top-points in scale space

This paper presents an algorithm for computing stability of top-points in scale-space. The potential usefulness of top-points in scale-space has already been shown for a number of applications, such as image reconstruction and image retrieval. In order to improve results only reliable top-points should be used. The algorithm is based on perturbation theory and noise propagation

A Sobolev norm based distance measure for HARDI clustering : a feasibility study on phantom and real data

Dissimilarity measures for DTI clustering are abundant. However, for HARDI, the L2 norm has up to now been one of only few practically feasible measures. In this paper we propose a new measure, that not only compares the amplitude of diffusion profiles, but also rewards coincidence of the extrema. We tested this on phantom and real brain data. In both cases, our measure significantly outperformed the L2 norm