Connects randomly ordered 2D points into a minimal nearest neighbor contour.
Given any list of 2D points (Xin,Yin), construct a singly connected nearest-neighbor path in either the 'cw' or 'ccw' directions. The code has been written to handle square and hexagon grid points, as well as any non-grid arrangement of...
Generate a list of file names that meet a set of text search criteria.
filenames = filefinder('searchpath','searchterm1','seartchterm2',...);
This function will return a...
Connected component analysis on undirected graphs, with thresholding and connectivity constraints.
Tristan Ursell, (c) 2012
Connected component analysis on an undirected graph, with various
thresholding and connectivity...
PEAKFIND general 1D peak finding algorithm
Reduce image noise by measuring local pixel statistics and remapping intensities.
Tristan Ursell (c)
Relative Noise Transform
Sub-pixel Resolved 2D Convolution
This function takes an input matrix mat1 and creates an image of the
matrix mat2 at the position (x,y) in mat1. If...
Create images with diffraction-limited spots of varying size and intensity, with noise.
Create an image with randomly positioned, diffraction-limited spots with full data on actual spot positions and...