• Title/Summary/Keyword: Persistent homology

Search Result 10, Processing Time 0.026 seconds

INSTABILITY OF THE BETTI SEQUENCE FOR PERSISTENT HOMOLOGY AND A STABILIZED VERSION OF THE BETTI SEQUENCE

  • JOHNSON, MEGAN;JUNG, JAE-HUN
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.25 no.4
    • /
    • pp.296-311
    • /
    • 2021
  • Topological Data Analysis (TDA), a relatively new field of data analysis, has proved very useful in a variety of applications. The main persistence tool from TDA is persistent homology in which data structure is examined at many scales. Representations of persistent homology include persistence barcodes and persistence diagrams, both of which are not straightforward to reconcile with traditional machine learning algorithms as they are sets of intervals or multisets. The problem of faithfully representing barcodes and persistent diagrams has been pursued along two main avenues: kernel methods and vectorizations. One vectorization is the Betti sequence, or Betti curve, derived from the persistence barcode. While the Betti sequence has been used in classification problems in various applications, to our knowledge, the stability of the sequence has never before been discussed. In this paper we show that the Betti sequence is unstable under the 1-Wasserstein metric with regards to small perturbations in the barcode from which it is calculated. In addition, we propose a novel stabilized version of the Betti sequence based on the Gaussian smoothing seen in the Stable Persistence Bag of Words for persistent homology. We then introduce the normalized cumulative Betti sequence and provide numerical examples that support the main statement of the paper.

Region Segmentation using Discrete Morse Theory - Application to the Mammography (이산 모스 이론을 이용한 영역 분할 - 맘모그래피에의 응용)

  • Hahn, Hee Il
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.1
    • /
    • pp.18-26
    • /
    • 2019
  • In this paper we propose how to detect circular objects in the gray scale image and segment them using the discrete Morse theory, which makes it possible to analyze the topology of a digital image, when it is transformed into the data structure of some combinatorial complex. It is possible to get meaningful information about how many connected components and topologically circular shapes are in the image by computing the persistent homology of the filtration using the Morse complex. We obtain a Morse complex by modeling an image as a cubical cellular complex. Each cell in the Morse complex is the critical point at which the topological structure changes in the filtration consisting of the level sets of the image. In this paper, we implement the proposed algorithm of segmenting the circularly shaped objects with a long persistence of homology as well as computing persistent homology along the filtration of the input image and displaying in the form of a persistence diagram.

Proposing the Technique of Shape Classification Using Homology (호몰로지를 이용한 형태 분류 기법 제안)

  • Hahn, Hee Il
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.1
    • /
    • pp.10-17
    • /
    • 2018
  • Persistence Betty numbers, which are the rank of the persistent homology, are a generalized version of the size theory widely known as a descriptor for shape analysis. They show robustness to both perturbations of the topological space that represents the object, and perturbations of the function that measures the shape properties of the object. In this paper, we present a shape matching algorithm which is based on the use of persistence Betty numbers. Experimental tests are performed with Kimia dataset to show the effectiveness of the proposed method.

Topological Analysis of Spaces of Waveform Signals (파형 신호 공간의 위상 구조 분석)

  • Hahn, Hee Il
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.2
    • /
    • pp.146-154
    • /
    • 2016
  • This paper presents methods to analyze the topological structures of the spaces composed of patches extracted from waveform signals, which can be applied to the classification of signals. Commute time embedding is performed to transform the patch sets into the corresponding geometries, which has the properties that the embedding geometries of periodic or quasi-periodic waveforms are represented as closed curves on the low dimensional Euclidean space, while those of aperiodic signals have the shape of open curves. Persistent homology is employed to determine the topological invariants of the simplicial complexes constructed by randomly sampling the commute time embedding of the waveforms, which can be used to discriminate between the groups of waveforms topologically.

Proposal of Image Segmentation Technique using Persistent Homology (지속적 호몰로지를 이용한 이미지 세그멘테이션 기법 제안)

  • Hahn, Hee Il
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.1
    • /
    • pp.223-229
    • /
    • 2018
  • This paper proposes a robust technique of image segmentation, which can be obtained if the topological persistence of each connected component is used as the feature vector for the graph-based image segmentation. The topological persistence of the components, which are obtained from the super-level set of the image, is computed from the morse function which is associated with the gray-level or color value of each pixel of the image. The procedure for the components to be born and be merged with the other components is presented in terms of zero-dimensional homology group. Extensive experiments are conducted with a variety of images to show the more correct image segmentation can be obtained by merging the components of small persistence into the adjacent components of large persistence.

