Abstract:
A method and system to detect correctly overload &amp; unlawful loading of cargoes under any circumstance. The Detection method of wrong measurement according to this invention are configured of Practicing Phase of Artificial Intelligence Algorithm to discriminate Wrong Measured Information by false manipulation of axle from Normal Measured Information without false manipulation of axle of vehicles by Pattern Information; Recognizing entering vehicle and Collecting Phase of Basic Data of the vehicle including dead weight, maximum pay load, and axles information; Verifying Phase of current vehicle information including total weight, load on each axle, and entering speed; And Classifying Phase of Measured Status of above vehicle using above collected and verified information as input value to Artificial Intelligence Algorithm. It might be desirable that Neural Back-Propagation Algorithm is implemented to detection method of wrong measurement according to the Invent as an Artificial Intelligence Algorithm.

Description:
CROSS-REFERENCE TO RELATED APPLICATION 
       [0001]    This application claims priority under 35 U.S.C. §119 to Korean Patent Application No. 10-2010-0127275, filed on Dec. 14, 2010, the disclosures of which is expressly incorporated by reference in its entireties. 
       BACKGROUND OF THE INVENTION 
       [0002]    1. Field of the Invention 
         [0003]    This Invention is for method and system to detect overload &amp; unlawful measurement applied to axle load weigher used in highway toll gates and others. Especially an artificial intelligence algorithm such as Neural Back-Propagation Algorithm is implemented to the Invention to detect overload &amp; unlawful loading of cargoes under any circumstance. 
         [0004]    2. Description of the Related Art 
         [0005]    Overloaded vehicles may cause not only crack and deformation of roads but also shorten pavement lifespan. This undesirable phenomena will increase risks resulting in traffic accidents and be accompanied with huge expenses and long times for maintenance of road. Especially, overloaded cargo trucks are key causes of road damages. 
         [0006]    For reference, when an axle load of a cargo truck is 10t, 11t and 15t, its impact on road damage is equivalent to passing of 70,000, 110,000 and 390,000 passenger cars, respectively. 
         [0007]    Overload-detecting devices can be categorized into two types; 1) a device that measures load of a stopped vehicle, and 2) a device that measures load of a moving vehicle. Among these two types, a type of weight measuring device for a stopped vehicle should have a corresponding vehicle stopped and guided to the device, therefore take long hours of measurement. Furthermore, making a moving vehicle on a highway stopped and guided can be not only highly risky (e.g. traffic accident) but also very expensive. 
         [0008]    Therefore, weight measuring method using a type of device to measure weight of a moving car is recommended, and lots of various devices of this type have been developed and applied. For example, an axle load weigher using load cell on road surface can be categorized in this type of device and has been widely utilized to detect unlawful overloads. If any overloaded vehicle passes by, the device will identify a license plate of the vehicle with a camera to enforce police activity. 
         [0009]    Usually, most current weight measuring systems are equipped with pads of 2 load cells (weight measuring sensor) for cost and other reasons. However, due to lack of most truck drivers&#39; commitments, these systems are increasingly used for cheating by truck drivers. For example, they have cheated these systems with certain unlawfulial technique so called “passing with wheels lifted up” or deceitful loading techniques with special structure. 
         [0010]      FIGS. 1 and 2  illustrate weight balance shown in the sensor of each vehicle axle in the “passing with wheels lifted up” technique. 
         [0011]    As depicted in the  FIG. 1  for total load distribution of a vehicle  20 , the wheel  24  located exterior to the wheel  22  takes different load, while exerted loads on the wheels  21  and  23  are same. This could be enabled because a driver slightly lifts up an exterior wheel with specially designed wheel control device and thus unlawfully decreases total load for an instant sensing time of weight. This unlawful technique is shown in the  FIG. 2  by graph. Depicted in the Graph  38 , the redder it becomes, the heavier a vehicle is. Contrarily, the bluer it gets, the lighter the vehicle is.  FIG. 2  indicates that weight of the wheel ( 31 ) of the axle No. 1  ( 34 ) and that of other wheel ( 33 ) of the axle No. 3  ( 36 ) are normally distributed while weight of the one side wheel ( 37 ) of the axle No. 2  ( 35 ) is different color from other Normal weight ( 32 ). 
         [0012]    To prevent these types of cheating and unlawful techniques, detection devices equipped with 4 pads have been suggested; however, higher costs caused by more numbers of installed pads, along with inconsistent spacing among wheel axles, have triggered diverse difficulties for efficient detection of overload &amp; unlawful loading of all types of vehicles. 
         [0013]    Therefore, there have been more requirements for a new device or system that can accurately and effectively detect every overload &amp; unlawful loading technique with as less pads as possible. 
       BRIEF SUMMARY OF THE INVENTION 
     Problems to be Solved 
       [0014]    This invention is designated to resolve those problems referred above. The purpose of this invention is to supply with detection method and system of wrong measurement using an Artificial Intelligence Algorithm (e.g. Neural Back-Propagation Algorithm) and thereby to enable an accurate detection of overload &amp; unlawful loading of cargoes under any circumstance. 
       Solving Methods of Problems 
       [0015]    A Detecting Method of Wrong Measurement to achieve above purpose is configured of Practicing Phase of Artificial Intelligence Algorithm to discriminate Wrong Measured Information by false manipulation of axle from Normal Measured Information without false manipulation of axle of vehicles by Pattern Information; 
         [0016]    Recognizing entering vehicle &amp; Collecting Phase of Basic Data of the vehicle including dead weight, maximum pay-load, and axles information; 
         [0017]    Verifying Phase of current vehicle information including total weight, load on each axle, and entering speed; 
         [0018]    And Classifying Phase of Measured Status of above vehicle using above collected and verified information as input value to Artificial Intelligence Algorithm. 
         [0019]    When above Vehicle Basic Data is collected &amp; current vehicle information is verified, it is desirable to use thereof information to calculate each weight information of all false manipulation cases of axles to feed to Artificial Intelligence Algorithm as Input Value. 
         [0020]    A Detecting System of Wrong Measurement according to this Invent to achieve above purpose is configured of Vehicle Information Measuring Unit to measure entering Vehicle Information installed in Axle Load Weigher for detecting wrong measurement of a vehicle; 
         [0021]    Artificial Intelligence Processor to detect wrong measurement if any, by executing practiced Artificial Intelligence Algorithm according to Vehicle Information created by Vehicle Information Measuring Unit; 
         [0022]    An Input Unit to input data into above Artificial Intelligence Processor; A Display Unit to display if any wrong measurement executed by above Artificial Intelligence Processor; 
         [0023]    A Practice Unit to execute practices of Artificial Intelligence Algorithm accommodated in above Artificial Intelligence Processor; 
         [0024]    And Vehicle Information DB to supply above Artificial Intelligence Processor with Basic Vehicle Data and False Manipulation Information of Axle and to store measured information executed by Artificial Intelligence Processor. 
         [0025]    Above Vehicle Information Measuring Unit is equipped with Video Sensor to identify vehicle license plate to collect Basic Data of the object vehicle, Weight Sensor to measure vehicle weight, Height Sensor to detect over-height of cargoes loaded on the vehicle, Axle Number Separator to obtain axle information failed to get from license plate of the vehicle, and Speed Sensor to measure initial entering speed of the vehicle. 
       Benefits of Invention 
       [0026]    Method and system according to this invention to detect any unlawful and cheating manipulation of weight measuring are very effective under any circumstance. Moreover, the detection method and system according to this invention do not require for additional expensive sensor pads and are therefore economically effective and efficient. 
         [0027]    Besides utilizing current Weight Sensor pads without adding new sensors, the detection method and system according to this invention are compatible with the applications of the existent OS (Operating System), therefore provide several diversified benefits (e.g. reduction in installation/maintenance costs, enhancement of efficiency, etc). 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0028]      FIGS. 1 and 2 : Concept diagram of weight balance shown in each vehicle axle sensor for the “passing with wheels lifted up” manipulation. 
           [0029]      FIG. 3 : Hierarchy structure diagram of the Neural Back-Propagation Algorithm implemented to this Invent. 
           [0030]      FIG. 4 : Explanation flow chart of the Neural Back-Propagation Algorithm implemented to a Detecting Method of Wrong Measurement according to this Invent. 
           [0031]      FIG. 5 : Concept Diagram of Practice of the Neural Back-Propagation Algorithm for normally loaded vehicles according to this Invent. 
           [0032]      FIG. 6 : Concept Diagram of Practice of the Neural Back-Propagation Algorithm for abnormally loaded vehicles after false manipulation of axle. 
           [0033]      FIG. 7 : Actually applied Concept Diagram of the Neural Back-Propagation Algorithm practiced in above Figures of  5  and  6 . 
           [0034]      FIG. 8 : Block diagram of a Detecting System of Wrong Measurement according to this Invent. 
           [0035]      FIGS. 9 and 10 : Concept Diagram and flow chart of a Detecting Method of Wrong Measurement according to this Invent 
           [0036]      FIG. 11 : Sequence diagram of a Detecting Process of Wrong Measurement according to this Invent 
           [0037]      FIG. 12 : Example drawing of actual data calculated by Detecting Method of Wrong Measurement using Neural Back-Propagation Algorithm according to an implementation example of this Invent 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0038]    Hereunder, desirable implementation case of the Invention is explained specifically with attached Figures. 
         [0039]    The method and system for detecting wrong measurement according to this invent execute practices of Artificial Intelligence Algorithm by implementing measured Information Patterns of Wrong Measured Information by false manipulation of axle and Normal Measured Information without false manipulation of axle of vehicles. 
         [0040]    Then, actually measured information are inputted into the algorithm, and the algorithm returns relevant outputs to detect any unlawful and cheating weight manipulation. 
         [0041]    In implementation case of the Invention, Neural Back-Propagation Algorithm is used for Artificial Intelligence Algorithm, and thereof practice concept is explained hereunder. 
         [0042]      FIG. 3  shows an hierarchy structure diagram of the Neural Back-Propagation Algorithm. Based on this Figure, practice procedure of the Neural Back-Propagation Algorithm is as follows. 
         [0043]    [Step 1] First of all, initialize those network interface-strength variables such as ‘wji’, ‘wkj’ and ‘offset θj/θk’ by random numbers that generally lie between −0.5-0.5. 
         [0044]    [Step 2] Then, select a relevant practice pattern for the algorithm. 
         [0045]    [Step 3] Compute the following values; 1) An output value ‘opi’ that is generated from a certain value associated with the practice pattern and outputted at the Input Layer, 2) An interface-strength value ‘wji’ between the Input Layer and the middle layer, and 3) An input value ‘netpj’ of the middle layer j that is generated from the offset. And, use the value of ‘netpj’ and the sigmoid function T to compute an output value of ‘opj’ of the middle layer j. 
         [0000]    
       
         
           
             
               net 
               pj 
             
             = 
             
               
                 
                   ∑ 
                   i 
                 
                  
                 
                   
                     w 
                     ji 
                   
                    
                   
                     o 
                     pi 
                   
                 
               
               + 
               
                 θ 
                 j 
               
             
           
         
       
       
         
           
             
               o 
               pj 
             
             = 
             
               
                 f 
                 j 
               
                
               
                 ( 
                 
                   net 
                   pj 
                 
                 ) 
               
             
           
         
       
     
         [0046]    [Step 4] Use the output value of ‘opj’ at the middle layer, the interface-strength value of ‘wpk’ between the middle layer and the Output Layer and the offset at the Output Layer k in order to compute an input value of ‘netpk’ at the Output Layer k. Then, use the ‘netpk’ and the sigmoid function ‘f’ to compute an output value of ‘opk’ at the Output Layer k. 
         [0000]    
       
         
           
             
               net 
               
                 p 
                  
                 
                     
                 
                  
                 k 
               
             
             = 
             
               
                 
                   ∑ 
                   j 
                 
                  
                 
                   
                     w 
                     
                       kj 
                        
                       
                           
                       
                     
                   
                    
                   
                     o 
                     pj 
                   
                 
               
               + 
               
                 θ 
                 k 
               
             
           
         
       
       
         
           
             
               o 
               
                 p 
                  
                 
                     
                 
                  
                 k 
               
             
             = 
             
               
                 f 
                 k 
               
                
               
                 ( 
                 
                   net 
                   
                     p 
                      
                     
                         
                     
                      
                     k 
                   
                 
                 ) 
               
             
           
         
       
     
         [0047]    [Step 5] Compute an interface-strength value at the Output Layer k and an error ‘δpk’ for the offset at the Output Layer k using the difference between a target output ‘tpk’ of the practice pattern and its actual output ‘opk’. 
         [0000]      δ pk =( t   pk   −o   pk ) f′   k (net pk )=( t   pk   −o   pk ) o   pk (1 −o   pk )
 
         [0048]    [Step 6] Compute an error ‘δpj’ for the interface-strength value at the middle layer j and the offset at the middle layer using the error ‘δpk’, the interface-strength value ‘wkj’ between the middle layer and Output Layer and the output value ‘netpj’ at the middle layer. 
         [0000]    
       
         
           
             
               θ 
               pj 
             
             = 
             
               
                 
                   
                     f 
                     k 
                     ′ 
                   
                    
                   
                     ( 
                     
                       net 
                       pj 
                     
                     ) 
                   
                 
                  
                 
                   
                     ∑ 
                     k 
                   
                    
                   
                     
                       δ 
                       
                         p 
                          
                         
                             
                         
                          
                         k 
                       
                     
                      
                     
                       w 
                       kj 
                     
                   
                 
               
               = 
               
                 
                   ∑ 
                   k 
                 
                  
                 
                   
                     δ 
                     
                       p 
                        
                       
                           
                       
                        
                       k 
                     
                   
                    
                   
                     w 
                     kj 
                   
                    
                   
                     
                       o 
                       pj 
                     
                      
                     
                       ( 
                       
                         1 
                         - 
                         
                           o 
                           pj 
                         
                       
                       ) 
                     
                   
                 
               
             
           
         
       
     
         [0049]    [Step 7] Multiply the error ‘δpk’ at the Output Layer k computed in the step 5 by the constant ‘a’ and the output value of ‘opj’ at the middle layer j. Add this multiplied value to the interface-strength variables ‘wkj’ for revision. Furthermore, revise the offset ‘θ k ’ at the Output Layer k by adding the error ‘δpk’ multiplied by the constant ‘β’. 
         [0000]    
       
      
       w 
       kj 
       =w 
       kj 
       +α·δ 
       pk 
       o 
       pj  
      
     
         [0000]      θ k =θ k +β·δ pk  
 
         [0050]    [Step 8] Multiply the error ‘δpj’ at the middle layer j by the constant ‘α’ and the output value ‘opi’ at the Input Layer i. Add this multiplied value to the interface-strength value ‘wji’ between the Input Layer and middle layer j for revision. Furthermore, revise the offset ‘θ j ’ at the middle layer j by adding the error ‘δpj’ multiplied by the constant ‘β’. 
         [0000]        w   ki   =w   ki +α·δ pj   o   pi  
 
         [0000]      θ j =θ j +β·δ pj  
 
         [0051]    [Step 9] Have the algorithm practiced the following patterns. 
         [0052]    [Step 10] Repeat the step 2 through step 9 until the algorithm practices every pattern. 
         [0053]    [Step 11] Count the number of repeated practice frequency. 
         [0054]    [Step 12] Go back to the step 2 if the number of repeated practice frequency is less than a certain maximum value. 
         [0055]    If all the steps above have been ended, practice procedure of the Neural Back-Propagation Algorithm is eventually completed. 
         [0056]    Hereunder, how practiced Neural Back-Propagation Algorithm through above procedures can practice and detect wrong measurement by unlawful and cheating measurement is explained. 
         [0057]      FIG. 4  depicts a flow chart of the Neural Back-Propagation Algorithm. Based on this Figure, the Neural Back-Propagation Algorithm could be explained as follows. 
         [0058]    A traditional neural back-propagation network is configured of an Input Layer ( 110 ), a Hidden Layer ( 120 ) and Output Layer ( 130 ). The number of neurons at the Input Layer is equal to the number of the input vector components. While the algorithm is practiced, the Input Layer sends every input data to the Hidden Layer ( 120 ). Neurons at the Hidden Layer ( 120 ) send the results computed from the output neurons. Each output neuron is used to compute loaded sums, and actual results can be computed from certain expected values for the error vectors. 
         [0059]    Then, an output node computes partial differential values of the error vectors for weights of the neurons using the results above. And, these partial differential values are inversely delivered to the Hidden Layer. Then, each Hidden Layer ( 120 ) computes the sum of the errors for the partial differential values to find certain contribution to the errors at the Output Layer ( 130 ). 
         [0060]    If these series of practice procedures are completed, the weight vectors at the Hidden Layer ( 120 ) generated from the practice procedures can be utilized to operate a neural network system. Since inputting flows in forward direction for actual application of a practice-completed system, it takes some time for the system to actually practice; however, once the system completely practiced every pattern, it does not need to re-practice each pattern, thereby quickly generate desirable results. 
         [0061]    Practice procedure of a multi-layered neural network using the neural back-propagation (BP) algorithm can be more specifically explained as follows. 
         [0062]    For example, if the number of the input vectors=11, the number of the Hidden Layers=150, the number of the Output Layers=3, the pattern vector at the Input Layer=‘x’, the output vector at the Hidden Layer=‘z’, and the output vector at the Output Layer=‘y’, then the [Mathematical Formula 1] can be expressed as follows. 
         [0000]        x=[x   1   x   2   x   3    . . . x   11 ] 
         [0000]        z=[z   1   z   2   z   3    . . . z   150 ] 
         [0000]        y=[y   1   y   2   y   3 ]  Mathematical Formula 1
 
         [0063]    The interface-strength variable ‘v(p×n)’ between the Input Layer and the Hidden Layer and the interface-strength variable ‘w(m×p)’ between the Hidden Layer and the Output Layer can be expressed in matrix as follows. 
         [0000]    
       
         
           
             
               
                 
                   
                     v 
                     = 
                     
                       [ 
                       
                         
                           
                             
                               
                                 v 
                                 11 
                               
                                
                               
                                 v 
                                 12 
                               
                                
                               
                                   
                               
                                
                               … 
                                
                               
                                   
                               
                                
                               
                                 v 
                                 
                                   1 
                                    
                                   n 
                                 
                               
                             
                           
                         
                         
                           
                             
                               
                                 v 
                                 21 
                               
                                
                               
                                 v 
                                 22 
                               
                                
                               
                                   
                               
                                
                               … 
                                
                               
                                   
                               
                                
                               
                                 v 
                                 
                                   2 
                                    
                                   n 
                                 
                               
                             
                           
                         
                         
                           
                             ⋮ 
                           
                         
                         
                           
                             
                               
                                 v 
                                 
                                   p 
                                    
                                   
                                       
                                   
                                    
                                   1 
                                 
                               
                                
                               
                                 v 
                                 
                                   p 
                                    
                                   
                                       
                                   
                                    
                                   2 
                                 
                               
                                
                               
                                   
                               
                                
                               … 
                                
                               
                                   
                               
                                
                               
                                 v 
                                 pn 
                               
                             
                           
                         
                       
                       ] 
                     
                   
                    
                   
                     
 
                   
                    
                   
                     w 
                     = 
                     
                       [ 
                       
                         
                           
                             
                               
                                 v 
                                 11 
                               
                                
                               
                                 v 
                                 12 
                               
                                
                               
                                   
                               
                                
                               … 
                                
                               
                                   
                               
                                
                               
                                 v 
                                 
                                   1 
                                    
                                   p 
                                 
                               
                             
                           
                         
                         
                           
                             
                               
                                 v 
                                 21 
                               
                                
                               
                                 v 
                                 22 
                               
                                
                               
                                   
                               
                                
                               … 
                                
                               
                                   
                               
                                
                               
                                 v 
                                 
                                   2 
                                    
                                   p 
                                 
                               
                             
                           
                         
                         
                           
                             ⋮ 
                           
                         
                         
                           
                             
                               
                                 v 
                                 
                                   m 
                                    
                                   
                                       
                                   
                                    
                                   1 
                                 
                               
                                
                               
                                 v 
                                 
                                   m 
                                    
                                   
                                       
                                   
                                    
                                   2 
                                 
                               
                                
                               
                                   
                               
                                
                               … 
                                
                               
                                   
                               
                                
                               
                                 v 
                                 
                                   m 
                                    
                                   
                                       
                                   
                                    
                                   p 
                                 
                               
                             
                           
                         
                       
                       ] 
                     
                   
                 
               
               
                 
                   Mathematical 
                    
                   
                       
                   
                    
                   Formula 
                    
                   
                       
                   
                    
                   2 
                 
               
             
           
         
       
     
         [0064]    Before going into the practice procedure, select 11 practice patterns that are used as the input vectors; (x 1 ,d 1 ), (x 2 ,d 2 ), (x 3 ,d 3 ), . . . , (x 11 ,d 11 ). 
         [0065]    Initialize those interface-strength variables v and w into small numbers (e.g. 0.5) and select a practice ratio (a&gt;0). Default practice ratio is set at 0.02 with a certain practice frequency to be determined. Input pairs of the practice patterns in sequence and change the interface-strength values as follows. 
         [0066]    A sigmoid function is used as an activation function. A unipolar sigmoid function, a most-commonly used function in a neural network model, can be expressed as shown in the [Mathematical Formula 3]. 
         [0000]    
       
         
           
             
               
                 
                   
                     f 
                      
                     
                       ( 
                       NET 
                       ) 
                     
                   
                   = 
                   
                     1 
                     
                       1 
                       + 
                       
                         exp 
                          
                         
                           ( 
                           
                             
                               - 
                               λ 
                             
                              
                             
                                 
                             
                              
                             NET 
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Mathematical 
                      
                     
                         
                     
                      
                     Formula 
                      
                     
                         
                     
                      
                     3 
                   
                   ] 
                 
               
             
           
         
       
     
         [0067]    Herein, ‘λ’ represents a slope. 
         [0068]    Since a unipolar sigmoid function expressed in the [Mathematical Formula 3] is used as an activation function, related output values will be between 0 and 1. If the ‘NET’ value equals to 0, then an output value of a neuron becomes ½. As ‘λ’ increases, ‘f=(NET)’ value gets closer to a y axis. If ‘λ’→∞, then the sigmoid function shows certain step function characteristics as shown in the [Mathematical Formula 4]. 
         [0000]    
       
         
           
             
               
                 
                   
                     f 
                      
                     
                       ( 
                       NET 
                       ) 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             1 
                             ; 
                             
                               NET 
                               ≥ 
                               0 
                             
                           
                         
                       
                       
                         
                           
                             0 
                             ; 
                             
                               NET 
                               &lt; 
                               0 
                             
                           
                         
                       
                     
                     } 
                   
                 
               
               
                 
                   [ 
                   
                     Mathematical 
                      
                     
                         
                     
                      
                     Formula 
                      
                     
                         
                     
                      
                     4 
                   
                   ] 
                 
               
             
           
         
       
     
         [0069]    ‘λ’=1 was used. The formula above can be re-arranged as follows. 
         [0000]    
       
         
           
             
               
                 
                   
                     f 
                      
                     
                       ( 
                       NET 
                       ) 
                     
                   
                   = 
                   
                     1 
                     
                       1 
                       + 
                       
                         exp 
                          
                         
                           ( 
                           
                             - 
                             NET 
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Mathematical 
                      
                     
                         
                     
                      
                     Formula 
                      
                     
                         
                     
                      
                     5 
                   
                   ] 
                 
               
             
           
         
       
     
         [0070]    If the above formula is differentiated, then 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           
                             f 
                             ′ 
                           
                            
                           
                             ( 
                             NET 
                             ) 
                           
                         
                         = 
                           
                          
                         
                           
                             exp 
                              
                             
                               ( 
                               
                                 - 
                                 NET 
                               
                               ) 
                             
                           
                           
                             
                               [ 
                               
                                 1 
                                 + 
                                 
                                   exp 
                                    
                                   
                                     ( 
                                     
                                       - 
                                       NET 
                                     
                                     ) 
                                   
                                 
                               
                               ] 
                             
                             2 
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             1 
                             
                               1 
                               + 
                               
                                 exp 
                                  
                                 
                                   ( 
                                   
                                     - 
                                     NET 
                                   
                                   ) 
                                 
                               
                             
                           
                           · 
                         
                       
                     
                   
                   
                     
                       
                           
                          
                         
                           
                             1 
                             + 
                             
                               exp 
                                
                               
                                 ( 
                                 
                                   - 
                                   NET 
                                 
                                 ) 
                               
                             
                             - 
                             1 
                           
                           
                             1 
                             + 
                             
                               exp 
                                
                               
                                 ( 
                                 
                                   - 
                                   NET 
                                 
                                 ) 
                               
                             
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             f 
                              
                             
                               ( 
                               NET 
                               ) 
                             
                           
                            
                           
                             [ 
                             
                               1 
                               - 
                               
                                 f 
                                  
                                 
                                   ( 
                                   NET 
                                   ) 
                                 
                               
                             
                             ] 
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           y 
                            
                           
                             ( 
                             
                               1 
                               - 
                               y 
                             
                             ) 
                           
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Mathematical 
                      
                     
                         
                     
                      
                     Formula 
                      
                     
                         
                     
                      
                     6 
                   
                   ] 
                 
               
             
           
         
       
     
         [0071]    Loaded sum of the Hidden Layers ‘NET Z ’ and output value ‘z’ can be expressed as shown in the [Mathematical Formula 7]. 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       NET 
                       Z 
                     
                     = 
                     
                       XV 
                       T 
                     
                   
                    
                   
                     
 
                   
                    
                   
                     
                       
                         
                           z 
                           = 
                             
                            
                           
                             f 
                              
                             
                               ( 
                               
                                 NET 
                                 Z 
                               
                               ) 
                             
                           
                         
                       
                     
                     
                       
                         
                           = 
                             
                            
                           
                             1 
                             
                               1 
                               + 
                               
                                 exp 
                                  
                                 
                                   ( 
                                   
                                     1 
                                     - 
                                     
                                       NET 
                                       Z 
                                     
                                   
                                   ) 
                                 
                               
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Mathematical 
                      
                     
                         
                     
                      
                     Formula 
                      
                     
                         
                     
                      
                     7 
                   
                   ] 
                 
               
             
           
         
       
     
         [0072]    Loaded sum of the Output Layers ‘NET Y ’ and final output value ‘y’ can be computed as shown in the [Mathematical Formula 8]. 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       NET 
                       y 
                     
                     = 
                     
                       zw 
                       T 
                     
                   
                    
                   
                     
 
                   
                    
                   
                     
                       
                         
                           y 
                           = 
                             
                            
                           
                             f 
                              
                             
                               ( 
                               
                                 NET 
                                 Y 
                               
                               ) 
                             
                           
                         
                       
                     
                     
                       
                         
                           = 
                             
                            
                           
                             1 
                             
                               1 
                               + 
                               
                                 exp 
                                  
                                 
                                   ( 
                                   
                                     1 
                                     - 
                                     
                                       NET 
                                       Y 
                                     
                                   
                                   ) 
                                 
                               
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Mathematical 
                      
                     
                         
                     
                      
                     Formula 
                      
                     
                         
                     
                      
                     8 
                   
                   ] 
                 
               
             
           
         
       
     
         [0073]    Compare the target value ‘d’ with the final output value ‘y’ and compute a square error ‘E’ as shown in the [Mathematical Formula 9]. 
         [0000]    
       
         
           
             
               
                 
                   E 
                   = 
                   
                     
                       1 
                       2 
                     
                      
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           1 
                         
                         m 
                       
                        
                       
                         
                           ( 
                           
                             
                               d 
                               i 
                             
                             - 
                             
                               y 
                               i 
                             
                           
                           ) 
                         
                         2 
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Mathematical 
                      
                     
                         
                     
                      
                     Formula 
                      
                     
                         
                     
                      
                     9 
                   
                   ] 
                 
               
             
           
         
       
     
         [0074]    Compute an error signal ‘δ yi ’ generated from the neuron i at the Output Layer using the [Mathematical Formula 10]. 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           δ 
                           yi 
                         
                         = 
                           
                          
                         
                           
                             ( 
                             
                               
                                 d 
                                 i 
                               
                               - 
                               
                                 y 
                                 i 
                               
                             
                             ) 
                           
                            
                           
                             
                               f 
                               ′ 
                             
                              
                             
                               ( 
                               
                                 NET 
                                 i 
                               
                               ) 
                             
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             ( 
                             
                               
                                 d 
                                 i 
                               
                               - 
                               
                                 y 
                                 i 
                               
                             
                             ) 
                           
                            
                           
                             
                               y 
                               i 
                             
                              
                             
                               ( 
                               
                                 1 
                                 - 
                                 
                                   y 
                                   i 
                                 
                               
                               ) 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Mathematical 
                      
                     
                         
                     
                      
                     Formual 
                      
                     
                         
                     
                      
                     10 
                   
                   ] 
                 
               
             
           
         
       
     
         [0075]    An error signal ‘δ zi ’ of the neuron j at the Hidden Layer can be computed as shown in the [Mathematical Formula 11]. 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           δ 
                           zi 
                         
                         = 
                           
                          
                         
                           
                             ∑ 
                             
                               i 
                               = 
                               1 
                             
                             m 
                           
                            
                           
                             
                               δ 
                               yi 
                             
                              
                             
                               
                                 w 
                                 ij 
                               
                               · 
                               
                                 
                                   ∂ 
                                   zi 
                                 
                                 
                                   ∂ 
                                   
                                     ( 
                                     
                                       NET 
                                       zi 
                                     
                                     ) 
                                   
                                 
                               
                             
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             
                               f 
                               ′ 
                             
                              
                             
                               ( 
                               
                                 NET 
                                 zi 
                               
                               ) 
                             
                           
                            
                           
                             
                               ∑ 
                               
                                 i 
                                 = 
                                 1 
                               
                               m 
                             
                              
                             
                               
                                 δ 
                                 yi 
                               
                                
                               
                                 w 
                                 ij 
                               
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Mathematical 
                      
                     
                         
                     
                      
                     Formula 
                      
                     
                         
                     
                      
                     11 
                   
                   ] 
                 
               
             
           
         
       
     
         [0076]    Changes of the interface-strength variable ‘Δv k ’ between the Input Layer and the Hidden Layer at the practice step k and the changes of the interface-strength variable ‘Δw k ’ between the Hidden Layer and the Output Layer can be computed as shown in the [Mathematical Formula 12]. 
         [0000]      Δ v   k =αδ z   x   k   +βΔv   k−1  
 
         [0000]      Δ w   k =αδ y   z   k   +βΔw   k−1   Mathematical Formula 12
 
         [0077]    Herein, ‘α’ and ‘β’ represents a corresponding constant for the practice ratio and momentum, respectively. And, ‘δ z ’ and ‘δ y ’ represents an error signal for the Hidden Layer and the Output Layer, respectively. 
         [0078]    Changes of the interface-strength variables ‘Δv’ and ‘Δw’ between the Input Layer and the Hidden Layer depend only on the practice ratio ‘α’ and the error signals ‘δ z ’ and ‘δ y ’. Generally, since the ‘α’ signal is set at a small value, changes of the interface-strength variables at each practice step become relatively smaller, therefore deteriorating a practice speed. However, deterioration of the practice speed can be prevented by adding the momentum constant ‘β’. 
         [0079]    The interface-strength variable ‘v k+1 ’, between the Input Layer and the Hidden Layer and the interface-strength variable ‘w k+1 ’ between the Hidden Layer and the Output Layer at the (k+1) stage can be computed as shown in the [Mathematical Formula 13]. 
         [0000]        v   k+1   =v   k +αδ z   x   k   +βΔv   k−1  
 
         [0000]        w   k+1   =w   k +αδ y   z   k   +βΔw   k−1   Mathematical Formula 13
 
         [0080]    Repeatedly input the input vectors to be practiced and change the interface-strength values. Then, end the practice procedure if the error ‘E’&lt;‘E max ’. 
         [0081]    As indicated in the  FIG. 4 , ‘x’, ‘z’ and ‘y’ each represents the Input Layer ( 110 ), the Hidden Layer ( 120 ) and the Output Layer ( 130 ), respectively. ‘w’ and ‘v’ each represents an inter-layer loaded value of the interface-strength with a default value at 0.5. ‘NETz’ is a loaded sum of the Hidden Layers ( 120 ) while ‘NETy’ represents a loaded sum of the Output Layers ( 130 ). In addition, ‘dz’ and ‘dy’ each represents an error value of the Hidden Layer ( 120 ) and the Output Layer ( 130 ) computed from the sigmoid function, respectively. Based on these error values, changes in the interface-strength values not only between the Hidden Layer ( 120 ) and the Output Layer ( 130 ) and but also between the Input Layer ( 110 ) and the Hidden Layer ( 120 ) can be computed. 
         [0082]    An output value ‘y’ can be computed if an error value ‘a’ different from the target value ‘d’ equals to 0.02 or if the related loop repeats at most 10,000 times. Based on certain input vector values, ongoing practicing for the error values of (‘d’−‘y’) can be repeated with certain loaded values of ‘v’ and ‘w’ changed. 
         [0083]    As shown in the  FIG. 4 , once a certain input pattern is given in each unit at the Input Layer ( 110 ), a related signal is converted in each unit, transferred to the middle layer and outputted at the Output Layer ( 130 ). Modify the interface-strength values to reduce the difference between the output value and expected value. Based on back propagation at upper layers, modify the interface-strength values at lower layers. 
         [0084]    A supervised practice method is adopted to enable a network to compare a certain pattern at the Output Layer converted from the Input Layer with the target pattern and repeat its practice procedure until the output pattern becomes the target pattern. Otherwise, the network modifies the interface-strength values to reduce the difference between the output pattern and the target pattern. This procedure will be repeated until an error ratio equals to 0.02 or if the related loop repeats at most 10,000 times. However, this invention is not constrained by this condition just mentioned. 
         [0085]      FIG. 5  shows a practice mechanism of the Neural Back-Propagation Algorithm for normally loaded vehicles. As shown in the  FIG. 5 ,  20  data for each axle that is not false manipulated are inputted through related sensors. Then, total 100 data are saved as array values and generate related indexing vector data between 0 and 1 through the sigmoid function. 
         [0086]    Data generated here will be repeatedly retrieved to modify related loaded values at each layer until they become ‘Normal’ state of a corresponding neural network. This procedure will be repeated till the number of repeats reaches 10,000 or a particular error value is reached. 
         [0087]      FIG. 6  represents a practice mechanism of the Neural Back-Propagation Algorithm for abnormally-loaded vehicles. As shown in the  FIG. 6 ,  20  data for each axle that is false manipulated are inputted through related sensors. Then, total 100 data are saved as array values and generate related indexing vector data between 0 and 1 through the sigmoid function. 
         [0088]    Data generated here will be repeatedly retrieved to modify related loaded values at each layer until they become ‘abnormal’ state of a corresponding neural network. This procedure will be repeated till the number of repeats reaches 10,000 or a designated error value is reached. 
         [0089]      FIG. 7  illustrates an actual application of the Neural Back-Propagation Algorithm that has been practiced as shown in the  FIGS. 5 and 6 . As shown in the  FIG. 7 , those data received from Weight Sensors are complied in the indexing vector function and flowed into the Neural Back-Propagation Algorithm to output actual results. 
         [0090]    As mentioned above, use of the practiced data enables outputting of each result and automatic retrieval (sequencing) of the algorithm practicing whenever the output results exceed 100 abnormal data. This is intended to reduce normal processing time and deliver relevant results based on pre-determined trials to complete generation of an algorithm. 
         [0091]    Automatic setting of practice hours mentioned above can be executed through the program setting. For example, if it is set at AM 12:00 every Monday for automatic implementation, a new algorithm will be updated for every other 100 abnormal data. ‘Normal’, ‘Retest’ and ‘Abnormal’ Status will be indicated whenever percentage of an inputted data exceeds a set maximum. For example, if less than 60%, it is in the ‘Abnormal’ mode. Likewise, if 61%˜89% and 91%˜100%, then it is in the ‘Retest’ and ‘Normal’ mode, respectively. These ‘Normal’, ‘Retest’ and ‘Abnormal’ Status can be indicated by information of characters, figures, sounds and colors. 
         [0092]    Hereunder, this specification will illustrate a system that is designated to detect an unlawful weight manipulation using the Neural Back-Propagation Algorithm. 
         [0093]      FIG. 8  represents a block diagram of the system for detecting an overload &amp; unlawful and cheating weight measurement. As shown in the  FIG. 8 , the detection system in this invention is configured of the following units; 1) A Vehicle Data Measuring Unit ( 210 ) that measures data of a vehicle, 2) An Artificial Intelligence Processor ( 220 ) that executes an Artificial Intelligence Algorithm to detect an overload &amp; cheating weight measurement based on the data generated from the Vehicle Data Measuring Unit ( 210 ), 3) An Input Unit ( 230 ) that inputs the data into the Artificial Intelligence Processor, 4) A Display Unit ( 240 ) that displays any overload &amp; unlawful weight measurement, 5) A Practice Unit ( 250 ) that executes practice of the artificial intelligence, and lastly 6) A Vehicle DB Unit ( 260 ) that stores the relevant data (e.g. Basic Vehicle Data, algorithm-processed data, etc). 
         [0094]    The Vehicle Data Measuring Unit ( 210 ) is equipped with the following components; 1) A Video Sensor ( 211 ) that identifies a license plate and collects Basic Vehicle Data, 2) A Weight Sensor ( 212 ) that measure a vehicle weight, 3) An Over-height Sensor ( 213 ) that detects over-height of cargoes, 4) An Axle Number Separator ( 214 ) that is utilized whenever relevant axle data cannot be obtained through a license plate, and lastly 5) A Speed Sensor ( 215 ) that measures entering speed of a vehicle. 
         [0095]    The Artificial Intelligence Processor ( 220 ) applied in this invention applies a Neural Back-Propagation Algorithm to detect an unlawful manipulation of weight measurement. 
         [0096]    This processor ( 220 ) is embedded with the hardware (CPU, RAM, ROM, etc), the software to run the hardware and the software to execute the Neural Back-Propagation Algorithm. 
         [0097]    The Input Unit ( 230 ) is an input device that is designated to input various vehicle data into the Artificial Intelligence Processor ( 220 ). The Display Unit ( 240 ) displays those data processed through Artificial Intelligence Processor ( 220 ). 
         [0098]    The Practice Unit ( 250 ) executes practice of the Neural Back-Propagation Algorithm and may be included in the Artificial Intelligence Processor ( 220 ). 
         [0099]    The Vehicle DB Unit ( 260 ) stores the relevant vehicle data for detection of an unlawful manipulation of weight measurement. This DB unit ( 260 ) stores and controls the following data; 1) Basic Vehicle Data ( 261 ) such as weight, # wheels and # axles, 2) False Manipulated Axle Data ( 262 ) such as weights manipulated through the axle No. 1 /No. 2 /No. 3 /No. 4 /No. 5  adjustments, and 3) Measured Information ( 263 ) generated from the Artificial Intelligence Processor ( 220 ). 
         [0100]      FIGS. 9 and 10  shows a diagram and flow chart of the detection algorithms applied in this invention. In addition,  FIG. 11  illustrates a sequence diagram of the detection procedures applied in this invention. 
         [0101]    As depicted in the  FIG. 9  or  11 , signals input into each device of the Vehicle Data Measuring Unit ( 210 ) represent particular data (e.g. axle data, # wheels at equilibrium, vehicle dead weight, entering vehicle speed, over-height of cargoes, normal weight, false manipulated weights through the axle No. 1 /No. 2 /No. 3 /No. 4 /No. 5  adjustments) and are included in the indexing vectors for a Basic Practice Procedure (S 310 ). 
         [0102]    After the practice procedure is completed, the Video Sensor ( 210 ) identifying a license plate of a vehicle retrieves basic data of the vehicle. The Basic Vehicle Data just mentioned could include the following data; truck dead weight without any cargoes, # wheels and # axles (S 320 ). These Basic Vehicle Data can be effectively sorted out through data retrieval from the Vehicle DB Unit ( 260 ). 
         [0103]    Then, the Weight Sensor ( 220 ), the Over-height Sensor ( 230 ), the Axle Number Separator ( 240 ) and the Speed Sensor ( 250 ) detect Current Vehicle Information (S 330 ) such as cargoes load, cargoes height and entering speed. Whenever axles of a vehicle cannot be detected through its license plate, the Axle Number Separator can be utilized to detect such axle data. 
         [0104]    Basic Vehicle Data retrieved and current vehicle data detected are used to compute corresponding load data for each axle adjustment in the Vehicle DB Unit ( 260 ) (S 340 ). The Neural Back-Propagation Algorithm with those retrieved, detected and computed data factored in is then executed (S 350 ) to categorize certain Unlawful Weight Measuring Types (S 360 ). That is, those data processed through the detection procedure mentioned above are converted into data with certain patterns through the indexing vectors and categorized as ‘Normal’, ‘Abnormal’ and ‘Retest’ groups through the neural network algorithm. This procedure executing the neural network algorithm was previously illustrated in the  FIG. 4 ,  5  or  7 . 
         [0105]    As illustrated in the  FIG. 5  or  7 , ‘Normal’, ‘Abnormal’ and ‘Retest’ Status can be alarmed whenever certain data passing each algorithm exceed pre-determined maximums. For example, related alarms will be activated for the following cases; Abnormal loading if &gt;90%, Normal loading if &lt;50% and Retest if 60-80%. However, this invention is not constrained by these alarming conditions. Furthermore, these ‘Normal’, ‘Retest’ and ‘Abnormal’ Status can be indicated by characters, figures, sounds and colors. 
         [0106]    If certain indexing vectors with values between 0 and 1 are generated for practice of the neural network algorithm based on such data as axle data, dead weight without any cargoes, maximum pay load, entering speed, over-height data and weight on each axle, final output values (both Normal and Abnormal output values) based on these indexing vectors can be generated through continuous changes in the interface-strength values at the middle layer and set as the system&#39;s default values. 
         [0107]    Once those default values mentioned above are set, it could be concluded that the neural network algorithm has completed its practice procedure. This implies that the practice-completed neural network is capable of determining ‘Normal’, ‘Retest’ and ‘Abnormal’ Status for all information, whether known or unknown, based on the results of the interface-strength values. 
         [0108]      FIG. 12  shows actual information samples generated from the detection method applied in this invention. These data represents the information generated from actual axle manipulation techniques based on the basic algorithm data. These data are analyzed for certain patterns and factored in the system. 
         [0109]    Although this specification has not touched on the hardware compatibility so far, the system applied in this invention is compatible with regular computers or high performance DSP (Digital Signal Processor). Moreover, an applicable algorithm for this invention is not limited to the Neural Back-Propagation Algorithm. That is, various algorithms (e.g. fuzzy algorithm, etc) other than the Neural Back-Propagation Algorithm can also be applied to this invention. 
         [0110]    Likewise, this invention is not limited to the explanation and example specified in this specification. Therefore, various revised or modified invention derivatives to this invention may be created within this technology art and the scope of patent claims of this invention by anyone in this technology art with common knowledge and skills. 
       EXPLANATION OF SYMBOLS 
       [0000]    
       
         
           
               110 : Input Layer 
               120 : Hidden Layer 
               130 : Output Layer 
               210 : Vehicle Data Measuring Unit 
               211 : Video Sensor for License Plate 
               212 : Weight Sensor 
               213 : Over-height Sensor 
               214 : Axle Number Separator 
               215 : Speed Sensor 
               220 : Artificial Intelligence Processor 
               230 : Input Unit 
               240 : Display Unit 
               250 : Practice Unit 
               260 : Vehicle DB Unit 
               261 : Basic Vehicle Data 
               262 : False Manipulation Information of Axle 
               263 : Measurement Data