Computational and Mathematical Methods in Medicine

Computational and Mathematical Methods in Medicine / 2014 / Article
Special Issue

Computational Intelligence Techniques in Medicine

View this Special Issue

Research Article | Open Access

Volume 2014 |Article ID 304685 | 19 pages | https://doi.org/10.1155/2014/304685

Image Tracking for the High Similarity Drug Tablets Based on Light Intensity Reflective Energy and Artificial Neural Network

Academic Editor: Rafael M. Luque-Baena
Received24 Apr 2014
Revised06 Jun 2014
Accepted22 Jun 2014
Published17 Jul 2014

Abstract

It is obvious that tablet image tracking exerts a notable influence on the efficiency and reliability of high-speed drug mass production, and, simultaneously, it also emerges as a big difficult problem and targeted focus during production monitoring in recent years, due to the high similarity shape and random position distribution of those objectives to be searched for. For the purpose of tracking tablets accurately in random distribution, through using surface fitting approach and transitional vector determination, the calibrated surface of light intensity reflective energy can be established, describing the shape topology and topography details of objective tablet. On this basis, the mathematical properties of these established surfaces have been proposed, and thereafter artificial neural network (ANN) has been employed for classifying those moving targeted tablets by recognizing their different surface properties; therefore, the instantaneous coordinate positions of those drug tablets on one image frame can then be determined. By repeating identical pattern recognition on the next image frame, the real-time movements of objective tablet templates were successfully tracked in sequence. This paper provides reliable references and new research ideas for the real-time objective tracking in the case of drug production practices.

1. Introduction

Nowadays, the automation level of drug mass production and quality inspection still remains undeveloped; most drug tablets in random position distribution were manually inspected for picking out those unqualified ones and then hand-encapsulated after amount counting or bottle packaging by ocular estimation. All drug tablets were highly similar or identical to each other in shape, size, surface topography, and color, which imposes colossal operation overload and time exhaustion on the working operators. In the interests of dealing with these difficulties, tablet tracking by computer video was greatly hampered by their identical size and similar shape, keeping a far distance from the traditional applications of image recognition, such as face recognition or vehicle video monitoring. Nevertheless, light intensity reflective energy and ANN recognition have remarkable superiority in locating those scattered tablet objectives, which undoubtedly confirms its reliable results and high efficient performance. Based on this theoretical hypothesis, the labor intensities will be greatly reduced, and simultaneously the high precision of tracking processes can also be ensured.

According to the recently published literatures, it can be learned that image tracking or video tracking were generally employed in such conditions as moving vehicle monitoring or people tracking. Wang and Wang [1] have proposed an approach based on computer version and image processing technique for automatic grain tracking; through an efficient box-tracking-based method, presented by Fukuda et al. [2], mammalian cells (fibroblast) on microcarrier have been clearly recognized. At the same time, Dill et al. [3] studied the tracking cells supported by digital image processing and obtained a rather satisfactory result for multiobjective positioning during their high-speed movement. Kuba et al. [4] also made their contributions on automatic particle detection by one-class SVM from microscope image. Similar performances have been obtained by González et al. and so forth [5] on tracking olive trees in high-resolution satellite images.

On the other hand, Guarino et al. [6] have optimized the traditional image analysis approach. But their optimization process needs a much more computation storage and time interval than that of other traditional ones, which restricts its direct usages in real-time drug mass production; Marçal [7] presented new methods based on mathematical morphology and were suitable for grains of circular shape; Kim et al. [8] have successfully proposed a real-time approach for tracking the number of passing people by using one single camera. Similar research founding proposed by Professor Luque-Baena et al. can also be learned from [9, 10] as well. In the area of moving-objective image detection and its automatic classification, Wong et al. [11] used an example of outdoor people tracking for tourist-flow estimation in a constrained environment. According to the research result of Buczkowski et al. [12], the box-tracking method (BCM) shows a very high percentage of error in experimental practice, due to the identical shape and high-speed movement of those drug tablets to be studied. In order to cover this deficiency, Wang et al. [13] have proposed a new and efficient framework for pedestrian analysis and tracking, which consists of rule induction classifier and linear regression model. Agustin and Oh [14] preprocessed the detected foreground objects to eliminate pixel noise and small artifacts by performing opening morphology operation. Besides, Lien et al. [15] also paid high attention on a novel vehicle detection method without background modeling simultaneously. Zhan and Luo [16] made their contribution on system design of real-time vehicle recognition based on video for Windows (AVI) files; the development of a block-based real-time tracking system has been concluded by Park et al. [17] and Głowacz et al. [18] and Park et al. [19] have paid their attentions to the optical flow calculation and the area-based decision rule, respectively, which helps in acquiring reliable image tracking results. When discussing the cross-correlation in pattern recognition, Hong [20] used correlation coefficient of fuzzy numbers under arithmetic operations. Park et al. [21] have studied the correlation coefficient of interval-valued intuitionistic probability sets to multiple attribute group decisions. Ye [22] and Son [23], respectively, proposed probability decision-making method and fuzzy entropy determination for investigating the mutual-relationships among different factors. Other related research results can be learned from [2426]. Furthermore, literature [2729] also presented their latest progresses in cross-correlation mechanisms while such evaluation approaches as intuitionistic probability, interval-valued probability sets, and gamma rank correlation coefficient were, respectively, described in [3032].

Since these commonly used approaches were found being influenced by traditional limitations, the real-time tablet tracking cannot be ensured easily; more importantly, due to the fact that most existing image tracking technologies focus on human tracking or vehicle monitoring, which can be distinguished easily by the different shapes and the widely divergent sizes of those targeted objects in practice [3335], the high similarity objective tracking method suitable for high-speed drug mass production still remains unstudied and undeveloped, that becomes a research margin of advanced video inspection in these years.

This paper is structured as follows. Section 1 outlines the importance and necessity of objective tablet tracking. Section 2 describes the theoretical foundation of light intensity reflective energy surface. Section 3 presents mathematical properties for describing the reflective energy surfaces of drug tablets, Section 4 discusses the detailed tracking processes, with tracking discussions and performance comparisons mentioned in Section 5, and finally Section 6 concludes this paper as respected.

