mirror of
https://github.com/tesseract-ocr/tesseract.git
synced 2024-12-15 09:47:46 +08:00
023e1b340e
* api: Replace Tesseract data types by POSIX data types Signed-off-by: Stefan Weil <sw@weilnetz.de> * ccmain: Replace Tesseract data types by POSIX data types Signed-off-by: Stefan Weil <sw@weilnetz.de> * ccstruct: Replace Tesseract data types by POSIX data types Signed-off-by: Stefan Weil <sw@weilnetz.de> * classify: Replace Tesseract data types by POSIX data types Signed-off-by: Stefan Weil <sw@weilnetz.de> * cutil: Replace Tesseract data types by POSIX data types Signed-off-by: Stefan Weil <sw@weilnetz.de> * dict: Replace Tesseract data types by POSIX data types Signed-off-by: Stefan Weil <sw@weilnetz.de> * textord: Replace Tesseract data types by POSIX data types Signed-off-by: Stefan Weil <sw@weilnetz.de> * training: Replace Tesseract data types by POSIX data types Signed-off-by: Stefan Weil <sw@weilnetz.de> * wordrec: Replace Tesseract data types by POSIX data types Signed-off-by: Stefan Weil <sw@weilnetz.de> * ccutil: Replace Tesseract data types by POSIX data types Now all Tesseract data types which are no longer needed can be removed from ccutil/host.h. Signed-off-by: Stefan Weil <sw@weilnetz.de> * ccmain: Replace Tesseract's MIN_*INT, MAX_*INT* by POSIX *INT*_MIN, *INT*_MAX Signed-off-by: Stefan Weil <sw@weilnetz.de> * ccstruct: Replace Tesseract's MIN_*INT, MAX_*INT* by POSIX *INT*_MIN, *INT*_MAX Signed-off-by: Stefan Weil <sw@weilnetz.de> * classify: Replace Tesseract's MIN_*INT, MAX_*INT* by POSIX *INT*_MIN, *INT*_MAX Signed-off-by: Stefan Weil <sw@weilnetz.de> * dict: Replace Tesseract's MIN_*INT, MAX_*INT* by POSIX *INT*_MIN, *INT*_MAX Signed-off-by: Stefan Weil <sw@weilnetz.de> * lstm: Replace Tesseract's MIN_*INT, MAX_*INT* by POSIX *INT*_MIN, *INT*_MAX Signed-off-by: Stefan Weil <sw@weilnetz.de> * textord: Replace Tesseract's MIN_*INT, MAX_*INT* by POSIX *INT*_MIN, *INT*_MAX Signed-off-by: Stefan Weil <sw@weilnetz.de> * wordrec: Replace Tesseract's MIN_*INT, MAX_*INT* by POSIX *INT*_MIN, *INT*_MAX Signed-off-by: Stefan Weil <sw@weilnetz.de> * ccutil: Replace Tesseract's MIN_*INT, MAX_*INT* by POSIX *INT*_MIN, *INT*_MAX Remove the macros which are now unused from ccutil/host.h. Remove also the obsolete history comments. Signed-off-by: Stefan Weil <sw@weilnetz.de> * Fix build error caused by ambiguous ClipToRange Error message vom Appveyor CI: C:\projects\tesseract\ccstruct\coutln.cpp(818): error C2672: 'ClipToRange': no matching overloaded function found [C:\projects\tesseract\build\libtesseract.vcxproj] C:\projects\tesseract\ccstruct\coutln.cpp(818): error C2782: 'T ClipToRange(const T &,const T &,const T &)': template parameter 'T' is ambiguous [C:\projects\tesseract\build\libtesseract.vcxproj] c:\projects\tesseract\ccutil\helpers.h(122): note: see declaration of 'ClipToRange' C:\projects\tesseract\ccstruct\coutln.cpp(818): note: could be 'char' C:\projects\tesseract\ccstruct\coutln.cpp(818): note: or 'int' Signed-off-by: Stefan Weil <sw@weilnetz.de> * unittest: Replace Tesseract's MAX_INT8 by POSIX INT8_MAX Signed-off-by: Stefan Weil <sw@weilnetz.de> * arch: Replace Tesseract's MAX_INT8 by POSIX INT8_MAX Signed-off-by: Stefan Weil <sw@weilnetz.de>
135 lines
5.7 KiB
C
135 lines
5.7 KiB
C
/******************************************************************************
|
|
** Filename: cluster.h
|
|
** Purpose: Definition of feature space clustering routines
|
|
** Author: Dan Johnson
|
|
** History: 5/29/89, DSJ, Created.
|
|
**
|
|
** (c) Copyright Hewlett-Packard Company, 1988.
|
|
** Licensed under the Apache License, Version 2.0 (the "License");
|
|
** you may not use this file except in compliance with the License.
|
|
** You may obtain a copy of the License at
|
|
** http://www.apache.org/licenses/LICENSE-2.0
|
|
** Unless required by applicable law or agreed to in writing, software
|
|
** distributed under the License is distributed on an "AS IS" BASIS,
|
|
** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
** See the License for the specific language governing permissions and
|
|
** limitations under the License.
|
|
******************************************************************************/
|
|
#ifndef CLUSTER_H
|
|
#define CLUSTER_H
|
|
|
|
#include "kdtree.h"
|
|
#include "oldlist.h"
|
|
|
|
struct BUCKETS;
|
|
|
|
#define MINBUCKETS 5
|
|
#define MAXBUCKETS 39
|
|
|
|
/*----------------------------------------------------------------------
|
|
Types
|
|
----------------------------------------------------------------------*/
|
|
typedef struct sample {
|
|
unsigned Clustered:1; // TRUE if included in a higher cluster
|
|
unsigned Prototype:1; // TRUE if cluster represented by a proto
|
|
unsigned SampleCount:30; // number of samples in this cluster
|
|
struct sample *Left; // ptr to left sub-cluster
|
|
struct sample *Right; // ptr to right sub-cluster
|
|
int32_t CharID; // identifier of char sample came from
|
|
FLOAT32 Mean[1]; // mean of cluster - SampleSize floats
|
|
} CLUSTER;
|
|
|
|
typedef CLUSTER SAMPLE; // can refer to as either sample or cluster
|
|
|
|
typedef enum {
|
|
spherical, elliptical, mixed, automatic
|
|
} PROTOSTYLE;
|
|
|
|
typedef struct { // parameters to control clustering
|
|
PROTOSTYLE ProtoStyle; // specifies types of protos to be made
|
|
FLOAT32 MinSamples; // min # of samples per proto - % of total
|
|
FLOAT32 MaxIllegal; // max percentage of samples in a cluster which have
|
|
// more than 1 feature in that cluster
|
|
FLOAT32 Independence; // desired independence between dimensions
|
|
FLOAT64 Confidence; // desired confidence in prototypes created
|
|
int MagicSamples; // Ideal number of samples in a cluster.
|
|
} CLUSTERCONFIG;
|
|
|
|
typedef enum {
|
|
normal, uniform, D_random, DISTRIBUTION_COUNT
|
|
} DISTRIBUTION;
|
|
|
|
typedef union {
|
|
FLOAT32 Spherical;
|
|
FLOAT32 *Elliptical;
|
|
} FLOATUNION;
|
|
|
|
typedef struct {
|
|
unsigned Significant:1; // TRUE if prototype is significant
|
|
unsigned Merged:1; // Merged after clustering so do not output
|
|
// but kept for display purposes. If it has no
|
|
// samples then it was actually merged.
|
|
// Otherwise it matched an already significant
|
|
// cluster.
|
|
unsigned Style:2; // spherical, elliptical, or mixed
|
|
unsigned NumSamples:28; // number of samples in the cluster
|
|
CLUSTER *Cluster; // ptr to cluster which made prototype
|
|
DISTRIBUTION *Distrib; // different distribution for each dimension
|
|
FLOAT32 *Mean; // prototype mean
|
|
FLOAT32 TotalMagnitude; // total magnitude over all dimensions
|
|
FLOAT32 LogMagnitude; // log base e of TotalMagnitude
|
|
FLOATUNION Variance; // prototype variance
|
|
FLOATUNION Magnitude; // magnitude of density function
|
|
FLOATUNION Weight; // weight of density function
|
|
} PROTOTYPE;
|
|
|
|
typedef struct {
|
|
int16_t SampleSize; // number of parameters per sample
|
|
PARAM_DESC *ParamDesc; // description of each parameter
|
|
int32_t NumberOfSamples; // total number of samples being clustered
|
|
KDTREE *KDTree; // for optimal nearest neighbor searching
|
|
CLUSTER *Root; // ptr to root cluster of cluster tree
|
|
LIST ProtoList; // list of prototypes
|
|
int32_t NumChar; // # of characters represented by samples
|
|
// cache of reusable histograms by distribution type and number of buckets.
|
|
BUCKETS* bucket_cache[DISTRIBUTION_COUNT][MAXBUCKETS + 1 - MINBUCKETS];
|
|
} CLUSTERER;
|
|
|
|
typedef struct {
|
|
int32_t NumSamples; // number of samples in list
|
|
int32_t MaxNumSamples; // maximum size of list
|
|
SAMPLE *Sample[1]; // array of ptrs to sample data structures
|
|
} SAMPLELIST;
|
|
|
|
// low level cluster tree analysis routines.
|
|
#define InitSampleSearch(S,C) (((C)==NULL)?(S=NIL_LIST):(S=push(NIL_LIST,(C))))
|
|
|
|
/*--------------------------------------------------------------------------
|
|
Public Function Prototypes
|
|
--------------------------------------------------------------------------*/
|
|
CLUSTERER *MakeClusterer (int16_t SampleSize, const PARAM_DESC ParamDesc[]);
|
|
|
|
SAMPLE *MakeSample(CLUSTERER * Clusterer, const FLOAT32* Feature, int32_t CharID);
|
|
|
|
LIST ClusterSamples(CLUSTERER *Clusterer, CLUSTERCONFIG *Config);
|
|
|
|
void FreeClusterer(CLUSTERER *Clusterer);
|
|
|
|
void FreeProtoList(LIST *ProtoList);
|
|
|
|
void FreePrototype(void *arg); // PROTOTYPE *Prototype);
|
|
|
|
CLUSTER *NextSample(LIST *SearchState);
|
|
|
|
FLOAT32 Mean(PROTOTYPE *Proto, uint16_t Dimension);
|
|
|
|
FLOAT32 StandardDeviation(PROTOTYPE *Proto, uint16_t Dimension);
|
|
|
|
int32_t MergeClusters(int16_t N, PARAM_DESC ParamDesc[], int32_t n1, int32_t n2,
|
|
FLOAT32 m[], FLOAT32 m1[], FLOAT32 m2[]);
|
|
|
|
//--------------Global Data Definitions and Declarations---------------------------
|
|
// define errors that can be trapped
|
|
#define ALREADYCLUSTERED 4000
|
|
#endif
|