head	1.4;
access;
symbols;
locks; strict;
comment	@ * @;


1.4
date	95.01.04.06.16.12;	author rjj;	state Exp;
branches;
next	1.3;

1.3
date	94.10.14.04.13.25;	author rjj;	state Exp;
branches;
next	1.2;

1.2
date	94.06.23.04.12.40;	author rjj;	state Exp;
branches;
next	1.1;

1.1
date	94.06.22.17.17.27;	author rjj;	state Exp;
branches;
next	;


desc
@Initial version of the Otsu algorithm, with debug msgs intact.
@


1.4
log
@Deleted redundant line with name of section.
@
text
@// otsu.h               Section: 3.7
// Threshold Selection by Maximizing Between Class Variance
//      Copyright 1994, Center for Computer Vision and Visualization,
//      University of Florida.  All rights reserved.


#ifndef otsu_h_
#define otsu_h_

#include "IntDI.h"
#include "UcharDI.h"

/////////////////////////////////////////////////////////////////////
// otsu()
// This function is given an image and a count of the number of
//      partition thresholds desired for the image.  It returns
//      a point set, with dimension one less than  partitionCount.
//      Each point in the point set maybe interpreted as a possible
//      partitioning of the image.  The coordinate value of each
//      point represents the Tau values defined by the Otsu algorithm.
//
template <class P, class T>
IA_Set<IA_Point<int> >
otsu( unsigned int partitionCount, const IA_Image<P,T> & a );

#endif
@


1.3
log
@Added algorithm to standard header.  Comment and style changes.
@
text
@a4 1
// Threshold Selection by Maximizing Between Class Variance
@


1.2
log
@First version of Otsu without debug stmts.  Seems to work, however the
  closure still had problems, it generates spurious iac++ instantiations.
@
text
@d2 1
d20 2
a21 2
//      partitioning of the image.  The coordiante value of each
//      point reprsent the Tau values defined by the Otsu algorithm.
@


1.1
log
@Initial revision
@
text
@d5 1
a5 2
// Just the template definitions in here.
//
d13 9
a21 1

@