2. The Theoretical Foundation of Light Intensity Reflective Energy Surface

During the imaging process, the light was projected vertically thereafter a clear image can be obtained for showing the surface topography and geometrical shape of objective tablet. But, at the same time, the unsmooth surface topography on those drug tablets can also be identified due to their different light reflective effects. Figure 1 shows the light reflective effect according to different topography areas, which composes an original property demonstration for calibrating the inflective-energy of objective tablet in this experiment. Since different topographic areas on objective tablet present different reflective effects of light, an average-distributed reflective energy condition of light intensity can be obtained on the smooth part of tablet surface. When the lighting ray casts on the objective surface to be observed, it will be reflected to CCD unit in the form of roughly parallel light routes; thus, an image with uniform distribution of light intensity will be gotten and a low concentration of lightness energy can also be shown. On the contrary, the light illumination on the rugged areas of tablet surface brings about the diffuse reflection of lighting rays, which results in the ununiformed concentration of lightness energy. Based on this theoretical presumption, the topography properties of objective drug tablet can be clearly classified with the reflective light intensity measurement, the computation of illumination energy, and the characteristic modeling of energy distribution.

3. Surface Mathematical Properties

Since the reflective energy of light intensity demonstrated by one given image pixel can be regarded as the height value in the axis, thereafter the reflective energy distribution of the whole tablet image can be described in the form of free-form surface, from the perspective of spatial surface fitting domain. Based on this theoretical foundation the following physical properties have been proposed, for the sake of calibrating the established reflective energy surface of objective tablet in a quantitative way [36, 37].

Property 1. As it was well known that surface elasticity demonstrates the transformation resisting capability of one objective spatial surface shape under the force impact caused by external force loading, it becomes a typical index to calibrate the shape properties of spatial surfaces in a mathematical coordinate system, and simultaneously surface elasticity shows the concentricity level of characteristic distribution in the form of elasticity value as well. In this experiment, Property 1 demonstrates the elasticity distribution concentrating on one certain topography section, which makes it being conveniently used to describe topography properties from the perspective of elasticity variance distribution:

Here, denotes an objective topography surface in the form of B-spline basis function; , , , , and are the partial derivatives of in the first order, second order, and hybrid state of axes, respectively; , , , and are the given coefficients, denotes a given function of surface vector, and finally , denote the order amounts of surface vector in axes.

Property 2. Energy of surface plays a prominent role as fairness function in the occasions of geometric modeling or surface microproperty analysis. Therefore, energy distribution can be computed and quantified to denote its belonged experimental conditions and geometric properties. This property defines the scattering level of surface energy in a mathematical sense, for a high value shows a more decentralized scattering of surface energy:

Here, , , , , and denote the first order, second order, and hybrid derivatives of objective surface in axes.

Property 3. Since surface construction highly depends on external loading effect, the fitted result will be deformed in an obvious scale. In the purpose of quantifying the influential effects caused by external loading, this property was newly proposed to calibrate the difference deviation and variation principle between the forced and original surfaces, as high amendment quantity demonstrates a relative critical deformation of resultant topography, with the definition shown as follows:

Here, , , and denote the B-spline boundary control surfaces in axes, respectively, with denoting the transitional vector between two adjacent control vertexes impacted by external loading.

Property 4. The computation of the radial polynomial of one coordinate point on free surface consists of three steps: computations of radial polynomials, radial basis functions, and radial polynomial moments, through projecting the coordinates of one control point on its belonged basis functions. denotes the radial polynomial of one control point :

Here, denotes a positive integer or zero and denotes an integer number and even number, with ; denotes the vector length spaced from the origin point to one control point on surface , defined as , .

Property 5. As the traditional Zernike moments have been extensively used, they receive much research attention in a number of fields: object recognition, terrain reconstruction, roughness segmentation, edge detection, and biomedical measurement. They have already become one of the most widely used families of orthogonal mathematical moments, owing to their extraordinary properties of being invariant or insensitive to any arbitrary rotation of the objective surface in the three-dimensional (3D) coordinate system. Based on the radial polynomial computation of one coordinate point mentioned before, an improved Zernike moment was presented by focusing on their magnitude values as follows:

Property 6. () was supposed to be the objective surface labeled by control vertexes in direction, with the node vectors being , , ,, , , , , , and control vertexes in direction, with the node vectors being , , , , , , , , , . Two signless integral numbers , were employed for , , and represents the congregation of parametric points in : (). Then, the fairing error of objective surface was defined as

Here, denotes the approximated surface of with control vertexes, which can be obtained from the frequency decomposition of in its 3D coordinate lattice.

4. Experiment for Drug Tablet Tracking

4.1. The Arrangement of Experimental Device

Stainless steel material was employed to manufacture the experimental platform, with the purpose of avoiding the high light reflective index and mirror effect of background material, causing these two physical phenomena to reduce the contrast ratio and blur the objective clearance in video image remarkably [38, 39]. On the stainless steel pathways, the drug tablets were scattered into the monitoring field for high-speed video detection. Figure 2 illustrates the video inspection platform employed, including the video device for tablet tracing and the platform pathways for tablet transmission. For the convenience of tracing these tablet objectives with high accuracy and efficiency, we subdivided the whole imaging field into several blocks by the size of 100 mm × 100 mm and then used the DMIRM CCD high-speed imaging system manufactured by German LEICA to capture the moving processes of drug tablets at the rate of 24 frames per second (FPS). It is noteworthy that this video imaging system consists of three essential components: a precise high-speed CCD head equipped with light intensity sensor array, a PC equipped with video processing board, and a set of multidimensional triangulation processing software for ensuring high clearances of video image frames. Since the light source being used is a visible coaxial LED (220 V; 20 W; 700 nm) combined with diffraction grating that generates a fixed number of stripes, which enables the system to capture more than 450,000 pixels in one single image frame. The range measurements were computed by using triangulation operation between the binary digital images and the calibrated imaging plane locations. The high-speed CCD microscopic camera was able to capture image pixel data in 0.01 ms (enabling image acquisition from a continuously moving manipulator) and process data array in 10 ms and has a measurement deviation of 1/20000 in the field of view. This CCD imaging head has been attached to a DMIRM 3-axis directly driven configuration manipulator for self-adaptively video imaging; thus, it eliminates image distortion caused by inhomogeneous light and keeps a rapid reaction and stable tracing performance simultaneously. For the purpose of improving the detection precision or dynamic tracing of drug tablets to the precise scale (1~5 mm), we predetermined the imaging depth as 0.3 m; therefore, the planar platform can be focused. On the other hand, the position overlap of drug tablets can be effectively avoided due to the continual high-frequency vibration of the experimental platform pathways, which reduces the probability of erroneous judgment to the maximum extent. In this experiment, the exposure time for digital imaging was supposed to be 0.5 s whereas the moving speed of drug tablet is about 3.5 m/s; therefore, one given tablet moves 1.75 m during the whole imaging process. In order to reduce the blur effect on the captured images, image sharpening was used to keep the high resolution of those studied objective tablets and thus accurate pattern recognition can be ensured.

