Open Access
This article is

- freely available
- re-usable

*Sensors*
**2010**,
*10*(5),
4825-4837;
doi:10.3390/s100504825

Article

GPCA vs. PCA in Recognition and 3-D Localization of Ultrasound Reflectors

Electronics Department, High Polytechnic School, Alcalá University, Alcalá de Henares, Madrid, Spain

*

Author to whom correspondence should be addressed; Tel.: +34-918-856-551; Fax: +34-91-885-6591.

Received: 25 February 2010; in revised form: 20 April 2010 / Accepted: 7 May 2010 / Published: 11 May 2010

## Abstract

**:**

In this paper, a new method of classification and localization of reflectors, using the time-of-flight (TOF) data obtained from ultrasonic transducers, is presented. The method of classification and localization is based on Generalized Principal Component Analysis (GPCA) applied to the TOF values obtained from a sensor that contains four ultrasound emitters and 16 receivers. Since PCA works with vectorized representations of TOF, it does not take into account the spatial locality of receivers. The GPCA works with two-dimensional representations of TOF, taking into account information on the spatial position of the receivers. This report includes a detailed description of the method of classification and localization and the results of achieved tests with three types of reflectors in 3-D environments: planes, edges, and corners. The results in terms of processing time, classification and localization were very satisfactory for the reflectors located in the range of 50–350 cm.

Keywords:

principal component analysis (PCA); generalized principal component analysis (GPCA); reflector classification; times-of-flight (TOFs); ultrasonic sensors## 1. Introduction

The classification and localization of reflectors constitutes a fundamental task in the field of mobile robotics, since this information contributes in a decisive way to other higher level tasks, such as the generation of environment maps and the robot’s localization. With respect to the process of reflector classification, the techniques more broadly used are based on geometric considerations obtained from the TOFs for every reflector type [1,2]. An important inconvenience of the systems based on geometric considerations is their high dependence on the precision with which the measurements of the TOFs are carried out, and consequently, the classification results are strongly influenced by noise.

Principal Component Analysis (PCA) has been used to reduce the dimension of data sets and object recognition in different works related to image processing [3–6]. The classification and localization technique for 3-D reflectors based on PCA using an ultrasonic sensor is explicitly discussed in [7], in which it is applied to 18 TOF values originated from a sensor that contains two emitter/receiver transducers and 12 receivers, (see Figure 1). The pulses emitted by E

_{0}/R_{0}are processed by itself (E_{0}/R_{0}) and by transducers E_{1}/R_{1,}R_{2}, R_{3,}R_{4,}R_{5,}R_{6,}R_{7,}and R_{8}. The pulses emitted by E_{1}/R_{1}are processed by transducers E_{1}/R_{1}, E_{0}/R_{0,}R_{5,}R_{7,}R_{9,}R_{10,}R_{11,}R_{12}, and R_{13}. In [7–11] to reduce the number of transducers, the simultaneous emission of complementary sequences by two or more emitters is proposed.The PCA is applicable only for data in vectorized representation. Therefore, the data obtained from a matrix sensor must have been previously converted to a vector form. A typical way to do this is the so-called “matrix to vector alignment”, which consists of concatenating all the rows in the matrix together to get a single vector. Figure 1 shows two matrix sensors of nine transducers. The TOFs t

_{0}_{_}_{2}, t_{0_6}, t_{0}_{_}_{3}, t_{0}_{_}_{8}, t_{0}_{_}_{0}, t_{0}_{_}_{5}, t_{0}_{_}_{4}, t_{0}_{_}_{7}, t_{0}_{_}_{1}obtained from reception of sequence emitted by E_{0}/R_{0}and the TOFs t_{1}_{_}_{0}, t_{1}_{_}_{5}, t_{1}_{_}_{7}, t_{1}_{_}_{9}, t_{1}_{_}_{10}, t_{1}_{_}_{11}, t_{1}_{_}_{12}, t_{1}_{_}_{13}obtained from reception of sequence emitted by E_{1}/R_{1}are aligned to get a single vector (1). Receiver R_{2}and R_{8}are neighbours in the sensor, while they are far away from each other in the vectorized representation. The same observations hold for positions R_{0}and R_{6}, etc. Due to the vector alignment the spatial information is missed. Also it can be remarked that the original 3 × 3 matrixes are converted to an 18 × 18 scatter matrix in PCA, which leads to higher time and memory space costs:
$$\begin{array}{l}\tau =[\underset{\mathit{From}\mathit{the}\mathit{emitter}{E}_{0}}{\underbrace{\begin{array}{ccccccccc}{t}_{0\_2}& {t}_{0\_6}& {t}_{0\_3}& {t}_{0\_8}& {t}_{0\_0}& {t}_{0\_5}& {t}_{0\_4}& {t}_{0\_7}& {t}_{0\_1}\end{array}}}\\ \hspace{1em}\underset{\mathit{From}\u200a\mathit{the}\hspace{0.17em}\mathit{emitter}\hspace{0.17em}{E}_{1}}{\underbrace{\begin{array}{ccccccccc}{t}_{1\_0}& {t}_{1\_5}& {t}_{1\_10}& {t}_{1\_7}& {t}_{1\_1}& {t}_{1\_12}& {t}_{1\_11}& {t}_{1\_13}& {t}_{1\_9}\end{array}}}{]}^{T}\end{array}$$

