Editing List of algorithms (section)

====Image processing====
{{further|Digital image processing}}
* Contrast Enhancement
** [[Histogram equalization]]: use histogram to improve image contrast
** [[Adaptive histogram equalization]]: histogram equalization which adapts to local changes in contrast
* [[Connected-component labeling]]: find and label disjoint regions
* [[Dithering]] and [[half-toning]]
** [[Error diffusion]]
** [[Floyd–Steinberg dithering]]
** [[Ordered dithering]]
** [[Riemersma dithering]]
* Elser [[difference-map algorithm]]: a search algorithm for general constraint satisfaction problems.  Originally used for [[X-ray crystallography|X-Ray diffraction]] microscopy
* [[Feature detection (computer vision)|Feature detection]]
** [[Canny edge detector]]: detect a wide range of edges in images
** [[Generalised Hough transform]]
** [[Hough transform]]
** [[Marr–Hildreth algorithm]]: an early [[edge detection]] algorithm
** [[Scale-invariant feature transform|SIFT]] (Scale-invariant feature transform): is an algorithm to detect and describe local features in images.
** {{visible anchor|SURF ([[speeded up robust features|Speeded Up Robust Features]])}}: is a robust local feature detector, first presented by Herbert Bay et al. in 2006, that can be used in computer vision tasks like object recognition or 3D reconstruction. It is partly inspired by the SIFT descriptor. The standard version of SURF is several times faster than SIFT and claimed by its authors to be more robust against different image transformations than SIFT.<ref>{{cite web |url=http://www.vision.ee.ethz.ch/~surf/eccv06.pdf |title=Archived copy |website=www.vision.ee.ethz.ch |access-date=13 January 2022 |archive-url=https://web.archive.org/web/20070221214147/http://www.vision.ee.ethz.ch/~surf/eccv06.pdf |archive-date=21 February 2007 |url-status=dead}}</ref><ref>{{cite web |url=http://glorfindel.mavrinac.com/~aaron/school/pdf/bay06_surf.pdf |title=Archived copy |access-date=2013-10-05 |url-status=dead |archive-url=https://web.archive.org/web/20131006113018/http://glorfindel.mavrinac.com/~aaron/school/pdf/bay06_surf.pdf |archive-date=2013-10-06 }}</ref>
* [[Richardson–Lucy deconvolution]]: image de-blurring algorithm
* [[Blind deconvolution]]: image de-blurring algorithm when [[point spread function]] is unknown.
* [[Median filtering]]
* [[Seam carving]]: content-aware image resizing algorithm
* [[Segmentation (image processing)|Segmentation]]: partition a digital image into two or more regions
** [[GrowCut algorithm]]: an interactive segmentation algorithm
** [[Random walker algorithm]]
** [[Region growing]]
** [[Watershed (algorithm)|Watershed transformation]]: a class of algorithms based on the watershed analogy