Sparsity Preserving Algorithms for Octagons

Known algorithms for manipulating octagons do not preserve their sparsity, leading typically to quadratic or cubic time and space complexities even if no relation among variables is known when they are all bounded. In this paper, we present new algorithms, which use and return octagons represented as weakly closed difference bound matrices, preserve the sparsity of their input and have better performance in the case their inputs are sparse. We prove that these algorithms are as precise as the known ones

Inferring Geodesic Cerebrovascular Graphs: Image Processing, Topological Alignment and Biomarkers Extraction

A vectorial representation of the vascular network that embodies quantitative features - location, direction, scale, and bifurcations - has many potential neuro-vascular applications. Patient-specific models support computer-assisted surgical procedures in neurovascular interventions, while analyses on multiple subjects are essential for group-level studies on which clinical prediction and therapeutic inference ultimately depend. This first motivated the development of a variety of methods to segment the cerebrovascular system. Nonetheless, a number of limitations, ranging from data-driven inhomogeneities, the anatomical intra- and inter-subject variability, the lack of exhaustive ground-truth, the need for operator-dependent processing pipelines, and the highly non-linear vascular domain, still make the automatic inference of the cerebrovascular topology an open problem. In this thesis, brain vessels’ topology is inferred by focusing on their connectedness. With a novel framework, the brain vasculature is recovered from 3D angiographies by solving a connectivity-optimised anisotropic level-set over a voxel-wise tensor field representing the orientation of the underlying vasculature. Assuming vessels joining by minimal paths, a connectivity paradigm is formulated to automatically determine the vascular topology as an over-connected geodesic graph. Ultimately, deep-brain vascular structures are extracted with geodesic minimum spanning trees. The inferred topologies are then aligned with similar ones for labelling and propagating information over a non-linear vectorial domain, where the branching pattern of a set of vessels transcends a subject-specific quantized grid. Using a multi-source embedding of a vascular graph, the pairwise registration of topologies is performed with the state-of-the-art graph matching techniques employed in computer vision. Functional biomarkers are determined over the neurovascular graphs with two complementary approaches. Efficient approximations of blood flow and pressure drop account for autoregulation and compensation mechanisms in the whole network in presence of perturbations, using lumped-parameters analog-equivalents from clinical angiographies. Also, a localised NURBS-based parametrisation of bifurcations is introduced to model fluid-solid interactions by means of hemodynamic simulations using an isogeometric analysis framework, where both geometry and solution profile at the interface share the same homogeneous domain. Experimental results on synthetic and clinical angiographies validated the proposed formulations. Perspectives and future works are discussed for the group-wise alignment of cerebrovascular topologies over a population, towards defining cerebrovascular atlases, and for further topological optimisation strategies and risk prediction models for therapeutic inference. Most of the algorithms presented in this work are available as part of the open-source package VTrails

Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra

Polyhedra form an established abstract domain for inferring runtime properties of programs using abstract interpretation. Computations on them need to be certified for the whole static analysis results to be trusted. In this work, we look at how far we can get down the road of a posteriori verification to lower the overhead of certification of the abstract domain of polyhedra. We demonstrate methods for making the cost of inclusion certificate generation negligible. From a performance point of view, our single-representation, constraints-based implementation compares with state-of-the-art implementations

Verasco: un analyseur statique pour C formellement vérifié

