edu.stanford.math.plex4.autogen.homology

Class BooleanPersistenceAlgorithm<U>

java.lang.Object

edu.stanford.math.plex4.homology.interfaces.AbstractPersistenceAlgorithm<T>

edu.stanford.math.plex4.homology.interfaces.AbstractPersistenceBasisAlgorithm<U,edu.stanford.math.primitivelib.autogen.formal_sum.BooleanSparseFormalSum<U>>

edu.stanford.math.plex4.autogen.homology.BooleanPersistenceAlgorithm<U>

Direct Known Subclasses:

BooleanPersistentHomology

public abstract class BooleanPersistenceAlgorithm<U>
extends AbstractPersistenceBasisAlgorithm<U,edu.stanford.math.primitivelib.autogen.formal_sum.BooleanSparseFormalSum<U>>

This class defines the functionality for a persistence algorithm with underlying field type being boolean and underlying basis element type being U. It acts as an intermediate layer between the interface AbstractPersistenceBasisAlgorithm and the actual implementations of the persistent homology/cohomology algorithms.

boolean the underlying type of the coefficient field

U the underlying basis type

Author:

autogen

Field Summary

Fields

Modifier and Type	Field and Description
protected java.util.Comparator<U>	basisComparator This comparator defines the ordering on the basis elements.
protected edu.stanford.math.primitivelib.autogen.formal_sum.BooleanPrimitiveFreeModule<U>	chainModule This objects performs the chain computations.
protected java.util.Comparator<U>	filteredComparator This comparator provides the dictionary ordering on filtration value - basis element pairs.
protected int	maxDimension This stores the maximum dimension for which to compute (co)homology.
protected int	minDimension This stores the minimum dimension for which to compute (co)homology.

Constructor Summary

Constructors

Constructor and Description
BooleanPersistenceAlgorithm(java.util.Comparator<U> basisComparator, int minDimension, int maxDimension) This constructor initializes the object with a comparator on the basis type.

Method Summary

Methods

Modifier and Type	Method and Description
AnnotatedBarcodeCollection<java.lang.Integer,edu.stanford.math.primitivelib.autogen.formal_sum.BooleanSparseFormalSum<U>>	computeAnnotatedIndexIntervals(AbstractFilteredStream<U> stream) This function computes the augmented persistence index intervals for a supplied filtered chain complex.
protected abstract AnnotatedBarcodeCollection<java.lang.Integer,edu.stanford.math.primitivelib.autogen.formal_sum.BooleanSparseFormalSum<U>>	computeAnnotatedIntervalsImpl(AbstractFilteredStream<U> stream) This function provides the implementation of computeAnnotatedIntervals.
BarcodeCollection<java.lang.Integer>	computeIndexIntervals(AbstractFilteredStream<U> stream) This function computes the persistence index intervals of a filtered chain complex.
protected abstract BarcodeCollection<java.lang.Integer>	computeIntervalsImpl(AbstractFilteredStream<U> stream) This function provides the implementation of computeIntervals.
edu.stanford.math.primitivelib.autogen.formal_sum.BooleanPrimitiveFreeModule<U>	getChainModule() This function returns the free module used for the arithmetic computations.
protected void	initializeFilteredComparator(AbstractFilteredStream<U> stream) This function simply updates the filtered comparator to the one induced by the given filtered stream.
protected U	low(edu.stanford.math.primitivelib.autogen.formal_sum.BooleanSparseFormalSum<U> chain) This function computes the operation low_A(j) as described in the paper.

Methods inherited from class edu.stanford.math.plex4.homology.interfaces.AbstractPersistenceBasisAlgorithm

computeAnnotatedIntervals

Methods inherited from class edu.stanford.math.plex4.homology.interfaces.AbstractPersistenceAlgorithm

computeIntervals

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

chainModule

protected final edu.stanford.math.primitivelib.autogen.formal_sum.BooleanPrimitiveFreeModule<U> chainModule

