# Shape Recognition Based on Projected Edges and Global Statistical Features

Authors: Attila Stubendek; Kristóf Karacs
Journal: Mathematical Problems in Engineering
 (2018)

---

## Abstract

A combined shape descriptor for object recognition is presented, along with an offline and online learning method. The descriptor is composed of a local edge-based part and global statistical features. We also propose a two-level, nearest neighborhood type multiclass classification method, in which classes are bounded, defining an inherent rejection region. In the first stage, global features are used to filter model instances, in contrast to the second stage, in which the projected edge-based features are compared. Our experimental results show that the combination of independent features leads to increased recognition robustness and speed. The core algorithms map easily to cellular architectures or dedicated VLSI hardware.


---

## Body

## 1. Introduction

Recognizing shapes is an essential task in computer vision, especially in understanding digital images and image flows. A wide spectrum of application areas relies on shape recognition, including robotics, healthcare, security systems, assistance for the impaired.The goal of computer vision is to generate answers to visual queries which are based on the input image. Depending on the query, several levels can be identified in a vision problem. A typical categorization distinguishes between detection, localization, and recognition. In the detection part, the presence of an object is examined; localization determines the position; in comparison, recognition identifies the detected objects, possibly considering their context in the visual scene. However, the definition of the object depends on the task [1, 2]. In typical computer vision systems, the result is computed from the image through its features, as a verified hypothesis [3, 4]. Similar to queries, features may incorporate local details as well as global image properties. If patches or complete contours are extracted from the image, the shape of the resulting region is one of the most important local features beside color, texture, and other details [5].The key to efficient shape recognition is to use an appropriate representation that comprises all important characteristics of a shape in a compact descriptor. A shape description is considered to be efficient from a recognition point of view, if(i)
the representation is compact,(ii)
a metric for the comparison of the feature vectors can be efficiently computed,(iii)
the representation is insensitive to minor changes and noise,(iv)
the description is invariant to several distortions.The most basic classification of shape descriptions distinguishes between contour-based and region-based techniques. Each method extracts specific features that encompass some meaningful aspects of the information in the shape. Using only one feature type thus limits the description power of the descriptor in terms of discriminative power and classification performance [6].Contour-based shape features describe the shape based on its contour lines in various representations, such as contour moments [7, 8], centroid distances and shape signatures [9–11], scale space methods [12], spectral transforms [13, 14], and structural representation [15, 16]. Common drawbacks of contour methods are the complexity of feature matching, representation of holes and detached parts of the shape, and noise sensitivity [6].Region-based techniques describe the shape based on every point of the shape and represent mainly global features of the shape. Moment invariants are derived as statistical features of the shape points [17]. Orthogonal moment descriptors such as Zernike and Legendre descriptors employ polynomials instead of the moment transform kernels [18–20]. Complex shape moments are robust and matching is straightforward; however, lower order of moments poorly represents the shape, but higher orders are more sensitive to noise and difficult to derive [21]. Generic Fourier descriptor represents the shape as the 2D Fourier transformation of the polar-transformed shape.The requirement of compactness stands for the maximal level of independence of the feature data without sacrificing comparison and recognition performance. In other words, redundancy in the feature vector is accepted if it significantly simplifies the subsequent processing of the vector, thus accelerating the classification, and may increase the accuracy of the recognition. Combining different features allows catching different essences of the shape, and although it may introduce redundant data, at the same time it also increases robustness [22–24]. However, employing compound feature vectors requires a decision method that suits the different parts of the description. In machine learning, several ensemble classifiers are known, which handle compound features, like boosting, bagging, or stacking [25–27].Representations of the same real-world object may differ due to several effects such as lighting conditions, camera settings, position, and noise. The major challenges of object detection are to ignore the differences in the representation resulting by sensing and preprocessing and to recognize if the difference is caused by different input objects. Several invariance requirements are often standard expectations to shape recognition methods, but the exact group of requirements has to be defined to each individual task, considering other parameters as well, such as hardware ones.The principal motivation of our work was to create methods for portable vision application, where safety and reliability are the primal goals, such as aid for the visually impaired, and also other vision-based recognition systems. The requirements towards the application outline the specifications of the used algorithms. We aim to recognize mainly rigid, not flexible objects in video images, but due to various image acquisition conditions and poor image quality, significant amount of noise has to be handled and several invariance requirements have to be fulfilled. The application is valuable only if it is reliable and it is not critical to classify all frames but false answers can easily cause dangerous situations. Thus minimizing false-positive errors has priority over maximizing cover ratio. Finally, we preferred that kind of algorithms that are appropriate for dedicated VLSI architecture but provide real-time processing even on standard cell phone CPU and GPU.Visual environments containing real-word objects normally encountered by humans contain a practically infinite number of object classes. Depending on the task, out of these classes, the number of relevant ones may be orders of magnitude smaller than the number of irrelevant classes; thus representing each irrelevant class with a representative instance is not efficient, if at all feasible. Hence, our primary goal is to develop a framework that can handle multiclass recognition problems, with only a few classes considered relevant, which requires performance evaluation metrics adapted to this flavor of multiclass classification.The paper is organized as follows. In Section2, we review the issue of invariance requirement of a recognition tool. In Section 3, we describe the performance evaluation methods used in the paper. In Section 4, we present our proposed compound description method, the Global Statistical and Projected Principal Edge Description. In Section 5, a gradual classification method is presented including a limited nearest neighborhood decision. The related online and offline learning method is presented in Sections 6 and 7. Finally, in Section 8, we show our results and, in Section 9, we conclude with future directions.


## 2. The Role of Description and Classification

We investigate classic machine learning decomposition and the role of edges and their appropriate and efficient representation. The estimation of the ground truth is based on limited sensing, resulting in different representation of essentially same objects. The key point of the recognition is a model that draws boundaries of output classes. However, classes may differ based on various traits; thus the selection of discriminative features is also essential. From this point of view, we will divide recognition to feature extraction and classification.In this paper, we investigate shape recognition that models the decision based on supervised learning, where the model is built up based on previously labeled inputs denoted as templates; the set of already known inputs is denoted as training set. Independently from the exact type and behavior of the classifier, the classification is a comparison of the input to labeled elements from the training set (or a model built up from the set), where the decision is a function of the representation. The difference between the representations of the same object is a result of various distortions that occur during the image acquisition and preprocessing. Note that distortions affect also the elements of the training set.The input shapeSi∗ is a result of a T transformation of the original shape Si, where γ denotes the parameter(s) of the transformation and P is the set of all possible parameters of the transformation:(1)TγiSi=Si∗,γi∈P.The input shape St∗ is a result of a T transformation of the original template shape St:(2)TγtSt=St∗,γt∈P.The output class of Si∗ is a decision function D^, depending on one or more labeled shapes St1∗,…,Stn∗, comprising the representative set R:(3)D^Si∗=DRSi∗⋃i=1nSti∗=R.The task of the recognition is not the reconstruction of the original shape by mathematical operations but to classify independently from transformations that distort the original and the template shapes and thus to estimate the ground truth C. (4)D^Si∗≈CSi.From this aspect, the transformation can be also considered as noise and noise is considered as a transformation.In the next paragraphs, we give an overview of possible distortions of a shape in an object recognition problem and formalize deviations mathematically. Then we try to define the ability to represent similarity by formalizing tolerance and invariance in general and especially for the target shapes. Finally, we give an overview about possible solutions of ensuring invariance and tolerance in a description-based recognition system.


### 2.1. Distortions in a Shape Description Problem

To find all the possible deviations of a shape, we go along the process where the binary shape is generated from a real-word object. However, shape generally can be defined as a multidimensional set of points; in this paper, we only focus on 2D shapes that are projections of 2D, flat objects in a 3D space and characteristic silhouettes of 3D images (2D representation of 3D objects from different viewpoints, where the object has to be modeled or multiple shapes are needed to reconstruct the object, is not the subject of this paper).Applying the constraints above, during image acquisition by a camera, where the 3D-2D transformation and the sampling take place, the following geometric and pixel-level deviations may occur:(a)
Rotation of the object on its plane compared to the camera axes(b)
Position difference of the object relatively to the camera, which can be split to
(ba)
distance difference of the camera and the object(bb)
position difference of the projected camera origin and the object(c)
Angular deviation of the object plane normal-vector and the camera projection direction(d)
Appearance of noise due to sensing limitations and sampling errors(e)
Some part of the shape being missing or the shape being joint with another patternNote that, from practical considerations, geometric variances can be represented in other spaces too. If we consider the characteristic motives of the shape to be larger than the sampling rate, the deviance in (d) is limited only to the sensing noise. However, inappropriate focusing may also cause loss of details of the shape which in most of the cases exceeds the sampling error.The shape is generated from the input image by various image processing algorithms, such as segmentation, patterns extraction, and morphological operations. Here, we will not investigate these preprocessing phases, but generally it can be stated that the shape generation is a binarization of some characteristic pattern of the image; thus the deviation (e) may befall due to the various lighting condition and unambiguous shape edges.Summarizing the deviations, we can name those variations, of which shape recognition may be independent or the similarity index should be proportional to the deviation. From the aspect of the shape, the distance variation appears in different scales of the shape. Positioning variance results in a different location of the shape on the image canvas; rotation of the image in its plane also results in a rotated shape. Angular deviation of the image plane together with positioning difference results in perspective variance. Not only do binarization ambiguity and noise result in misplaced edge pixels on the desired shape but also both of them may lead to detached shape parts or to holes in the original shape.


### 2.2. Decomposition Model for Shape Similarity