In order to develop safer software for critical applications, some static analyzers aim at establishing, with mathematical certitude, the absence of some classes of bug in the input program. A possible limit to this approach is the possibility of a soundness bug in the static analyzer itself, which would nullify the guarantees it is supposed to deliver.In this thesis, we propose to establish formal guarantees on the static analyzer itself: we present the design, implementation and proof of soundness using Coq of Verasco, a formally verified static analyzer based on abstract interpretation handling most of the ISO C99 language, including IEEE754 floating-point arithmetic (except recursion and dynamic memory allocation). Verasco aims at establishing the absence of erroneous behavior of the given programs. It enjoys a modular extendable architecture with several abstract domains and well-specified interfaces. We present the abstract iterator of Verasco, its handling of bounded machine arithmetic, its interval abstract domain, its symbolic abstract domain and its abstract domain of octagons. Verasco led to the development of new techniques for implementing data structure with sharing in Coq.Afin de développer des logiciels plus sûrs pour des applications critiques, certains analyseurs statiques tentent d'établir, avec une certitude mathématique, l'absence de certains types de bugs dans un programme donné. Une limite possible à cette approche est l'éventualité d'un bug affectant la correction de l'analyseur lui-même, éliminant ainsi les garanties qu'il est censé apporter.Dans cette thèse, nous proposons d'établir des garanties formelles sur l'analyseur lui-même : nous présentons la conception, l'implantation et la preuve de sûreté en Coq de Verasco, un analyseur statique formellement vérifié utilisant l'interprétation abstraite pour le langage ISO C99 avec l'arithmétique flottante IEEE754 (à l'exception de la récursion et de l'allocation dynamique de mémoire). Verasco a pour but d'établir l'absence d'erreur à l'exécution des programmes donnés. Il est conçu selon une architecture modulaire et extensible contenant plusieurs domaines abstraits et des interfaces bien spécifiées. Nous détaillons le fonctionnement de l'itérateur abstrait de Verasco, son traitement des entiers bornés de la machine, son domaine abstrait d'intervalles, son domaine abstrait symbolique et son domaine abstrait d'octogones. Verasco a donné lieu au développement de nouvelles techniques pour implémenter des structures de données avec partage dans Coq

Adaptive Resonance Theory (ART) for social media analytics