This objects performs the chain computations.

basisComparator

protected final java.util.Comparator<U> basisComparator

This comparator defines the ordering on the basis elements.

filteredComparator

protected java.util.Comparator<U> filteredComparator

This comparator provides the dictionary ordering on filtration value - basis element pairs.

minDimension

protected int minDimension

This stores the minimum dimension for which to compute (co)homology.

maxDimension

protected int maxDimension

This stores the maximum dimension for which to compute (co)homology.

Constructor Detail

BooleanPersistenceAlgorithm

public BooleanPersistenceAlgorithm(java.util.Comparator<U> basisComparator,
                           int minDimension,
                           int maxDimension)

This constructor initializes the object with a comparator on the basis type.

Parameters:

basisComparator - a comparator on the basis type U

minDimension - the minimum dimension to compute

maxDimension - the maximum dimension to compute

Method Detail

initializeFilteredComparator

protected void initializeFilteredComparator(AbstractFilteredStream<U> stream)

This function simply updates the filtered comparator to the one induced by the given filtered stream.

Parameters:

stream - the AbstractFilteredStream that provides the filtration index information

getChainModule

public edu.stanford.math.primitivelib.autogen.formal_sum.BooleanPrimitiveFreeModule<U> getChainModule()

This function returns the free module used for the arithmetic computations.

Returns:

the free module over chains in U

computeIndexIntervals

public BarcodeCollection<java.lang.Integer> computeIndexIntervals(AbstractFilteredStream<U> stream)

Description copied from class: AbstractPersistenceAlgorithm

This function computes the persistence index intervals of a filtered chain complex. In other words, it returns intervals corresponding to the internal filtration indices of the basis elements.

Specified by:

computeIndexIntervals in class AbstractPersistenceAlgorithm<U>

Parameters:

stream - the filtered chain complex

Returns:

the persistence intervals of the given complex

computeAnnotatedIndexIntervals

public AnnotatedBarcodeCollection<java.lang.Integer,edu.stanford.math.primitivelib.autogen.formal_sum.BooleanSparseFormalSum<U>> computeAnnotatedIndexIntervals(AbstractFilteredStream<U> stream)

Description copied from class: AbstractPersistenceBasisAlgorithm

This function computes the augmented persistence index intervals for a supplied filtered chain complex. The augmented persistence intervals are the same as the regular persistence intervals, except that each interval is annotated with a generator of type B. Note that it returns intervals corresponding to the internal filtration indices of the basis elements.

Specified by:

computeAnnotatedIndexIntervals in class AbstractPersistenceBasisAlgorithm<U,edu.stanford.math.primitivelib.autogen.formal_sum.BooleanSparseFormalSum<U>>

Parameters:

stream - the filtered chain complex

Returns:

the augmented persistence intervals

computeIntervalsImpl

protected abstract BarcodeCollection<java.lang.Integer> computeIntervalsImpl(AbstractFilteredStream<U> stream)

This function provides the implementation of computeIntervals.

Parameters:

stream - the filtered chain complex

Returns:

the persistence intervals of the given complex

computeAnnotatedIntervalsImpl

protected abstract AnnotatedBarcodeCollection<java.lang.Integer,edu.stanford.math.primitivelib.autogen.formal_sum.BooleanSparseFormalSum<U>> computeAnnotatedIntervalsImpl(AbstractFilteredStream<U> stream)

This function provides the implementation of computeAnnotatedIntervals.

Parameters:

stream - the filtered chain complex

Returns:

the augmented persistence intervals

low

protected U low(edu.stanford.math.primitivelib.autogen.formal_sum.BooleanSparseFormalSum<U> chain)

This function computes the operation low_A(j) as described in the paper. Note that if the chain is empty (for example the column contains only zeros), then this function returns null.

Parameters:

chain - the chain to search

Returns:

the lowest element of the chain