Variance in the appearance of an object can be modeled in a mathematical sense as noise. We call shapes to be similar if the difference is due to different observation properties and processing noise. If the shape is rigid, observation property is reduced only to geometrical transformations. To achieve classification consistency across various distortions, we identify two different aspects, invariance and tolerance, with respect to these distortions.Invariance of a recognition engine with respect to a particular type of deviation is defined as the ability to return the same result for all inputs that only differ in the given deviation.(5)D^TγS=D^Sfor∀γ∈P.We speak about tolerance to an effect if difference in the input causes no difference in the output to a certain limit LT:(6)D^TγS=D^Sfor∀γ∈P,γ<LT.Note that norm for transformation parameter is substantially an abstract function, which cannot be measured directly but only can be estimated based on the transformed shape. Similarly, the limit LT also represents an abstract value. Both the norm and the limit are determined by the actual interpretation of the similarity.Tolerance can be defined as a limited, local invariance, and, vice versa, invariance is a global tolerance. Due to this, invariance with respect to an effect implies tolerance to the whole domain, while invariance can be achieved by overlapping regions of tolerance.The human similarity metric highly depends on the actual task; thus no general statement can be defined on which deviations should be eliminated and which should be tolerated during shape recognition. The environment in some cases does provide some references regarding the projection details. Some of the parameters described above might be fixed, previously adjusted (e.g., relative orientation or position of the camera and the object), or can be derived from the image metadata (e.g., distance of the focused subject of an image and angular difference from the horizontal plane). In these cases, deviations in the given parameters result in a different shape; thus invariance is needed only if the human notion of the shape is not dependent on the distortion, and only tolerance is required if the given parameters are not exact or the human perception does tolerate deviations with a certain limit.The transformations above can be characterized by the possible outputs applying the transformations. The rangeQ of transformation T is defined as the set of all possible results of transformation T on a shape S:(7)QTS=U,U=TγS,γ∈P.In the case of reversible transformation Tγ·, the inverse transformation is denoted here as Tγ-1·. To represent noise as transformation, we chose the parameter γ as a shape, and the noise transformation TγS=S⊕γ, where ⊕ stands for the logical X-OR operation. By using this formalization, the random property of the noise transformation is ensured in random selection of parameter γ. This annotation allows us to represent the noise as a reversible operation, where γ-1=γ.We denote shapesS and U to be separated by transformation T if there are no parameters γ1 and γ2 of T which transform S and U to the same shape:(8)∄γ1,γ2∈P:Tγ1S=Tγ2UQTS∩QTU=∅If the transformation is reversible, then S and U are separated by transformation T:(9)∄γ:TγS=US∉QTU.If we assume that output classes are separated by transformation T and no reference system is given, the recognition should be invariant to transformation T. If the classes are not separated, the recognition should only tolerate the difference caused by transformation T.Without any assumptions about the noise, adding sampling and preprocessing noise to a shape (noise transformation) may result in an arbitrary distortion; no shapes are separated by noise transformation, and thus the recognition should only be tolerant to the noise transformation. If the noise is bounded, the result space is limited.Adding sampling and preprocessing noise (noise transformation) theoretically may result in arbitrary shape. The geometric transformations, except for the 90-degree perspective distortion, are closed transformations; thus invariance with respect to rotation, scale, and transition and tolerance to perspective distortion are standard requirements in case of shape recognition. However, distortions affecting a shape cannot be handled separately. Sampling noise when doing a low resolution scale or a flat perspective view can be significant. Hence, scale invariance and perspective tolerance are limited to scales where essential details of the shape are still present.Invariance and tolerance regarding different distortions can be ensured in various ways. Feature extraction generalizes the shape from the specific aspect independently from those effects that are irrelevant for the classification, and classification performs a decision based on a complex distance. Hence, feature extraction is generally responsible for ensuring invariance and classification for tolerating difference to a specific limit. However, as we described in Section2.2, invariance can be achieved by continuous tolerance and tolerance is a partial invariance; thus encoding similarities may occur in different parts of the recognition unit. In addition, there are many classifiers that also include generalization power (i.e., kernel functions).


## 2.1. Distortions in a Shape Description Problem

To find all the possible deviations of a shape, we go along the process where the binary shape is generated from a real-word object. However, shape generally can be defined as a multidimensional set of points; in this paper, we only focus on 2D shapes that are projections of 2D, flat objects in a 3D space and characteristic silhouettes of 3D images (2D representation of 3D objects from different viewpoints, where the object has to be modeled or multiple shapes are needed to reconstruct the object, is not the subject of this paper).Applying the constraints above, during image acquisition by a camera, where the 3D-2D transformation and the sampling take place, the following geometric and pixel-level deviations may occur:(a)
Rotation of the object on its plane compared to the camera axes(b)
Position difference of the object relatively to the camera, which can be split to
(ba)
distance difference of the camera and the object(bb)
position difference of the projected camera origin and the object(c)
Angular deviation of the object plane normal-vector and the camera projection direction(d)
Appearance of noise due to sensing limitations and sampling errors(e)
Some part of the shape being missing or the shape being joint with another patternNote that, from practical considerations, geometric variances can be represented in other spaces too. If we consider the characteristic motives of the shape to be larger than the sampling rate, the deviance in (d) is limited only to the sensing noise. However, inappropriate focusing may also cause loss of details of the shape which in most of the cases exceeds the sampling error.The shape is generated from the input image by various image processing algorithms, such as segmentation, patterns extraction, and morphological operations. Here, we will not investigate these preprocessing phases, but generally it can be stated that the shape generation is a binarization of some characteristic pattern of the image; thus the deviation (e) may befall due to the various lighting condition and unambiguous shape edges.Summarizing the deviations, we can name those variations, of which shape recognition may be independent or the similarity index should be proportional to the deviation. From the aspect of the shape, the distance variation appears in different scales of the shape. Positioning variance results in a different location of the shape on the image canvas; rotation of the image in its plane also results in a rotated shape. Angular deviation of the image plane together with positioning difference results in perspective variance. Not only do binarization ambiguity and noise result in misplaced edge pixels on the desired shape but also both of them may lead to detached shape parts or to holes in the original shape.


## 2.2. Decomposition Model for Shape Similarity

Variance in the appearance of an object can be modeled in a mathematical sense as noise. We call shapes to be similar if the difference is due to different observation properties and processing noise. If the shape is rigid, observation property is reduced only to geometrical transformations. To achieve classification consistency across various distortions, we identify two different aspects, invariance and tolerance, with respect to these distortions.Invariance of a recognition engine with respect to a particular type of deviation is defined as the ability to return the same result for all inputs that only differ in the given deviation.(5)D^TγS=D^Sfor∀γ∈P.We speak about tolerance to an effect if difference in the input causes no difference in the output to a certain limit LT:(6)D^TγS=D^Sfor∀γ∈P,γ<LT.Note that norm for transformation parameter is substantially an abstract function, which cannot be measured directly but only can be estimated based on the transformed shape. Similarly, the limit LT also represents an abstract value. Both the norm and the limit are determined by the actual interpretation of the similarity.Tolerance can be defined as a limited, local invariance, and, vice versa, invariance is a global tolerance. Due to this, invariance with respect to an effect implies tolerance to the whole domain, while invariance can be achieved by overlapping regions of tolerance.The human similarity metric highly depends on the actual task; thus no general statement can be defined on which deviations should be eliminated and which should be tolerated during shape recognition. The environment in some cases does provide some references regarding the projection details. Some of the parameters described above might be fixed, previously adjusted (e.g., relative orientation or position of the camera and the object), or can be derived from the image metadata (e.g., distance of the focused subject of an image and angular difference from the horizontal plane). In these cases, deviations in the given parameters result in a different shape; thus invariance is needed only if the human notion of the shape is not dependent on the distortion, and only tolerance is required if the given parameters are not exact or the human perception does tolerate deviations with a certain limit.The transformations above can be characterized by the possible outputs applying the transformations. The rangeQ of transformation T is defined as the set of all possible results of transformation T on a shape S:(7)QTS=U,U=TγS,γ∈P.In the case of reversible transformation Tγ·, the inverse transformation is denoted here as Tγ-1·. To represent noise as transformation, we chose the parameter γ as a shape, and the noise transformation TγS=S⊕γ, where ⊕ stands for the logical X-OR operation. By using this formalization, the random property of the noise transformation is ensured in random selection of parameter γ. This annotation allows us to represent the noise as a reversible operation, where γ-1=γ.We denote shapesS and U to be separated by transformation T if there are no parameters γ1 and γ2 of T which transform S and U to the same shape:(8)∄γ1,γ2∈P:Tγ1S=Tγ2UQTS∩QTU=∅If the transformation is reversible, then S and U are separated by transformation T:(9)∄γ:TγS=US∉QTU.If we assume that output classes are separated by transformation T and no reference system is given, the recognition should be invariant to transformation T. If the classes are not separated, the recognition should only tolerate the difference caused by transformation T.Without any assumptions about the noise, adding sampling and preprocessing noise to a shape (noise transformation) may result in an arbitrary distortion; no shapes are separated by noise transformation, and thus the recognition should only be tolerant to the noise transformation. If the noise is bounded, the result space is limited.Adding sampling and preprocessing noise (noise transformation) theoretically may result in arbitrary shape. The geometric transformations, except for the 90-degree perspective distortion, are closed transformations; thus invariance with respect to rotation, scale, and transition and tolerance to perspective distortion are standard requirements in case of shape recognition. However, distortions affecting a shape cannot be handled separately. Sampling noise when doing a low resolution scale or a flat perspective view can be significant. Hence, scale invariance and perspective tolerance are limited to scales where essential details of the shape are still present.Invariance and tolerance regarding different distortions can be ensured in various ways. Feature extraction generalizes the shape from the specific aspect independently from those effects that are irrelevant for the classification, and classification performs a decision based on a complex distance. Hence, feature extraction is generally responsible for ensuring invariance and classification for tolerating difference to a specific limit. However, as we described in Section2.2, invariance can be achieved by continuous tolerance and tolerance is a partial invariance; thus encoding similarities may occur in different parts of the recognition unit. In addition, there are many classifiers that also include generalization power (i.e., kernel functions).


