ScholarGate
Асистент

Порівняння методів

Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.

Сегментація вододілом×Виявлення блобів×Виявлення країв за Канним×Гістограмне вирівнювання×
ГалузьКомп'ютерний зірКомп'ютерний зірКомп'ютерний зірКомп'ютерний зір
РодинаMachine learningMachine learningMachine learningMachine learning
Рік появи1979199819861970s
Автор методуSerge Beucher and Christian LantuéjoulTony LindebergJohn CannySignal processing community
ТипMorphological image segmentationMulti-scale feature detectionImage gradient analysisContrast enhancement and preprocessing
Основоположне джерелоMeyer, F. (1994). Topographic distance and watershed lines. Signal Processing, 38(1), 113–125. DOI ↗Lindeberg, T. (1998). Feature detection with automatic scale selection. International Journal of Computer Vision, 30(2), 79–116. DOI ↗Canny, J. (1986). A computational approach to edge detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 8(6), 679–698. DOI ↗Gonzalez, R. C., & Woods, R. E. (1992). Digital Image Processing. Addison-Wesley, 2nd edition, Chapter 3. link ↗
Інші назвиWatershed transform, Water shedding segmentationConnected component analysis, Region-based detectionCanny operator, Canny edge detectorHistogram stretching, Contrast enhancement
Пов'язані5555
Підсумок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.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.
ScholarGateНабір даних
  1. v1
  2. 2 Джерела
  3. PUBLISHED
  1. v1
  2. 2 Джерела
  3. PUBLISHED
  1. v1
  2. 2 Джерела
  3. PUBLISHED
  1. v1
  2. 2 Джерела
  3. PUBLISHED

Перейти до пошуку Завантажити слайди

ScholarGateПорівняння методів: Watershed Segmentation · Blob Detection · Canny Edge Detection · Histogram Equalization. Отримано 2026-06-18 з https://scholargate.app/uk/compare