In [8], the sensorial structure is formed by four transducers which can simultaneously obtain 16 TOF values at every scanning process. These 16 TOF values are aligned in a vector that is used in the classification algorithm based on PCA.

In [12] the generalized PCA (GPCA) algorithm is used for image compression. The GPCA algorithm deals with the data in its original matrix representation and considers the projection onto a space, which is the tensor product of two vector spaces. In this paper, we use the GPCA for recognition and localization of ultrasound reflectors which aim to overcome the drawbacks in the traditional PCA. We used a matrix of 16 transducers (using four of the centre sensors as emitters/receivers and the other 12 as receivers). Thus, we can obtain up to four 4 × 4 matrices, each of which performs a classification procedure independently. The results of the four classification processes merge to give the final result.

The rest of this paper is organized as follows. Section 2 illustrates the proposed sensor structure. Section 3 describes the GPCA algorithm. Experimental results are presented in Section 4. And, conclusions are offered in Section 5.

## 2. Sensor Structure

The sensor structure used to extract information in a 3-D environment and to subsequently classify and locate ultrasonic reflectors with the obtained data (TOF sets) from echoes is shown in Figure 2.

The physical structure of the ultrasonic sensor consists of 16 transducers, four of them working as emitters and receivers (E

_{1}/R_{6}, E_{4}/R_{7}, E_{3}/R_{10}and E_{2}/R_{11}) and the others only working as receivers. All the transducers are located in a plane (plane xz), with the axial axis in the y-direction. Furthermore, the separation between transducers is determined by the distance a (a = 0.17 m).With the proposed sensor structure it is possible to obtain up to 64 TOFs at every emission/scanning process. To do this, it is necessary to assign a different macrosequence to every transducer to encode their emissions. These macrosequences, obtained from complementary sets of sequences, allow simultaneous emission and reception to be carried out with all the transducers for the same scanned environment [8,11].

## 3. GPCA Algorithm

In this paper, the usage of GPCA is proposed to carry out the reflector classification using the measurements of 16, 32 and 64 TOFs provided by the ultrasonic sensors. This method maintains the spatial distribution of sensor data, which is represented by the TOFs in a matrix format (2):

$${\mathbf{\tau}}_{e}=\left[\begin{array}{cccc}{t}_{1}& {t}_{2}& {t}_{3}& {t}_{4}\\ {t}_{5}& {t}_{6}& {t}_{7}& {t}_{8}\\ {t}_{9}& {t}_{10}& {t}_{11}& {t}_{12}\\ {t}_{13}& {t}_{14}& {t}_{15}& {t}_{16}\end{array}\right]$$

In (2), t

_{1}… t_{16}are the TOFs associated to each receiver and**τ**_{e}∈**IR**^{r}^{×}^{c}is the TOF matrix obtained for each emitter (r and c are the number of rows and columns of the sensor, respectively). Therefore, in our case we can obtain up to four matrices ( ${\mathbf{\tau}}_{e}^{E1}$, ${\mathbf{\tau}}_{e}^{E2}$, ${\mathbf{\tau}}_{e}^{E3}$ and ${\mathit{\tau}}_{e}^{E4}$ for the emitters E1, E2, E3 and E4).In GPCA we compute an optimal (l

_{1}, l_{2})-dimensional space, such that the projections of the data points (subtracted by the mean) onto this axis system have the maximum variance among all possible (l_{1}, l_{2})-dimensional axes systems. Unlike PCA, the projections of the data points onto the (l_{1}, l_{2})-dimensional axis system in GPCA are matrices, instead of vectors.Let consider S = {

**τ**_{0},**τ**_{1},**τ**_{2}, …**τ**_{n−1}} be a training set of n samples of TOF matrix. The mean TOF matrix of the set is defined by:
$$\overline{\mathbf{\tau}}=\frac{1}{n}\sum _{i=0}^{n-1}{\mathbf{\tau}}_{i}$$

Matrices with mean zero are represented as:

$${\mathrm{\Phi}}_{i}={\mathbf{\tau}}_{i}-\overline{\mathbf{\tau}}$$