This chapter presents the ART-based clustering algorithms for social media analytics in detail. Sections 3.1 and 3.2 introduce Fuzzy ART and its clustering mechanisms, respectively, which provides a deep understanding of the base model that is used and extended for handling the social media clustering challenges. Important concepts such as vigilance region (VR) and its properties are explained and proven. Subsequently, Sects. 3.3-3.7 illustrate five types of ART adaptive resonance theory variants, each of which addresses the challenges in one social media analytical scenario, including automated parameter adaptation, user preference incorporation, short text clustering, heterogeneous data co-clustering and online streaming data indexing. The content of this chapter is several prior studies, including Probabilistic ART [15

Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging

Bilinear programs and Phase Retrieval are two instances of nonconvex problems that arise in engineering and physical applications, and both occur with their fundamental difficulties. In this thesis, we consider various methods and algorithms for tackling these challenging problems and discuss their effectiveness. Bilinear programs (BLPs) are ubiquitous in engineering applications, economics, and operations research, and have a natural encoding to quadratic programs. They appear in the study of Lyapunov functions used to deduce the stability of solutions to differential equations describing dynamical systems. For multivariate dynamical systems, the problem formulation for computing an appropriate Lyapunov function is a BLP. In electric power systems engineering, one of the most practically important and well-researched subfields of constrained nonlinear optimization is Optimal Power Flow wherein one attempts to optimize an electric power system subject to physical constraints imposed by electrical laws and engineering limits, which can be naturally formulated as a quadratic program. In a recent publication, we studied the relationship between data flow constraints for numerical domains such as polyhedra and bilinear constraints. The problem of recovering an image from its Fourier modulus, or intensity, measurements emerges in many physical and engineering applications. The problem is known as Fourier phase retrieval wherein one attempts to recover the phase information of a signal in order to accurately reconstruct it from estimated intensity measurements by applying the inverse Fourier transform. The problem of recovering phase information from a set of measurements can be formulated as a quadratic program. This problem is well-studied but still presents many challenges. The resolution of an optical device is defined as the smallest distance between two objects such that the two objects can still be recognized as separate entities. Due to the physics of diffraction, and the way that light bends around an obstacle, the resolving power of an optical system is limited. This limit, known as the diffraction limit, was first introduced by Ernst Abbe in 1873. Obtaining the complete phase information would enable one to perfectly reconstruct an image; however, the problem is severely ill-posed and the leads to a specialized type of quadratic program, known as super-resolution imaging, wherein one attempts to learn phase information beyond the limits of diffraction and the limitations imposed by the imaging device

Robustness Verification of k-Nearest Neighbor Classifiers by Abstract Interpretation

openAbstract interpretation is an established mathematical framework introduced by Cousot and Cousot in 1977 and ubiquitously used in static program analysis. In recent years, many noteworthy works have shown how abstract interpretation can be successfully applied to formally verify robustness properties of some major machine learning techniques like (deep) neural networks, decision trees and support vector machines. This research work aims to pursue this line of research by proposing a novel abstract interpretation-based framework for designing a sound abstract version of the k-Nearest Neighbors (kNN) algorithm, a well-known non-parametric supervised learning method widely used for classification and regression tasks, which is then instantiated to the standard interval domain approximating the range of numerical features, to verify its robustness and stability properties. This verification approach has been fully implemented and evaluated on several datasets, including standard benchmark datasets for individual fairness verification, and then compared with some related works finding adversarial examples on kNNs. The experimental results turned out to be very promising and showed high percentages of provable robustness and stability in most of the reference datasets, thus making a step forward in the current state-of-the-art of formal verification of machine learning models.Abstract interpretation is an established mathematical framework introduced by Cousot and Cousot in 1977 and ubiquitously used in static program analysis. In recent years, many noteworthy works have shown how abstract interpretation can be successfully applied to formally verify robustness properties of some major machine learning techniques like (deep) neural networks, decision trees and support vector machines. This research work aims to pursue this line of research by proposing a novel abstract interpretation-based framework for designing a sound abstract version of the k-Nearest Neighbors (kNN) algorithm, a well-known non-parametric supervised learning method widely used for classification and regression tasks, which is then instantiated to the standard interval domain approximating the range of numerical features, to verify its robustness and stability properties. This verification approach has been fully implemented and evaluated on several datasets, including standard benchmark datasets for individual fairness verification, and then compared with some related works finding adversarial examples on kNNs. The experimental results turned out to be very promising and showed high percentages of provable robustness and stability in most of the reference datasets, thus making a step forward in the current state-of-the-art of formal verification of machine learning models

based on resting state fMRI

학위논문(박사) -- 서울대학교대학원 : 융합과학기술대학원 분자의학 및 바이오제약학과, 2021.8. 위원석.대부분의 실세계 네트워크에서 네트워크의 구성에 있어서 기하학이 중요한 역할을 하며, 최근 연구에서 구조적 뇌 네트워크는 쌍곡기하적 특성을 가지고 있음이 밝혀졌다. 뇌의 구조와 기능은 밀접한 연관을 지니고 있으므로, 기능적 뇌 네트워크 역시 쌍곡기하적 특성을 지니고 있음을 추정할 수 있다. 이번 연구에서, 우리는 휴식기 뇌 자기공명영상(rs-fMRI)을 통해 추출한 기능적 뇌 커넥톰(connectome)을 분석하여 이 가설을 증명하고자 하였으며, 이를 쌍곡공간에 임베드(embed)함으로써 기능적 뇌 네트워크의 특성을 새로이 조사하고자 하였다. 네트워크의 꼭지점은 274개의 미리 정의된 관심영역(ROI) 혹은 6mm 크기의 복셀(voxel)의 두 가지 스케일로 정의되었으며, 꼭지점 사이의 연결성은 자기공명 영상에서 각 영역의 시간에 따른 BOLD 신호의 상관관계를 측정하고 일정 문턱값(threshold)을 적용함으로서 결정되었다. 먼저 쌍곡기하 네트워크의 특징인 스케일-프리(scale-free)를 만족함을 확인하기 위해, 네트워크의 차수(degree) 분포의 급수성(power-law)을 평가하였다. 차수의 확률분포곡선은 로그-로그 스케일의 그래프에서 우하향하는 직선 모양의 분포를 보였으며, 이는 즉 차수 분포가 차수의 음의 급수함수에 의해 나타내어짐을 의미한다. 이어서 기능적 뇌 네트워크에 가장 적합한 기저 기하를 확인하기 위하여, 그래프를 유클리드, 쌍곡, 구면적 틍성을 가진 다양체들에 임베드하여 임베딩의 충실성 척도(fidelity measure)들을 비교하였다. 임베드 대상이 된 적 다양체들 중, 10차원 및 2차원 쌍곡공간의 평균 뒤틀림(distortion)이 동일 차원의 유클리드 다양체와 비교하여 더 낮았다. 이어, 네트워크를 구체화 및 시각화하고 그 특징을 확인하기 위하여, 네트워크를 이차원의 쌍곡 원판에 1/ℍ2 기하학적 모델에 따라 임베드하였다. 이 이차원의 극좌표 형태의 모델에서 반경 및 각 차원의 좌표는 각각 꼭지점의 연결 인기도 및 유사도를 나타낸다. ROI 수준의 분석에서는 특별히 높은 인기도를 갖는 영역은 관찰되지 않아 임베드된 원판의 중심부에 빈 공간으로 나타났다. 한편 같은 해부학적 엽(lobe)에 속한 영역들은 비슷한 각도 영역 내에 밀집되었으며, 반대측 동일 엽에 속한 영역들 역시 그 각좌표의 분포가 구분되지 않았다. 이는 기능적 뇌 네트워크의 해부학적 연관성과 반대측 동일 엽 간의 기능적 연관성을 나타내는 것으로 볼 수 있다. 또한, 복셀 수준의 분석에서는 소뇌에 속한 복셀들 중 다수가 넓은 각좌표 영역에 흩뿌려진 현상이 나타났으며, 이는 개개 복셀의 기능적 이질성을 시사한다. 또한, 전 영역에 걸쳐 매우 유사한 각좌표를 가진 방사형의 막대 모양의 점의 집합이 관찰되었으며, 높은 기능적 유사성을 가진 복셀들로 볼 수 있다. 복셀 수준의 네트워크에서 뇌의 독립성분 분석(ICA) 의 결과로 나온 성분 네트워크들을 플로팅한 결과, 각 네트워크 성분이 높은 밀집도를 보여 두 방법론 간 결과의 유사성을 확인할 수 있었다. 자폐스펙트럼장애의 ABIDE II 오픈 데이터셋을 이용하여 1/ℍ2 모델에 근거하여, 대조군 환자 그룹과 질병군 환자 개인의 네트워크를 비교하는 분석을 시행한 결과, 질병군에서 다양한 패턴을 보였으나, 그 중 자폐증 진단을 받은 환자에서 피질-선조체 경로의 이상이, 아스퍼거증후군 진단을 받은 환자에서 후위관자고랑 (posterior superior temporal sulcus) 을 포함하는 경로의 이상을 발견할 수 있었다. 분석의 재현성을 확인하기 위하여 같은 네트워크를 대상으로 임베딩 과정을 반복 시행하였을 때, 네트워크 말단의 일부 꼭지점을 제외하면 높은 재현성을 보였다. 영상의 시계열(time series) 내 일관성을 확인하기 위하여 영상을 시간 구간에 따라 분리하여 분석하였을 때, 4구간으로 나눈 시계열 영상에서는 유사한 결과를 얻었으나 30초 길이의 30구간으로 나뉘었을 때는 일관적인 결과가 관찰되지 않았다. 이 연구는 뇌 기능적 네트워크에 대한 분석 중 최초로 기하학적 관점에서 진행된 것이며, 이러한 새로운 관점 및 질병군 대상에서 뇌 네트워크의 이상을 찾기 위한 새로운 방법론을 제시한다는 의의가 있다.For most of the real-world networks, geometry plays an important role in organizing the network, and recent works have revealed that the geometry in the structural brain network is most likely to be hyperbolic. Therefore, it can be assumed that the geometry of the functional brain network would also be hyperbolic. In this study, we analyzed the functional connectomes from functional magnetic resonance imaging (fMRI) to prove this hypothesis and investigate the characteristics of the network by embedding it into the hyperbolic space, by utilizing human connectome project (HCP) dataset for healthy young adults and Autism Brain Imaging Data Exchange II (ABIDE II) dataset for diseased autism subject and control group. Nodes of the network were defined at two different scales: by 274 predefined ROIs and 6mm-sized voxels. The adjacency between the nodes was determined by computing the correlation of the time-series of the BOLD signal of brain regions and binarized by adopting threshold value. First, we aimed to find out whether the network was scale-free by investigating the degree distribution of the functional brain network. The probability distribution function (PDF) versus degree was plotted as a straight line at a log-log scale graph versus the degree of nodes. This indicates that degree distribution is roughly proportional to a power function of degree, or scale-free. To clarify the most fitting underlying geometry of the network, we then embedded the graph into manifolds of Euclidean, hyperbolic, or spherical spaces and compared the fidelity measures of embeddings. The embedding to the hyperbolic spaces yielded a better fidelity measure compared to other manifolds. To get a discrete and visible map and investigate the characteristics of the network, we embedded the network in a two-dimensional hyperbolic disc by the 1/ℍ2 model. The radial and angular dimensions in the embedding is interpreted as popularity and similarity dimensions, respectively. The ROI-wise analysis revealed that no nodes with particularly high popularity were found, which was revealed by a vacant area in the center of the disk. Nodes in the same lobe were more likely to be clustered in narrow similarity dimensions, and the nodes from the homotopic lobes were also functionally clustered. The results indicate the anatomic relevance of the functional brain network and the strong functional coherence of the homotopic area of the cerebral cortex. The voxel-wise analysis revealed additional features. A large number of voxels from the cerebellum were scattered in the whole angular position, which might reflect the functional heterogeneity of the cerebellum in the sub-ROI level. Additionally, multiple rod-shaped substructures of radial direction were found, which indicates sets of voxels with functional similarity. When compared with independent component analysis (ICA)-driven results, each large-scale component of the brain acquired by ICA showed a consistent pattern of embedding between the subjects. To find the abnormality of the network in the diseased patient, we utilized the autistic spectrum disorder (ASD) dataset. The two groups of ASD and the control group were found to be comparable in means of the quality of embedding. We calculated the hyperbolic distance between all edges of the network and searched for the alteration of the distance of the individual brain network. Among the variable results among the networks of ASD group subjects, the alteration of the cortico-striatal pathway in an autism patient and posterior superior temporal sulcus (pSTS) in an Asperger’s syndrome patient were present, respectively. The two different anatomically-scaled layers of the network showed a certain degree of correspondence in terms of degree-degree correlation and spreading pattern of network. But anatomically parcellated ROI did not guarantee the functional similarity between the voxels composing it. Finally, to investigate the reproducibility of the embedding process, we repeatedly performed the embedding process and computed the variance of distance matrices. The result was stable except for end-positioned non-popular nodes. Furthermore, to investigate consistency along time-series of fMRI, we compared network yielded by segments of the time series. The segmented networks showed similar results when divided into four frames, but the result lost consistency when divided into 30 frames of 30 seconds each. This study is the first to investigate the characteristics of the functional brain network on the basis of hyperbolic geometry. We suggest a new method applicable for assessing the network alteration in subjects with a neuropsychiatric disease, and these approaches grant us a new understanding in analyzing the functional brain network with a geometric perspective.1. Introduction 1 1.1. Human brain networks 1 1.1.1. Geometry of human brain networks 2 1.2. Scale-free network 3 1.2.1. Definition of a scale-free network 4 1.3. Embedding of the network in hyperbolic space 5 1.3.1. Hyperbolic spaces and Poincaré disk 5 1.3.2. Geometric model of 1/ℍ2 9 1.4. The aim of the present study 10 2. Methods 12 2.1. Subjects and image acquisition 12 2.1.1. Human connectome project (HCP) dataset 12 2.1.2. Autism Brain Imaging Data Exchange II (ABIDE II) dataset 12 2.2. Preprocessing for resting-state fMRI 15 2.3. Resting-state networks and functional connectivity analysis 16 2.3.1. Analyzing degree distribution 18 2.4. Assessing underlying geometry 18 2.4.1. The three component spaces 18 2.4.2. Embedding into spaces 20 2.5. Embedding of the network in the 1/ℍ2 model 22 2.6. Comparison with ICA-driven method 23 2.7. Assessing the quality of embedding 23 2.8. Abnormality detection in the diseased subject 24 2.9. Assessing variability of analysis 27 3. Results 29 3.1. Global characteristics of the network 29 3.1.1. The degree distribution 31 3.1.2. Determining the threshold value of network 34 3.2. Graph embedding into spaces 36 3.3. 1/ℍ2 model analysis 39 3.4. Quality of the embedding 58 3.5. Alteration of the network in the diseased subject 61 3.6. Variability of results 63 3.6.1. Reproducibility of Mercator 63 3.6.2. Time variance of results 67 4. Discussion 70 4.1. Composition of the network 70 4.2. Scale-freeness of brain network 71 4.3. The underlying geometry of brain network 73 4.4. Hyperbolic plane representation 75 4.4.1. Voxelwise approach 78 4.4.2. Compatibility with ICA 80 4.5. Alteration of the network in ASD subjects 81 4.6. Variability and reproducibility of methods 83 4.7. Further applications 85 5. Conclusion 87 References 89 국문 초록 106박