I have a huge 3D big data (128×128×128). I want to compute the Betti numbers for this 3D data. I tried using the moguTDA and ripser packages from Python and my kernel dies when I try computing the Betti numbers. Is there a big data approach to compute the Betti numbers?
Computing persistent homology Betti numbers on big data
273 Views Asked by karthik subramanian At
1
There are 1 best solutions below
Related Questions in PYTHON
- How to store a date/time in sqlite (or something similar to a date)
- Instagrapi recently showing HTTPError and UnknownError
- How to Retrieve Data from an MySQL Database and Display it in a GUI?
- How to create a regular expression to partition a string that terminates in either ": 45" or ",", without the ": "
- Python Geopandas unable to convert latitude longitude to points
- Influence of Unused FFN on Model Accuracy in PyTorch
- Seeking Python Libraries for Removing Extraneous Characters and Spaces in Text
- Writes to child subprocess.Popen.stdin don't work from within process group?
- Conda has two different python binarys (python and python3) with the same version for a single environment. Why?
- Problem with add new attribute in table with BOTO3 on python
- Can't install packages in python conda environment
- Setting diagonal of a matrix to zero
- List of numbers converted to list of strings to iterate over it. But receiving TypeError messages
- Basic Python Question: Shortening If Statements
- Python and regex, can't understand why some words are left out of the match
Related Questions in VOXEL
- How to estimate the memory size of a binary voxelized geometry?
- Prevent Matplotlib voxels from shading facecolors
- How to use Viktor Ferenczi's Godot Voxel addon?
- 3d array data in json file, I want to read the content in C# unity
- How can I declare an enum in wgsl?
- How to calculate Uvs from texture atlas?
- Voxelization Issue with Open3D: Incomplete Filling Along Some Triangle Faces
- faster way to iterate through a chunk of voxels in rust?
- Determining voxelized .json file format
- Trying to insert a sphere defect (.ply) into an object (.obj) using Voxel Method bypassing Airspaces and Vertices using the open3d
- Can I access the mesh output of a mesh shader back to CPU?
- Function to find points along a vector line in a CT image
- No voxels with a sufficient number of points. I cannot solve this by changing parameters in setLeafSize
- Voxel Array creates a voxel that's not part of the scene
- Creating VoxelGrid using Voxels (Open3D)
Related Questions in TOPOLOGY
- Is there a way to reorder vertices?
- Correct way to loop through a list in R
- Slurm - How does topology/tree actually link to the scheduling-logic and how does it model the topology?
- RLock(s) were not greened, Eventlet.monkey(patch) error
- Getting output of CLI commands in some text file
- Round-Robin Ryu controller for mininet
- Offset buffer to another geometry
- Comparing topological structure of similar data sets
- Containment algorithms and Convex hull algorithms to check if a point is inside the d dimensional convex hull spanned by n vectors
- KafkaStreams doesn't accept my serde in StreamsConfig
- R persistence homology - identify points that generate topological features
- Blender Topology and UV editing, how to put a tileable texture on a curved mesh? How to make the topology better?
- Mathematica and Sympy is unable to simplify expressions such as log(e^A) to A, and errors involving for Integrating limtis to be real
- Computing persistent homology Betti numbers on big data
- Barcode with Vietoris Rips Filtration
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
It is unclear what you are trying to compute. You mention voxel data and Gudhi, so I would have expected gudhi.CubicalComplex, but you seem to derive a point cloud and build its RipsComplex instead?
For a cubical complex, 128³ is far from huge, gudhi.CubicalComplex can handle that easily. For significantly larger input, I recommend reading the recent paper Slice, Simplify and Stitch: Topology-Preserving Simplification Scheme for Massive Voxel Data. It is about the software Cubicle, which was used in particular on grids of size 2048³ (on a laptop). It also mentions other software like Cubical Ripser and TTK (topology toolkit).
Rips filtrations are a different business. By default, gudhi.RipsComplex first computes the distance between each pair of points, to check if it is less than max_edge_length. This quadratic behavior is already hard to manage for a million points. In low dimension, it seldom makes sense to use a Rips filtration, gudhi.AlphaComplex makes much more sense.
Note that if other software causes the Python kernel to crash, you could try reporting a bug to the authors of such software, sometimes a small tweak can replace that with an exception.