EP1944737A1 - Modèle de validation pour support de valeur de classes multiples - Google Patents

Modèle de validation pour support de valeur de classes multiples Download PDF

Info

Publication number
EP1944737A1
EP1944737A1 EP07254912A EP07254912A EP1944737A1 EP 1944737 A1 EP1944737 A1 EP 1944737A1 EP 07254912 A EP07254912 A EP 07254912A EP 07254912 A EP07254912 A EP 07254912A EP 1944737 A1 EP1944737 A1 EP 1944737A1
Authority
EP
European Patent Office
Prior art keywords
media item
template
class
classes
multiple classes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP07254912A
Other languages
German (de)
English (en)
Inventor
Chao He
Gary A. Ross
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NCR Voyix Corp
Original Assignee
NCR Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US11/888,683 external-priority patent/US8503796B2/en
Application filed by NCR Corp filed Critical NCR Corp
Publication of EP1944737A1 publication Critical patent/EP1944737A1/fr
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07D—HANDLING OF COINS OR VALUABLE PAPERS, e.g. TESTING, SORTING BY DENOMINATIONS, COUNTING, DISPENSING, CHANGING OR DEPOSITING
    • G07D7/00—Testing specially adapted to determine the identity or genuineness of valuable papers or for segregating those which are unacceptable, e.g. banknotes that are alien to a currency
    • G07D7/20—Testing patterns thereon
    • G07D7/2016—Testing patterns thereon using feature extraction, e.g. segmentation, edge detection or Hough-transformation
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07D—HANDLING OF COINS OR VALUABLE PAPERS, e.g. TESTING, SORTING BY DENOMINATIONS, COUNTING, DISPENSING, CHANGING OR DEPOSITING
    • G07D7/00—Testing specially adapted to determine the identity or genuineness of valuable papers or for segregating those which are unacceptable, e.g. banknotes that are alien to a currency
    • G07D7/20—Testing patterns thereon
    • G07D7/202—Testing patterns thereon using pattern matching
    • G07D7/206—Matching template patterns