Analysis of Topological Invariants of Manifold Embedding for Waveform Signals (파형 신호에 대한 다양체 임베딩의 위상학적 불변항의 분석)

  • Hahn, Hee-Il
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.291-299
    • /
    • 2016
  • This paper raises a question of whether a simple periodic phenomenon is associated with the topology and provides the convincing answers to it. A variety of music instrumental sound signals are used to prove our assertion, which are embedded in Euclidean space to analyze their topologies by computing the homology groups. A commute time embedding is employed to transform segments of waveforms into the corresponding geometries, which is implemented by organizing patches according to the graph-based metric. It is shown that commute time embedding generates the intrinsic topological complexities although their geometries are varied according to the spectrums of the signals. This paper employs a persistent homology to determine the topological invariants of the simplicial complexes constructed by randomly sampling the commute time embedding of the waveforms, and discusses their applications.

Visualization of Bottleneck Distances for Persistence Diagram

  • Cho, Kyu-Dong;Lee, Eunjee;Seo, Taehee;Kim, Kwang-Rae;Koo, Ja-Yong
    • The Korean Journal of Applied Statistics
    • /
    • v.25 no.6
    • /
    • pp.1009-1018
    • /
    • 2012
  • Persistence homology (a type of methodology in computational algebraic topology) can be used to capture the topological characteristics of functional data. To visualize the characteristics, a persistence diagram is adopted by plotting baseline and the pairs that consist of local minimum and local maximum. We use the bottleneck distance to measure the topological distance between two different functions; in addition, this distance can be applied to multidimensional scaling(MDS) that visualizes the imaginary position based on the distance between functions. In this study, we use handwriting data (which has functional forms) to get persistence diagram and check differences between the observations by using bottleneck distance and the MDS.

Prevalence study of bovine viral diarrhea virus (BVDV) from cattle farms in Gyeongsangnam-do, South Korea in 2021 (2021년 경남지역 소바이러스성설사 바이러스(BVDV) 감염실태 조사)

  • Son, Yongwoo;Cho, Seonghee;Ji, Jeong-Min;Cho, Jae-Kyu;Bang, Sang-Young;Choi, Yu-Jeong;Kim, Cheol-Ho;Kim, Woo Hyun
    • Korean Journal of Veterinary Service
    • /
    • v.45 no.3
    • /
    • pp.211-219
    • /
    • 2022
  • Bovine viral diarrhea (BVD) is one of the problematic wasting diseases in cattle leading to huge economic losses. This study was conducted to investigate the prevalence of BVD including transient and persistent infection from cattle farms in Gyeongsangnam-do. A total of 2,667 blood samples from 24 farms were collected and the sera were subjected to ELISA to detect BVD virus (BVDV) antigen, Erns. 5' untranslated region (5'-UTR) of BVDV-positive samples was sequenced to identify the genotype, and compared with isolates previously reported elsewhere. There were fourteen BVDV-positive calves from 2,667 samples (positive rate: 0.52%) from first ELISA testing followed by eight persistently infected out of eleven BVDV-positive samples (72.73%) in secondary ELISA that was conducted in at least four weeks suggesting the circulation of BVDV in the area. Sequencing analysis exhibited that thirteen BVDV-positive samples were identified as BVDV-1b and one sample was BVDV-2a. Phylogenetic analysis revealed that the BVDV-1b-positive samples showed the highest homology in nucleotide sequence to Korean isolates collected from Sancheong, Gyeongsangnam-do, while the BVDV-2a-positive sample (21GN7) was more similar to reference strains collected outside South Korea. This study will provide the recent fundamental data on BVD prevalence in Gyeongsangnam-do to be referred in developing strategies to prevent BVDV in South Korea.

A NODE PREDICTION ALGORITHM WITH THE MAPPER METHOD BASED ON DBSCAN AND GIOTTO-TDA

  • DONGJIN LEE;JAE-HUN JUNG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.27 no.4
    • /
    • pp.324-341
    • /
    • 2023
  • Topological data analysis (TDA) is a data analysis technique, recently developed, that investigates the overall shape of a given dataset. The mapper algorithm is a TDA method that considers the connectivity of the given data and converts the data into a mapper graph. Compared to persistent homology, another popular TDA tool, that mainly focuses on the homological structure of the given data, the mapper algorithm is more of a visualization method that represents the given data as a graph in a lower dimension. As it visualizes the overall data connectivity, it could be used as a prediction method that visualizes the new input points on the mapper graph. The existing mapper packages such as Giotto-TDA, Gudhi and Kepler Mapper provide the descriptive mapper algorithm, that is, the final output of those packages is mainly the mapper graph. In this paper, we develop a simple predictive algorithm. That is, the proposed algorithm identifies the node information within the established mapper graph associated with the new emerging data point. By checking the feature of the detected nodes, such as the anomality of the identified nodes, we can determine the feature of the new input data point. As an example, we employ the fraud credit card transaction data and provide an example that shows how the developed algorithm can be used as a node prediction method.