4.2. The Computation of Transitional Vectors between Surface Control Points

In order to establish surface model for describing the light intensity reflective energy of drug tablets, the obtained energy value at the specific coordinate position of one pixel can be demonstrated as the -axis value in the vertical direction; therefore, it was considered as the spatial coordinate of one control point. Under usual illumination, the external surface of drug tablet presents a constant situation of light intensity and uniform distribution of grey level. Based on this precondition, the three-dimensional (3D) transitional vectors can be computed.

During the capturing of digital images, the observer sight line keeps orthogonal intersecting with the imaging plane called . The light intensity of one surface point can be denoted by , its project vector was determined as , and then the normal vector of its reflective energy surface can be described as . In this paper, denotes the included angle that lies between the project vector of lighting and the normal vector of reflective energy surface. The reflective intensity of lighting energy in the direction of normal vector can be computed as [40, 41]

Here, denotes the reflective energy intensity of the image pixel , whereas denotes the incident illumination intensity and is supposed as a constant number; denotes the light reflectivity level of objective tablet surface (constant number).

Then, the cosine value of this included angle can be expressed as [42]

The energy intensity of one image pixel (or called as the reflective light intensity at the objective pixel) can be identified as

Figure 3 shows the transitional vectors between surface control points and their spatial distribution. Through presenting a specific image pixel at , this research obtained the normal vector of energy surface: , together with other normal ones at its neighboring: , , and . On this basis, the tangent vectors , , and at the positions of , , and can be determined, respectively:

The secondary partial derivative vectors were identified as and , which demonstrates the variance ratio of those tangent vectors in and directions, respectively. Therefore, the finite difference method can be used to determine these two items:

Based on the above-mentioned process, the normal vector of one specific surface point can be determined the same as its partial derivative vectors at the 1st and 2nd order, respectively. Consider

4.3. The Establishment of Light Intensity Reflective Energy Surface

Figure 4 shows some typical image frames for objective tracking, the amount of drug tablets being seen in the monitoring area was strictly limited under 20 by predetermined setting, in the interest of keeping clear shape description and instantaneous tracking of those objective tablets. Through characteristic statistical analysis of drug tablets in geometric shapes, 12 tablet templates in typical geometric shapes and different laying angles were selected out for the following pattern recognition, with all possible shape morphologies and variant position arrangements during monitoring process being fully included, as Figure 5 demonstrates. Compared with other mathematical criterions, using tablet template facilitates the following determination of their geometrical characteristics in a clearer way. Since energy optimization fitting becomes a frequently used modeling method supported by mathematical programming and structure optimization, it regards the studied reflective energy surface providing the minimum physical distorting energy as its ultimate objective; therefore, various means of energy restriction and employed loadings were applied to achieve this goal in practice [4345].

Energy optimization method regarding the laminose elastic deformation equation of elastic mechanics as its mathematical references:

Here, denotes the objective surface represented in axes; , , , and denote the first-order and second-order derivative vectors of in and axes, respectively. denotes a mixing derivative vector, and were given parameters, and denotes a given vector function to be approximated.

In practical modeling, and often denote the referential parameters of material characteristic; denotes the external employed loading used for energy surface control. Under normal condition, the influence results exerted by , , and will be generally neglected and thereafter valuated as 1, 1, and 0, respectively. Consider

By using the basis function of B-spline surface, the above-mentioned function was transferred into

Here, denotes a control point of surface ; , denote the number of control points in two axes; and denote the power of studied surface; are the B-spline basis function defined by , , together with the knot vector denoted by , (, ) as well. All variables in these equations were defined in or directions.

Equation (16) defines the first-order and second-order derivative vectors and :

Substituting (16) into (14) and letting , then

Then,

Thus, (17) will be simplified into

Here, denotes the integrating operation of one-known basis function; thus, the mathematical model of energy optimization surface can be transferred into the quadratic function of control vertexes [46]. Based on this surface fitting method and the tablet templates shown in Figure 5, their corresponding reflective energy surfaces of light intensity can then be established with the resultant details being demonstrated in Figure 6.

4.4. The Application of ANN for Recognizing Surface Properties

In this study, back propagation (BP) learning algorithm, which has a unique learning principle, generally called delta rule, is used. As we all know, the back propagation learning algorithm is a common method for training artificial neural networks. Firstly, forward propagation of input vectors was realized to generate the propagation output activations, and then ANN uses the pattern target to generate the deviation of all output and hidden neurons. Based on this precondition, multiplying the calculation between the output deviation and the input activation was operated for obtaining the gradient vectors of those weigh values, which results into the percentage subtraction of their gradient vectors. Repeat these steps again until the performance of ANN network reaches a satisfied level. The three layers of the network architecture include the input layer, middle layer (hidden layer), and output layer. Layers include several processing units known as neurons. They connected with each other by variable weights to be determined. In this network, the input layer receives information from external source and passes this information to the network for data processing. The middle layer receives data from the input layer and does all information analysis. The output layer receives the processed information from the middle layer and sends the results to an external receptor [47].