Then the variance of the projections of
where || ||

**Φ**_{i}onto the (l_{1}, l_{2}) dimensional axis system is defined as:
$$\text{var}(\mathbf{L},\mathbf{R})=\frac{1}{n}{\sum _{i=0}^{n-1}\Vert {\mathbf{L}}^{T}{\mathbf{\Phi}}_{i}\mathbf{R}\Vert}_{F}^{2}$$

_{F}is the Frobenius norm and**L**∈ IR^{r×l1}and R ∈ IR^{c×l2}are two matrices with orthonormal columns, such that the variance var(**L**,**R**) is maximum. The maximum value of (5) cannot be found in closed form and thus an iterative approach is needed:- ♦ For a given
**R**, the optimal matrix**L**consists of the l_{1}eigenvectors of the matrix**M**which correspond to the largest l_{L}_{1}eigenvalues, where:$${\mathbf{M}}_{\mathbf{L}}=\sum _{i=0}^{n-1}{\mathbf{\Phi}}_{i}{\mathbf{RR}}^{T}{\mathbf{\Phi}}_{i}{}^{T}$$ - ♦ In the same way, given
**L**, the matrix**R**consists of the l_{2}eigenvectors of the matrix**M**, corresponding to the largest l_{R}_{2}eigenvalues, where:$${\mathbf{M}}_{\mathbf{R}}=\sum _{i=0}^{n-1}{\mathbf{\Phi}}_{i}{}^{T}{\mathbf{L}\mathbf{L}}^{T}{\mathbf{\Phi}}_{i}$$

In the realized experiments we used l

_{1}= l_{2}= 2 (**L**∈ IR^{4 × 2}and**R**∈ IR^{4 × 2}) and l_{1}= l_{2}= 1 (**L**∈**IR**and^{4×1}**R**∈**IR**).^{4×1}To calculate the

**L**and**R**matrices that maximize Equation 5, it is necessary to initially fix one of them. Fixing**L**, we can calculate**R**by computing the eigenvectors of the matrix**M**, and then, with the calculated_{R}**R**we can then update**L**by computing the eigenvectors of the matrix**M**. It is necessary to repeat the procedure until the result converges. The solution depends on the initial choice of_{L}**L**(**L**_{0}). As it is recommended in [12], we use**L**_{0}= (**I**, 0)^{T}, where**I**is the identity matrix. To measure the convergence of the GPCA procedure we use the root mean square error (ζ), defined as follows:
$$\xi =\sqrt{\frac{1}{n}\sum _{i=0}^{n-1}{\Vert {\mathbf{\Phi}}_{i}-{\mathbf{L}\mathbf{L}}^{T}{\mathbf{\Phi}}_{i}{\mathbf{R}\mathbf{R}}^{T}\Vert}_{F}^{2}}$$

In the realized experiments for ζ = 10

^{−8}the procedure converges within five iterations.Once the transformation matrices

**L**and**R**are determined and given a new TOF matrix**τ**_{i}to be classified, its zero-mean version**Φ**_{i}is transformed into the feature space as:
$${\mathbf{\Omega}}_{i}={\mathbf{L}}^{T}{\mathbf{\Phi}}_{i}\mathbf{R}$$

Then we can reconstruct

**Φ**_{i}as:
$${\widehat{\mathbf{\Phi}}}_{i}\approx \mathbf{L}{\mathbf{\Omega}}_{i}{\mathbf{R}}^{T}$$

The reconstruction error (ε

_{R}) for**Φ̂**_{i}can be computed as:
$${\epsilon}_{R}={\Vert {\mathbf{\Phi}}_{i}-{\widehat{\mathbf{\Phi}}}_{i}\Vert}_{F}={\Vert {\mathbf{\Phi}}_{i}-{\mathbf{L}\mathbf{L}}^{T}{\mathbf{\Phi}}_{i}{\mathbf{R}\mathbf{R}}^{T}\Vert}_{F}$$

#### 3.1. Offline Generation of the Classes

The objective of this work is to classify one of the three reflector types (plane, corner, and edge) and its approximate direction (azimuth angle γ, elevation angle θ) and distance (r) with respect to the frontal space of the sensor. Before beginning the classification process, it is necessary to create different classes, depending on the reflector type and its spatial location. Every class has two transformation matrices

