An animated simulation of Particles in 2D searching for a global minima of a simple function using Particle Swarm Optimization algorithm
This script provides the final interval of uncertainty in which the minima of single variable non linear/linear function. The function should be unimodal in the interval. The script checks the unimodality of the function.User inputs the initial...
unimodality of a single variable function in a given interval refers to existence of at the most only one maxima or minima. This script checks the unimodality of the function in the interval provided by the user.
This function uses vectorised methods to determine the locations of maxima and minima where they exist within a piecewise spline fit. The matlab built-in functions for determining the maxima and minima, by differentiating the pp spline and finding...
Rosenbrock equation's minima has been evaluated by using Fletcher Reeves method.
file contains 4 m files. Rosenbrock.m Cojugategradient.m and two other important files.
This script provides the final interval of uncertainty in which the minima of single variable non linear/linear function. The function should be unimodal in the interval. The script checks the unimodality of the function.User inputs the initial...
The filter computes the minima and/or maxima of an array over sliding window with a given size.
Multidimensional array is fully supported: running filter in 1D, 2D filter for image processing applications (erosion/dilatation), 3D and...
This function quickly finds local peaks or valleys (local extrema) in a noisy vector using a user defined magnitude threshold to determine if each peak is significantly larger (or smaller) than the data around it. The problem with the strictly...
While working with a histogram we may need to detect a peak or crest of the histogram.But the histogram contains a number of local minima & maxima which makes the histogram extremely uneven.While detecting a peak or crest we are intended to...
====================================== main executing reference usage: usage_proclivityStateTracking.m * Each trend data point are to be of large time interval
This is a php based program with which users can install apache web server with Mysql and php / without any hassle. It is available in single distribution for linux. It is easy to understand and easy to use. This program can be configured with...
Data structures for solving the following two problems:
Range minimization: given an array X of data, quickly find min(X[i:j]) for different ranges i:j. Least common ancestors: given a tree, quickly find the lowest tree node...
These are two similar programs. They operate to find coordinates and indices of extreme points in a set of x,y data. they are usful for a purposes ranging between finding positions where the first derivative is zero to obtaining envelops of...
This is a very simple function to find the local maximum in any dimensional array. As simple as it is it still gives nice results.
I use the imdilate() function as a maximum operation and then compare the data to the result.
PEAKFIND general 1D peak finding algorithm peakfind(x_data,y_data) peakfind(x_data,y_data,upsam) peakfind(x_data,y_data,upsam,gsize,gstd) peakfind(x_data,y_data,upsam,htcut,'cuttype') ...
Let r_scale be the neighborhood radius scale, a brute search method would require N*r_scale to detect the valleys with neighborhood size of r_scale in 1d signal or N*r_scale*r_scale complexity in 2d image. Which is too slow in large data size. In...
This is a large set of test functions, which may be used to test the effectiveness of global optimization algorithms. Some are rather easy to optimize (rosenbruck, leon, ...), others next to impossible (crosslegtable, bukin6, ...).
All...
anneal Minimizes a function with the method of simulated annealing (Kirkpatrick et al., 1983) ANNEAL takes three input parameters, in this order:
LOSS is a function handle (anonymous function or inline) with a loss function,...
This function finds dominant peaks and valleys of an image histogram. Minimum peak distance and averaging filter size can be changed to suit your need. Although, the function is originally written for mages, there is no reason why this can't...
function [i,i_] = fgridmin(y) % Search an N-dimensional array y for points that may be proximate to a global minimum % of the interpolated array; return the proximate points' N-D subscripts (i) in y. Also % optionally return the... |