A neuron in ANN network produces its input by processing the net input through nonlinear activation (transfer) function. The sigmoidal activation function is the most utilized one, which updates the weight and derivative values of ANN according to the resilient back propagation algorithm; therefore, it is usually trained for updating ANN networks. In this training algorithm, the update value for ANN weight is increased whenever the derivative value of its performance function has the same sign for two successive calculate iterations; on the other hand it is decreased according to the derivative value with respect to that weight changes sign from the previous iteration. If the derivative value is zero, then the update value for ANN weight remains the same. If the objective weight value continues to change in the same direction for several training iterations, then the magnitude of the weight change will be increased accordingly. In this experiment, we supposed that the input layer has NI neurons, with the middle layer and output layer having NJ and NK neurons, respectively, whereas the input elements for the th neuron at the middle layer can then be described as

Here, denotes the weight calibrating from the th neuron on the input layer to the th neuron on the middle layer, with demonstrating the output result of the th neuron on the input layer. Meanwhile, the resultant input of the th neuron on the output layer can also be identified as

Here, denotes the weight calibrating from the th neuron on the middle layer to the th neuron on the output layer, with demonstrating the output result of the th neuron on the middle layer. Through substituting the input neurons of the middle and output layer, as denoted by and , into (20), the output results of these three layers can be illustrated as follows:

Here, and denote the output threshold value used for assessing the computation results of the th neuron on the middle layer and the th neuron on the output layer, respectively. In this experiment, the gradient-based learning rule was used to train this established network, with the minimum mean square error (MSE) between the computation results caused by the network output and tablet template being predetermined as the ultimate train objective. The template amount for training was supposed to be , and the input elements can then be denoted by , with the output elements being denoted by . Here, this experiment used to denote the data vector consisted by training samples. Thus, MSE of the th sample can be obtained as follows:

Here, denotes the reference value of the th sample for the th output neutron, while denotes the practical output in the same condition. Therefore, the weight on the output layer can then be adjusted to

Here, represents the learning rate, denotes the momentum factor, and denotes the deviation value between and , which shows the difference between the reference value and the practical output of the th sample caused by the th output neutron [48]. Therefore, the weights of middle layer can then be adjusted into

When focusing on the ANN Testing process, it should be noted that the idea which we have used for testing neural networks and generally applying test vectors is that we use a multicase test vector to determine the decision strength of this neural network. For the final evaluation, we captured 100 images describing the random movement cases of drug tablets. Such a large testing case amount was used to minimize the uncertainty of the objective classifier’s performance estimation in this experiment. Then, according to the reflective energy surfaces of those drug tablets, we input their corresponding property vectors to the established ANN and check the obtained output vectors in sequence. Based on the testing operations, this neural network reaches the desired performance; thus, a high improvement in the video detection of drug tablets can be observed.

The weight values in ANN network markedly affect the classification of tablet templates, which keep a close correlation with the computation or tracking errors in the proposed experimental conditions; they were also easily impacted by the arrangement of neural neutrons and input/output vectors as well as weight values provide correlation among network layers, which ensures the feasibility of recognizing the geometrical shapes of tablet template and the property distribution of its reflective energy surface with the self-adaptive control of ANN. As Figure 7 shows, the detailed setup of ANN network is used, and it was observed that, for the purpose of realizing the improvements in network recognition and objective classification, the weights between input and middle layers should be kept in a relatively stable state, which provides a useful tool to markedly eliminate the external error-training interference caused by noisy sample vectors or error distribution gradient of input data. Simultaneously, the weights between middle and output layers should be kept in a radically distinction state, which ensures a clearer classification of tablet properties, especially when the self-adaptive learning rule was being employed. Based on these preconditions, ANN network was gradually optimized for improving its recognition performance [49, 50].

5. Tracking Process Discussions and Performance Comparisons

With the trained neural network and the surface properties computed by (1)–(6), they were used as the input vector for recognizing the tablet templates:

Then, the output vector can be predetermined as [] by using forward propagation algorithm; the maximum possible reiteration times were determined as 15000, in order to prevent the case of training threshold does not be met; the node number of the hidden layer was 2, the learning rate coefficient was supposed to be 0.45, the momentum factor was supposed to be 0.065, the train step was supposed to be 0.15, and the interval illustration factor for recognition process was predetermined as 30. The error function was determined by (27), and it can also be employed to describe the ANN performance capability:

This index examines if the prerequirement was satisfied or not: If it was confirmed, then the training processes of ANN can be terminated or it will be iterated for the next time until this prerequirement is satisfied.

When discussing the determination of , through establishing the weights between network layers, then

Here, denotes a distinguishing coefficient located in . denotes the self-adaptive deviation value between the weight values calibrated from the th neuron on the middle layer to the th neuron on the output; denotes the deviation value between and . By using this threshold screening mechanism, the accuracy of pattern recognition can be ensured, and thereafter the overtraining phenomenon in ANN network could also be prevented. The greater this threshold value is, clearer the objective recognition result would be.

Table 1 demonstrates the original and corrected weights of ANN. It is noteworthy that the original weights were tentatively selected with reference to (20)-(21), in the hope of reducing the computation deviation between the desired and practical output vectors to the minimum scale [51, 52]. Table 2 demonstrates the energy surface properties of tablet templates on the 35th image frame. In the interest of clearly describing the detailed process of tablet template recognition and its position justification, a program flow schematic was provided, with the details shown in Figure 8. Table 3 describes the recognition results of surface properties; similar operations were repeatedly operated for times. Output vector composed by four digits is used to denote the specific objective template. For example, represents template 1, represents template 2, represents template 3, represents template , and represents template 12, with the mean values of recognition results based on repeatedly experiments being used. Through data comparison, the obtained results keep a close difference with those predetermined one, which undoubtedly confirms their effectiveness and accuracy. As one typical pattern recognition, Figure 9 shows the coordinate positions of surface areas best matching their corresponding tablet templates on the 35th image frame, with the black boxes showing the probable positions of the targeted tablets to be studied. In this figure, the most possible matching positions have been magnified and displayed in surrounding images for clearer description; the coordinate positions of template centers were highlighted by the focus marks. For better illustration of the tablet tracking result, 10 key tablets have been labeled with numbers, especially those close ones that were highly focused, as Figure 10 shows. We can observe that the practical operation with this algorithm can be smoothly identified, and those tablets in close position can also be distinguished clearly. Besides, as the interval distance between two adjacent dashed lines was predetermined as 30 mm, the instantaneous moving speeds of objective tablets can be calculated.


