image thumbnail

updated 2 years ago

Skeleton Branchpoint Connectivity Finder by Ryan

Determines if branchpoints of a skeleton are of 3 (Y) or 4 (X) bit connectivity. (image processing, bwmorph, branchpoints)

XorYbranchpoint(skeleton,branchpoints)

image thumbnail

updated 2 years ago

Label the largest pixel/voxel group in an image by Sheng Yue

LABELLARGEST keep the largest N isolated regions in the image (connectivity, bwconncomp, connected components)

LabelLargest(IM,pieces,conn)

image thumbnail

updated almost 3 years ago

CeItrConnGUI by Gal Haspel

This GUI is used to study the iterativity of connections within the locomotion network of C. elegans (c elegans, neuronal network, connectivity)

CIC_MNtoMN(MuscleBin, NeurConnNames, NeurConnNumbs, MNnam...

CIC_NMJs(MuscleBin, MNnamesSrc, FPNumbs, FPNames, MNnames...

CIC_Open(Method, FileName, PathName)

image thumbnail

updated 3 years ago

label2CC by Sean de

This function takes a label image and converts it to a CC struct, the same output as bwconncomp. (labelmatrix, bwconncomp, bwlabel)

label2CC(L,conn)

image thumbnail

updated 4 years ago

Remove Unconnected Triangle by David Gingras

This function takes a triangular mesh and remove the unconnected cells. (delaunay, triangulation, mesh)

[TRI2 XYZ2]=removeUnconnectedTri(TRI1,XYZ1,triID)

image thumbnail

updated 5 years ago

Assign connectivity ID to 2D triangular mesh by David Gingras

This function assigns an ID based on the connectivity for each cell of a 2D triangular mesh. (mesh, triangulation, connectivity)

groupID=connectivityTri(TRI)

image thumbnail

updated 5 years ago

Shortest path (all pair shortest path) by Bharat Patel

Finds all pair shortest path. (dijkstra, shortest path, all pair)

mdijkstra(A,C)

image thumbnail

updated almost 8 years ago

CoCoMac by James Allen

Download CoCoMac.org cortical connectivity data, model it as a network, and simulate epileptic sprea (gui tools, example, cocomac)

circulargraph2(matrix,labels, plotHandle);

clustering(net, netLabels)

download()

Contact us