## 3. Performance Evaluation in Multiclass Classification

In open-world multiclass recognition problems, only a relatively small subset of the classes is considered relevant for the given task. This is similar to a binary classification scheme with only positive and negative labels, with the difference that inside the positive class we need to be able to differentiate between several “positive” labels, which are considered relevant by themselves, as opposed to the irrelevant ones, among which no differentiation is necessary. More precisely, the relevancy attribute partitions the set of classes into the relevant and the irrelevant subsets.For an appropriate evaluation performance, metrics need to be adapted to this nature. Due to the prevalence of the positive-negative property for this multiclass case, it makes sense to rely on classic binary performance metrics, including recall and precision. To be able to use them, we need to extend the binary confusion matrix scheme of positive and negative decisions. Since we do not differentiate between irrelevant classes, all decisions from and into irrelevant classes are counted as true-negative (TN). True-positive (TP) counts all correct positive, that is, relevant, classifications; false-negative (FN) refers to the number of decisions where a relevant input was classified as irrelevant. False-positive decisions are split into two categories:FPRel indicates the number of false classifications between relevant classes, while FPNRel counts decisions where an irrelevant input is classified as a relevant one.Using this extended taxonomy, precision and recall can be defined as follows:(10)precision=TPTP+FPRel+FPNRel,recall=TPTP+FN+FPRel.For Fβ, being a weighted average of precision and recall, the definition does not need to be changed, with recall being more important for β>1, and precision weighted more important for β<1:(11)Fβ=1+β2precision·recallβ2·precision+recall.As we primarily target real-time recognition tasks on video sequences, type II errors have a much lower cost than type I errors. Hence, we have used the value β=0.05, which reflects this preference.


## 4. The Global Statistical and Projected Principal Edge Description

Since shapes have different properties depending on several aspects and the distinctive characteristics may be encoded in different aspects, a descriptor compound of independent shape features may provide more accurate representation. As mentioned earlier, the most important aspects are scope (global-local) and basis (region and edge). We suggest a shape description denoted as Global Statistical and Projected Principal Edge Description (GSPPED) that combines these shape features in order to represent different aspects.The descriptor consists of global statistical features and principal edge descriptors representing local characteristics. Structurally the descriptor is divided into three parts:(a)
A highly expressive header including eccentricity and area fill ratio(b)
A region-based feature set with histogram moments representing global shape properties(c)
A contour-based edge description employing modified Projected Principal Edge Distribution description for shapes


### 4.1. General Region-Based Global Features

Moments and general statistical features derived from moments are frequently used descriptors in shape and pattern recognition [6, 28]. A series of moments express the properties of a shape from basic features to details [17]; however, moments of higher orders are more vulnerable to noise and variances in shape. Thus, in vision applications, where patterns belonging to the same class may vary due to camera position or segmentation, using higher-order moments is less effective [21].The header part of the proposed description aims to depict the shape in the most compressed and expressive way. We are searching for that kind of combinations which are perceptually linear but may be calculated by nonlinear operations from easily measurable operands. Eccentricity and area ratio describe the basic outline of the shape; however, they are only suitable to use as primary features in filtering obviously false matches [6]. Besides, they are simple scalars encompassing understandable and most characterizing information for a human. The smaller the eccentricity is, the closer the shape is to a circle, while shape with eccentricity value of one is a line. The area ratio is the ratio of the area occupied by the shape and the area of the minimal rectangle covering the shape.The region-based feature set consists of the first four moments of horizontal and vertical histograms of the shape (Figure1). Using more moments would enable us to describe the shape in more detail, but we would lose the general recognition ability. Thus, we used the first four moments: mean, variance, skewness, and kurtosis. For the sake of simplicity but not losing dimensional information, the moments are computed from the histograms of the shape. This solution reduces computational complexity compared to 2-dimensional moment calculation and provides advantages when the descriptor is computed on VLSI architecture. The distribution of the region-based features is shown in Figures 2 and 3.Figure 1
Vertical and horizontal histograms of a shape.Figure 2
The distributions of the eccentricity and the area ratio on the Hungarian Forint Banknote pattern dataset (for details, see Section8.). Classes 1–9 represent different patterns from banknotes; other irrelevant shapes are denoted as class 0.Figure 3
The distributions of the vertical and horizontal moments on the Hungarian Forint Banknote pattern dataset (for details, see Section8.). Classes 1–9 represent different patterns from banknotes; other irrelevant shapes are denoted as class 0. The figure shows that these values do not contain enough discriminative power to classify the patches but provide a good guide to filter and reject obviously different shapes.


### 4.2. Contour-Based Features

#### 4.2.1. The Projected Principal Edge Distribution

Projected Principal Edge Distribution (PPED) is a grayscale image descriptor that characterizes principal edges of 64 × 64 pixels’ moving image window developed for recognizing anatomical regions in X-ray images. To highlight important edges, for every pixel, a local threshold is defined as the median of differences of neighboring pixel values in a 5 × 5 pixels’ window around the pixel. Edges are detected in four directions (0,π/4, π/2, and 3π/4) with a convolution, where values below the actual pixel threshold (defined above) are set to zero. To select the principal edges only, for every pixel location of the four edge maps, only the largest edge value is kept and the values of the location on the other three maps are set to zero. Edge maps are then projected in the same direction as the convolution and normalized to a length of 16 values. Finally, smoothing is applied to reduce noise.For every window position on the input image, a separate feature vector is computed and compared to the labeled templates, choosing the closest instance to classify the input [29].Note that PPED and relative descriptors are not rotation-invariant, and scale invariance is ensured by using fixed window sizes and scaling.


#### 4.2.2. The Extended Projected Principal Shape Edge Distribution (EPPSED)

The core of the contour-based edge description is based on the principle used by the PPED. The edge values are detected in four directions; principal edges are selected and then projected and concatenated; the result for one shape is a 64-element feature vector. The essential difference between the methods is in selecting the object, calculating the thresholds and the maxima of the four edge maps, and ensuring scale and rotation invariance. The method is shown in Figure4.Figure 4
Construction of the EPPSED feature vector. Edges are detected in four directions; then thresholding and maxima selection are applied; finally projections are concatenated and normalized.The input of a shape recognition task is the shape: a binary or a grayscale image with a binary mask, where the borders, the edges of the shapes, are detected by the pattern extractor or the segmentation algorithm. Thus, finding the border of the shape is the task of the preprocessor, not the shape descriptor. From another aspect, the differences between neighboring pixel gray-values in a binary image are 0 or 1 (pixel value 1 for in-shape pixels and 0 for others); consequently, the median value is also binary. Hence, using the median of differences as a threshold is unnecessary. We experimented with different threshold values, and we concluded that the best results can be achieved by using a threshold value ofθglobal=2.An essential difference between the EPPSED and the PPED lies in the thresholding method and in choosing the maximal edge value. Our aim is to design a cross-architecture algorithm, where architecture-dependent computing does not influence the output significantly. Using hard-thresholding (thard) may result in ambiguous behaviors near the threshold value for almost identical edge values; thus we use a soft-thresholding (tsoft) method with no discontinuity:(12)tsoftx=max⁡0,θbx+1-θbifx<θxifx≥θ,where θ is the threshold value or the maximal edge value and b is the tolerance bound.We chose the optimal tolerance boundb based on Fβ measured on the databases mentioned in Section 8 (Figure 5). The results showed that small tolerance values do not have a significant effect, but using higher values leads to improved classification performance, with the best result achieved using a tolerance bound of b=2, which was used for all experiments described in the paper. Noting that θglobal=b, we concluded that using a global threshold for the edge values is unnecessary.Figure 5
TheF-measure depending on the tolerance bound b in the soft-threshold method. Hard-th corresponds to the F-measure value achieved by hard-thresholding.Another major deficiency of the PPED is that it is not invariant with respect to rotation. Rotation invariance can be ensured at various phases of feature-based object recognition. One approach generates a rotation-invariant feature vector applying an adequate mathematical transformation while generating the description. Another possibility is to solve the rotation-invariance in classification technique whether by using rotationally redundant training set or by applying preprocessing on the feature vector [18–20, 30]. Since the PPED algorithmically is not rotation-invariant, only angular normalization or employing a rotationally redundant template bank may provide invariance. The latter solution can easily result in a huge and complicated database. To achieve rotation invariance, we chose to detect a characteristic angle and normalize the shape angularly. The orientation of the shape (defined as the declination of the major axis of the ellipse having the same second moment) serves well as a characteristic angle, since it is consistent in the sense that orientation values of similar shapes are close to each other (mathematical orientation may significantly deviate from the orientation value estimated by a human observer).Orientation is a value within(-π,π); thus rotation by the orientation provides invariance to rotation by k∗π, resulting in two distinct possibilities. To make the rotation unambiguous, the shape is rotated by π if the center of mass of the shape is located on the right side.To achieve scale-invariant shape analysis, the shape is normalized to fit in a window sized 64 × 64 pixels, preserving the original aspect ratio. It has been shown earlier that using larger sizes is unnecessary. Due to angular normalization, the shape fully fills the horizontal space; thus positioning is limited only to the vertical alignment, where the shape is moved to have the same distance between the borders and the square box on the two sides.We summarized the construction of the EPPSED feature vector by Pseudocode1.Pseudocode 1
E V → = 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 - 1 - 1 - 1 - 1 - 1 0 0 0 0 0 E V ↘ = 0 1 0 0 0 - 1 0 1 1 0 0 - 1 0 1 0 0 - 1 - 1 0 1 0 0 0 - 1 0 E V ↑ = rot ⁡ 90 E V → E V ↗ = rot ⁡ 90 E V ↘  function EPPSED(S) N=64 % preprocessing rotate(S, -orientation(S)) resize(S, [N, N], fit) if horizontal_mass_center(S) > N/2 then rotate(S, 180)  directions  ≔  [ ↑ ,   ↗ ,   → ,   ↘ ] % generate edge maps (EM) for every direction for dir in directions EM(dir) ≔convolution2d(S, EV(dir)) % for every location threshold the edge maps for i in [1..N], j in [1..N] for dir in directions θ  ≔  max dir 2   in   directions ⁡ E P d i r 2 i , j EMT(dir)  ≔  t s o f t (EM(dir), θ ) % project thresholded edge maps and scale them for dir in directions PR(dir)  ≔  histogram(EMT(dir)) scale(PR(dir), N/4) EPPSED  ≔  [PR( ↑ ), PR( → ), PR( ↗ ), PR( ↘ )] end