Definitions

  • an automatic handling system such as banknote sorter or an intelligent deposit or recycling ATM
  • the system must recognize the items to determine to which of multiple possible classes (e.g. , which currency and denomination) each item belongs and, on recognition, must assess whether the item is genuine or counterfeit (i.e. , "validate" the item).
  • classes e.g. , which currency and denomination
  • These systems typically achieve recognition and validation of valuable items by using templates developed previously from training data taken from items of the type to be handled.
  • a unique template is developed for every unique "class" of media item that the systems are expected to handle. For example, for currency-handling systems, a unique template is created for every possible combination of currency, series, denomination and orientation ( i.e. , orientation of the bank note upon insertion into the handling system).
  • the technique involves accessing a template that comprises multiple one-class classifiers, each corresponding to one of multiple classes to which the media item might belong, and then applying each of the one-class classifiers to an image of the media item to generate a result set for each of the multiple classes.
  • the result set for each media class is then analyzed to assess whether the media item belongs to that class.
  • the technique involves receiving images of multiple media items of similar type, where each of the images belongs to one of multiple classes associated with media items of that type. The images are then used to create a single segmentation map that represents media items belonging to all of the multiple classes. The images and the segmentation map are then used together to create multiple one-class classifiers, where each of the one-class classifiers is associated with one of the multiple classes. The template is then defined to include the segmentation map and the multiple one-class classifiers.
  • Described below is a technique for use in creating automated media-validation templates and then using these templates in systems that accept any form of valuable media from users of those systems.
  • the technique is particularly useful in automated validation of bank notes in any type of self-service terminal configured to receive bank notes, including automated teller machines (ATMs) with note-deposit capabilities, ticket vending machines, currency-exchange machines, self-service kiosks, and the like.
  • ATMs automated teller machines
  • the description below concentrates most heavily on the validation of bank notes, but the techniques are useful in the automated validation of virtually any type of valuable media.
  • the technique for creating media-validation templates draws upon the template-creation process described in the two related applications that are incorporated by reference above. That process involves the creation of a one-class classifier for use in automated assessment of the validity of a bank note or other valuable media, using a currency template that is built upon a statistical representation of the sub-regions of one or more genuine bank notes, and only genuine bank notes - no statistical representation of counterfeit bank notes is necessary.
  • the classifier created in that process is a "one-class” classifier in that, in determining the validity of each note, it requires statistical information from genuine notes only and, with this information, concludes either that the note in question does belong to the class ( i.e., is "genuine") or does not belong to the class ( i.e., is counterfeit).
  • each note "class” is defined by a particular combination of currency (e . g ., U.S. Dollars), denomination (e . g ., $5, $10, $20 denominations), series ( e . g ., a 2003 $5 bill vs. a 2006 $5 bill), and orientation ( i . e ., front-side right edge first, front-side left edge first, back-side right edge first, back-side left edge first).
  • the note would be compared against only one of these sixteen templates - i . e ., the template corresponding to the note's denomination, series, and orientation of insertion into the handling system.
  • the process described below modifies the process of the two related applications to require only a single media-validation template for a given media item, regardless of how many classes might exist for that item. For example, for the currency described above having two denominations each produced under two different series and having sixteen total classes, the process set forth below would not produce sixteen validation templates for the currency, but rather would produce only two templates - one for each denomination of the currency. Each of these templates would be used in assessing the validity of all eight of the classes that exist for one of the two denominations, including the classes that correspond to both production series and to all four note orientations. Before the modifications are described, however, a summary of the process described in the two related applications is in order.
  • the template-creation process involves capturing images of multiple bank notes (Notes I to N) for each note class.
  • the images are generated in any of multiple possible image "channels," each representing either the transmission or reflection characteristics of the bank notes when illuminated at a selected frequency or range of frequencies - e . g ., red, green, blue, infrared and ultraviolet.
  • the images of the notes in each class have an image size determined by the number of pixels contained in each image - an image that is R pixels high and C pixels wide has an image size of RxC.
  • Each of the pixels in an image has an intensity value P which is easily measured using known techniques.
  • P ij n the pixel intensity value at the i th row and the j th column of the n th note.
  • the intensity values for all pixels in the image of the first note are aligned in the first row; the intensity values for all pixels in the image of the second note are aligned in the second row; and so on, with intensity values for all pixels in the image of the N th note aligned in the N th row.
  • the columns of the matrix provide a "pixel-position profile" for all of the images in the class - i.e. , each column indicates the intensity values for all pixels in a given position across all of the notes in the class. For example, in the example of FIG.
  • the first column of the matrix indicates the image intensities for all pixels in the first row and first column (upper left corner) of the note images; the last column of the matrix indicates the image intensities for all pixels in the R th row and C th column (lower right corner) of the note images.
  • a clustering algorithm is then applied to the image-intensity matrix to group the pixel positions into M subgroups, or "segments.” To accomplish this, a similarity measure is calculated for every pair of pixel positions using the intensity values for the pixels in each pair, e.g., by calculating the Euclidean distance between column vectors in the matrix.
  • This clustering process takes place in an iterative manner, and, after the results of the algorithm have converged around the M segments, every pixel position is assigned a "membership index” indicating to which of the M segments it belongs.
  • the set of membership-index values across the entire RxC image size form a "segmentation map" for the note class.
  • Each pixel position in the map is has a numerical value of "1," "2" or "3,” where a value of "1” represents very dark pixels, a value of "3” represents very light pixels, and a value of "2" represents pixels that are somewhere between light and dark.
  • This segmentation map applies to all N of the notes in the training set for the note class and, in some systems, is used in the recognition and validation processes with images taken from any and all of the available image channels.
  • the map is applied as a mask to extract discriminative information from each of the N images in the class, as shown in FIG. 5 .
  • applying the segmentation map creates, for each note, three mean intensity values - S 1 , S 2 , and S 3 - one for each of the three segments defined in the segmentation map.
  • the mean-intensity values for all of the N notes in the training set are then combined to create a "feature set matrix" F for the note class, as shown in FIG. 6 .
  • Each row in the matrix holds the mean intensity values for the M segments of a single one of the notes in the training set.
  • the feature set matrix is an Nx3 matrix - N notes each having three segments.
  • FIGS. 7A through 7D show a valuable media item, such as a bank note, having four different classes defined by the four possible length-wise orientations in which the item can be inserted into an automatic handling system.
  • the solid lines appearing within the media item in FIGS. 7A and 7B represent features that are visible on the surface of the item when it is inserted into the handling system front-side up, where the orientation shown in FIG. 7B represents a 180-degree rotation from the orientation shown in FIG. 7A.
  • FIGS. 7C and 7D represent orientations of the item when it is inserted into the handling system back-side up, with the dashed lines indicating that the features appearing on the front side of the item are not visible in these orientations with the naked eye.
  • each segmentation map is created from images of items all belonging to the same class
  • the process described here creates a segmentation map from images of items belonging to different classes - for example, from images of items having the four orientations shown in FIG. 7A through 7D .
  • the training images for all possible classes are processed together, with the resulting image-intensity matrix (see FIG. 3 ) representing a "pseudo image" that would look something like that shown in FIG. 8 - an image showing features of the media item as they would appear if images of the item in all four orientations were overlaid on one another.
  • FIG. 9 shows a segmentation map having three segments that would result from the example of FIGS. 7A through 7D .
  • the first of these segments having a numerical value of "1" and representing very dark pixel positions, includes four groups of pixel positions having rectangular shapes.
  • the second of these segments having a numerical value of "2" and representing moderately dark pixel positions, includes two groups of pixel positions running vertically across the note and surrounding the groups that form the first segment.
  • the third segment represents very light pixel positions and includes all of the pixel positions not assigned to the first or second segments.
  • the template-creation process relies on clustering technologies to create K one-class classifiers that work in conjunction with the segmentation map in the validation process, where K is the total number of classes to be associated with each validation template.
  • K is the total number of classes to be associated with each validation template.
  • the validation template for each denomination would include eight one-class classifiers stored with a single segmentation map.
  • clustering technologies such as K-means clustering, hierarchical clustering, nearest-neighbor clustering and kernel clustering are used to discover the internal organization of a dataset by finding structure within the data in the form of clusters.
  • the template-creation process described here applies any of these well-known clustering technologies to the images of a media item - including images corresponding to all classes of the item to be covered by a single validation template - to group the image data into several clusters according to a similarity measure defined by the clustering algorithm.
  • the clustering algorithm divides the image data into K clusters.
  • the number of clusters K 4 N s , where four is the number of possible orientations in which a note can be inserted into a handling system.
  • the clustering process might produce a set of four clusters looking something those shown in FIG. 10 .
  • FIG. 11 is a flow diagram showing a process for use in creating a validation template using the segmentation map and cluster data described above, for example, a validation template for a denomination of bank notes having K classes to be covered by the template.
  • the process begins when a training system collects a data set X of images from a training set of bank notes of the selected denomination (step 1100).
  • the data set includes images from all of the bank notes of the selected denomination without regard to the classes to which the images belong - e.g. , without regard to the production series or orientations of the corresponding notes.
  • the training system uses the images in the data set X to create a segmentation map S m for the selected denomination, like the one described above and shown in FIG. 9 (step 1110).
  • the training system After creating the segmentation map S m and the K clusters X i , the training system applies the segmentation map S m to each of the K clusters X i to extract feature set matrices F i for the clusters X i (step 1130), in the manner described above in connection with FIG. 6 .
  • the training system then calculates, for each of the K feature set matrices F i , the mean vector ⁇ i , the covariance matrix ⁇ i , and the critical value f ci (step 1140).
  • the formulas for calculating all three of these elements are well known in the art and are not described in any detail here. These three elements together form the parameters of a one-class classifier for each of the K clusters.
  • the training set Upon calculating the parameters of the one-class classifiers for each of the K clusters, the training set stores these parameters along with the segmentation map S m as the validation template for the selected currency denomination (step 1150). This validation template is then distributed to note handling systems for use in assessing the validity of bank notes of the currency and denomination associated with the template.
  • FIG. 12 shows a process for use in an automated media handling system in assessing the validity of media items of a certain type having multiple classes.
  • the process is particularly suited, e.g. , for the validation of bank notes of a selected denomination in an automated teller machine (ATM) or a currency-exchange recycler, regardless of the number of production series associated with the denomination or the orientations of the bank notes as they are inserted into the system ( i.e. , regardless of the number of classes to which bank notes of that denomination may belong).
  • ATM automated teller machine
  • a currency-exchange recycler regardless of the number of production series associated with the denomination or the orientations of the bank notes as they are inserted into the system ( i.e. , regardless of the number of classes to which bank notes of that denomination may belong).
  • the validation process begins when the system receives a bank note and creates one or more digital images of the bank note (step 1200).
  • a note-recognition module in the system analyzes the note image and identifies both the currency and the denomination of the note (step 1210).
  • a validation module in the system receives the currency and denomination information from the recognition module and retrieves the appropriate validation template from a prescribed storage location, where the validation template includes the K one-class classifier parameters and the segmentation map described above (step 1220).
  • the validation module applies the segmentation map to the note image to extract a feature set for the note (step 1230).
  • the feature set for an individual note is a vector like those that form the rows of the feature set matrix described above.
  • the validation module then retrieves the mean vector and covariance matrix stored for each of the K one-class classifiers and uses these parameters, along with the feature set vector for the note, to calculate a test statistical value for the note with respect to each of the K one-class classifiers (steps 1240 1-K ).
  • the validation module compares this value for the note to the critical values stored for each of the K one-class classifiers (step 1250). If the validation module concludes that the test statistical value for the note fulfills the criterion defined by the critical value for one of the K one-class classifiers, then the validation module concludes that the note is a valid note and instructs the handling system to accept the note (step 1260).
  • the validation module concludes that the note's test statistical value does not fulfill the criteria defined by the critical values of any of the K one-class classifiers, the validation module concludes that the note is invalid or suspect and instructs the handling system either to return the note to the user or to divert the note to a rejected-note bin (step 1270).
  • the various implementations of the techniques described above are realized in electronic hardware, computer software, or combinations of these technologies. Most implementations include one or more computer programs executed by a programmable computer.
  • the computer includes one or more processors, one or more data-storage components (e.g. , volatile and nonvolatile memory modules and persistent optical and magnetic storage devices, such as hard and floppy disk drives, CD-ROM drives, and magnetic tape drives), one or more input devices (e.g. , mice and keyboards), and one or more output devices (e.g. , display consoles and printers).
  • processors e.g. , volatile and nonvolatile memory modules and persistent optical and magnetic storage devices, such as hard and floppy disk drives, CD-ROM drives, and magnetic tape drives
  • input devices e.g. , mice and keyboards
  • output devices e.g. , display consoles and printers.
  • the computer programs include executable code that is usually stored in a persistent storage medium and then copied into memory at run-time.
  • the processor executes the code by retrieving program instructions from memory in a prescribed order.
  • the computer receives data from the input and/or storage devices, performs operations on the data, and then delivers the resulting data to the output and/or storage devices.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Inspection Of Paper Currency And Valuable Securities (AREA)