**L**,**R**associated to it. These matrices are referred as**L**^{P}and**R**^{P}for the plane,**L**^{C}and**R**^{C}for the corner, and**L**^{E}and**R**^{E}for the edge.As it is stated in [7,8], we assume that the frontal space of the sensorial structure is formed by Q directions defined by (γ

_{q}, θ_{q}), with q ∈ {1, 2,…, Q}. Along every direction q, there are D discrete distances referred to as r_{d}, with d ∈ {1, 2,..., D}. To generate the transformation matrices associated to every direction class and every reflector type, the reflectors {P,C,E} have been located at every direction q and for all the d distances, obtaining the TOF vectors. In GPCA, to generate the transformation matrices associated with every direction and every reflector type ( ${\mathbf{L}}_{q}^{P}$, ${\mathbf{R}}_{q}^{P}$, ${\mathbf{L}}_{q}^{C}$, ${\mathbf{R}}_{q}^{C}$, ${\mathbf{L}}_{q}^{E}$, ${\mathbf{R}}_{q}^{E}$), the reflectors {P, C, E} have been located at every direction q and for all the D distances.When more than one transducer is emitting, we use a matrix of TOF for each emitter, i.e.:
${\mathbf{\tau}}_{e}^{E1}$,
${\mathbf{\tau}}_{e}^{E2}$,
${\mathbf{\tau}}_{e}^{E3}$ and
${\mathbf{\tau}}_{e}^{E4}$ for the emitters E1, E2, E3 and E4. Therefore, it is necessary to compute the transformation matrices associated to every direction and every reflector type (
${\mathbf{L}}_{q}^{P}$,
${\mathbf{R}}_{q}^{P}$,
${\mathbf{L}}_{q}^{C}$,
${\mathbf{R}}_{q}^{C}$,
${\mathbf{L}}_{q}^{E}$,
${\mathbf{R}}_{q}^{E}$) for each emitter.

#### 3.2. Classification and Position Estimation of the Reflector

The strategy proposed in this paper to carry out the online classification process is to first classify the type and approximate direction in which the reflector is located and then to estimate its distance with respect to the frontal space of the sensor.

To classify the type and approximate direction of the reflector, we calculate the square reconstruction error (ε), using the transformation matrices associated to every direction q and every reflector type:

$$\begin{array}{l}\left({\epsilon}_{q}^{P}\right)={\Vert {\mathbf{\Phi}}_{q}^{P}-{\mathbf{L}}_{q}^{P}{\mathbf{L}}_{q}^{{P}^{T}}{\mathbf{\Phi}}_{q}^{P}{\mathbf{R}}_{q}^{P}{\mathbf{R}}_{q}^{{P}^{T}}\Vert}_{F}^{2}={\Vert {\mathbf{\Phi}}_{q}^{P}\Vert}_{F}^{2}-{\Vert {\mathbf{L}}_{q}^{{P}^{T}}{\mathbf{\Phi}}_{q}^{P}{\mathbf{R}}_{q}^{P}\Vert}_{F}^{2}\\ \left({\epsilon}_{q}^{E}\right)={\Vert {\mathbf{\Phi}}_{q}^{E}-{\mathbf{L}}_{q}^{E}{\mathbf{L}}_{q}^{{E}^{T}}{\mathbf{\Phi}}_{q}^{E}{\mathbf{R}}_{q}^{E}{\mathbf{R}}_{q}^{{E}^{T}}\Vert}_{F}^{2}={\Vert {\mathbf{\Phi}}_{q}^{E}\Vert}_{F}^{2}-{\Vert {\mathbf{L}}_{q}^{{E}^{T}}{\mathbf{\Phi}}_{q}^{E}{\mathbf{R}}_{q}^{E}\Vert}_{F}^{2}\\ \left({\epsilon}_{q}^{C}\right)={\Vert {\mathbf{\Phi}}_{q}^{C}-{\mathbf{L}}_{q}^{C}{\mathbf{L}}_{q}^{{C}^{T}}{\mathbf{\Phi}}_{q}^{C}{\mathbf{R}}_{q}^{C}{\mathbf{R}}_{q}^{{C}^{T}}\Vert}_{F}^{2}={\Vert {\mathbf{\Phi}}_{q}^{C}\Vert}_{F}^{2}-{\Vert {\mathbf{L}}_{q}^{{C}^{T}}{\mathbf{\Phi}}_{q}^{C}{\mathbf{R}}_{q}^{C}\Vert}_{F}^{2}\end{array}$$

The reflector is classified as a plane if
${\epsilon}_{q\hspace{0.17em}\text{min}}^{C}>{\epsilon}_{q\hspace{0.17em}\text{min}}^{P}<{\epsilon}_{q\hspace{0.17em}\text{min}}^{E}$, it is classified as an edge if
${\epsilon}_{q\hspace{0.17em}\text{min}}^{C}>{\epsilon}_{q\hspace{0.17em}\text{min}}^{E}<{\epsilon}_{q\hspace{0.17em}\text{min}}^{P}$ and it is classified as a corner if
${\epsilon}_{q\hspace{0.17em}\text{min}}^{P}>{\epsilon}_{q\hspace{0.17em}\text{min}}^{C}<{\epsilon}_{q\hspace{0.17em}\text{min}}^{E}$. The value of q, which corresponds to the minimum value of ε