## 4.1. General Region-Based Global Features

Moments and general statistical features derived from moments are frequently used descriptors in shape and pattern recognition [6, 28]. A series of moments express the properties of a shape from basic features to details [17]; however, moments of higher orders are more vulnerable to noise and variances in shape. Thus, in vision applications, where patterns belonging to the same class may vary due to camera position or segmentation, using higher-order moments is less effective [21].The header part of the proposed description aims to depict the shape in the most compressed and expressive way. We are searching for that kind of combinations which are perceptually linear but may be calculated by nonlinear operations from easily measurable operands. Eccentricity and area ratio describe the basic outline of the shape; however, they are only suitable to use as primary features in filtering obviously false matches [6]. Besides, they are simple scalars encompassing understandable and most characterizing information for a human. The smaller the eccentricity is, the closer the shape is to a circle, while shape with eccentricity value of one is a line. The area ratio is the ratio of the area occupied by the shape and the area of the minimal rectangle covering the shape.The region-based feature set consists of the first four moments of horizontal and vertical histograms of the shape (Figure1). Using more moments would enable us to describe the shape in more detail, but we would lose the general recognition ability. Thus, we used the first four moments: mean, variance, skewness, and kurtosis. For the sake of simplicity but not losing dimensional information, the moments are computed from the histograms of the shape. This solution reduces computational complexity compared to 2-dimensional moment calculation and provides advantages when the descriptor is computed on VLSI architecture. The distribution of the region-based features is shown in Figures 2 and 3.Figure 1
Vertical and horizontal histograms of a shape.Figure 2
The distributions of the eccentricity and the area ratio on the Hungarian Forint Banknote pattern dataset (for details, see Section8.). Classes 1–9 represent different patterns from banknotes; other irrelevant shapes are denoted as class 0.Figure 3
The distributions of the vertical and horizontal moments on the Hungarian Forint Banknote pattern dataset (for details, see Section8.). Classes 1–9 represent different patterns from banknotes; other irrelevant shapes are denoted as class 0. The figure shows that these values do not contain enough discriminative power to classify the patches but provide a good guide to filter and reject obviously different shapes.


## 4.2. Contour-Based Features

### 4.2.1. The Projected Principal Edge Distribution

Projected Principal Edge Distribution (PPED) is a grayscale image descriptor that characterizes principal edges of 64 × 64 pixels’ moving image window developed for recognizing anatomical regions in X-ray images. To highlight important edges, for every pixel, a local threshold is defined as the median of differences of neighboring pixel values in a 5 × 5 pixels’ window around the pixel. Edges are detected in four directions (0,π/4, π/2, and 3π/4) with a convolution, where values below the actual pixel threshold (defined above) are set to zero. To select the principal edges only, for every pixel location of the four edge maps, only the largest edge value is kept and the values of the location on the other three maps are set to zero. Edge maps are then projected in the same direction as the convolution and normalized to a length of 16 values. Finally, smoothing is applied to reduce noise.For every window position on the input image, a separate feature vector is computed and compared to the labeled templates, choosing the closest instance to classify the input [29].Note that PPED and relative descriptors are not rotation-invariant, and scale invariance is ensured by using fixed window sizes and scaling.


### 4.2.2. The Extended Projected Principal Shape Edge Distribution (EPPSED)

The core of the contour-based edge description is based on the principle used by the PPED. The edge values are detected in four directions; principal edges are selected and then projected and concatenated; the result for one shape is a 64-element feature vector. The essential difference between the methods is in selecting the object, calculating the thresholds and the maxima of the four edge maps, and ensuring scale and rotation invariance. The method is shown in Figure4.Figure 4
Construction of the EPPSED feature vector. Edges are detected in four directions; then thresholding and maxima selection are applied; finally projections are concatenated and normalized.The input of a shape recognition task is the shape: a binary or a grayscale image with a binary mask, where the borders, the edges of the shapes, are detected by the pattern extractor or the segmentation algorithm. Thus, finding the border of the shape is the task of the preprocessor, not the shape descriptor. From another aspect, the differences between neighboring pixel gray-values in a binary image are 0 or 1 (pixel value 1 for in-shape pixels and 0 for others); consequently, the median value is also binary. Hence, using the median of differences as a threshold is unnecessary. We experimented with different threshold values, and we concluded that the best results can be achieved by using a threshold value ofθglobal=2.An essential difference between the EPPSED and the PPED lies in the thresholding method and in choosing the maximal edge value. Our aim is to design a cross-architecture algorithm, where architecture-dependent computing does not influence the output significantly. Using hard-thresholding (thard) may result in ambiguous behaviors near the threshold value for almost identical edge values; thus we use a soft-thresholding (tsoft) method with no discontinuity:(12)tsoftx=max⁡0,θbx+1-θbifx<θxifx≥θ,where θ is the threshold value or the maximal edge value and b is the tolerance bound.We chose the optimal tolerance boundb based on Fβ measured on the databases mentioned in Section 8 (Figure 5). The results showed that small tolerance values do not have a significant effect, but using higher values leads to improved classification performance, with the best result achieved using a tolerance bound of b=2, which was used for all experiments described in the paper. Noting that θglobal=b, we concluded that using a global threshold for the edge values is unnecessary.Figure 5
TheF-measure depending on the tolerance bound b in the soft-threshold method. Hard-th corresponds to the F-measure value achieved by hard-thresholding.Another major deficiency of the PPED is that it is not invariant with respect to rotation. Rotation invariance can be ensured at various phases of feature-based object recognition. One approach generates a rotation-invariant feature vector applying an adequate mathematical transformation while generating the description. Another possibility is to solve the rotation-invariance in classification technique whether by using rotationally redundant training set or by applying preprocessing on the feature vector [18–20, 30]. Since the PPED algorithmically is not rotation-invariant, only angular normalization or employing a rotationally redundant template bank may provide invariance. The latter solution can easily result in a huge and complicated database. To achieve rotation invariance, we chose to detect a characteristic angle and normalize the shape angularly. The orientation of the shape (defined as the declination of the major axis of the ellipse having the same second moment) serves well as a characteristic angle, since it is consistent in the sense that orientation values of similar shapes are close to each other (mathematical orientation may significantly deviate from the orientation value estimated by a human observer).Orientation is a value within(-π,π); thus rotation by the orientation provides invariance to rotation by k∗π, resulting in two distinct possibilities. To make the rotation unambiguous, the shape is rotated by π if the center of mass of the shape is located on the right side.To achieve scale-invariant shape analysis, the shape is normalized to fit in a window sized 64 × 64 pixels, preserving the original aspect ratio. It has been shown earlier that using larger sizes is unnecessary. Due to angular normalization, the shape fully fills the horizontal space; thus positioning is limited only to the vertical alignment, where the shape is moved to have the same distance between the borders and the square box on the two sides.We summarized the construction of the EPPSED feature vector by Pseudocode1.Pseudocode 1
E V → = 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 - 1 - 1 - 1 - 1 - 1 0 0 0 0 0 E V ↘ = 0 1 0 0 0 - 1 0 1 1 0 0 - 1 0 1 0 0 - 1 - 1 0 1 0 0 0 - 1 0 E V ↑ = rot ⁡ 90 E V → E V ↗ = rot ⁡ 90 E V ↘  function EPPSED(S) N=64 % preprocessing rotate(S, -orientation(S)) resize(S, [N, N], fit) if horizontal_mass_center(S) > N/2 then rotate(S, 180)  directions  ≔  [ ↑ ,   ↗ ,   → ,   ↘ ] % generate edge maps (EM) for every direction for dir in directions EM(dir) ≔convolution2d(S, EV(dir)) % for every location threshold the edge maps for i in [1..N], j in [1..N] for dir in directions θ  ≔  max dir 2   in   directions ⁡ E P d i r 2 i , j EMT(dir)  ≔  t s o f t (EM(dir), θ ) % project thresholded edge maps and scale them for dir in directions PR(dir)  ≔  histogram(EMT(dir)) scale(PR(dir), N/4) EPPSED  ≔  [PR( ↑ ), PR( → ), PR( ↗ ), PR( ↘ )] end


## 4.2.1. The Projected Principal Edge Distribution

