{"title":"A comparative performance study of several global thresholding techniques for segmentation","authors":"Sang Uk Lee, Seok Yoon Chung, Rae Hong Park","doi":"10.1016/0734-189X(90)90053-X","DOIUrl":"10.1016/0734-189X(90)90053-X","url":null,"abstract":"<div><p>A comparative performance study of five global thresholding algorithms for image segmentation was investigated. An image database with a wide variety of histogram distribution was constructed. The histogram distribution was changed by varying the object size and the mean difference between object and background. The performance of five algorithms was evaluated using the criterion functions such as the probability of error, shape, and uniformity measures Attempts also have been made to evaluate the performance of each algorithm on the noisy image. Computer simulation results reveal that most algorithms perform consistently well on images with a bimodal histogram. However, all algorithms break down for a certain ratio of population of object and background pixels in an image, which in practice may arise quite frequently. Also, our experiments show that the performances of the thresholding algorithms discussed in this paper are data-dependent. Some analysis is presented for each of the five algorithms based on the performance measures.</p></div>","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"52 2","pages":"Pages 171-190"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90053-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115810129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Index-based object recognition in pictorial data management","authors":"William I Grosky","doi":"10.1016/0734-189X(90)90062-Z","DOIUrl":"https://doi.org/10.1016/0734-189X(90)90062-Z","url":null,"abstract":"","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"52 2","pages":"Page 306"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90062-Z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137343475","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient parallel implementation of the hough transform on a distributed memory system","authors":"D Ben-Tzvi, A Naqui, M Sandler","doi":"10.1016/0734-189X(90)90063-2","DOIUrl":"https://doi.org/10.1016/0734-189X(90)90063-2","url":null,"abstract":"","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"52 2","pages":"Page 306"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90063-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137343476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A color clustering technique for image segmentation","authors":"Mehmet Celenk","doi":"10.1016/0734-189X(90)90052-W","DOIUrl":"10.1016/0734-189X(90)90052-W","url":null,"abstract":"<div><p>This paperr describes a clustering algorithm for segmenting the color images of natural scenes. The proposed method operates in the 1976 CIE (<em>L<sup>∗</sup>, a<sup>∗</sup>, b<sup>∗</sup></em>)-uniform color coordinate system. It detects image clusters in some circular-cylindrical decision elements of the color space. This estimates the clusters' color distributions without imposing any constraints on their forms. Surfaces of the decision elements are formed with constant lightness and constant chromaticity loci. Each surface is obtained using only 1D histogramsof the <em>L<sup>∗</sup>, H°, C<sup>∗</sup></em> cylindrical coordinates of the image data or the extracted feature vector. The Fisher linear discriminant method is then used to project simultaneously the detected color clusters onto a line for 1D thresholding. This permits utilization of all the color properties for segmentation and inherently recognizes their respective cross correlation. In this respect, the proposed algorithm also differs from the multiple histogram-based thresholding schemes.</p></div>","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"52 2","pages":"Pages 145-170"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90052-W","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121829811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Vector field restoration by the method of convex projections","authors":"Patrice Y Simard, Guy E Mailloux","doi":"10.1016/0734-189X(90)90061-Y","DOIUrl":"https://doi.org/10.1016/0734-189X(90)90061-Y","url":null,"abstract":"","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"52 2","pages":"Page 306"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90061-Y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137343474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"B-spline curves and surfaces viewed as digital filters","authors":"Ardeshir Goshtasby, Fuhua Cheng, Brian A Barsky","doi":"10.1016/0734-189X(90)90058-4","DOIUrl":"10.1016/0734-189X(90)90058-4","url":null,"abstract":"<div><p>In this paper, we show that <em>B</em>-spline curves and surfaces can be viewed as digital filters. Viewing <em>B</em>-spline problems as digital filters allows one to predict some properties of the generated curves and surfaces. We find that even-order <em>B</em>-splines and odd-order <em>B</em>-splines behave differently when used in curve and surface interpolation. Even-order <em>B</em>-splines generate smoother curves and surfaces than do odd-order <em>B</em>-splines.</p></div>","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"52 2","pages":"Pages 264-275"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90058-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114937430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Parallel shrinking algorithms using 2-subfields approaches","authors":"Muhittin Gökmen, Richard W Hall","doi":"10.1016/0734-189X(90)90054-Y","DOIUrl":"10.1016/0734-189X(90)90054-Y","url":null,"abstract":"<div><p>A class of parallel shrinking algorithms is introduced which uses two subfields arranged in a checkerboard pattern. For this class of algorithms sufficient conditions are derived for maintaining image connectivity and guaranteeing algorithm convergence and correct shrinking to single pixel residues. In comparisons with other parallel shrinking algorithms instances of the 2-subfields class are shown to exhibit substantially higher parallel speed for specific artificial and real test images.</p></div>","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"52 2","pages":"Pages 191-209"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90054-Y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124012315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Digitization of straight line segments closeness and convexity","authors":"Maurice Maes","doi":"10.1016/0734-189X(90)90060-9","DOIUrl":"10.1016/0734-189X(90)90060-9","url":null,"abstract":"<div><p>In her thesis “Digitisation Functions in Computer Graphics” M. van Lierop presents a framework in which one can mathematically describe digitization of straight line segments, and desirable properties of this digitization, such as translation invariance, closeness, minimality, and convexity (convexity is sometimes called “the subset line property”). In the second chapter of her thesis she proves that a line function that has these four properties does not exist, and the remaining question is whether closeness and convexity are mutually exclusive properties (even if one drops minimality or translation invariance). In this paper we will answer this question affirmatively.</p></div>","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"52 2","pages":"Pages 297-305"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90060-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117332227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Three-frame corner matching and moving object extraction in a sequence of images","authors":"Hsi-Jian Lee, Hsi-Chou Deng","doi":"10.1016/0734-189X(90)90055-Z","DOIUrl":"10.1016/0734-189X(90)90055-Z","url":null,"abstract":"<div><p>This paper presents a three-frame matching method for finding the correspondences of corner points. After a two-stage corner detector is applied to each frame to extract a set of corner points as the matching primitives, candidate transition paths, which are formed by three corner points among three consecutive corner sets, are found by utilizing the smoothness constraint of motion due to inertia. Initially, each transition path is assigned an initial probability of being correct transition based on the similarity of curvatures of the three corner points. These probabilities are iteratively modified by a relaxation process according to the consistency properties of both acceleration and velocity. After several iterations, the paths with sufficiently high probabilities are taken as the correct transition paths. A new segmentation process which integrates both velocity and contrast information is presented to extract regions of moving objects. Several experimental results show that the approach is very effective.</p></div>","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"52 2","pages":"Pages 210-238"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90055-Z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130847603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}