_{q}determines the approximate direction of the reflector. When more than one emitter is being used, we determine the minimum value of reconstruction error in each direction for each emitter, and added to all these minimum values. The minimum values are taken with the same angle for all transmitter, otherwise the results will not classify correctly. For four emitters that is:
$$\begin{array}{c}{\epsilon}_{q\text{min}}^{P}={\left({\epsilon}_{q\text{min}}^{P}\right)}^{E1}+{\left({\epsilon}_{q\text{min}}^{P}\right)}^{E2}+{\left({\epsilon}_{q\text{min}}^{P}\right)}^{E3}+{\left({\epsilon}_{q\text{min}}^{P}\right)}^{E4}\\ {\epsilon}_{q\text{min}}^{E}={\left({\epsilon}_{q\text{min}}^{E}\right)}^{E1}+{\left({\epsilon}_{q\text{min}}^{E}\right)}^{E2}+{\left({\epsilon}_{q\text{min}}^{E}\right)}^{E3}+{\left({\epsilon}_{q\text{min}}^{E}\right)}^{E4}\\ {\epsilon}_{q\text{min}}^{C}={\left({\epsilon}_{q\text{min}}^{C}\right)}^{E1}+{\left({\epsilon}_{q\text{min}}^{C}\right)}^{E2}+{\left({\epsilon}_{q\text{min}}^{C}\right)}^{E3}+{\left({\epsilon}_{q\text{min}}^{C}\right)}^{E4}\end{array}$$

Once the type of reflector and the direction in which it is positioned are known, the approximate distance with respect to the sensor structure can be determined. The Frobenius norm in the transformed space between the feature vector

**τ**_{e}for the object to be classified, and every feature vector of the training samples of the class to which this reflector belongs, are calculated. For example, if the object was classified as a plane in the direction q, the TOF vector set used offline to generate the transformation matrix will have been $\left\{{\mathbf{\tau}}_{q1}^{P},{\mathbf{\tau}}_{q2}^{P},{\mathbf{\tau}}_{q3}^{P},\dots ,{\mathbf{\tau}}_{qD}^{P}\right\}$. Therefore, it is only necessary to compute the Frobenius norm in the transformed space among the feature vector corresponding to the TOF vector**τ**_{e}, and the feature vectors corresponding to the training samples, as is shown in:
$${\epsilon}_{d}={\Vert {\mathbf{L}}_{q}^{{P}^{T}}{\mathbf{\Phi}}_{q}^{P}{\mathbf{R}}_{q}^{P}\Vert}_{F}^{2}-{\Vert {\mathbf{L}}_{q}^{{P}^{T}}{\mathbf{\Phi}}_{d}{\mathbf{R}}_{q}^{P}\Vert}_{F}^{2}$$

${\mathbf{\Phi}}_{d}={\mathbf{\tau}}_{\mathit{qd}}^{P}-{\overline{\mathbf{\tau}}}_{q}^{P}$, d = 1, 2,…, D.

The value corresponding to d, that provides the minimum ε

_{d}, will be the approximate reflector distance, in the direction q.It has been proven empirically that the relationship among the distances of the reflectors to the sensor structure, and the Frobenius norm of their feature vectors in the transformed space, is approximately linear. In this way, considering the distance interval, where the reflector is, and the Frobenius norm in the transformed space, a correct estimation can be obtained by means of a linear interpolation of the distance at which the reflector is positioned.

#### 3.3. Processing Time Using PCA and GPCA

To compare the processing time of the GPCA classification method with the PCA method, we analyze the number of multiplication operations required to classify the type of the reflector from the reconstruction error. To do this, we consider a generic sensor as proposed in Figure 2 with r rows and c columns. With TOF’s obtained a r × c matrix and a vector of dimension r.c are built for GPCA and PCA methods respectively. It’s also considered that a number l of eigenvectors are selected and that the sensor has m emitters.

In PCA, the reconstruction error is given by the following expression:
where L is the transformation matrix and

$$\epsilon =\Vert \mathbf{\Phi}-\hspace{0.17em}\widehat{\mathbf{\Phi}}\Vert =\Vert \mathbf{\Phi}-\hspace{0.17em}{\mathbf{LL}}^{T}\mathbf{\Phi}\Vert $$

**Φ**is the measurements column vector with mean zero. The dimensions of the vector**Φ**and matrix**L**are r·c·m (**Φ**∈ ℜ^{(}^{r.c.m}^{)}) and (r·c·m) × l (**L**∈ ℜ^{(}^{r.c.m}^{)×}^{l}) respectively. We can obtain the number of multiplication operations required broking expression (13) down in different terms (14) and (15):
$${\mathbf{L}}^{T}\mathbf{\Phi}=\mathbf{E}$$