Projected Principal Edge Distribution (PPED) is a grayscale image descriptor that characterizes principal edges of 64 × 64 pixels’ moving image window developed for recognizing anatomical regions in X-ray images. To highlight important edges, for every pixel, a local threshold is defined as the median of differences of neighboring pixel values in a 5 × 5 pixels’ window around the pixel. Edges are detected in four directions (0,π/4, π/2, and 3π/4) with a convolution, where values below the actual pixel threshold (defined above) are set to zero. To select the principal edges only, for every pixel location of the four edge maps, only the largest edge value is kept and the values of the location on the other three maps are set to zero. Edge maps are then projected in the same direction as the convolution and normalized to a length of 16 values. Finally, smoothing is applied to reduce noise.For every window position on the input image, a separate feature vector is computed and compared to the labeled templates, choosing the closest instance to classify the input [29].Note that PPED and relative descriptors are not rotation-invariant, and scale invariance is ensured by using fixed window sizes and scaling.


## 4.2.2. The Extended Projected Principal Shape Edge Distribution (EPPSED)

The core of the contour-based edge description is based on the principle used by the PPED. The edge values are detected in four directions; principal edges are selected and then projected and concatenated; the result for one shape is a 64-element feature vector. The essential difference between the methods is in selecting the object, calculating the thresholds and the maxima of the four edge maps, and ensuring scale and rotation invariance. The method is shown in Figure4.Figure 4
Construction of the EPPSED feature vector. Edges are detected in four directions; then thresholding and maxima selection are applied; finally projections are concatenated and normalized.The input of a shape recognition task is the shape: a binary or a grayscale image with a binary mask, where the borders, the edges of the shapes, are detected by the pattern extractor or the segmentation algorithm. Thus, finding the border of the shape is the task of the preprocessor, not the shape descriptor. From another aspect, the differences between neighboring pixel gray-values in a binary image are 0 or 1 (pixel value 1 for in-shape pixels and 0 for others); consequently, the median value is also binary. Hence, using the median of differences as a threshold is unnecessary. We experimented with different threshold values, and we concluded that the best results can be achieved by using a threshold value ofθglobal=2.An essential difference between the EPPSED and the PPED lies in the thresholding method and in choosing the maximal edge value. Our aim is to design a cross-architecture algorithm, where architecture-dependent computing does not influence the output significantly. Using hard-thresholding (thard) may result in ambiguous behaviors near the threshold value for almost identical edge values; thus we use a soft-thresholding (tsoft) method with no discontinuity:(12)tsoftx=max⁡0,θbx+1-θbifx<θxifx≥θ,where θ is the threshold value or the maximal edge value and b is the tolerance bound.We chose the optimal tolerance boundb based on Fβ measured on the databases mentioned in Section 8 (Figure 5). The results showed that small tolerance values do not have a significant effect, but using higher values leads to improved classification performance, with the best result achieved using a tolerance bound of b=2, which was used for all experiments described in the paper. Noting that θglobal=b, we concluded that using a global threshold for the edge values is unnecessary.Figure 5
TheF-measure depending on the tolerance bound b in the soft-threshold method. Hard-th corresponds to the F-measure value achieved by hard-thresholding.Another major deficiency of the PPED is that it is not invariant with respect to rotation. Rotation invariance can be ensured at various phases of feature-based object recognition. One approach generates a rotation-invariant feature vector applying an adequate mathematical transformation while generating the description. Another possibility is to solve the rotation-invariance in classification technique whether by using rotationally redundant training set or by applying preprocessing on the feature vector [18–20, 30]. Since the PPED algorithmically is not rotation-invariant, only angular normalization or employing a rotationally redundant template bank may provide invariance. The latter solution can easily result in a huge and complicated database. To achieve rotation invariance, we chose to detect a characteristic angle and normalize the shape angularly. The orientation of the shape (defined as the declination of the major axis of the ellipse having the same second moment) serves well as a characteristic angle, since it is consistent in the sense that orientation values of similar shapes are close to each other (mathematical orientation may significantly deviate from the orientation value estimated by a human observer).Orientation is a value within(-π,π); thus rotation by the orientation provides invariance to rotation by k∗π, resulting in two distinct possibilities. To make the rotation unambiguous, the shape is rotated by π if the center of mass of the shape is located on the right side.To achieve scale-invariant shape analysis, the shape is normalized to fit in a window sized 64 × 64 pixels, preserving the original aspect ratio. It has been shown earlier that using larger sizes is unnecessary. Due to angular normalization, the shape fully fills the horizontal space; thus positioning is limited only to the vertical alignment, where the shape is moved to have the same distance between the borders and the square box on the two sides.We summarized the construction of the EPPSED feature vector by Pseudocode1.Pseudocode 1
E V → = 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 - 1 - 1 - 1 - 1 - 1 0 0 0 0 0 E V ↘ = 0 1 0 0 0 - 1 0 1 1 0 0 - 1 0 1 0 0 - 1 - 1 0 1 0 0 0 - 1 0 E V ↑ = rot ⁡ 90 E V → E V ↗ = rot ⁡ 90 E V ↘  function EPPSED(S) N=64 % preprocessing rotate(S, -orientation(S)) resize(S, [N, N], fit) if horizontal_mass_center(S) > N/2 then rotate(S, 180)  directions  ≔  [ ↑ ,   ↗ ,   → ,   ↘ ] % generate edge maps (EM) for every direction for dir in directions EM(dir) ≔convolution2d(S, EV(dir)) % for every location threshold the edge maps for i in [1..N], j in [1..N] for dir in directions θ  ≔  max dir 2   in   directions ⁡ E P d i r 2 i , j EMT(dir)  ≔  t s o f t (EM(dir), θ ) % project thresholded edge maps and scale them for dir in directions PR(dir)  ≔  histogram(EMT(dir)) scale(PR(dir), N/4) EPPSED  ≔  [PR( ↑ ), PR( → ), PR( ↗ ), PR( ↘ )] end


## 5. Multilevel Classification

Adapted to the structure of the GSPPED descriptor, we propose a two-step classification method that adapts to the compound characteristics of the GSPPED descriptor, but it can be used in general as well.Nearest neighborhood classifiers are typical when using PPED-type descriptors. The drawback of the nearest neighborhood method is that it might be slow (due to many comparisons) [31]; representation set scales poorly, and there is no option to reject inputs not belonging to any relevant class. The GSPPED, as a compound descriptor, enables us to use a special comparison method, since the parts of the vector represent different features. Compound classifiers are frequently used techniques to handle separate parts, but generally they do not exploit the meaning of each part of the vector.We suggest a two-step classification scheme that allows using the different parts of the descriptor individually. Shape classification is performed by comparison of the descriptor to labeled points in the feature space denoted as templates. In the first step, global and statistical features are compared; then, if a satisfactory match is achieved, the final decision is computed from the differences between the contour features.We call the set of templates used for comparison the representative set, which is a subset of the training set. Every template in the training set is labeled by its semantic class. Depending on the task, several classes are chosen as relevant ones, whereas every input vector outside of these is considered to be nonrelevant (nonrelevant classes). Although the nonrelevant subset typically comprises many classes, it can be handled as a single class due to the lack of need to differentiate between them.


### 5.1. Filtering

The first phase of the decision selects candidates from the representative set for the second phase by rejecting obviously dissimilar template vectors. An input descriptor matches the labeled template vector if the number of elements with a difference higher than the threshold is under a certain limit.(13)comparisonf,t=match,ifEf,t≤thGreject,ifEf,t>thGEf,t=∑i∈filterseif,teif,t=1iffi-ti≤thi0iffi-ti>thi,where f is the input shape feature, t is the template vector, thG is the global filtering threshold, and thi is the threshold for the ith feature used for filtering.Other definitions ofei(f,t) can also be considered with continuous error values; for the sake of simplicity and simple computation, we chose a discrete function.The threshold valuesthG and th were determined based on preliminary measurements and genetic algorithm results. The fitness value of a filter vector z was chosen as follows:(14)fz=∑x∈R-penaltyx,zPenaltyx,z=0ifCx=D~x,z1ifCx≠D~x,z,D~x,zis  not  relevantPifCx≠D~x,z,D~x,zis  relevantD~x,z=D^Rxusing  filtersz,where Cx is the class of x and D~x,z is the predicted class of element x from parameter set R using the filter vector z. The false-positive penalty value P represents the priority between the precision and recall. If P>1, the precision is prioritized, and if P<1, the recall is maximized. The resulting filter values are denoted by z∗ and were computed using fitness function defined above with P=50 in 200 epochs and population size of 100 individuals.The goal of the filtering is to reduce classification time by allowing only a highly reduced sample set into the second phase and to increase precision by excluding elements that fall close to the input in the feature space of the second phase but are trivially dissimilar based on this lower dimensional subspace. However, not only does filtering result in a slight increase in precision but also we could achieve significantly higher recall rate (Figure6).Figure 6
Classification precision (a) and recall (b), tested on three different test sets A, B, and C, depending on the usage of filtering phase.
(a) (b)The explanation of the anomaly is the consequence of the second phase of the classification explained in Section5.2. The Adaptive Limited Nearest Neighborhood model learns the limits of acceptance also on filtered results and maximizes the classification precision. Assuming that filtering is based on data orthogonal to the data used in the second phase, it might filter out templates that in the second phase would determine lower acceptance radius for some instance. To verify the hypothesis, the frequency of acceptance radius lengths was measured in the function of the usage of filtering on the same representative set.As is seen in Figure7, filtering allows bigger acceptance radii, resulting in higher recall in the final classification. The mean of the acceptance radii is 113.4 if filtering is applied. Without filtering, the mean is reduced to 75.35, and only few representative instances have higher radius than 110 (radii shown in this paragraph are distances in the EPPSED feature space. Typically, the values of each dimension are in the interval from 0 to 200).Figure 7
Frequency of the acceptance radii in case of filtering (blue dotted) and without filtering (red lines). Filtering allows the acceptance radii to take higher values in average but even zero (if no other comparable elements remain after filtering) and overly high values as well (if only few and distant templates remain to compare).We also measured the speed of classification which depends on the number of comparisons to the template vectors. Filtering reduces the average lookup time by 85–95%.Filter values were computed to fit one actual shape set; thus these values may not be suitable for other sets. Since generated values are in the same order of magnitude with the standard deviation of the measured moments on the training set, we tested the standard deviation (as well as the half and the double of the standard deviation) on the same test sets. Results are summarized in Table1. Precision does not depend on the filter values and recall is significantly lower using the standard deviation compared to z∗; however, they are clearly higher than without filtering.Table 1
Recall depending on the filtering.z∗ denotes the filter vector obtained from genetic algorithm; std denotes the standard deviation of the relevant classes.
z ∗ std s t d / 2 s t d ∗ 2 No filtering Test set A 62,41 % 50,82% 54,23% 47,61% 44,43% Test set B 66,97 % 60,29% 62,72% 59,02% 38,46% Test set C 55,34 % 48,91% 47,66% 47,47% 36,20%