EP07254912A 2006-12-29 2007-12-18 Modèle de validation pour support de valeur de classes multiples Withdrawn EP1944737A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US87783906P 2006-12-29 2006-12-29
US11/888,683 US8503796B2 (en) 2006-12-29 2007-08-02 Method of validating a media item

Publications (1)

Publication Number Publication Date
EP1944737A1 true EP1944737A1 (fr) 2008-07-16

Family

ID=39247372

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07254912A Withdrawn EP1944737A1 (fr) 2006-12-29 2007-12-18 Modèle de validation pour support de valeur de classes multiples

Country Status (1)

Country Link
EP (1) EP1944737A1 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011082793A1 (fr) * 2009-12-16 2011-07-14 Giesecke & Devrient Gmbh Procédé pour vérifier des documents de valeur
WO2011082792A1 (fr) * 2009-12-16 2011-07-14 Giesecke & Devrient Gmbh Procédé pour vérifier des documents de valeur
WO2012084145A1 (fr) * 2010-12-23 2012-06-28 Giesecke & Devrient Gmbh Procédé et dispositif de détermination d'un ensemble de données de référence de classe, pour la classification de documents de valeur
EP3285210A4 (fr) * 2015-04-13 2018-06-20 GRG Banking Equipment Co., Ltd. Procédé d'identification de billet de valeur
EP3410409A1 (fr) * 2017-05-30 2018-12-05 NCR Corporation Validation de sécurité multimédia
EP4435746A1 (fr) * 2023-03-24 2024-09-25 CI Tech Sensors AG Procédé, support lisible par ordinateur et dispositif de commande

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5542518A (en) * 1994-05-25 1996-08-06 Toyo Communication Equipment Co., Ltd. Method of identifying the denominations of pieces of paper
US20020044677A1 (en) * 2000-10-18 2002-04-18 De La Rue International Limited Denomination identification
EP1484719A2 (fr) * 2003-06-06 2004-12-08 Ncr International Inc. Vérification de monnaie

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5542518A (en) * 1994-05-25 1996-08-06 Toyo Communication Equipment Co., Ltd. Method of identifying the denominations of pieces of paper
US20020044677A1 (en) * 2000-10-18 2002-04-18 De La Rue International Limited Denomination identification
EP1484719A2 (fr) * 2003-06-06 2004-12-08 Ncr International Inc. Vérification de monnaie

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
HE C ET AL: "Employing optimized combinations of one-class classifiers for automated currency validation", PATTERN RECOGNITION, ELSEVIER, GB, vol. 37, no. 6, June 2004 (2004-06-01), pages 1085 - 1096, XP004505313, ISSN: 0031-3203 *

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011082793A1 (fr) * 2009-12-16 2011-07-14 Giesecke & Devrient Gmbh Procédé pour vérifier des documents de valeur
WO2011082792A1 (fr) * 2009-12-16 2011-07-14 Giesecke & Devrient Gmbh Procédé pour vérifier des documents de valeur
WO2012084145A1 (fr) * 2010-12-23 2012-06-28 Giesecke & Devrient Gmbh Procédé et dispositif de détermination d'un ensemble de données de référence de classe, pour la classification de documents de valeur
RU2562758C2 (ru) * 2010-12-23 2015-09-10 Гизеке Унд Девриент Гмбх Способ и устройство для определения эталонного набора данных класса для классификации ценных документов
US9690841B2 (en) 2010-12-23 2017-06-27 Giesecke & Devrient Gmbh Method and apparatus for determining a class reference data record for the classification of value documents
EP3285210A4 (fr) * 2015-04-13 2018-06-20 GRG Banking Equipment Co., Ltd. Procédé d'identification de billet de valeur
US10235595B2 (en) 2015-04-13 2019-03-19 Grg Banking Equipment Co., Ltd. Value bill identifying method
EP3410409A1 (fr) * 2017-05-30 2018-12-05 NCR Corporation Validation de sécurité multimédia
US10475846B2 (en) 2017-05-30 2019-11-12 Ncr Corporation Media security validation
EP4435746A1 (fr) * 2023-03-24 2024-09-25 CI Tech Sensors AG Procédé, support lisible par ordinateur et dispositif de commande
WO2024200272A1 (fr) * 2023-03-24 2024-10-03 Ci Tech Sensors Ag Procédé, support lisible par ordinateur et dispositif de commande

