1962
DOI: 10.1145/321119.321123
|View full text |Cite
|
Sign up to set email alerts
|

Operations Useful for Similarity-Invariant Pattern Recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
98
0
2

Year Published

1983
1983
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 236 publications
(100 citation statements)
references
References 2 publications
0
98
0
2
Order By: Relevance
“…Generally, segmentation is the most pragmatic preprocessing technique that could be applied on manifold filed where the texture of background or foreground should be analyzed (Golchin et al, 2013). As the failure and success rate of every image processing applications is extremely dependent on reliability and scrupulousness of the preprocessing techniques and especially thresholding, therefore, many researchers attempted to introduce thresholding optimization techniques using algorithms such as P-tile (Doyle, 1962), Gray-Level Histogram thresholding "Otsu" (Otsu, 1979), Maximum Entropy with adaptive Genetic algorithm Nie, 2009), Shanbhag algorithm (Shanbhag, 1994), Yen technique (Yen et al, 1995), Entropic thresholding method based on Ant Colony Genetic algorithm (Shen et al, 2009), integration of clustering algorithm and marker controlled watershed segmentation algorithm (Christ et al, 2010) and many other algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…Generally, segmentation is the most pragmatic preprocessing technique that could be applied on manifold filed where the texture of background or foreground should be analyzed (Golchin et al, 2013). As the failure and success rate of every image processing applications is extremely dependent on reliability and scrupulousness of the preprocessing techniques and especially thresholding, therefore, many researchers attempted to introduce thresholding optimization techniques using algorithms such as P-tile (Doyle, 1962), Gray-Level Histogram thresholding "Otsu" (Otsu, 1979), Maximum Entropy with adaptive Genetic algorithm Nie, 2009), Shanbhag algorithm (Shanbhag, 1994), Yen technique (Yen et al, 1995), Entropic thresholding method based on Ant Colony Genetic algorithm (Shen et al, 2009), integration of clustering algorithm and marker controlled watershed segmentation algorithm (Christ et al, 2010) and many other algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…It is less appropriate in dividing textured images into meaningful regions, but it still has a variety of applications in situations in which the objects and background are homogeneous and smooth. A number of techniques have been proposed for automatic threshold selection; these include global thresholdselection techniques based on gray-level histograms (Doyle, 1962;Prewitt & Mendelson, 1966) or local thresholding methods (Bartz, 1969;Morrin, 1974;Sklansky, 1968;Ullman, 1974;Wolfe, 1969).…”
Section: Resultsmentioning
confidence: 99%
“…Over the past five decades, many automatic threshold selection methods have been reported in literature. [16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31][32][33][34][35] In late 80's, Sahoo et al 16 published a survey of optimum thresholding methods while Lee et al 17 reported results of a comparative study of several thresholding methods. Glasbey 18 published results of another comparative study involving eleven histogram-based thresholding algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…A relatively recent survey of thresholding algorithms for change detection in a surveillance environment has been presented by Rosin and Ioannidis. 36 Among early works on automatic thresholding, Prewitt and Mendelson 19 suggested using valleys in a histogram, while Doyle 20 advocated the choice of median. Otsu 21 developed a thresholding method maximizing between-class variance.…”
Section: Introductionmentioning
confidence: 99%