The original weight value of ANN before training

~ 2.3581.298−3.1145.558−6.025−0.5533.3396.554
~ −5.1590.5871.265−3.558−5.5547.6632.663−2.226
~ 0.668−5.487−6.5879.5583.2143.2711.098−3.554
~ 6.5581.245−6.584−5.1459.5521.1182.3376.524
~ −3.224−4.8591.5484.8873.225−3.8768.098−6.554
~ 2.3352.9823.112−3.4427.0781.9879.0032.338
~ 3.2652.554−6.2549.5513.0252.336−8.476−2.114
~ 1.4876.5844.559−6.0025.5544.098−4.4426.335
~ −6.9548.8853.6548.201−6.0022.2218.098−6.598
~ 6.547−6.5486.5548.887−6.254−2.1893.2280.621
~ 2.337−3.0724.976−0.8877.7652.0373.0475.887

The corrected weight value of ANN after training

~ 3.3344.2282.9982.8822.3323.7282.3913.311
~ −0.8876.447−8.4728.4728.4825.7725.3394.591
~ 2.3376.992−1.9936.4723.4426.1025.2815.993
~ 5.8239.0734.3783.4485.3129.082−0.998−2.921
~ 9.0082.7747.4615.7297.4225.698−9.0033.549
~ 1.894−8.3728.4725.7739.0824.332−5.2115.281
~ −8.7740.9874.2288.7289.2286.9377.381−6.391
~ 5.6628.443−0.8798.227−8.4922.1841.391−5.112
~ 8.4479.6222.3982.1737.472−7.4714.2915.295
~ 0.1828.4461.0947.4224.4424.5525.281−3.591
~ −4.3726.3644.553−0.9217.3116.0828.391−8.422


The input values of the surface properties
Property 1Property 2Property 3 Property 4 Property 5 Property 6

13587.23548.521587.910155.4956.60.2669
21035.69669.522036.512336.5 875.20.3022
32598.32716.553544.510269.5665.20.3654
44782.61215.843055.89854.6365.40.1485
55548.32985.366248.29965.5302.10.3954
63699.14888.365598.77825.5954.60.3022
76685.26441.566694.86359.4865.70.2035
81334.69332.586025.89806.51012.50.3144
94026.54698.224785.911025.41124.50.6022
104026.57725.366698.512004.51325.90.3598
119833.21889.654755.27985.6968.80.4752
125476.32102.546321.59586.61024.50.3301


Objective tabletsThe recognized results (the obtained number vectors were the mean values based on 10 times of repeated experiments)Recognition ratio

Template 1 Practical result vector 95.6%
Predetermined vector

Template 2 Practical result vector 94.6%
Predetermined vector

Template 3 Practical result vector 95.2%
Predetermined vector

Template 4 Practical result vector 92.9%
Predetermined vector

Template 5 Practical result vector 93.3%
Predetermined vector

Template 6 Practical result vector 95.1%
Predetermined vector

Template 7 Practical result vector 98.2%
Predetermined vector

Template 8 Practical result vector 93.9%
Predetermined vector

Template 9 Practical result vector 95.6%
Predetermined vector

Template 10 Practical result vector 93.9%
Predetermined vector

Template 11 Practical result vector 94.4%
Predetermined vector

Template 12 Practical result vector 97.5%
Predetermined vector

In order to prove the accuracy and validity of this newly proposed method, several commonly used tracking methods were investigated with reference to the published literatures, including the maximum likelihood estimation, the Bayesian estimation, the prior probability-density statistics, the nonprior information estimation, the invariant prior probability-density statistics, the Jeffreys statistics, the box-tracing-based method, and the sensor tracing method. Typical evaluation indexes were employed when an identical experimental condition has been considered: such as the computation time (the accurate time consumption in which the whole experiment uses the identical tracing platform; this research measures the computation time by means of the automated time counting instrument), the distributed Hash degree (the decentralized distributed complexity level that provides a lookup assessment index for algorithm evaluation similar to traditional Hash table, with a small value associated with the high-efficiently structure of tracing algorithm, and vice versa. This research calculates them through the performance process of one given algorithm and then makes a definite assessment on its performance capabilities as respected), the tracking error (the tracking ratio between the amount of error-tracking objectives to total ones, by which the tracing accuracy can be quantitatively identified. It can be calibrated by counting the amount of wrong-located tablets and total ones, resp., and then the ratio between them can be used as the tracking error), and the computation storage (the internal memory capacity used for the whole experimental computations; we calibrate them from the real-time performance indicator of the video tracking system that is being involved during the whole process of tablet tracking) [4448]. After determining these evaluation indexes, their average performance capabilities were compared to each other, with the results shown in Table 4 after data equalization and value regularization. Since this experiment is repeatable, we take a detailed notes about the practical performances for 10, 20, 30, 40, and 50 times, and thereafter a statistical evaluation on their mean index values can be made by employing those mentioned algorithms, respectively. It can be seen from Figure 11 that, with the increment of experiment times, most of these tracking algorithms show a growth tendency in the average computation times. But it is noteworthy that a relative-stable performance capability can be ensured by using our newly proposed algorithm, which is kept at about 0.443 s throughout the whole process rather than changing radically. Similar performance evaluations can also be observed in the variation tendency schematics of Figure 12 with the average Hash degree (from 59.8% to 5.66%), the average tracking error (from 2.3% to 2.445%) in Figure 13, and the average computation storage (from 797.5 kb to 804.5 kb) in Figure 14.


MethodAverage computation
time
Average distributed
Hash degree
Average tracking
error
Average computation
storage

New algorithm0.443 s5.66%2.445%797.5 kb
Maximum likelihood estimation0.678 s4.90%2.147%883.1 kb
Bayesian estimation0.558 s5.03%2.798%1566.6 kb
Prior probability-density statistics 0.734 s7.65%3.446%1251.4 kb
Nonprior information estimation1.565 s7.35%3.709%785.2 kb
Jeffreys statistics1.623 s6.44%2.366%975.1 kb
Invariant prior probability-density statistics0.889 s6.72%2.477%1032.5 kb
Box-tracing-based method0.894 s7.91%3.674%1377.3 kb
Senor tracing method0.905 s8.60%2.668%558.5 kb