$$\mathbf{LE}=\mathbf{F}$$

Therefore, taking the dimensions of vector

**Φ**and matrix**L**into account, to calculate the terms**E**=**L**^{T}**Φ**and**F**=**LE**l.(r.c.m) multiplications are needed. To obtain the Euclidean distance, r.c.m multiplications are needed. So, the total number of multiplications required to classify the type of the reflector using PCA is:
$$\mathrm{n}\xb0\hspace{0.17em}\text{multiplications}\hspace{0.17em}\hspace{0.17em}(\mathit{PCA})=\hspace{0.17em}l\xb7(r\xb7c\xb7m)+l\xb7(r\cdot c\xb7m)+(r\xb7c\xb7m)$$

In GPCA the reconstruction error is given by:
where

$$\epsilon ={\Vert \mathbf{\Phi}\Vert}_{F}^{2}-{\Vert {\mathbf{L}}^{T}\mathbf{\Phi}R\Vert}_{F}^{2}$$

**L**and**R**are transformation matrices and**Φ**is the measurements matrix with mean zero. In this case, the dimensions of matrices**Φ**,**L**and**R**are r × c (**Φ**∈ ℜ^{r×c}), r × l_{1}(L ∈ ℜ^{r}^{×}^{l}^{1}) and c × l_{2}(R ∈ ℜ^{r}^{×}^{l}^{2}respectively. Following the same method that in PCA, we obtain the number of multiplications broking expression (17) down in terms:
$$\mathbf{H}=\mathbf{\Phi}\mathbf{R}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\stackrel{n\xb0\hspace{0.17em}\mathit{multiplications}}{\to}\hspace{0.17em}\hspace{0.17em}(r\xb7c\xb7{l}_{2}).m$$

$$\mathbf{G}={\mathbf{L}}^{\mathrm{T}}\mathbf{H}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\stackrel{n\xb0\hspace{0.17em}\mathit{multiplications}}{\to}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}({l}_{1}\xb7r\xb7{l}_{2}).m$$

$${\Vert \mathbf{G}\Vert}_{F}^{2}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\stackrel{n\xb0\hspace{0.17em}\mathit{multiplications}}{\to}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}({l}_{1}\xb7{l}_{2})\xb7m$$

$${\Vert \mathrm{\Phi}\Vert}_{F}^{2}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\stackrel{n\xb0\hspace{0.17em}\mathit{multiplications}}{\to}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}(r\xb7c)\xb7m$$

Then, the total number of multiplications required to classify the type of the reflector using GPCA is:

$$\mathrm{n}\xb0\hspace{0.17em}\text{multiplications}\hspace{0.17em}\hspace{0.17em}(\mathit{GPCA})=\hspace{0.17em}\left[(r\xb7c\xb7{l}_{2})+({l}_{1}.r.{l}_{2})+({l}_{1}+{l}_{2})+(r\xb7c)\right].m$$

The number of multiplications for both methods particularized for r = 3, c = 3 and using different numbers of emitters (m) and eigenvalues (l, l

_{1}, l_{2}) are shown in Table 1. One can see that the total number of multiplications using GPCA is slightly lower than using PCA. However, its main advantage is that because the classification is performed independently with the TOFS obtained for each emitter and added to the obtained values, it is possible to make a parallelization of the calculations when using a multiprocessor system. That is, for two emitters (m = 2) using a dual processor system, the processing time can be reduced by more than half using GPCA (160 using PCA and 68 using GPCA).## 4. Simulation Results

A simulator has been used in order to carry out the simulations; this allows TOFs to be obtained in three-dimensional environments, based on the sensor model proposed by Barshan and Kuc [13] and using the rays technique [14]. The system employs a frequency of 50 Khz. To this frequency we can suppose a specular model. This simulator is the same as that used in [7] and it is validated with real measurements. The measures used to compare the two methods of classification, PCA and GPCA, have been obtained under the same conditions.

To evaluate and compare the GPCA classification method with the PCA method, we generate TOFs simulating the sensor structure of Figure 2. To obtain the transformation matrices, the reflectors have been located at distances from 50 to 350 cm, with 30-cm intervals. The azimuth and elevation angles were from −12° to +12°, with intervals of 2°.

