1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592
|
## Copyright (C) 2017 Hartmut Gimpel <hg_code@gmx.de>
## Copyright (C) 2018 Carnë Draug <carandraug@octave.org>
##
## This program is free software; you can redistribute it and/or modify
## it under the terms of the GNU General Public License as published by
## the Free Software Foundation; either version 3 of the License, or
## (at your option) any later version.
##
## This program is distributed in the hope that it will be useful,
## but WITHOUT ANY WARRANTY; without even the implied warranty of
## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
## GNU General Public License for more details.
##
## You should have received a copy of the GNU General Public License
## along with this program. If not, see <http://www.gnu.org/licenses/>.
## -*- texinfo -*-
## @deftypefn {Function File} {@var{centers} =} imfindcircles (@var{im}, @var{radius})
## @deftypefnx {Function File} {@var{centers} =} imfindcircles (@var{im}, @var{RadiusRange})
## @deftypefnx {Function File} {@var{centers} =} imfindcircles (@dots{}, @var{property}, @var{value})
## @deftypefnx {Function File} {[@var{centers}, @var{radii}, @var{strengths}] =} imfindcircles (@dots{})
## Find circles in image using the circular Hough transform.
##
## This function finds circles in a given 2d image @var{im}.
## The image data can be grayscale, rgb color, or binary.
## The search is done only for circular shapes of approximatly
## the given @var{radius} (single value) or @var{RadiusRange}
## (a two element vector [r_min, r_max]).
##
## The output @var{centers} is a two column matrix,
## where each row contains the (fractional) x and y coordinates of
## the center of one found circle. The output rows are ordered
## according the @var{strengths} of the circles, the strongest
## circle first.
##
## The output @var{radii} is a column vector of the (fractional)
## radii of the found circles, in the same order as the circle centers.
## If @var{radius} is specified, instead of @var{RadiusRange}, then
## all values in @var{radii} are the same as @var{radius}.
##
## The output @var{strengths} is a measure of how "strong"
## the corresponding circle is. (A sharp, smooth and full circle gives
## roughly a value of one. The minimum value is zero.)
##
## Additionally the following optional property-value-pairs can be used:
## @table @var
## @item ObjectPolarity
## Either "bright" circles on darker background can be searched (default),
## or "dark" circles on brighter background.
##
## @item Method
## The default method "PhaseCode" is faster as the
## (currently unimplemented) method "TwoStage".
## For literature and details on the algorithm, see comments
## in the code.
##
## @item Sensitivity
## A value between 0 and 1 to say how strong
## a circle must be in order to be found. With a value
## of 1 no circles are discarded, default value is 0.85.
## (Use bigger values of Sensitivity if your circles are
## not properly found, until unwanted "ghost" circles
## start to appear.)
##
## @item EdgeThreshold
## A value between 0 and 1 to say how strong
## an edge point of the image must be, to be
## considered as a possible point on a circle circumference.
## With a value of 0 all possible
## edge points are considered, with a value of 1 only the
## edge point with the stronges gradient will be considered.
## As default value the output of @code{graythresh} (Otsu's threshold)
## of the gradient image is taken.
## @end table
##
## Notes:
## @itemize @bullet
## @item
## Only center points inside the image region can be found.
## @item
## For concentric cirles the output is unpredictable.
## @item
## For optimal speed, keep the radius range and the image size
## as small as possible.
## @item
## For radius values above 100 pixels the sensitivity and accuracy
## of this algorithm starts to decrease.
## @item
## For big radius ranges the sensitivity decreases. Try to keep
## r_max < 3 * r_min .
## @item
## RGB color images will automatically be converted to grayscale
## using the @code{rgb2gray} function.
## @item
## Binary images will automatically be converted to grayscale
## and be slightly smoothed before processing.
## @end itemize
##
## Compatibility note: The @var{centers} and @var{radii} outputs
## have good compatibility to the Matlab outputs. The @var{strengths}
## outputs differ a bit, but have mostly the same ordering.
## Currently only the (default) Matlab algorithm "PhaseCode" is implemented
## in Octave.
##
## @seealso{hough, hough_circle}
## @end deftypefn
## Algorithm:
## The following papers and books were used for the
## implementation of this function:
##
## [1] (for general information on the circle Hough transform
## and the basic algorithmic approach)
## E. R. Davies: "Computer & Machine Vision"
## Academic Press (2012), 4th edition
## chapter 12 "Circle and Ellipse Detection"
## [2] (for the 'phase code' algorithm to search for a radius range
## with just a 2-dimensional accumulator array)
## T. J. Artherton and D. J. Kerbyson:
## "Size invariant circle detection"
## Image and Vision Computing 17 (1999), p. 795-803.
## [3] (for 'state of the art' peak finding in the circular Hough
## transform accumulator array)
## C. Zhang, F. Huber, M. Knop, F. A. Hamprecht:
## "Yest cell detection and segmentation in bright field microscopy"
## IEEE Int. Symp. Biomed. Imag. (ISBI), April 2014, p. 1267-1270.
##
## A more detailed description of the individual steps of the
## algorithm is given in the following code itself.
function [centers, radii, strengths] = imfindcircles (im, radiusrange, varargin)
if (nargin < 2 || nargin > 10 || mod (numel (varargin), 2) != 0)
print_usage ();
endif
p = inputParser ();
p.FunctionName = "imfindcircles";
p.addParamValue ("ObjectPolarity", "bright",
@(x) any (strcmpi (x, {"bright", "dark"})));
p.addParamValue ("Method", "PhaseCode",
@(x) any (strcmpi (x, {"PhaseCode", "TwoStage"})));
p.addParamValue ("Sensitivity", 0.85,
@(x) isnumeric (x) && isreal (x) && isscalar (x));
## The default value of EdgeThreshold must be computed later.
p.addParamValue ("EdgeThreshold", [],
@(x) isnumeric (x) && isreal (x) && isscalar (x));
p.parse (varargin{:});
dark_circles = strcmpi (p.Results.ObjectPolarity, "dark");
sensitivity = p.Results.Sensitivity;
edge_thresh = p.Results.EdgeThreshold;
if (! isimage (im) || ! any (ndims (im) == [2, 3]))
error ("imfindcircles: IM must be a logical or numeric 2d or 3d array");
elseif (ndims (im) == 3 && size (im, 3) != 3)
error ("imfindcircles: the 3d image IM must be a RGB image");
endif
if (all (numel (radiusrange) != [1 2]))
error ("imfindcircles: RADIUS or RADIUSRANGE must be a vector of length 1 or 2");
elseif (! isnumeric (radiusrange) || any (radiusrange <= 0))
error ("imfindcircles: RADIUS or RADIUSRANGE must be positive")
elseif (numel (radiusrange) == 2 && radiusrange(1) > radiusrange(2))
error ("imfindcircles: RADIUSRANGE(1) must be smaller than RADIUSRANGE(2)")
endif
if (strcmpi (p.Results.Method, "TwoStage"))
error ("imfindcirles: the 'TwoStage' method is not yet implemented. Try 'PhaseCode' instead.");
endif
if (sensitivity < 0 || sensitivity > 1)
error ("imfindcircles: 'Sensitivity' must be between 0 and 1");
endif
if (! isempty (edge_thresh) && (edge_thresh < 0 || edge_thresh > 1))
error ("imfindcircles: 'EdgeThreshold' must be between 0 and 1");
endif
H = cht_accumulator (im, radiusrange, edge_thresh, dark_circles);
[centers, centers_ind, strengths] = cht_centers (H, sensitivity);
## Output values must be sorted by strength.
[strengths, idx_sorted] = sort (strengths, "descend");
centers = centers(idx_sorted,:);
if (isargout (2))
if (isscalar (radiusrange))
radii = repmat (radiusrange, numel (strengths), 1);
else
radii = cht_radii (H(centers_ind), radiusrange);
## Output values must be sorted by strength.
radii = radii(idx_sorted);
endif
endif
endfunction
## Convert image from RGB or logical types into a floating point 2D
## image that can be used for CHT.
function im = cht_image_preparation (im)
if (isinteger (im))
im = im2double (im);
endif
if (size (im, 3) == 3)
im = rgb2gray (im);
endif
## The Matlab help page mentions "preprocessing" of
## binary input images to "improve the accuracy".
## Unsure what they do here.
## We'll just do a little (carefully rotation symmetrical)
## smoothing as grayscale images, because we need
## the accurate gradient directions later on. (This wouldn't
## work properly with the binary images itself.)
if (islogical (im))
im = im2single (im);
gauss_filter = fspecial ("gaussian", [9 9], 1.5);
im = imfilter (im, gauss_filter, "replicate");
endif
endfunction
## calculate the intensity gradients values at edge pixels
## using the Sobel operator (see ref. [1], chapter 12.2)
## (we'll always call the first coordinate "x" here)
function [G0, GxE, GyE, E_ind] = edge_intensity_gradients (im, edge_thresh)
sobel_x = fspecial ("sobel");
sobel_y = sobel_x';
Gx = imfilter (im, sobel_x, "replicate");
Gy = imfilter (im, sobel_y, "replicate");
G = sqrt (Gx.^ 2 + Gy.^ 2); # sqrt is expensive, but yields higher angle precision
## get rid of empty gradient images, they would cause trouble later on:
Gmax = max (G(:));
if (Gmax == 0)
E_ind = [](:);
else
## Find the edge pixels by thresholding the gradient image. If
## not set, estimate threshold with Otsu's algorithm.
if (isempty (edge_thresh))
edge_thresh = graythresh (G ./ Gmax);
endif
E_ind = find (G > (edge_thresh * Gmax)); # edge pixels indices
endif
G0 = G(E_ind);
GxE = Gx(E_ind);
GyE = Gy(E_ind);
endfunction
function [xs, ys] = candidate_centers (im, R, edge_thresh)
[G0, GxE, GyE, E_ind] = edge_intensity_gradients (im, edge_thresh);
[Ex, Ey] = ind2sub (size (im), E_ind);
## generate stroke pixels (xs, ys):
## This does not involve sin and cos calculations,
## which helps for speed (see ref. [1].)
## (automatic broadcasting here,
## R is a row vector, the G's are column vectors.)
xs = Ex - R .* (GxE ./ G0); # eq. 12.3 (ref. [1])
ys = Ey - R .* (GyE ./ G0); # eq. 12.4 (ref. [1])
## round to integer pixel positions:
xs = round (xs);
ys = round (ys);
endfunction
## visit all edge pixels and generate
## a "spoke" in the circular Hough transform:
## A spoke is a line of pixels which are a distance r1 to r2
## away from the edge point, this distance is taken in
## the edge direction (gradient) of this very edge point.
## The resulting points on the spokes are candidates for circle
## center points. And each gradient pixel can vote for
## one center pixel candidate (for each radius value).
## All spoke points are summed up in the accumulator array H.
## (see equations 12.3 and 12.4 for xs and ys in ref. [1])
function H = cht_accumulator (im, radiusrange, edge_thresh, dark_circles)
im = cht_image_preparation (im);
if (isscalar (radiusrange))
R = radiusrange;
else
## Range of circle radii. Step size of 0.5 covers all integer
## circle diameters.
R = radiusrange(1):0.5:radiusrange(2);
endif
## code the circle polarity in the radius sign:
## (different direction of "spoke", see ref. [1], chapter 12.2)
if (dark_circles)
[xs, ys] = candidate_centers (im, -R, edge_thresh);
else
[xs, ys] = candidate_centers (im, R, edge_thresh);
endif
ns = rows (xs);
## limit pixel position and code values to the image size:
xs = xs(:);
ys = ys(:);
idx_outside = (xs < 1 | xs > rows (im) | ys < 1 | ys > columns (im));
xs(idx_outside) = [];
ys(idx_outside) = [];
if (isscalar (radiusrange))
codes = 1 ./ R; # phase coding is not useful for a single radius value
else
## pre-calculate the phases and (complex) code values for all radii:
## We use the "log phase coding", which is best, according to
## ref. [2].
logR = log (R);
phase = 2 .* pi .* ((logR - logR(1))
./ (logR(end) - logR(1))); # eq. 8 (ref. [2])
code = exp (i .* phase); # eq. 5 (ref. [2])
code ./= R; # eq. 11 (ref. [2]) , radius normalization
## -> a full and perfect circle will give a value of 2pi in H
codes = repmat (code, ns, 1)(:);
codes(idx_outside) = [];
endif
## add the code value of all those spoke pixels
## to the corresponding pixel position in H:
H = accumarray ([xs, ys], codes, size (im));
endfunction
## Find local (regional) maximas in H, because they are the circle
## center pixels. This part of the algorithm is taken from ref. [3],
## section 2.2 "Detecting cell center candidates".
function [centers, centers_ind, strengths] = cht_centers (H, sensitivity)
## Take the absolute value of the H accumulator array which may be
## complex if we had a radius range and phase coded annulus.
H = abs (H);
## do some smoothing before searching for peak positions
## use a (rotation symmetric) gaussian filter for this (see ref. [3])
gauss_filter = fspecial ("gaussian", [9 9], 2); # a bigger filter might join nearby centers
H = imfilter (H, gauss_filter, 0); # introduces small shifts of centers near the edge,
# but padding "replicate" would be worse
## define threshold to suppress smaller peaks in H:
peak_thresh = 1 - sensitivity;
peak_thresh *= 2*pi; # because a full circle can add up to 2pi in H
## use the h-maxima transform to suppress maximas with a too low height:
Hbig = imhmax (H, peak_thresh);
## find the regional maxima of those smoothed big peaks in H:
Hmax_BW = imregionalmax (Hbig ./ max (Hbig(:)));
## Use those maxima as well as their surrounding peak
## to calculate a weighted average for the peak position:
## (This gives the circle center positions with the necessary
## subpixel accuracy.)
props = regionprops (Hmax_BW, Hbig, "WeightedCentroid");
centers = cell2mat ({props.WeightedCentroid}');
## for the "strength" return value, take the (smoothed) H:
## (Matlab seems to do this a bit different.)
centers_ind = sub2ind (size (H), round (centers(:,2)), round (centers(:,1)));
strengths = H(centers_ind) ./ (2*pi); # normalize a "full" circle to 1
endfunction
## calculate the circle radius from the complex phase in H:
## (i.e. undo the phase coding)
function radii = cht_radii (H, radiusrange)
r1 = radiusrange(1);
r2 = radiusrange(2);
c_phase = arg (H);
c_phase(c_phase < 0) += (2*pi);
radii = exp ((c_phase ./ (2*pi) .* (log (r2) - log (r1))) + log (r1));
endfunction
%!shared im0, rgb0, im1
%! im0 = [0 0 0 0 0;
%! 0 1 2 1 0;
%! 0 2 5 2 0;
%! 0 1 2 1 0;
%! 0 0 0 0 0];
%! rgb0 = cat (3, im0, 3.*im0, 2.*im0);
%! im1 = zeros (20);
%! im1(2:6, 5:9) = 1;
%! im1(13:19, 13:19) = 1;
%!function image = circlesimage (numx, numy, centersx, centersy, rs, values)
%! ## create an image with circles of given parameters
%! num = length (centersx);
%! image = zeros (numy, numx);
%! [indy, indx] = meshgrid (1:numx, 1:numy);
%! for n = 1:num
%! centerx = centersx(n);
%! centery = centersy(n);
%! r = rs(n);
%! value = values(n);
%! dist_squared = (indx - centerx).^ 2 + (indy - centery).^ 2;
%! image(dist_squared <= (r-0.5)^2) = value;
%! endfor
%!endfunction
## test input syntax:
%!error imfindcircles ()
%!error imfindcircles (im0)
%!error imfindcircles (im0, [1 2 3])
%!error imfindcircles (im0, -3)
%!error imfindcircles (im0, 4+2*i)
%!error imfindcircles (ones (5,5,4), 2)
%!error imfindcircles (ones (5,5,5,5), 2)
%!error imfindcircles (im0, [2 1])
%!error imfindcircles (im0, 2, "rubbish")
%!error imfindcircles (im0, 2, "more", "rubbish")
%!error imfindcircles (im0, 2, "ObjectPolarity", "rubbish")
%!error imfindcircles (im0, 2, "ObjectPolarity", 5)
%!error imfindcircles (im0, 2, "ObjectPolarity")
%!error imfindcircles (im0, 2, "Method", "rubbish")
%!error imfindcircles (im0, 2, "Method", 5)
%!error imfindcircles (im0, 2, "Method")
%!error imfindcircles (im0, 2, "Sensitivity", "rubbish")
%!error imfindcircles (im0, 2, "Sensitivity")
%!error imfindcircles (im0, 2, "Sensitivity", -0.1)
%!error imfindcircles (im0, 2, "Sensitivity", 1.1)
%!error imfindcircles (im0, 2, "Sensitivity", [0.1 0.2])
%!error imfindcircles (im0, 2, "EdgeThreshold", "rubbish")
%!error imfindcircles (im0, 2, "EdgeThreshold")
%!error imfindcircles (im0, 2, "EdgeThreshold", -0.1)
%!error imfindcircles (im0, 2, "EdgeThreshold", 1.1)
%!error imfindcircles (im0, 2, "EdgeThreshold", [0.1 0.2])
%!error imfindcircles (im0, 2, "EdgeThreshold", 0.1, "ObjectPolarity", "bright",
%! "Sensitivity", 0.3, "Method", "PhaseCode", "more", 1)
%!test # none of this should fail
%! imfindcircles (im0, 2);
%! imfindcircles (im0, [1 2]);
%! imfindcircles (logical (im0), 2);
%! imfindcircles (logical (im0), [1 2]);
%! imfindcircles (rgb0, 2);
%! imfindcircles (rgb0, [1 2]);
%! imfindcircles (uint8 (im0), 2);
%! imfindcircles (uint8 (im0), [1 2]);
%! imfindcircles (im0, 2, "ObjectPolarity", "bright");
%! imfindcircles (im0, 2, "ObjectPolarity", "dark");
%! imfindcircles (im0, 2, "Method", "PhaseCode");
%! imfindcircles (im0, 2, "Sensitivity", 0.5);
%! imfindcircles (im0, 2, "EdgeThreshold", 0.5);
%! imfindcircles (im0, 2, "ObjectPolarity", "bright", "Method", "PhaseCode");
%! imfindcircles (im0, 2, "ObjectPolarity", "bright", "Sensitivity", 0.3,
%! "Method", "PhaseCode");
%! imfindcircles (im0, 2, "EdgeThreshold", 0.1, "ObjectPolarity", "bright",
%! "Sensitivity", 0.3, "Method", "PhaseCode");
## output class, number and shape:
%!test
%! centers = imfindcircles (im1, 2);
%! assert (size (centers, 2), 2)
%! assert (class (centers), "double")
%!test
%! [centers, radii] = imfindcircles (im1, [1 5]);
%! assert (size (centers, 2), 2)
%! assert (size (radii, 2), 1)
%! assert (class (radii), "double")
%!test
%! [centers, radii, strengths] = imfindcircles (im1, [1 5]);
%! assert (size (strengths, 2), 1)
%! assert (class (strengths), "double")
%!error [a b c d] = imfindcircles (im0, 2);
## test calculation results:
%!test ## sub-pixel accuracy of circle center
%! xs = [95.7];
%! ys = [101.1];
%! rs = [50];
%! vals = [0.5];
%! im = circlesimage (200, 200, xs, ys, rs, vals);
%! filt = ones (3) ./ 9;
%! im = imfilter (im, filt);
%! [centers, radii] = imfindcircles (im, [40 60]);
%! assert (centers, [101.1, 95.7], 0.1);
%! assert (radii, 50, 1);
%!test
%! ## specificity to circular shapes and strengths output value
%! xs = [100 202];
%! ys = [101, 203];
%! rs = [40, 41];
%! vals = [0.8, 0.9];
%! im = circlesimage (300, 300, xs, ys, rs, vals);
%! filt = ones (3) ./ 9;
%! im = imfilter (im, filt);
%! im(30:170, 50:100) = 0;
%! im(20:120, 180:280) = 1;
%! [centers, radii, strengths] = imfindcircles (im, [30 50], "Sensitivity", 0.9);
%! assert (size (centers), [2 2]);
%! assert (centers, [203, 202; 101, 100], 1.5);
%! assert (radii, [40; 41], 2.5);
%! assert (strengths(1) / strengths(2) > 1.8, true);
%!test # radius range parameter & dark circles
%! xs = [50, 420, 180];
%! ys = [80, 100, 200];
%! rs = [35, 30, 40];
%! vals = [0.7, 0.8, 0.9];
%! im = circlesimage (300, 500, xs, ys, rs, vals);
%! filt = ones (3) ./ 9;
%! im = imfilter (im, filt);
%! [centers1, radii1] = imfindcircles (im, [28 36]);
%! [centers2, radii2] = imfindcircles (im, [28 42]);
%! assert (size (centers1), [2 2]);
%! assert (centers1, [100 420; 80 50], 0.2);
%! assert (radii1, [30; 35], 2);
%! assert (size (centers2), [3 2]);
%! im_dark = 1-im;
%! [centers_dark, radii_dark, strengths_dark] = imfindcircles (im_dark, [25 42], "ObjectPolarity", "dark");
%! assert (sortrows (centers_dark), [80 50; 100 420; 200 180], 0.2);
%! assert (sortrows (radii_dark), [30; 35; 40], 1);
%!test # ability to find circles with big radius
%! xs = [111, 555, 341];
%! ys = [222, 401, 161];
%! rs = [45, 50, 150];
%! vals = [0.6, 0.8, 0.7];
%! im = circlesimage (400, 701, xs, ys, rs, vals);
%! [centers, radii] = imfindcircles (im, [140 160], "Sensitivity", 0.98);
%! assert (centers, [161, 341], 0.2);
%! assert (radii, 150, 1);
%!test # overlapping circles
%! xs = [105, 155];
%! ys = [202, 221];
%! rs = [45, 50];
%! vals = [0.5, 0.8];
%! im = circlesimage(385, 422, xs, ys, rs, vals);
%! filt = ones (3) ./ 9;
%! im = imfilter (im, filt);
%! [centers, radii] = imfindcircles (im, [30 80]);
%! assert (centers, [221, 155; 202, 105], 0.5);
%! assert (radii, [50; 45], 1);
%!test # overlapping circles, only 10 pixels apart
%! xs = [155, 155];
%! ys = [175, 157];
%! rs = [50, 50];
%! vals = [0.7, 0.8];
%! im = circlesimage (300, 300, xs, ys, rs, vals);
%! filt = ones (3) ./ 9;
%! im = imfilter (im, filt);
%! [centers, radii] = imfindcircles (im, [30 80], "Sensitivity", 0.95);
%! assert (centers, [157, 155; 175, 155], 1);
%! assert (radii, [50; 50], 1);
%!test # edge threshold parameter
%! xs = [100 202];
%! ys = [101, 203];
%! rs = [40, 41];
%! vals = [0.1, 0.9];
%! im = circlesimage (300, 300, xs, ys, rs, vals);
%! filt = ones (3) ./ 9;
%! im= imfilter (im, filt);
%! [centers_auto, radii_auto] = imfindcircles (im, [30 50]);
%! [centers_0, radii_0] = imfindcircles (im, [30 50], "EdgeThreshold", 0);
%! [centers_05, radii_05] = imfindcircles (im, [30 50], "EdgeThreshold", 0.5);
%! assert (centers_auto, [203, 202], 0.2);
%! assert (radii_auto, 41, 1);
%! assert (centers_0, [101, 100; 203, 202], 0.2);
%! assert (radii_0, [40; 41], 1);
%! assert (centers_05, [203, 202], 0.2);
%! assert (radii_05, 41, 1);
%!demo
%! ## First generate an input image:
%! model = [ 1.0 0.2 0.2 0.2 0.5 0
%! 1.0 0.3 0.3 -0.1 -0.2 0
%! -0.5 0.7 0.7 -0.5 0.5 0];
%! im = phantom (model);
%! im(170:230,170:230) = 1;
%! im = imfilter (im, fspecial ("average", 3));
%! im = imnoise (im, "salt & pepper");
%! imshow (im);
%!
%! ## Find and show circles with radius between 20 and 50:
%! [centers, radii] = imfindcircles (im, [20 50]);
%! viscircles (centers, radii)
%! title ("found circles in red")
|