From Table 4, it can be observed that the maximum likelihood estimation or the sensor tracing method has a relative superiority in the tracking error and distributed Hash degree; they can be widely used to investigate a stable statistical condition, by concerning the dynamic moving characteristics of identical tablets in huge cluster; the Bayesian estimation obtains a good performance result in the computation time; therefore, it will be more suitable to fast assess a simpler mutual relationship mechanism for the approximate shape properties of those drug tablets; the prior probability-density statistics method or the Jeffreys statistics approach have excellent computation performances when the tracking error or distributed Hash degree were highly emphasized, which ensure the accurate demonstrations of data relationship analysis and thereafter make a series of remarkable progresses when compared with other traditional methods; the nonprior information estimation method and the invariant prior probability-density statistics approach have extraordinary capabilities in the distributed Hash degree, which show a more precise algorithm complexity of data distribution in multidimensional statistical domain. Finally a good performance evaluation result can be obtained by using this newly proposed algorithm, especially in the computation time, computation storage, or distributed Hash degree. Performance comparison proves its validation and efficiency when similar shape or identical size of objective tablets should be taken into account, and the working estimation on how well these alternative methods perform on average can be facilitated as well.

6. Conclusions

A new image tracking approach for high similarity drug tablets based on light intensity reflective energy and ANN recognition has been investigated. Considering the practical condition and precision requirement, the reflective energy surfaces were established for modeling the high similarity geometric characteristics and surface topography of those targeted drug tablets, which results into the maximum deletion of external optical signal interferences or calibration error in practice, and simultaneously an accurate description of tablet objectives in the light intensity domain can also be ensured. Thereafter, ANN was used for recognizing those studied objective tablets with the computed surface properties, and then their instantaneous positions on one image frame can be identified clearly. Through repeating these steps on the sequential image frames, a series of tablet tracking results can be obtained. After being compared with other tracking methods in performance indexes and determined results, it can be learned that this newly proposed method solves numerous difficult problems characterized by monitoring precision, complicated calculations or tracking errors, and other signal interferences caused by mathematical calibration or pattern recognition. Therefore, the quantitative analysis of the objective tracking can be simplified, and the searching precision or computation efficiency can also be greatly improved, accordingly. Experimental computation and result analysis confirmed the validation and accuracy of this new method; new research ideas for real-time objective recognition or tablet tracking can be provided as well.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

The author acknowledges the funding of the following science foundations: National Natural Science Foundation of China (51205073), China National Spark Program (2013GA780063), China Postdoctoral Science Foundation Funded Project (2013T60797, 2012M510197), the Water Resource Science and Technology Program of Guangdong Province of China (2012-11), the Project of Department of Education of Guangdong Province (2013KJCX0142), the Science and Technology Project of Guangzhou City (2012J4100053), the Foundation Projects of the State Key Laboratory of Fluid Power Transmission and Control (GZKF-201201), the Traction Power State Key Laboratory (TPL1311), and the National Engineering Research Centre of Near-Net-Shape Forming for Metallic Materials (2012007). They are also appreciated for supporting this work.

