Porównaj metody

	Segmentacja wododziałowa	Detekcja obszarów (blob detection)	Detekcja krawędzi Canny'ego	Analiza konturu	Uśrednianie histogramu
Dziedzina	Widzenie komputerowe	Widzenie komputerowe	Widzenie komputerowe	Widzenie komputerowe	Widzenie komputerowe
Rodzina	Machine learning	Machine learning	Machine learning	Machine learning	Machine learning
Rok powstania	1979	1998	1986	1985	1970s
Twórca	Serge Beucher and Christian Lantuéjoul	Tony Lindeberg	John Canny	Satoshi Suzuki and Keiichi Abe	Signal processing community
Typ	Morphological image segmentation	Multi-scale feature detection	Image gradient analysis	Shape and contour analysis	Contrast enhancement and preprocessing
Źródło pierwotne	Meyer, F. (1994). Topographic distance and watershed lines. Signal Processing, 38(1), 113–125.	Lindeberg, T. (1998). Feature detection with automatic scale selection. International Journal of Computer Vision, 30(2), 79–116.	Canny, J. (1986). A computational approach to edge detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 8(6), 679–698.	Suzuki, S., & Abe, K. (1985). Topological structural analysis of digitized binary images by border following. Computer Vision, Graphics, and Image Processing, 30(1), 32–46.	Gonzalez, R. C., & Woods, R. E. (1992). Digital Image Processing. Addison-Wesley, 2nd edition, Chapter 3.
Inne nazwy	Watershed transform, Water shedding segmentation	Connected component analysis, Region-based detection	Canny operator, Canny edge detector	Edge-based contours, Boundary analysis	Histogram stretching, Contrast enhancement
Pokrewne	5	5	5	5	5
Podsumowanie	Watershed segmentation is a morphological image processing technique that automatically segments an image into distinct regions by treating image intensity as a topographic landscape where each object corresponds to a valley. Introduced by Beucher and Lantuéjoul in 1979 and refined by Meyer, the watershed algorithm is particularly effective for separating touching or overlapping objects.	Blob detection is a technique for identifying regions of interest (blobs)—connected, homogeneous areas that differ from their surroundings—at multiple scales. Introduced by Lindeberg in the context of scale-space theory, blob detection automatically finds and characterizes circular or elliptical objects without requiring a priori knowledge of their size.	The Canny edge detector, introduced by John Canny in 1986, is a multi-stage algorithm for identifying edges in digital images where significant intensity changes occur. Canny's method is optimal for step edges in additive Gaussian noise and remains the gold standard for edge detection in computer vision due to its mathematical elegance and practical effectiveness.	Contour analysis is the process of detecting and analyzing the boundaries of objects in images by identifying connected edges and extracting shape information. The Suzuki-Abe algorithm provides an efficient method for finding contours in binary images, enabling shape-based object classification and segmentation.	Histogram equalization is an image preprocessing technique that redistributes pixel intensities to improve contrast and visibility of details. By spreading the histogram of pixel values evenly across the available range, histogram equalization enhances images with poor contrast, making features more visually distinct and easier to process algorithmically.