In the simulations carried out, we analyze the percentage of successful classifications, using different values for the number of emitters (m) and different values of the number of used eigenvectors (l = l

_{1}= l_{2}) corresponding to the largest eigenvalues. In all the cases, the results are obtained adding to the TOFs a zero mean, independent and identically distributed (i.i.d.) Gaussian noise with typical deviation of 15 μs. The distance for plane, edge, and corner-type reflectors placed at distances from 50 to 350 cm, with intervals of 20 cm, and an azimuth angle of 7.5°. For each type of reflector at each distance 500 tests were conducted. We also performed simulations for different azimuth and elevation angles and the results are similar to the ones showed in this section.In Figure 3 the classification percentage for l = 2 and m = 2, using PCA and GPCA methods, is shown. In this figure we can observe that the percentage of successful classifications using the PCA algorithm is greater than using the GPCA for distances greater than 200 cm. This is due to, the GPCA algorithm need a amount of input data greater than PCA for a appropriate classification. In both cases we obtained a 100% success rate for distances below 200 cm.

If we maintain the same number of emitters and use only the eigenvector corresponding to the largest eigenvalue, the percentage of success is greater than 95% up to 300 cm and then decreases very sharply, as shown in Figure 4.

The simulations carry out with other values of noise and a single eigenvector have shown that, using PCA and GPCA the percentages successful classifications of corners and planes fall sharply for distances greater than 330 cm. This is due to the loss of dimensionality in the transformed space.

If one wants to increase the percentage of hits in the classification, we can increase the number of emitters. In Figure 5 the results obtained for m = 4 are shown. In this figure we can see that the percentage of hits is over 98% up to 350 cm. In this case the processing time for PCA is approximately twice that with two transmitters. However, using GPCA we can get a time similar to that obtained for a single emitter, if we use parallel processing.

In applications that do not require classifying objects at distances greater than 290 cm, you can use a single eigenvector to obtain 100% success. In Figure 6 the results obtained for m = 4 and l = 1 are shown. In this figure we can see that the percentage of success is 100% up to 290 cm and then decreases very sharply.

The GPCA approach better organizes the data in the sense of adjacent components in the matrix representation correspond to physically adjacent readings in the sensor array. This allows, with smaller transformation matrixes to achieve similar results to those obtained with PCA and the computational cost is lower.

The results obtained in estimating the distance are similar using PCA and GPCA methods. However, using GPCA has the advantage of a lower computational cost. The computational cost in the estimation of distance can be analyzed in the same way as is analyzed in the classification process.

Although all the results presented come from simulations done with non-correlated noise, tests with correlated noise have been carried out. It has been verified that the proposed algorithm is very robust against that kind of noise. In these tests, the classification is successful even when the correlated noise has higher standard deviations than the non-correlated noise.

## 5. Conclusions

In this paper, a classification algorithm based on the GPCA techniques have been proposed, with which three types of basic 3-D reflectors can be classified: planes, corners, and edges. The excellent behaviour of the GPCA proposed classification algorithm for a wide range of distances between reflectors and sensor systems has been demonstrated by means of simulations, under extreme noise conditions regarding measurements. Experiments show similar performance between GPCA and PCA, in terms of successful classification percentage. However, GPCA uses transformation matrices that are much smaller than PCA. This significantly reduces the space to store the transformation matrices and reduces the computational time in the classification procedure. Also, as the processing of the data is obtained for each emitter it is processed independently and processing time can be significantly reduced using parallel processing.

## Acknowledgments

This work has been supported by the Spanish Ministry of Science and Innovation under projects VISNU (ref. TIN2009-08984) and SDTEAM-UAH (ref. TIN2008-06856-C05-05).

## References