References

  1. W. Wang and L. Wang, “An image processing method for grains counting,” Communications in Computer and Information Science, vol. 326, no. 1, pp. 181–185, 2012. View at: Publisher Site | Google Scholar
  2. T. Fukuda, H. Ishigami, S. Shiotani et al., “Recognition and counting method of mammalian cells on micro—carrier using image processing and artificial neural network,” Animal Cell Technology: Basic & Applied Aspects, vol. 4, pp. 185–191, 1992. View at: Google Scholar
  3. D. Dill, A. Scholz, M. Gül, and B. Wolf, “Methods for counting cells supported by digital image processing,” in 14th Nordic-Baltic Conference on Biomedical Engineering and Medical Physics, vol. 20 of IFMBE Proceedings, pp. 493–496, 2008. View at: Publisher Site | Google Scholar
  4. H. Kuba, K. Hotta, and H. Takahashi, “Automatic particle detection and counting by one-class SVM from microscope image,” Lecture Notes in Computer Science, vol. 5507, no. 2, pp. 361–368, 2009. View at: Publisher Site | Google Scholar
  5. J. González, C. Galindo, V. Arevalo, and G. Ambrosio, “Applying image analysis and probabilistic techniques for counting olive trees in high-resolution satellite images,” Lecture Notes in Computer Science, vol. 4678, pp. 920–931, 2007. View at: Google Scholar
  6. V. Guarino, A. Guaccio, P. A. Netti, and L. Ambrosio, “Image processing and fractal box counting: user-assisted method for multi-scale porous scaffold characterization,” Journal of Materials Science: Materials in Medicine, vol. 21, no. 12, pp. 3109–3118, 2010. View at: Publisher Site | Google Scholar
  7. A. R. S. Marçal, “Alternative methods for counting overlapping grains in digital images,” Lecture Notes in Computer Science, vol. 5112, pp. 1051–1060, 2008. View at: Publisher Site | Google Scholar
  8. J.-W. Kim, K.-S. Choi, B.-D. Choi, J.-Y. Lee, and S.-J. Ko, “Real-time system for counting the number of passing people using a single camera,” in Pattern Recognition, vol. 2781 of Lecture Notes in Computer Science, pp. 466–473, Springer, Berlin, Germany, 2003. View at: Publisher Site | Google Scholar
  9. R. M. Luque-Baena, J. M. Ortiz-De-Lazcano-Lobato, E. López-Rubio, E. Domínguez, and E. J. Palomo, “A competitive neural network for multiple object tracking in video sequence analysis,” Neural Processing Letters, vol. 37, no. 1, pp. 47–67, 2013. View at: Publisher Site | Google Scholar
  10. R. M. Luque, J. M. Ortiz-De-Lazcano-Lobato, E. Lopez-Rubio, and E. J. Palomo, “Object tracking in video sequences by unsupervised learning,” Lecture Notes in Computer Science, vol. 5702, pp. 1070–1077, 2009. View at: Publisher Site | Google Scholar
  11. Y. S. Wong, C. W. Tam, S. M. Lee, C. P. Chan, and H. Fu, “Video-base people counting and gender recognition,” Lecture Notes in Computer Science, vol. 7332, no. 2, pp. 228–235, 2012. View at: Publisher Site | Google Scholar
  12. S. Buczkowski, S. Kyriacos, F. Nekka, and L. Cartilier, “The modified box-counting method: analysis of some characteristic parameters,” Pattern Recognition, vol. 31, no. 4, pp. 411–418, 1998. View at: Publisher Site | Google Scholar
  13. Z.-B. Wang, H.-W. Hao, Y. Li, X.-C. Yin, and S. Tian, “Pedestrian analysis and counting system with videos,” in Neural Information Processing, vol. 7667 of Lecture Notes in Computer Science, pp. 91–99, Springer, Berlin, Germany, 2012. View at: Publisher Site | Google Scholar
  14. O. C. Agustin and B.-J. Oh, “People counting using object detection and grid size estimation,” Communications in Computer and Information Science, vol. 265, no. 1, pp. 244–253, 2011. View at: Publisher Site | Google Scholar
  15. C. C. Lien, Y. T. Tsai, M. H. Tsai, and L. G. Jang, “Vehicle counting without background modeling,” Lecture Notes in Computer Science, vol. 6523, pp. 446–456, 2011. View at: Google Scholar
  16. W. Zhan and Z. Luo, “System design of real time vehicle type recognition based on video for windows (AVI) files,” Communications in Computer and Information Science, vol. 135, no. 2, pp. 681–686, 2011. View at: Publisher Site | Google Scholar
  17. H. H. Park, H. G. Lee, S. Noh, and J. Kim, “Development of a block-based real-time people counting system,” Lecture Notes in Computer Science, vol. 4109, pp. 366–374, 2006. View at: Google Scholar
  18. A. Głowacz, Z. Mikrut, and P. Pawlik, “Video detection algorithm using an optical flow calculation method,” Communications in Computer and Information Science, vol. 287, pp. 118–129, 2012. View at: Publisher Site | Google Scholar
  19. H. H. Park, H. G. Lee, S.-I. Noh, and J. Kim, “An area-based decision rule for people-counting systems,” in Multimedia Content Representation, Classification and Security, vol. 4105 of Lecture Notes in Computer Science, pp. 450–457, Springer, Berlin, Germany, 2006. View at: Publisher Site | Google Scholar
  20. D. H. Hong, “Fuzzy measures for a correlation coefficient of fuzzy numbers under TW(the weakest t-norm)-based fuzzy arithmetic operations,” Information Sciences, vol. 176, no. 2, pp. 150–160, 2006. View at: Publisher Site | Google Scholar | MathSciNet
  21. D. G. Park, Y. C. Kwun, and J. H. Park, “Correlation coefficient of interval-valued intuitionistic fuzzy sets and its application to multiple attribute group decision making problems,” Mathematical and Computer Modelling, vol. 50, no. 9-10, pp. 1279–1293, 2009. View at: Publisher Site | Google Scholar | MathSciNet
  22. J. Ye, “Fuzzy decision-making method based on the weighted correlation coefficient under intuitionistic fuzzy environment,” European Journal of Operational Research, vol. 205, no. 1, pp. 202–204, 2010. View at: Publisher Site | Google Scholar | Zentralblatt MATH
  23. C. Son, “Correlation between learning (probability of success) and fuzzy entropy in control of intelligent robot's part macro-assembly tasks with sensor fusion techniques,” Robotics and Computer-Integrated Manufacturing, vol. 23, no. 1, pp. 47–62, 2007. View at: Publisher Site | Google Scholar
  24. R. M. Luque-Baena, D. Elizondo, E. López-Rubio, E. J. Palomo, and T. Watson, “Assessment of geometric features for individual identification and verification in biometric hand systems,” Expert Systems with Applications, vol. 40, no. 9, pp. 3580–3594, 2013. View at: Publisher Site | Google Scholar
  25. Z. Liang, X. Liu, B. Ye, and Y. Wang, “Performance investigation of fitting algorithms in surface micro-topography grinding processes based on multi-dimensional fuzzy relation set,” International Journal of Advanced Manufacturing Technology, vol. 67, no. 9, pp. 2779–2798, 2013. View at: Publisher Site | Google Scholar
  26. Z. Liang, B. Ye, Y. Wang, and R. K. Brauwer, “Three-dimensional fuzzy influence analysis of fitting algorithms on integrated chip topographic modeling,” Journal of Mechanical Science and Technology, vol. 26, no. 10, pp. 3177–3191, 2012. View at: Publisher Site | Google Scholar
  27. C. Guan, C. Juang, and G. Chen, “Face localization using fuzzy classifier with wavelet-localized focus color features and shape features,” Digital Signal Processing, vol. 22, no. 6, pp. 961–970, 2012. View at: Publisher Site | Google Scholar | MathSciNet
  28. N. Chen, Z. Xu, and M. Xia, “Correlation coefficients of hesitant fuzzy sets and their applications to clustering analysis,” Applied Mathematical Modelling, vol. 37, no. 4, pp. 2197–2211, 2013. View at: Publisher Site | Google Scholar | MathSciNet
  29. A. Dutta, A. Kar, and B. N. Chatterji, “A new approach to corner matching from image sequence using fuzzy similarity index,” Pattern Recognition Letters, vol. 32, no. 5, pp. 712–720, 2011. View at: Publisher Site | Google Scholar
  30. C. G. da Costa, B. Bedregal, and A. D. Dória Neto, “Atanassov's intuitionistic fuzzy probability and Markov chains,” Knowledge-Based Systems, vol. 43, pp. 52–62, 2013. View at: Publisher Site | Google Scholar
  31. J. E. B. Maia, G. A. Barreto, and A. L. V. Coelho, “Visual object tracking by an evolutionary self-organizing neural network,” Journal of Intelligent and Fuzzy Systems, vol. 22, no. 2-3, pp. 69–81, 2011. View at: Publisher Site | Google Scholar
  32. M. D. Ruiz and E. Hüllermeier, “A formal and empirical analysis of the fuzzy gamma rank correlation coefficient,” Information Sciences, vol. 206, pp. 1–17, 2012. View at: Publisher Site | Google Scholar | MathSciNet
  33. C. Zhong, G. Yanli, H. Huang, L. Tan, Y. Wu, and W. Wenting, “Three-dimensional reconstruction of coronary arteries and its application in localization of coronary artery segments corresponding to myocardial segments identified by transthoracic echocardiography,” Computational and Mathematical Methods in Medicine, vol. 2013, Article ID 783939, 8 pages, 2013. View at: Publisher Site | Google Scholar
  34. J. Lia, Q. Dub, and C. Suna, “An improved box-tracking method for video fractal dimension estimation,” Pattern Recognition, vol. 42, no. 11, pp. 2460–2469, 2009. View at: Google Scholar
  35. Y. Chen, W. Xu, F. Kuang, and S. Gao, “The research and application of visual saliency and adaptive support vector machine in target tracking field,” Computational and Mathematical Methods in Medicine, vol. 2013, Article ID 925341, 8 pages, 2013. View at: Publisher Site | Google Scholar
  36. Y. Yi, A. Mouloud, and B. Salah, “Automatic segmentation and measurement of vasculature in retinal fundus images using probabilistic formulation,” Computational and Mathematical Methods in Medicine, pp. 260410–260421, 2013. View at: Google Scholar
  37. C. M. B. Nobre, R. A. Braga Jr., A. G. Costa, R. R. Cardoso, W. S. da Silva, and T. Sáfadi, “Biospeckle laser spectral analysis under Inertia Moment, Entropy and Cross-Spectrum methods,” Optics Communications, vol. 282, no. 11, pp. 2236–2242, 2009. View at: Publisher Site | Google Scholar
  38. Z. Liang, X. Liu, B. Ye, and R. K. Brauwer, “Fuzzy performance between surface fitting and energy distribution in turbulence runner,” The Scientific World Journal, vol. 2012, Article ID 408949, 14 pages, 2012. View at: Publisher Site | Google Scholar
  39. J. Hua, L. Meng, Z. Xu, and G. Li, “An adaptive signal-to-noise ratio estimator in mobile communication channels,” Digital Signal Processing, vol. 20, no. 3, pp. 692–698, 2010. View at: Publisher Site | Google Scholar
  40. R. Xiao, J. Yang, M. Goyal, Y. Liu, and Y. Wang, “Automatic vasculature identification in coronary angiograms by adaptive geometrical tracking,” Computational and Mathematical Methods in Medicine, vol. 2013, Article ID 796342, 11 pages, 2013. View at: Publisher Site | Google Scholar
  41. J. A. Revie, D. Stevenson, J. G. Chase et al., “Evaluation of a model-based hemodynamic monitoring method in a porcine study of septic shock,” Computational and Mathematical Methods in Medicine, vol. 2013, Article ID 505417, 17 pages, 2013. View at: Publisher Site | Google Scholar
  42. J. L. C. Mission and H. Kim, “Design charts for elastic pile shortening in the equivalent top-down load-settlement curve from a bidirectional load test,” Computers and Geotechnics, vol. 38, no. 2, pp. 167–177, 2011. View at: Publisher Site | Google Scholar
  43. Z. Liang, X. Liu, and B. Ye, “Four-dimensional fuzzy relation investigation in turbulence kinetic energy distribution, surface cluster modeling,” Arabian Journal for Science and Engineering, vol. 39, no. 3, pp. 2339–2351, 2014. View at: Google Scholar
  44. T. P. Vo and J. Lee, “Interaction curves for vibration and buckling of thin-walled composite box beams under axial loads and end moments,” Applied Mathematical Modelling. Simulation and Computation for Engineering and Environmental Systems, vol. 34, no. 10, pp. 3142–3157, 2010. View at: Publisher Site | Google Scholar | MathSciNet
  45. G. A. Papakostas, Y. S. Boutalis, and D. A. a. Karras, “Pattern classification by using improved wavelet compressed Zernike moments,” Applied Mathematics and Computation, vol. 212, no. 1, pp. 162–176, 2009. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
  46. T.-W. Sung and C.-S. Yang, “A Voronoi-based sensor handover protocol for target tracking in distributed visual sensor networks,” International Journal of Distributed Sensor Networks, vol. 2014, Article ID 586210, 14 pages, 2014. View at: Publisher Site | Google Scholar
  47. J. Pradeep, E. Srinivasan, and S. Himavathi, “An investigation on the performance of hybrid features for feed forward neural network based English handwritten character recognition system,” WSEAS Transactions on Signal Processing, vol. 10, no. 1, pp. 21–29, 2014. View at: Google Scholar
  48. D. B. Sinha, N. M. Ledbetter, and D. L. Barbour, “Spike-timing computation properties of a feed-forward neural network model,” Frontiers in Computational Neuroscience, vol. 8, no. 5, pp. 1–17, 2014. View at: Publisher Site | Google Scholar
  49. P. Fuangkhon, “An incremental learning preprocessor for feed-forward neural network,” Artificial Intelligence Review, vol. 41, no. 2, pp. 183–210, 2014. View at: Publisher Site | Google Scholar
  50. G. Rajabzadeh, S. Salehi, A. Nemati, R. Tavakoli, and M. Solati Hashjin, “Enhancing glass ionomer cement features by using the HA/YSZ nanocomposite: a feed forward neural network modelling,” Journal of the Mechanical Behavior of Biomedical Materials, vol. 29, pp. 317–327, 2014. View at: Publisher Site | Google Scholar
  51. F. N. Sibai, A. Nuaimi, A. Maamari, and R. Kuwair, “Ear recognition with feed-forward artificial neural networks,” Neural Computing and Applications, vol. 23, no. 5, pp. 1265–1273, 2013. View at: Publisher Site | Google Scholar
  52. X. Zhang and Z. Zou, “Black-box modeling of ship manoeuvring motion based on feed-forward neural network with Chebyshev orthogonal basis function,” Journal of Marine Science and Technology, vol. 18, no. 1, pp. 42–49, 2013. View at: Publisher Site | Google Scholar

Copyright © 2014 Zhongwei Liang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

883 Views | 436 Downloads | 3 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19.