Similar Documents

Publication Publication Date Title
US8625876B2 (en) Validation template for valuable media of multiple classes
US8611665B2 (en) Method of recognizing a media item
JP5219211B2 (ja) 銀行券の確認方法及びその装置
US7639858B2 (en) Currency validation
US6424728B1 (en) Method and apparatus for verification of signatures
EP1489562B1 (fr) Système et méthode pour suivre la trace de billets de banque
EP1944737A1 (fr) Modèle de validation pour support de valeur de classes multiples
CN101366061B (zh) 检测改进质量的伪造介质
Amirsab et al. An automated recognition of fake or destroyed Indian currency notes
EP4033376B1 (fr) Système informatique distribué d'authentification de document
CN113936374A (zh) 一种基于双注意力机制的纸币鉴别方法
CN107240184B (zh) 一种塑料币版本识别的方法、装置及设备
CN110969757A (zh) 一种多国钞票类型快速识别技术
WO2017046561A1 (fr) Procédé et système de détection de coloration
Hardani et al. Identify the authenticity of rupiah currency using k nearest neighbor (K-NN) algorithm
Nagayoshi et al. Banknote identification based on characteristic differences
Deepesh DETECTION OF COUNTERFIET CURRENCY USING K-NN SUPERVISED ALGORITHM
Kavinila et al. Detection and Implementation of Indian Currencies Based on Computer Vision Approach

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK RS

17P Request for examination filed

Effective date: 20090116

17Q First examination report despatched

Effective date: 20090219

AKX Designation fees paid

Designated state(s): DE ES FR GB HU IT

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NCR CORPORATION

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN

18W Application withdrawn

Effective date: 20180314