- Kleeman, L.; Kuc, R. Mobile robot sonar for target localization and classification. Int. J. Robot. Res
**1995**, 14, 295–318. [Google Scholar] - Akbarally, H.; Kleeman, L. A sonar sensor for accurate 3-D target localization and classification. Proceedings of IEEE International Conference on Robotics and Automation, Nagoya, Japan, May 21–27, 1995; pp. 3003–3008.
- Swets, D.L.; Weng, J.J. Using discriminant eigen features for image retrieval. IEEE Trans. Pattern Anal. Mach. Intell
**1996**, 18, 831–836. [Google Scholar] - Malhi, A.; Gao, R.X. PCA-based feature selection scheme for machine defect classification. IEEE Trans. Instrum. Meas
**2004**, 53, 1517–1525. [Google Scholar] - Yang, J.; Zhang, D.; Frangi, A.F.; Yang, J. Two-dimensional PCA: A new approach to appearance-based face representation and recognition. IEEE Trans. Pattern Anal. Mach. Intell
**2004**, 26, 131–137. [Google Scholar] - Vázquez, J.F.; Lázaro, J.L.; Mazo, M.; Luna, C.A. Sensor for object detection in railway environment. Sens. Lett
**2008**, 6, 690–698. [Google Scholar] - Jiménez, J.A.; Ureña, J.; Mazo, M.; Hernández, A.; Santiso, E. Using PCA in time-of-flight vectors for reflectors recognition and 3-D localization. IEEE Trans. Robot
**2005**, 21, 909–924. [Google Scholar] - Ochoa, A.; Urena, J.; Hernandez, A.; Mazo, M.; Jimenez, J.A.; Perez, M.C. Ultrasonic multitransducer system for classification and 3-D location of reflectors based on PCA. IEEE Trans. Instrum. Meas
**2009**, 58, 3031–3041. [Google Scholar] - Díaz, V.; Urena, J.; Mazo, M.; Jimenez, J.A.; García, J.J.; Bueno, E.; Hernandez, A. Using complementary sequences for multimode Ultrasonic operation. Proceedings of the 7th IEEE International Conference on Emerging Technologies and Factory Automation, Barcelona, Spain, October 1999; pp. 599–604.
- De Marziani, C.; Ureña, J.; Hernández, A.; Mazo, M.; Álvarez, F.; García, J.J.; Donato, P. Modular architecture for efficient generation and correlation of complementary set of sequences. IEEE Trans. Signal Process
**2007**, 55, 2323–2337. [Google Scholar] - Hernandez, A.; Urena, J.; García, J.J.; Mazo, M.; Dérutin, J.P.; Serot, J. Ultrasonic sensor performance improvement using DSP-FPGA based architectures. Proceedings of the 28th IEEE International Conference on Industrial Electronics Society, Seville, Spain, November 5–8, 2002; pp. 2694–2699.
- Ye, J.; Janardan, R.; Li, Q. GPCA: An efficient dimension reduction scheme for image compression and retrieval. Proceedings of Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, WA, USA, August 2004; pp. 354–363.
- Barshan, B.; Kuc, R. Differentiating sonar reflections from corners and planes by employing an intelligent sensor. IEEE Trans. Pattern Anal. Mach. Intell
**1990**, 12, 560–569. [Google Scholar] - Watt, A.; Watt, M. Advanced Animation and Rendering Techniques; ACM Press: New York, NY, USA, 1992. [Google Scholar]

**Figure 1.**View of sensor structure proposed in [7].

**Figure 3.**Percentage of successful classifications using GPCA and PCA, for l = l

_{1}= l

_{2}= 2 and m = 2.

**Figure 4.**Percentage of successful classifications using GPCA and PCA, for l = l

_{1}= l

_{2}= 1 and m = 2.

**Figure 5.**Percentage of successful classifications using GPCA and PCA, for l = l

_{1}= l

_{2}= 2 and m = 4.

**Figure 6.**Percentage of successful classifications using GPCA and PCA, for l = l

_{1}= l

_{2}= 1 and m = 4.

**Table 1.**Number of multiplications for PCA and GPCA, using different numbers of emitters and eigenvalues.

PCA | GPCA | |
---|---|---|

ε = ‖ Φ − LL^{T} Φ‖ | $\epsilon ={\Vert \mathbf{\Phi}\Vert}_{F}^{2}-{\Vert {\mathbf{L}}^{T}\mathbf{\Phi}R\Vert}_{F}^{2}$ | Reconstruction error. |

Φ ∈ ℜ ^{(}^{r}^{·}^{c}^{·}^{m}^{)} | Φ ∈ ℜ^{r} ^{×} ^{c} | Dimensions of matrices. |

L ∈ ℜ ^{(}^{r}^{·}^{c}^{·}^{m}^{)}^{×l} | L ∈ ℜ^{r} ^{×} ^{l}^{1} | |

R ∈ ℜ^{c} ^{×} ^{l}^{2} | ||

l · (r · c · m) + (r · c · m)·l + (r · c · m) | (r · c · l_{2} + l_{1} · r · l_{2} + l_{1} · l_{2} + r · c) · m | Number of multiplication operations. |

64 + 64 +32 = 160 | 32 +16 + 4 + 16 = 68 × 2 | Number of multiplication operations for l = l_{1} = l_{2} = 2 and m = 2. |

128 + 128 + 64 = 320 | 32 +16 + 4 + 16 = 68 × 4 | Number of multiplication operations for l = l_{1} = l_{2} = 2 and m = 4. |

32 + 32 + 32 = 96 | 16 + 4 + 1 +16 = 37 × 2 | Number of multiplication operations for l = l_{1} = l_{2} = 1 and m = 2. |

64 + 64 + 64 = 182 | 16 + 4 + 1 +16 = 37 × 4 | Number of multiplication operations for l = l_{1} = l_{2} = 1 and m = 4. |

© 2010 by the authors; licensee MDPI, Basel, Switzerland. This article is an Open Access article distributed under the terms and conditions of the Creative Commons Attribution license ( http://creativecommons.org/licenses/by/3.0/).