in the current description we refer to the detection of multiple car - plates from a video sequence and the extraction of the coordinates of each plate . in accordance with an exemplary embodiment of the present invention , location information of car - plates is extracted from an image frame sequence by using a system like the one shown in fig1 . this system uses a camera sensor ( 11 in fig1 ) which captures the video frames ( 12 in fig1 ), stores the most recent frame in a memory ( 13 in fig1 ) and then processes it with a car - plate detection device ( 14 in fig1 ), comprised by a storage section ( 15 in fig1 ) and a processing section ( 16 in fig1 ) in order to extract carplates . the car plate detection device through which the system detects car - plates and extracts the information of the coordinates is shown in fig2 . this exemplary system functions as follows : first two consecutive frames i i and i i + 1 , ( 12 in fig1 ) are input into the image data input unit ( 221 in fig2 ) from the storage memory ( 13 in fig1 ) and are temporarily stored into the input image data memory ( 21 in fig2 ). the data are then fed into the moving object detection unit ( 222 in fig2 ), which detects the parts of video frames corresponding to moving objects at any time and stores the corresponding parts of the video frames into the moving object image data memory ( 22 in fig2 ). data from the moving object image data memory are then fed into the automatic threshold adaptation unit ( 223 in fig2 ), which calculates the optimal local binarization threshold parameter . this unit takes also input from the digit segmentation unit ( 229 in fig2 ) and from the number of digits input unit ( 233 in fig2 ). this unit then feeds the threshold parameter into the image binarization unit ( 224 in fig2 ), to binarize the moving object image data , which it gets from the moving object image data memory ( 22 in fig2 ) and stores in the binary image data memory ( 23 in fig2 ). the image binarization unit ( 224 in fig2 ) can optionally get data from the user through the threshold input unit ( 231 in fig2 ), or through the automatic threshold calculation unit ( 232 in fig2 ). data from binary image data memory are then fed to the morphological filtering unit ( 225 in fig2 ), for filtering of unwanted noise and storing the filtered image data in the filtered binary image data memory ( 24 in fig2 ). data from this memory are input to the connected component analysis ( cca ) unit ( 226 in fig2 ), which analyzes the binary data to find blocks of pixels corresponding to regions ( blobs ) and then stores the results in the region data memory ( 25 in fig2 ). the next step is the classification of the blobs in order to identify the car plates . this procedure takes place into the region classification unit ( 228 in fig2 ) which analyzes the data previously stored in the region data memory ( 25 in fig2 ), using classification criteria defined by the user through the classification criteria trimming unit ( 227 in fig2 ). the output of the region classification unit , which is the plate coordinates are stored in the detected plate coordinates memory ( 26 in fig2 ). the results of this extraction are then fed into the plate output unit ( 234 in fig2 ), which outputs the plates to the system output when the automatic threshold adaptation unit ( 223 in fig2 ) indicates that the right number of digits have been detected . a final step of processing concerns the segmentation of the plate digits that exist in the detected plate . this procedure takes place within the digit extraction unit ( 229 in fig2 ). the results of this extraction are then fed into the digit output unit ( 230 in fig2 ), which outputs the digits to the system output when the automatic threshold adaptation unit ( 223 in fig2 ) indicates that the right number of digits have been detected . moving object detection unit ( 227 in fig2 ). this unit detects the motion of pixels from consecutive video frames . the target is to identify one or more moving cars in a steady background as viewed by the camera . the background corresponds to the view of the camera when no car is present and nothing else moves . however this complete absence of motion rarely occurs under real world conditions and therefore the background is instead modeled according to a background model . the background model is actually an image obtained using some statistical methodology , which incorporates any minor differences that may occur due to slight variations in lighting conditions , electronic noise from some camera sensor , or due to some minor motions inherent in the video scene ( e . g . tree leaves moving due to a blowing wind ). given the background model , any moving pixels can be identified in a video frame by subtracting the background model from this particular frame . therefore referring to fig3 , the moving pixels ( 32 and 34 in fig3 ) corresponding to a moving object within this video sequence are identified by subtracting the background model image ( 33 in fig3 ) from the current frame ( 31 in fig3 ). as the motion in the current frame becomes more intense , more pixels are different from the background model . the calculation of the background model can be achieved using statistical techniques : each pixel in the background model is modeled through the use of the corresponding pixels of some consequent frames as shown in fig4 . more specifically , each pixel pbm k in the background model ( 43 in fig4 ) results in a statistical measure of the central tendency of the pixel population which is constituted by the pixels p k1 . . . n ( 41 in fig4 ) in the consecutive video sequence frames i 1 . . . i n ( 42 in fig4 ) having the same coordinates as pbm k . possible statistical measures of the central tendency include the mean value , the median value and the mode value . however in order to be able to use this central tendency measure , a number of consecutive video frames must be stored in a buffer memory and this constitutes a significant problem in the case that the system is targeted to be implemented as an embedded system . in an embedded system the memory is usually limited and therefore this type of implementation is not feasible . the calculation of the mean value may be an exception to this problem since it is possible to be calculated as the running mean . the running mean value is calculated progressively as follows : pbm k = 0 . 5pbm k + 0 . 5 p k , i = 1 . . . n ( 1a ) in an exemplary embodiment , a weighted average measure is used described by the following relation : pbm k = a pbm k +( 1 − a ) p ki , i = 1 . . . n ( 2a ) the difference between equations ( 1a ) and ( 2a ) is the parameter α , which in the case of running average takes on the value 0 . 5 . values of α smaller than 0 . 5 , make the system to be more robust to background changes . in this case the background model change faster or equivalently the system has limited memory and is able to forget its history . as parameter α gets smaller , the background model changes faster . more specifically , the procedure of detecting a car - plate is the following : as a first step , the background model bm is calculated . in the first iteration , the background model is initialized with a zero value for every pixel ( 52 in fig5 ). then , the background model is calculated ( 53 in fig5 ) using eq . 2a . the background model is then subtracted from the current frame ( 54 in fig5 ). finally the absolute value of the difference is checked for every pixel against a threshold th and the corresponding pixel is categorized as background if d k & lt ; th and as moving object if d k & gt ; th ( 56 and 57 in fig5 ). the parameter th plays the role of motion sensitivity . the larger the parameter th the less sensitive the system will be to small motions . this is a very useful feature since it controls the response of the system in noisy conditions where there are small motions distributed across the entire frame area , corresponding to conditions such as rain , wind etc . as a final step , the system outputs the coordinates of the moving object using the following procedure : first all the coordinates of the pixels characterized as moving are sorted ( 58 in fig5 ). from this procedure the minimum and maximum coordinates in the x - direction ( x_min and x_max ) as well as the minimum and maximum coordinates in the y - direction ( y_min and y_max ) are computed . then , rectangle q 1 q 2 q 3 q 4 is formed ( 62 in fig6 ), representing the moving portion of the video frame ( 61 in fig6 ), with the corner points q 1 having the following coordinates : q1 =( x_min , y_min ) q2 =( x_max , y_min ), q3 =( x_min , y_max ) q4 =( x_max , y_max ). the binarization unit ( 224 in fig2 ) focuses on the binarization of the input image . a binarization procedure is considered the formation of a new image having pixels with only two possible values . in the context of the current invention these values can be either 0 ( black ) or 255 ( white ). the binarization procedure employs the comparison of each pixel in the image with a threshold value th_bin and then forms a new binary image having a one to one correspondence with the initial image described as follows : pixels in the original image with a value greater than th_bin correspond to pixels with value 255 in the binary image and pixels in the original image with a value lower than th_bin correspond to pixels with value 0 in the binary image . however binarization using a global threshold is not an optimal solution . a major problem with global thresholding is that changes in illumination across the scene may cause some parts to be brighter ( in the light ) and some parts darker ( in shadow ) in ways that have nothing to do with the objects in the image . such uneven illumination can be handled by determining thresholds locally . that is , instead of having a single global threshold , we allow the threshold itself to smoothly vary across the image . in the current invention , we use a local thresholding method , which uses local edge properties in a window to compute threshold . automatic threshold adaptation unit ( 223 in fig2 ) the selection of the threshold in the image binarization unit is a very critical task , since it influences the content of the binary image and finally the precision of the detection system . usually the value of this threshold changes with the content of the image or with the lighting conditions . therefore the use of a constant ( global or local ) threshold , although an option , is not optimal . to this end an automatic threshold adaptation unit is included in the system described in the current invention . the system is able to adapt a global or local threshold according to the results of the detection process . in an exemplary embodiment , a local thresholding approach is used which employs threshold adaptation using feedback from the system output and more specifically from the digit segmentation unit ( 229 in fig2 ). more specifically the unit functions as follows : for every frame i k ( 71 in fig7 ) an edge - map is obtained ( 76 in fig7 ). an edge map is defined as an image containing image edges . an image edge is a point in a digital image at which the image brightness changes sharply or , more formally , has discontinuities . the points at which image brightness changes sharply are typically organized into a set of curved line segments termed edges . edge detection is the process of obtaining the edge - map of an image . the detection process typically employs the filtering of an image by convolving a standard matrix known as an “ operator ” with the image . this filtering process results in an image having increased intensity for the pixels belonging to an edge and decreased intensity for pixels not - belonging to an edge . usually as a final step , the binary edge map is obtained by applying binarization , using thresholding , to the edge - map image . this results in an image which has white pixels at the edges and black pixels everywhere else . in an exemplary embodiment , the binary edge map ( 76 in fig7 ) of frame i k ( 71 in fig7 ) is obtained by first applying an edge filtering using a sobel operator ( 74 in fig7 )[ 1 ] and then binarization using thresholding ( 75 in fig7 ). the threshold value for the binarization unit is obtained from the threshold trimming sub - system ( 751 in fig7 ) described below . the threshold trimming sub - system functions as follows : an arbitrary , pre - determined initial threshold value thres_1 = thres_1 ini is set . to be equal to the smaller integer number which is closest to the value 2 nb / 2 , where nb is the number of bits used to represent the pixel value ( e . g for 8 bits representation this number equals 127 ). the plate detection and digit segmentation process is then run and when the plate detection and the digit segmentation process is finished , the number of detected digits is fed from the digit segmentation unit ( 229 in fig2 ) and the required number of digits that must be detected is input from the number of digits input unit ( 233 in fig2 ). if the number of the detected digits is smaller than the required number of digits , the threshold value thres_1 is decreased and the detection is re - initiated . if the number of the detected digits is higher than the required number of digits , the threshold value thres_1 is increased and the detection is re - initiated . this process is repeated until the number of the detected digits is equal to the required number of digits . each threshold from threshold trimming sub - system is fed to the thresholding i sub - system ( 75 in fig7 ), which binarizes the edge map by using thresholding , to obtain the binary edge map j k ( 76 in fig7 ). as a next step , the input frame i k and the binary edge map e k is partitioned into a number n bx × n by blocks of dimensions w × w pixels each . then for every from frame i k the following procedure takes place iteratively for every frame i k ij ( 75 in fig7 ): the block i k ij is taken ( 75 in fig7 ) and from the binary image e k the corresponding block e ij block is taken ( 78 in fig7 ). for each of these blocks a binarization process is then taking place as follows : first the i k ij block ( 75 in fig7 ) is multiplied ( 79 in fig7 ) with the corresponding e k ij block ( 78 in fig7 ) of binary image e k . the resulting block d k ij ( 791 in fig7 ) is a semi - binary image , containing pixels having the gray - scale value of the corresponding pixel in i k ij when the corresponding pixel in e k ij has a non - zero value ( e . g . the pixel is on an edge ) and zero everywhere else . the next step is the binarization of this semi - binary block d k ij by applying a thresholding scheme ( 792 in fig7 ), using a threshold calculated by the following formula : where d ij xy is the pixel in x - th column and the y - th row of the d k ij block . the result is a binary version b k ij ( 793 in fig7 ) of the block i k ij of the video frame i k . automatic threshold calculation unit ( 232 in fig2 ) alternative to automatic threshold adaptation , an automatic threshold calculation unit can be used . to this end a global threshold calculation algorithm can be used which can lead to acceptable performance . there are a few automatic global threshold calculation approaches that can be used in this system [ 2 ]: algorithm of ridler and calvard , which optimizes the process of changing a gray - level image to a bimodal image , while retaining the best possible illumination of the image . algorithm of otsu , which is a classical algorithm in image binarization . this algorithm transforms a gray - level image to a binary image for classifying foreground and background with a global threshold . this algorithm can be applied iteratively to a gray - scale histogram of an image for generating threshold candidates . algorithm of pun proposes an optimal criterion for image thresholding . this criterion is corrected and improved by kapur et al . which revised and improved pun &# 39 ; s algorithm by assuming two probability distributions for objects and background as well as maximizing the entropy of the image to obtain the optimal threshold . algorithm of kittler and illingworth , proposing a minimum error thresholding algorithm that minimizes the probability of classification error by fitting error expression . it is assumed that a mixture of two gaussians distributions of object and background pixels can characterize the image . algorithm of fan et al ., proposing a fast entropic technique to obtain a global threshold automatically by reducing complexity in computation . algorithm of portes de albuquerque et al . proposing an entropic thresholding algorithm , which is customized from non - extensive tsallis entropy concept . algorithm of xiao et al . proposing an entropic thresholding algorithm based on the gray - level spatial correlation ( glsc ) histogram . this is a revision and extension of kapur et al .&# 39 ; s algorithm . in one exemplary embodiment , the algorithm of kapur has been selected for implementation [ 3 ]. this algorithm assumes two probability distributions , for objects p obj ( foreground ) and background p bg , and maximizes the between - class entropy of the image to obtain the optimal threshold . f 1 ⁡ ( th ) = h ⁡ ( 0 , th ) + h ⁡ ( th , l ) ⁢ ⁢ where ( 2 ) h ⁡ ( 0 , th ) = - ∑ i = 1 th ⁢ p i p obj ⁢ ln ⁢ p i p obj ( 3 ) h ⁡ ( th , l ) = - ∑ i = th + 1 l ⁢ p i p bg ⁢ ln ⁢ p i p bg ⁢ ⁢ and ( 4 ) p obj = - ∑ i = 0 th ⁢ p i ( 5 ) p bg = 1 - p obj ( 6 ) p i is the probability of a pixel value to appear in the current image and is defined as the ratio of the appearances of a value to the total number of pixels . in other words the optimal threshold value is the value of th for which the quantity f 1 is maximized for each frame . this unit is an input unit , which can be used optionally to input a threshold value manually . in the presence of electronic noise , or physical obstacles ( e . g . dust ) the binarization process may result in binary noise . binary noise manifests as white spots . these spots can cause a significant increase of the processing time . this is because the connected component analysis unit ( 232 in fig2 ) separately analyzes each non - black pixel to see if it is physically connected to any other pixel . to overcome this problem , the morphological filtering unit cleans any isolated pixels in order to eliminate these pixels and to produce a more “ clear ” binary image . the unit implements the following morphological operation : in each video frame ( 80 in fig8 ) a 3 × 3 mask is formed ( 81 in fig8 ) and starts rolling from the first pixel within a binary image from position ( 0 , 0 ) towards higher x and y coordinates . for each window the number of black n b and the number of white pixels n w is counted . then if n b & gt ; n w the central pixel of the 3 × 3 window is set to have black value ( 82 in fig8 ) else the central pixel of the 3 × 3 window is set to have white value ( 83 in fig8 ). connected component analysis unit ( 226 in fig2 ) this unit aims at the labeling of the binary image regions using a connected components algorithm . the target is to label each object within the binary image and this incorporates the labeling of each pixel with a label . pixels that are somehow connected are given the same label . at the end of this procedure , pixels with the same label corresponding to an object , having the same label as its constituting ( labeled ) pixels . in an exemplary embodiment , a run - length based connect component algorithm is used [ 4 ], which is similar to the two - pass connected component algorithm [ 5 ], but here run - lengths are used rather than pixels resulting in a more efficient implementation in terms of computer memory and processing power . in accordance with an exemplary embodiment of the current invention , a run - length encoding representation is followed for labeling . the run - length encoded format is also much more compact than a binary image ( individual runs have a single label ), and so the sequential label propagation stage that follows , is much faster than the conventional algorithm . run - length encoding works as follows : consider the binary image frame ( 91 in fig9 ). the target is to encode the contiguous foreground pixels ( black colored ), which , when working in rows , they are nothing else but black lines . for each line the starting pixel x - coordinate s , the end pixel coordinate e and the row r of that the line is recorded . for example line l 1 in fig9 ( 92 in fig9 ) starts at the first pixel of that row , so s = 0 , ends at the 5 - th pixel of that row ( thus e = 4 ) and lies at the second row ( thus r = 1 ). therefore this line is encoded as ( 0 , 4 , 1 ) and this code is also called a run . the same procedure is followed for every line in the image . a run is complete when the end of a row is reached or when a background pixel is reached . the maximum possible number of runs in an image of size m × n is 2mn and the flow of the related algorithm is shown in fig1 . this stage involves initial labeling and propagation of labels ( fig1 ). the ids and equivalences ( eqs ) of all runs are initialized to zero . this is followed by a raster scan of the runs ; assigning provisional labels , which propagate to any adjacent , runs on the row below . for any unassigned run ( idi = 0 ) a unique value is assigned to both its id and eq . after that , the 4 - way or 8 - way connectivity is checked of each run . in 4 - way connectivity , the adjacent pixels in four directions ( up , down , left , right ) are checked . if they are foreground pixels then are connected otherwise they are un - connected . consider for example pixels p 3 ( 98 in fig9 ) and p 4 ( 97 in fig9 ). these are 4 - way connected since pixel p 3 is on the left of pixel p 4 . in 8 - way connectivity , the diagonal directions are also checked . consider for example pixels p 1 ( 95 in fig9 ) and p 2 ( 96 in fig9 ), which are not 4 - way connected to each other . however p 2 is in the diagonal direction of p 1 , so p 1 and p 2 are 8 - way connected . for each run with identity id i excluding runs on the last row of the image , runs r j one row below the r i is checked for a connection . in terms of run - length encoded lines , 4 - way connection between two runs r i , r j means that the following conditions hold : 8 - way connection between two runs r i , r j means that the following conditions hold : a connected run in the row below r i , is assigned the identity id i , if and only if its id , id j is unassigned . if there is a conflict ( e . g . if an overlapping run has assigned id j ), the equivalence of run i ( the eq i ) is set to idj . the eq and id values should be equal . a differentiation between those two values for some run indicates the presence of some conflict , which occasionally happens when special shaped objects are encountered . thus a third stage must be included for resolving those conflicts . for example this problem may be occurred when a ‘ u ’- shaped object is encountered . as shown in fig1 , applying labeling algorithm to the ‘ u ’- shaped object ( 123 in fig1 ) will generate four runs r 1 , r 2 , r 3 , r 4 , each with unassigned id and the solution is a conflict - resolving algorithm , which follows a serial procedure , which scans all the runs sequentially , in the way shown in fig1 . at the end of this procedure , each run has a label ; so it is straightforward to obtain the final components , by simply gather the runs having the same labels . the aim of this unit is to classify each region identified with the help of the cca unit ( 227 in fig2 ) and stored to the cca data memory ( 25 in fig2 ), in order to classify this region as a car - plate or not . to this end , several characteristic features of each region are measured . these features are forming then a vector characterizing this region and then are classified . the region classification procedure includes two steps : the region feature extraction and the region classification . region feature extraction includes the measurement of several characteristic features of each region ( 142 in fig1 ). the features that are measured are the following : the width of the region : width corresponds to the width of a rectangle surrounding the region under consideration ( 144 in fig1 ). the width of the rectangle is computed as the difference of the maximum x coordinate minus the minimum x coordinate . the area that the region occupies : this is the area occupied by a rectangle surrounding the region under consideration ( 144 in fig1 ) measured in square pixels . the width of the rectangle is computed as the difference of the maximum x coordinate minus the minimum x coordinate , and the height of the rectangle is computed as the difference of the maximum y coordinate minus the minimum y coordinate . the area equals the product of width by the height of the rectangle . the magnitude of the region : this is the count of the non - white pixels n nw , of the connected region and is measured in pixels . the plenitude of a region : this measure indicates how full the region under consideration is . for example a region containing gaps will have less plenitude in relation with a region not having gaps . the plenitude of a region is defined as the ratio of the area to the magnitude features defined above . the aspect ratio of a rectangle surrounding the region under consideration ( 143 in fig1 ): the region under test is surrounded by a rectangle . the ratio of this rectangles height to the rectangles width gives the aspect ratio of that region . number of scan - lines intersection points : several “ virtual ” lines of 1 - pixel thickness are considered that intersect the region at different heights ( 144 in fig1 ). the system records the number of pixels that each scan line meets in each track throughout the region and produces a feature vector fv sl of cardinality n sl , where n sl is equal to the number of the scan lines and contains the id of each scan - line and the number of pixels that this line intersects . as an example , consider the scan lines indicated in fig1 , ( 144 in fig1 ). since the first line intersects with 2 pixels , the second line with 3 pixels and the third line with three pixels , then this future vector is fv sl ={ 1 , 2 , 2 , 3 , 3 , 3 }. statistical normalized central moments ( hu moments ). statistical manipulation of the pixels and their coordinates within a region result in the formation of a set of region - specific features called statistical moments [ 6 ]. central moments are given by the following expression : μ pq = σ x σ y ( x − x ) p ( y − y ) q ( 12 ) in eq . ( 12 ) x , y are the x and y coordinates of each pixel in the region and x , y are the mean values of all x and all y coordinates respectively for each non - white pixel within this region . integer numbers p and q , determine the order of a statistical moment . combinations of low order statistical moments ( up to the order of 2 e . g . μ 02 to μ 11 ), represent some physical measure of the region as the mean , the mass - center , the skewness , the angle with the x - axis etc . for example , the angle of a region with the horizontal x - axis is given by the following expression : in an exemplary embodiment , the calculation of these statistical moments is performed in the encoded space and on the run - length encoded runs . as it has been described above , each run is described by three numbers namely s i , e i , r i , which indicate the start and the end on the x - direction as well as the row of each non - white pixel within the region under consideration . if this type of description is used , eq . 12 cannot be directly applied , since the coordinates of each pixel in the region under consideration is not available . to this end eqn . 12 should be modified accordingly . below , this modification of the central moments is given for order up to 3 ( p + q ≦ 3 ). one interesting modification of these moments , results when the central moments are normalized used following relation : by using these normalized central moments , a new set of statistical moments can be formed , known as the hu moments i i , given by the following relations i 2 =( n 20 − n 02 ) 2 + 4 n 11 2 ( 25 ) i 3 =( n 30 − 3 n 12 ) 2 +( 3 n 21 − n 03 ) 2 ( 26 ) i 4 =( n 30 + n 12 ) 2 +( n 21 + n 03 ) 2 ( 27 ) i 5 =( n 30 − 3 n 12 )( n 30 + n 12 )[( n 30 + n 12 ) 2 − 3 ( n 21 + n 03 ) 2 ]+( 3 n 21 − n 03 )( n 21 + n 03 )[ 3 ( n 30 + n 12 ) 2 −( n 21 + n 03 ) 2 ] ( 28 ) i 6 =( n 20 − n 02 )[( n 30 + n 12 ) 2 −( n 21 + n 03 ) 2 ]+ 4 n 11 ( n 30 + n 12 )( n 21 + n 03 ) ( 29 ) i 7 =( 3 n 21 − n 03 )( n 30 + n 12 )[( n 30 + n 12 ) 2 − 3 ( n 30 + n 03 ) 2 ]−( n 30 − 3 n 12 )( n 21 + n 03 )[ 3 ( n 30 + n 12 ) 2 −( n 21 + n 03 ) 2 ] ( 30 ) in a different implementation the run - length encoded region under consideration , is first decoded in order to obtain the initial binary image corresponding to this region . in this case , equation 12 is applied directly . the procedure that is followed in order to do this is analyzed below , in the description of the digit segmentation unit . the feature vector fv hm ={ i 2 , i 3 , i 4 , i 5 , i 6 , i 7 } resulting from this set of features contains up to 7 numbers corresponding to the 7 hu moments i 1 to i 7 as described in eqs . 24 - 30 . the region classification aims to the classification of each region under consideration as a car - plate or not , using also input from the classification criteria trimming unit ( 227 in fig2 ). in implementing an exemplary embodiment , a pattern classification scheme is used for region classification . to this end , the system has been previously trained offline , using a database with regions corresponding to plates and with regions corresponding to non - plates . for each region , the features described in the previous section are evaluated and a total feature vector is formed . the feature vector is then projected in the feature space , defined as a multi - dimensional space with as many dimensions as the feature vector . in such a projection , the feature vectors corresponding to plate and non - plate regions are concentrated ( clustered ) in separate areas of the multi - dimensional feature space . consider the example shown in fig1 incorporating a 3 - dimensional feature vector fv ={ fv 1 , fv 2 , fv 3 }, which builds a 3 dimensional feature space ( 151 in fig1 ). each point in this space is defined by the three coordinates fv 1 , fv 2 , fv 3 . the projection of the several regions on this axis - system creates two clusters one for the regions corresponding to plates ( 153 in fig1 ) and one for the regions not corresponding to plates ( 152 in fig1 ). the next step is to define the centers of the individual clusters . in accordance with one exemplary embodiment , this is achieved via the calculation of the center of mass of each cluster . the center of mass has coordinates fv c ={ fv 1 , fv 2 , . . . , fv d } where d is the dimensionality of the feature space , and each coordinate fv k is defined as : fv _ k = 1 n ns ⁢ σ i ⁢ fv ki ( 31 ) where n s is the number of samples ( regions ) participating in each cluster . in the 3 - dimensional example referred before , the centers of the clusters are indicated as c 1 ( 156 in fig1 ) and c 2 ( 157 in fig1 ). when a new region t is tested , its feature vector fv t is obtained . this corresponds to a point in the feature space . in order to test into which cluster this test point belongs , the distance of this point from the centers of the clusters is computed using some distance measure such as the l1 distance , l2 distance , the mahalanobis distance etc . in one exemplary embodiment , the l2 distance is used which is defined as follows : in cartesian coordinates , if p =( p 1 , p 2 , . . . , p n ) and q =( q 1 , q 2 , . . . , q n ) are two points in euclidean n - space , then the l2 or euclidean distance from p to q , or from q to p is given by the following expression : d ( p , q )= d ( q , p )=√{ square root over ( σ i = 1 n ( q i − p i ) 2 )} ( 32 ) in the 3 - dimensional example of fig1 , the distance of the test point t ( 155 in fig1 ) from the cluster - center c 1 ( 152 in fig1 ) is d 1 ( 158 in fig1 ) and from the cluster - center c 2 ( 157 in fig1 ) is d 2 ( 154 in fig1 ). once the distances of the test point from the centers of the clusters are computed , the decision about into which cluster this point belongs to is taken according a proximity criterion . that is , the point belongs to the nearest cluster according to the distance measure used . once this decision has been made , the region under test has been classified as plate or non - plate . while the above description utilizes a specific classifier , it is understood that an artificial neural network classifier or any other type of classifier can be used . an alternative to pattern classification , is the feature filtering implementation . in this scheme , a region can be classified as plate or non - plate according to some empirical measures corresponding to physical properties of each region , or some empirical observations . to this end the features of width , magnitude , aspect ratio , plenitude , scan - lines and the angle with the x - axis ( eq . 13 ) are used . the target is a formation of a decision vector as follows : each of the above - mentioned features is checked against a target value or a range of target values rule ( table 1 ), which are in turn obtained from empirical observations or from governmental standards . these rules are input from the classification criteria trimming unit ( 227 in fig2 ). conformance to the target value corresponds to a true indication and a non - conformance to the target value corresponds to a false indication . to this end a binary decision vector dv is obtained as follows : dv ={ d width _ rule , d magnitude _ rule , d aspect _ ratio _ rule , d plenitude _ rule , d scan - lines _ rule , d angle _ rule } a simple approach is to classify the region as a plate if and only if all the logic vector containing logic ones , meaning that the all the feature values conforming to the target values . however in the current implementation a decision fusion rule is formed leading to optimal results . this fusion rule is the following fr ={[ d width _ rule and d aspect _ ratio _ rule and d angle _ rule ] or [ d plenitude _ rule and d scan - lines _ rule ]} if fr is true then the region is classified as a plate , while if fr is false the region is classified as a non - plate . the target value rules can be change when is needed ( e . g . the system need to be trimmed for a different country ) through the classification criteria trimming unit ( 227 in fig2 ). classification criteria trimming unit ( 227 in fig2 ) this unit is used for input target value rules to the region classification unit ( 228 in fig2 ) the aim of this unit is to output the coordinates of each region classified as a car plate . the unit outputs the plate if and only if the automatic threshold adaptation unit ( 223 in fig2 ), indicate that the right number of digits have been detected . the aim of this unit is to segment the individual digits constituting a car - plate in order to be able to be output from the system in binary form to an optical character recognition ( ocr ) system . the digits in a binary plate image appear as coherent regions ( 161 in fig1 ). therefore the unit performs a cca analysis similar with the analysis performed in cca unit ( 226 in fig2 ). however on top of the plate digits , the plate image usually contains additional regions corresponding to e . g . the plate border - line ( 163 in fig1 ), separation and state signs ( 166 in fig1 ), noise ( 162 in fig1 ) etc . to this end an additional filtering scheme is applied in order to filter - out any regions not corresponding to digits . this filtering scheme includes the computation of a simple feature and checking this feature against a target value rule . the cca analysis performed in this unit follows steps 2 and 3 of the cca analysis performing the cca unit , leaded by an extra step , which is the background - foreground inversion . in the first cca analysis , the digits of the plate appear as white holes ( background ), since the digits are usually black . to this end they are not run - length encoded and thus information about them cannot be extracted . to this end a background - foreground inversion must be carried out for the regions detected as plates using a procedure , which for a region containing n runs is shown in fig1 . once the background - foreground inversion has been carried out , the new inverted runs must be de - coded in binary image format ( pixels coordinates and values ). this process is straightforward and incorporates the use of a structured image memory , which is loaded with pixels values at coordinates indicated by the run - length code . analytically the process followed in the current implementation for a region containing n runs , is shown in fig1 . the aim of this unit is to output the digits to the system output when the automatic threshold adaptation unit ( 223 in fig2 ) indicates that the right number of digits has been detected . the systems , methods and techniques described herein performed or implemented on any device that comprises at least one camera , including but not limited to , standalone cameras , security cameras , smart cameras , industrial cameras , mobile phones , tablet computers , laptop computers smart tv sets and car boxes , i . e . a device embedded or installed in an automobile that collects video and images . it will be understood and is appreciated by persons skilled in the art , that one or more processes , sub - processes or process steps described in embodiments of the present invention can be implemented in hardware and / or software . while the above - described flowcharts and methods have been discussed in relation to a particular sequence of events , it should be appreciated that changes to this sequence can occur without materially effecting the operation of the invention . additionally , the exemplary techniques illustrated herein are not limited to the specifically illustrated embodiments but can also be utilized and combined with the other exemplary embodiments and each described feature is individually and separately claimable . additionally , the systems , methods and protocols of this invention can be implemented on a special purpose computer , a programmed microprocessor or microcontroller and peripheral integrated circuit element ( s ), an asic or other integrated circuit , a digital signal processor , a hard - wired electronic or logic circuit such as discrete element circuit , a programmable logic device such as pld , pla , fpga , pal , any comparable means , or the like . in general , any device capable of implementing ( or configurable to implement ) a state machine that is in turn capable of implementing ( or configurable to implement ) the methodology illustrated herein can be used to implement the various methods , protocols and techniques according to this invention . furthermore , the disclosed methods may be readily implemented in software using object or object - oriented software development environments that provide portable source code that can be used on a variety of computer or workstation platforms . alternatively , the disclosed system may be implemented partially or fully in hardware using standard logic circuits or vlsi design . whether software or hardware is used to implement the systems in accordance with this invention is dependent on the speed and / or efficiency requirements of the system , the particular function , and the particular software or hardware systems or microprocessor or microcomputer systems being utilized . the systems and methods illustrated herein can be readily implemented in hardware and / or software using any known or later developed systems or structures , devices and / or software by those of ordinary skill in the applicable art from the functional description provided herein and with a general basic knowledge of the video processing arts . moreover , the disclosed methods may be readily implemented in software that can be stored on a storage medium , executed on programmed general - purpose computer with the cooperation of a controller and memory , a special purpose computer , a microprocessor , or the like . in these instances , the systems and methods of this invention can be implemented as program embedded on personal computer such as an applet , java ™ or cgi script , as a resource residing on a server or computer workstation , as a routine embedded in a dedicated system or system component , or the like . the system can also be implemented by physically incorporating the system and / or method into a software and / or hardware system , such as the hardware and software systems of an electronic device . it is therefore apparent that there has been provided , in accordance with the present invention , systems and methods for the detection of multiple number - plates of moving vehicles . while this invention has been described in conjunction with a number of embodiments , it is evident that many alternatives , modifications and variations would be or are apparent to those of ordinary skill in the applicable arts . accordingly , it is intended to embrace all such alternatives , modifications , equivalents and variations that are within the spirit and scope of this invention . ( all of which are incorporated herein by reference in their entirety ) 1 . sobel operator , wikipedia , http :// en . wikipedia . org / wiki / sobel_operator 2 . m . athimethphat , “ a review on global binarization algorithms for degraded document images ”, au j . t . 14 ( 3 ): 188 - 195 ( january 2011 ). 3 . j . n . kapur et all . “ a new method for gray - level picture thresholding using the entropy of the histogram ”, computer vision , graphics and image processing , 29 , 273 - 285 , 1985 . 4 . kofi appiaha , andrew huntera , hongying menga , patrick dickinson , “ accelerated hardware object extraction and labeling : from object segmentation to connected components labeling ”, preprint submitted to computer vision and image understanding aug . 22 , 2009 5 . n . ma , d . g . bailey , and c . t . johnston , “ optimized single pass connected components analysis ” ieee international conference on field - programmable technology , 2008 . 6 . r . c . gonzalez , r . e . woods , “ digital image processing ”, pages : 514 - 516 , addison - wesley , 1993 .