• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제25권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.

• 한국멀티미디어학회논문지
• /
• 제22권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.

• 한국멀티미디어학회논문지
• /
• 제21권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.

• 한국멀티미디어학회논문지
• /
• 제19권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.

• 한국인터넷방송통신학회논문지
• /
• 제18권1호
• /
• pp.223-229
• /
• 2018

본 논문에서는 이미지에서 검출된 각 연결성분들의 위상적 지속구간 정보를 그래프 기반 이미지 세그멘테이션에 결합하여 보다 안정적인 이미지 세그멘테이션 기법을 제안한다. 이미지의 밝기 또는 색상정보 등을 이용하여 모스 함수를 정의하고 이의 레벨세트로부터 각 연결성분의 위상적 지속구간을 구한다. 각 연결성분이 생성되고 긴 지속구간을 갖는 연결성분에 적절히 병합되는 과정을 영 차원 호몰로지 군의 관점에서 설명한다. 다양한 특성을 갖는 이미지들에 대하여 짧은 지속구간을 갖는 연결성분들을 지속구간이 긴 인근 성분에 적절히 병합시키는 과정을 통하여 보다 안정적인 이미지 세그멘테이션 결과들 얻을 수 있음을 실험으로 확인한다.

• 전자공학회지
• /
• 제42권2호
• /
• pp.45-56
• /
• 2015

• 한국인터넷방송통신학회논문지
• /
• 제16권1호
• /
• pp.291-299
• /
• 2016

본 논문에서는 임의의 주기적인 현상이나 특성은 위상구조와 밀접한 관련이 있음을 추론하고 이를 실험적으로 확인한다. 실험대상으로 주기적 특성이 있는 다양한 악기음을 선택하여 이를 유클리드 공간에 임베딩하고 이로부터 호몰로지 군을 계산하여 위상특성을 분석한다. 이를 위하여, 파형신호에서 추출한 패치모음을 패치 그래프로 구성한 다음, 대표적인 다양체 학습 방식인 통근시간 임베딩 기법을 이용하여 기하구조로 변환한다. 스펙트럼이 시간에 따라 가변적인 파형신호를 통근시간 임베딩할 때, 그에 따라 생성되는 기하구조는 변화하지만 그 신호 고유의 내재된 위상구조는 거의 변하지 않는다. 본 논문에서는 임베딩 데이터의 일부를 표본화하여 단순 복합체를 구성한 다음 이로부터 호몰로지를 계산하여 임베딩 기하구조의 위상특성을 분석하고, 이의 활용방안을 논의한다.

• 응용통계연구
• /
• 제25권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.

• 한국동물위생학회지
• /
• 제45권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, E^rns. 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.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권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.