### 5.2. Adaptive Limited Nearest Neighborhood Classification

The second phase of the classification defines the final class of the input employing Limited Nearest Neighborhood Classification method. The reason to choose nearest neighborhood (NN) classifier is due to its suitability to be implemented on dedicated VLSI architecture; it can be easily learned and extended with new knowledge by inserting new representative instances.An important property of the nearest neighborhood method is that there is always a nearest element to every input vector if no additional constraints are specified. This can be a disadvantage in some cases if the distance between the closest element and the input is high.The inability to reject a hypothesis results in a type I error when irrelevant parts of the input space are not covered with training instances. To make the classifier able to maximize the precision, we propose an Adaptive Limited Nearest Neighborhood (AL-NN) method that allows the rejection of irrelevant inputsY by defining an acceptance radius individually for all training instances (C(Y)∈CNRel, where CNRel is the set of irrelevant classes and CRel is the set of relevant classes). By setting an upper bound for the distance of an input and a representative instance, we can limit the set of inputs that may get classified to the corresponding class to a hypersphere in the feature space, which we call the acceptance region of the instance.Acceptance regions of different shapes can also be considered. If the dimensions can be typically regarded as independent and the noise is not significant, the usage of a hypercube as an acceptance region is justifiable. Employing a hyperellipsoid allows different limits in different dimensions, but it is effective only in case of low-dimensional spaces. Since we work with a 64-dimensional feature vector, the degree of freedom would be impractically high. Additionally, in the proposed edge-based shape description, dimensions are typically equivalent as the amount and distribution of noise are the same in all dimensions; dimensions are weakly dependent, and we expect similar tolerance in all dimensions; thus we opted to use hyperspheres as acceptance regions.Using the same radius for all representative instances would be computationally easier, but it would result in a disproportionately large representative set to represent in-class regions and also boundary regions with the same radius. Furthermore, irregular boundaries might increase the inefficiency of the cover if the radius is determined based on the radius of the highest curvature.The acceptance radius indicates the extension of the class, the region in the feature space where the characteristics of the instance are valid. The clues in determining the acceptance radius as a boundary measure for a representative instance are the closest known instances that belong to another class and the instance with the maximal distance that belongs to the same class. In case of a relevant sample, it is worthwhile to distinguish relevant instances from other classes and irrelevant instances to make the representation more flexible.We define the set of all irrelevant examples (N), and for every example we define the set of other instances of the same class (SPx) and the set of instances of all other relevant classes (OPx):(15)OPx=y∣y∈R,Cy∈CRel,Cy≠CxN=z∣z∈R,Cz∈CNRelSPx=w∣w∈R,Cw=Cx.To be able to handle the three cases in a unified manner, a partial acceptance region function is introduced (rAλ(x)), which expresses the threshold for a given set A and a given threshold function λ:(16)rAλx=λdx,v∣v∈AxifAx≠∅∞ifAx=∅.The final acceptance radius will be the smallest of the partial acceptance radii. An example x from the training set R from the class C(x)∈CRel will get an acceptance radius rx (Figure 8):(17)rOP′x=ηOP·rOPminxrN′x=ηN·rNminxrSP′x=ηSP·rSPmaxxrx=ν·min⁡rOP′x,rN′x,rSP′x,where ν serves as a shared vigilance parameter, which affects how cautious do we want to be, and can be used to move on the precision-recall trade-off curve.Figure 8
Definition of the acceptance range.x0 and y0 represent relevant elements from different classes, z0 is the closest irrelevant element. Acceptance threshold for y0(r(y0)) is set to the half of the distance to the closest irrelevant element (rNmin(y0)). Acceptance threshold for x0 (r(x0)) is chosen as the distance to the closest element of another class (rOPmin(x0)). Since z0 is an irrelevant template, it is not included in the representative set; thus no acceptance region is defined for it.In our experiments, we usedηOP=ηSP=1, because this safely excludes other relevant samples from the acceptance region but still tries to include as many samples from its own class as possible. For the irrelevant classes, we have set the threshold parameter ηN more conservatively to 0.5 so as to enable the omission of the irrelevant elements from the representative set, as this choice does not allow acceptance regions to intersect with acceptance regions of irrelevant samples. Thus, if an input is not within the acceptance region of any relevant elements, then it is refused as being a nonrelevant input. With these parameter values, setting ν=1 results in strong preference for a high precision over a high recall rate. In this paper, where it is not specified, we used ν=1.Finding the optimal representation set in general is hard; hence, it is important that slight overrepresentations do not degrade the recall rate and thus the generalization capability of the model does not change considerably. This is satisfied by the formula proposed above, as it does not let the radius of the acceptance region to decrease if a new instance of the same class is added to the representative set.


## 5.1. Filtering

The first phase of the decision selects candidates from the representative set for the second phase by rejecting obviously dissimilar template vectors. An input descriptor matches the labeled template vector if the number of elements with a difference higher than the threshold is under a certain limit.(13)comparisonf,t=match,ifEf,t≤thGreject,ifEf,t>thGEf,t=∑i∈filterseif,teif,t=1iffi-ti≤thi0iffi-ti>thi,where f is the input shape feature, t is the template vector, thG is the global filtering threshold, and thi is the threshold for the ith feature used for filtering.Other definitions ofei(f,t) can also be considered with continuous error values; for the sake of simplicity and simple computation, we chose a discrete function.The threshold valuesthG and th were determined based on preliminary measurements and genetic algorithm results. The fitness value of a filter vector z was chosen as follows:(14)fz=∑x∈R-penaltyx,zPenaltyx,z=0ifCx=D~x,z1ifCx≠D~x,z,D~x,zis  not  relevantPifCx≠D~x,z,D~x,zis  relevantD~x,z=D^Rxusing  filtersz,where Cx is the class of x and D~x,z is the predicted class of element x from parameter set R using the filter vector z. The false-positive penalty value P represents the priority between the precision and recall. If P>1, the precision is prioritized, and if P<1, the recall is maximized. The resulting filter values are denoted by z∗ and were computed using fitness function defined above with P=50 in 200 epochs and population size of 100 individuals.The goal of the filtering is to reduce classification time by allowing only a highly reduced sample set into the second phase and to increase precision by excluding elements that fall close to the input in the feature space of the second phase but are trivially dissimilar based on this lower dimensional subspace. However, not only does filtering result in a slight increase in precision but also we could achieve significantly higher recall rate (Figure6).Figure 6
Classification precision (a) and recall (b), tested on three different test sets A, B, and C, depending on the usage of filtering phase.
(a) (b)The explanation of the anomaly is the consequence of the second phase of the classification explained in Section5.2. The Adaptive Limited Nearest Neighborhood model learns the limits of acceptance also on filtered results and maximizes the classification precision. Assuming that filtering is based on data orthogonal to the data used in the second phase, it might filter out templates that in the second phase would determine lower acceptance radius for some instance. To verify the hypothesis, the frequency of acceptance radius lengths was measured in the function of the usage of filtering on the same representative set.As is seen in Figure7, filtering allows bigger acceptance radii, resulting in higher recall in the final classification. The mean of the acceptance radii is 113.4 if filtering is applied. Without filtering, the mean is reduced to 75.35, and only few representative instances have higher radius than 110 (radii shown in this paragraph are distances in the EPPSED feature space. Typically, the values of each dimension are in the interval from 0 to 200).Figure 7
Frequency of the acceptance radii in case of filtering (blue dotted) and without filtering (red lines). Filtering allows the acceptance radii to take higher values in average but even zero (if no other comparable elements remain after filtering) and overly high values as well (if only few and distant templates remain to compare).We also measured the speed of classification which depends on the number of comparisons to the template vectors. Filtering reduces the average lookup time by 85–95%.Filter values were computed to fit one actual shape set; thus these values may not be suitable for other sets. Since generated values are in the same order of magnitude with the standard deviation of the measured moments on the training set, we tested the standard deviation (as well as the half and the double of the standard deviation) on the same test sets. Results are summarized in Table1. Precision does not depend on the filter values and recall is significantly lower using the standard deviation compared to z∗; however, they are clearly higher than without filtering.Table 1
Recall depending on the filtering.z∗ denotes the filter vector obtained from genetic algorithm; std denotes the standard deviation of the relevant classes.
z ∗ std s t d / 2 s t d ∗ 2 No filtering Test set A 62,41 % 50,82% 54,23% 47,61% 44,43% Test set B 66,97 % 60,29% 62,72% 59,02% 38,46% Test set C 55,34 % 48,91% 47,66% 47,47% 36,20%


## 5.2. Adaptive Limited Nearest Neighborhood Classification

The second phase of the classification defines the final class of the input employing Limited Nearest Neighborhood Classification method. The reason to choose nearest neighborhood (NN) classifier is due to its suitability to be implemented on dedicated VLSI architecture; it can be easily learned and extended with new knowledge by inserting new representative instances.An important property of the nearest neighborhood method is that there is always a nearest element to every input vector if no additional constraints are specified. This can be a disadvantage in some cases if the distance between the closest element and the input is high.The inability to reject a hypothesis results in a type I error when irrelevant parts of the input space are not covered with training instances. To make the classifier able to maximize the precision, we propose an Adaptive Limited Nearest Neighborhood (AL-NN) method that allows the rejection of irrelevant inputsY by defining an acceptance radius individually for all training instances (C(Y)∈CNRel, where CNRel is the set of irrelevant classes and CRel is the set of relevant classes). By setting an upper bound for the distance of an input and a representative instance, we can limit the set of inputs that may get classified to the corresponding class to a hypersphere in the feature space, which we call the acceptance region of the instance.Acceptance regions of different shapes can also be considered. If the dimensions can be typically regarded as independent and the noise is not significant, the usage of a hypercube as an acceptance region is justifiable. Employing a hyperellipsoid allows different limits in different dimensions, but it is effective only in case of low-dimensional spaces. Since we work with a 64-dimensional feature vector, the degree of freedom would be impractically high. Additionally, in the proposed edge-based shape description, dimensions are typically equivalent as the amount and distribution of noise are the same in all dimensions; dimensions are weakly dependent, and we expect similar tolerance in all dimensions; thus we opted to use hyperspheres as acceptance regions.Using the same radius for all representative instances would be computationally easier, but it would result in a disproportionately large representative set to represent in-class regions and also boundary regions with the same radius. Furthermore, irregular boundaries might increase the inefficiency of the cover if the radius is determined based on the radius of the highest curvature.The acceptance radius indicates the extension of the class, the region in the feature space where the characteristics of the instance are valid. The clues in determining the acceptance radius as a boundary measure for a representative instance are the closest known instances that belong to another class and the instance with the maximal distance that belongs to the same class. In case of a relevant sample, it is worthwhile to distinguish relevant instances from other classes and irrelevant instances to make the representation more flexible.We define the set of all irrelevant examples (N), and for every example we define the set of other instances of the same class (SPx) and the set of instances of all other relevant classes (OPx):(15)OPx=y∣y∈R,Cy∈CRel,Cy≠CxN=z∣z∈R,Cz∈CNRelSPx=w∣w∈R,Cw=Cx.To be able to handle the three cases in a unified manner, a partial acceptance region function is introduced (rAλ(x)), which expresses the threshold for a given set A and a given threshold function λ:(16)rAλx=λdx,v∣v∈AxifAx≠∅∞ifAx=∅.The final acceptance radius will be the smallest of the partial acceptance radii. An example x from the training set R from the class C(x)∈CRel will get an acceptance radius rx (Figure 8):(17)rOP′x=ηOP·rOPminxrN′x=ηN·rNminxrSP′x=ηSP·rSPmaxxrx=ν·min⁡rOP′x,rN′x,rSP′x,where ν serves as a shared vigilance parameter, which affects how cautious do we want to be, and can be used to move on the precision-recall trade-off curve.Figure 8
Definition of the acceptance range.x0 and y0 represent relevant elements from different classes, z0 is the closest irrelevant element. Acceptance threshold for y0(r(y0)) is set to the half of the distance to the closest irrelevant element (rNmin(y0)). Acceptance threshold for x0 (r(x0)) is chosen as the distance to the closest element of another class (rOPmin(x0)). Since z0 is an irrelevant template, it is not included in the representative set; thus no acceptance region is defined for it.In our experiments, we usedηOP=ηSP=1, because this safely excludes other relevant samples from the acceptance region but still tries to include as many samples from its own class as possible. For the irrelevant classes, we have set the threshold parameter ηN more conservatively to 0.5 so as to enable the omission of the irrelevant elements from the representative set, as this choice does not allow acceptance regions to intersect with acceptance regions of irrelevant samples. Thus, if an input is not within the acceptance region of any relevant elements, then it is refused as being a nonrelevant input. With these parameter values, setting ν=1 results in strong preference for a high precision over a high recall rate. In this paper, where it is not specified, we used ν=1.Finding the optimal representation set in general is hard; hence, it is important that slight overrepresentations do not degrade the recall rate and thus the generalization capability of the model does not change considerably. This is satisfied by the formula proposed above, as it does not let the radius of the acceptance region to decrease if a new instance of the same class is added to the representative set.


## 6. Optimizing the Representative Set

Another major disadvantage of the nearest neighborhood classification is that the manually built training/representative set might be disproportionately large, making the classification very slow.The representative set can be optimized by eliminating unnecessary points so that the resubstitution results do not change significantly on the training set. Omitting points may lead to a small decrease of the cover, but most of the omissions can be regarded as noise filtering, thus making the model eventually more robust.Selection of unnecessary points can be carried out based on the analysis of the representative set by minimizing the set size while preserving approximately the same cover. A pointY is unnecessary (U) from the aspect of classification if the classification result remains the same for all the points of the space (i.e., for an arbitrary input) if Y is removed from the representative set:(18)U=x∈F:DRx=DR∖Yx,where F is the feature space and DRx is the decision for feature vector x using the model learned by representative set R.In a nearest neighborhood model, the class is determined by the nearest labeled point. A representative instanceY is unnecessary if, for every point in the feature space that is classified to Y as the closest template point, the second closest template point belongs to the same class as Y.(19)∀x∈F∃Z∈R∖Y∀w∈R∖Y:dx,Y≤dx,w⟶dx,Z≤dx,w,where d(x,y) is the distance between points x and y.The boundary surfaceB between classes is the set of points that are equally distant from support vectors of different classes. A template point Y is unnecessary if it does not influence the boundary surfaces. In an n-dimensional feature space, such a boundary surface is n-1-dimensional, and apart from the singular cases when points lie in one hyperplane, complete shadowing of Y can be achieved with at least n necessary points of the same class. Therefore, if the number of representative points of a class and the dimension of the feature space have the same order of magnitude, only a negligible portion of the representative set can be unnecessary.In the Adaptive Limited Nearest Neighborhood method proposed above, acceptance regions of each representative instance provide a good estimate of their contribution to the global cover. We propose an iterative optimization algorithm for the Adaptive Limited Nearest Neighborhood classification which reduces the mutual cover of the representative set elements. As initialization, the points of the representative set are ordered in a queueP. The set S is initialized as empty:(20)S≔∅P≔x1,x2,…,xn,∀xi,xji<j⟶Hmxi<HmxjHmxi=∑j=1j≠inhmxi,xjhmxi,xj=1,ifdxi,xj≤m·rxi0,ifdxi,xj>m·rxi,where r(xi) is the acceptance radius of xi and Hmxi is the number of instances in the representative set which are closer to xi by m·r(xi).The first element ofP is taken out from P and moved to S, and all other instances are removed from P which are covered by it. (21)p≔P1S≔S∪premovex∈P∣Cp,x=1fromP.The iteration ends when P is empty, and S will be the reduced representative set.We tested the optimization algorithm from cutoff ratiom=1 to m=0, where m=1 stands for deleting any covered representative element and m=0 stands for unpruned model, where even identical elements may remain in the set. Results show that from m=1 to m=0.5 the recall increases from 0.5 to 0.6 nearly linearly, and from m=0.5 to 0 only a small increase can be noticed. Almost parallel to that, the size of the reduced representative set increases slightly to m=0.4 and after a significant increase saturates after m=0.2. The size of the resulting representative set is shown in Figure 10, and the recall depending on the cutoff ratio is shown in Figure 9.Figure 9
Recall as a function of the cutoff ratio.Figure 10
Size of the representative set as a function of the cutoff ratio.We also tested different orderings of the setP. Ordering based on acceptance radius showed lower performance with the same representative set size. Ordering based on the ratio of the volume of intersections and the acceptance hypersphere produced almost the same results as the method above but with significantly more complex computation. Another way to optimize the representative set is to perform several tests and remove instances that did not play a role in a certain number of classifications. However, this empirical method would require additional data that cover the largest portion of the feature space.


## 7. Extending the Representative Set

Adaptive extension of a learned AL-NN model can be carried out easily by inserting new point to the representative set and setting the acceptance radius of the inserted element based on the original training set. The extension can bring higher recall rates by covering previously uncovered regions of the feature space.The main challenge in extending the representative set is to select new instances to be inserted adequately. On one hand, to cover new areas, a candidate has to be far from the existing representative elements. On the other hand, an automatic update should only insert elements that are classified correctly with a reasonably high confidence, that is, ones close to a labeled point. If both conditions hold, we declare the insertion of the new instance to be safe.As we showed in Section5.2, the acceptance regions clearly bound the coverage in the representative set; thus both conditions can be formalized based on acceptance thresholds. The real challenge in selecting new instances is that the two conditions are contradictory. To resolve the contradiction that the distance of the candidate sample should be low (for high confidence) and high (to gain significant coverage) at the same time, we rely on temporal information.We developed an automatic extension algorithm for the AL-NN model, which uses temporal information in the update method, if available (Figure11). We define a decision to be safe if a test set element is closer to the representative example than the half of its acceptance threshold.(22)dt,c≤msrtms=0.5.The choice of the value ms=0.5 was based on the quick decision (presented in Section 5.2) threshold.Figure 11
Acceptance region, safe region, and candidate region of a representative instance in the feature set.An element is chosen as a candidate for insertion if it is at the edge of the acceptance region.(23)dt,c≥mcrt.A candidate is only inserted into the representative set if neighboring frames contain patches that were classified in the same class with a safe decision. The radius of neighboring frames is chosen based on the processing frame rate and the median translation of the image. In the shape set we used, the total processing time is between 0.1 and 0.3 seconds, while the images were taken by a cell phone camera moving slightly upon a table; thus the frame radius was set to involve only directly neighboring frames.We tested the extension withmc=0.5 to mc=0.95. We added new elements from three different test sets (test sets A, B, and C) and measured the improvement on an independent test set (test set D). Results are summarized in Table 2. Details of the test sets are described in Section 8.Table 2
Results of online learning algorithm depending on the candidate ratiomc.
m s # of added instances # of new recognized instances 0.5 91 35 0.75 24 15 0.9 8 15 0.95 4 6


## 8. Experimental Results

The description and the classification method presented in this paper have been tested in the framework of the Bionic Eyeglass. The Bionic Eyeglass [32, 33] is a portable device to help blind and visually impaired people in everyday navigation, orientation, and recognition tasks that require visual input. The development of the device is ongoing at present; the finalized algorithms are now implemented on different platforms (Android, iOS, and FPGA). The Bionic Eyeglass integrates several functions requested by visually impaired people, namely, banknote recognition [34], crosswalk detection, and public transport number reader.The five shape datasets contain several thousands of shape images, including irrelevant inputs that do not belong to any class. The GSPPED was extracted in average of 29.5 milliseconds on a standard computer (Core2 Quad CPU @ 2.66 GHz, 4 GB memory). The test results and the exact size and source of the test sets are indicated in Table3.Table 3
Experimental results of the proposed GSPPED shape descriptor and the two-level classification algorithm including the AL-NN classification. Test sets A-D contain shape images from live tests performed with participation of visually impaired subjects; test set E was generated in laboratory.
Test set F β Precision Recall Images Test set A 99,63% 99,78% 62,41% 7008 Test set B 99,88% 100% 66,97% 6482 Test set C 99,69% 99,89% 55,34% 6171 Test set D 99,54% 99,71% 58,89% 13895 Test set E 99,93% 99,95% 92,94% 13113The representative set was produced from a training set containing 1073 shapes; the initial representative set contained 792 shapes. Shapes in the test sets represent characteristic graphical patches (portraits and drawings) extracted from banknotes and also shadows, joined patterns, and other patches from the background. We used 9 relevant classes containing highly varying shapes due to morphologic extraction. The average lookup time was 1.8 ms. Examples of input images are shown in Figure12.Figure 12
Fragment of the test sets. Row (a) shows shapes from irrelevant classes and rows (b–d) show relevant shapes of banknotes; the source banknotes are shown next to the shape images.We compared our results achieved on test sets A–D (excluding test set E) with other shape descriptions (Complex Zernike Moments and Generic Fourier Descriptor) and classification methods. To allow for different weights for prioritization of precision over recall, AutoMLP, FF-NN, and SVM models were trained using a cost matrix with false-positive to false-negative penalty rates ranging from 5 to 100; in case of the AL-NN, we changed the vigilance parameterν from 1.0 to 1.25, with an appropriate adjustment of the filter limit vector z=ν2z∗.First we compared the AL-NN classifier to a feed-forward neural network (FF-NN), an AutoMLP, a k-NN model, and a SVM on the shape feature vectors obtained from the GSPPED.The best results were reached by the neural networks, FF-NN, and AutoMLP. We tested the FF-NN containing 2 to 5 hidden layers and trained from 100 to 1000 epochs. AutoMLP was trained for 20 cycles of 10 generations and 5 MLPs per ensemble. The best performances achieved by the models are shown in Figure13. Since the SVM (with radial basis function and polynomial kernels) and the k-NN (for k from 1 to 10) models could not achieve precision rate above 90% with any parametrization, they are not included in Figure 13.Figure 13
Precision and recall of the shape classification by FF-NN, AutoMLP, and the presented Adaptive Limited Nearest Neighborhood (AL-NN) classification. The source data is constructed by the GSPPED shape descriptor.In order to investigate the efficiency of the GSPPED shape descriptor, we compared it with the Generic Fourier Descriptor (GFD) [35] and with the Complex Zernike Moments Descriptor (CZMD) [36, 37], trained on the same train set, using the AutoMLP classifier. The feature vector of the GFD contained 85 elements with angular frequency of 16 and radial frequency of 4. The CZMD contained 121 feature elements with the highest order of 20. Results are shown in Figure 14.Figure 14
Precision and recall of the shape classification, comparing the performance of the Complex Zernike Moments Descriptor, the Generic Fourier Descriptor, and the GSPPED descriptor.The GSPPED and the Complex Zernike Moments Descriptor evidently outperform the Generic Fourier Descriptor. When classified by the AutoMLP, the GSPPED slightly outperforms the CZMD; however, with high penalty coefficient, the CZMD provides better recall.We also compared the descriptors based on McNemar’s test. CZMD and GSPPED with AL-NN differ significantly (p=1.27e-4), and GSPPED with AL-NN also exceeds the performance compared to GFD significantly (p<1e-15).


### 8.1. Effect of Noise

To measure the sensitivity of the developed shape description and classifier, we repeated the test on noisy images and compared the results with the results obtained with the Complex Zernike Moments Descriptor and the Generic Fourier Descriptor. Based on our datasets, we observed that deviations in the extracted shape images do not occur in pixel-level additions or removals but in joining with other blobs or in removal of some parts of the shape (also see Figure15). To model this kind of noise, we added and removed several randomly generated blobs to and from the original shape. The total area of the blobs is given as a ratio (w) to the shape area.Figure 15
Example of blob-level shape noise with manipulation ratiow=0.2. In (a), the original shape is shown, in (b), the additions are shown, in (c), removals are highlighted, and the final noisy shape is shown in (d).
(a) (b) (c) (d)In the case of the CZMD and GFD, results show consistent decrease both in recall and in precision. GSPPED provides lower recall on high noise ratio than the other two descriptors; however, the precision is significantly higher compared to the CZMD and the GFD (Figure16). These results might highlight the nature of GSPPED and AL-NN: the generalization capability of the AL-NN classification method using GSPPED is somewhat limited, but it is still comparable to other methods; at the same time, this combination provides outstanding discriminative power.Figure 16
Classification recall and precision of the GSPPED, the Complex Zernike Moments Descriptor, and the Generic Fourier Descriptor, depending on the noise ratiow that represents the ratio of the number of manipulated pixels to the total area of the shape. The CZMD and GFD features were classified by the AutoMLP algorithm, while GSPPED features were classified with the AL-NN method.


## 8.1. Effect of Noise

To measure the sensitivity of the developed shape description and classifier, we repeated the test on noisy images and compared the results with the results obtained with the Complex Zernike Moments Descriptor and the Generic Fourier Descriptor. Based on our datasets, we observed that deviations in the extracted shape images do not occur in pixel-level additions or removals but in joining with other blobs or in removal of some parts of the shape (also see Figure15). To model this kind of noise, we added and removed several randomly generated blobs to and from the original shape. The total area of the blobs is given as a ratio (w) to the shape area.Figure 15
Example of blob-level shape noise with manipulation ratiow=0.2. In (a), the original shape is shown, in (b), the additions are shown, in (c), removals are highlighted, and the final noisy shape is shown in (d).
(a) (b) (c) (d)In the case of the CZMD and GFD, results show consistent decrease both in recall and in precision. GSPPED provides lower recall on high noise ratio than the other two descriptors; however, the precision is significantly higher compared to the CZMD and the GFD (Figure16). These results might highlight the nature of GSPPED and AL-NN: the generalization capability of the AL-NN classification method using GSPPED is somewhat limited, but it is still comparable to other methods; at the same time, this combination provides outstanding discriminative power.Figure 16
Classification recall and precision of the GSPPED, the Complex Zernike Moments Descriptor, and the Generic Fourier Descriptor, depending on the noise ratiow that represents the ratio of the number of manipulated pixels to the total area of the shape. The CZMD and GFD features were classified by the AutoMLP algorithm, while GSPPED features were classified with the AL-NN method.


## 9. Conclusion

We presented a new shape description and classification method. Key characteristics of our approach are the compound descriptor and classifier that join the region and contour-based features. We suggested an online learning method to extend the representative set and increase performance. We proposed a representative set optimizing algorithm as well.The core idea behind our method is the two-level description and classification: for an input shape, low-level, global statistical information is extracted to roughly select the set of similar objects and to reject obviously different templates. In the second stage, local edge information is investigated to find the closest known shape but with the ability to reject the match. The refusal is based on the acceptance radius that is specified individually for every item in the representative set according to the properties of the local proximity in the feature set.Results demonstrate a high precision rate (99.83%) and an acceptable recall rate (60.53%), which fulfil the requirements for a safety-oriented visual application processing an image flow. The reason to have lower cover is that input frames contain highly deformed shapes, which, for sake of reliability, are classified as nonrelevant inputs. The recall is acceptable, as long as a continuous input is available. Compared to other classifiers, none of the tested ones could outperform the AL-NN in precision, and the same recall could only be reproduced with significantly lower precision. If a final decision is made based on multiple input frames and multiple clues, the false-positive error can be minimized to be practically negligible.The computation time of the descriptor (~30 ms) and the classification time (~2 ms) allow real-time recognition even on standard CPUs in computers and phones, and the architecture core of the algorithm is easily adaptable to locally connected cellular array processors.The proposed algorithms were implemented on cell phones and FPGAs with the purpose of providing a reliable vision aid for blind and visually impaired people. One of the drawbacks of the GSPPED we have found is the high sensitivity to positioning and scaling, depending on minor variations. We will focus on designing and employing a more robust translation and scale normalization method. We also plan to investigate the possibility of taking more training elements into account when defining the acceptance threshold, similar to thek-NN method.



---

*Source: 4763050-2018-04-19.xml*