Xerox Corporation

Conduent Business Services, LLC

Herve Poirier

Florent C Perronnin

Caroline Privault

Nelly Tarbouriech

Jean-Luc Meunier

Frederic Roulland

Victor Ciriza

Gabriela Csurka

Nicolas Monet

Jose Antonio Rodriguez Serrano

Jose Antonio Rodriguez-Serrano

Saghar Estehghari

Nidhi Singh

Jean-Marc Coursimault

Harsimrat Singh Sandhawalia

Gilbert Harrus

A system and method for preserving privacy of evidence are provided. In the method, an encrypted first image is generated by encrypting a first image acquired at a first location with a symmetric cryptographic key that is based on first information such as a license plate number extracted from the first image and first metadata associated with the first image, such as a time at which the first image was acquired. When a link is established between a second image and the first image, for example, through visual signature matching, the symmetric cryptographic key can be reconstructed, without having access to the first image, but based instead on the first metadata and information extracted from the second image. The reconstructed symmetric cryptographic key can then be used for decryption of the encrypted image to establish evidence that the license plate number was indeed extracted from the first image.

Privacy-preserving evidence in ALPR applications

Methods, systems and processor-readable media for vehicle classification. In general, one or more vehicles can be scanned utilizing a laser scanner to compile data indicative of an optical profile of the vehicle(s). The optical profile associated with the vehicle(s) is then pre-processed. Particular features are extracted from the optical profile following pre-processing of the optical profile. The vehicle(s) can be then classified based on the particular features extracted from the optical feature. A segmented laser profile is treated as an image and profile features that integrate the signal in one of the two directions of the image and Fisher vectors which aggregate statistics of local 'patches' of the image are computed and utilized as part of the extraction and classification process.

Vehicle classification from laser scanners using fisher and profile signatures

Methods and systems for dynamically training a web crawler. The web crawler maintains one or more categories each comprising a set of words. The method includes selecting at least one hyperlink in response to a query received from a user. The method further includes determining a hyperlink score for the at least one hyperlink based on a category score associated with each of one or more categories. The category score associated with each of the one or more categories is updated based at least in part on the hyperlink score. The updated category score is compared with the hyperlink score to select a category from the one or more categories. The set of words associated with the category is updated based on content of a web page pointed by the at least one hyperlink.

Systems and methods of web crawling

A method for recognition of an identifier such as a license plate includes storing first visual signatures, each extracted from a first image of a respective object, such as a vehicle, captured at a first location, and first information associated with the first captured image, such as a time stamp. A second visual signature is extracted from a second image of a second object captured at a second location and second information associated with the second captured image is acquired. A measure of similarity is computed between the second visual signature and at least some of the first visual signatures to identify a matching one. A test is performed, which is a function of the first and the second information associated with the matching signatures. Only when it is confirmed that the test has been met, identifier recognition is performed to identify the identifier of the second object.

Delayed vehicle identification for privacy enforcement

To compute a signature for an object comprising or represented by a set of vectors in a vector space of dimensionality D, statistics are computed that are indicative of distribution of the vectors of the set of vectors amongst a set of regions R, i=1, . . . , N of the vector space, at least some statistics associated with each region are binarized to generate sets of binary values a, i=1, . . . , N indicative of statistics of the vectors of the set of vectors belonging to the respective regions R, i=1, . . . , N; and a vector set signature is defined for the set of vectors including the sets of binary values a, i=1, . . . , N. The computing, binarizing, and defining operations may be repeated for two sets of vectors, and a quantitative comparison of the two sets of vectors determined based on the corresponding vector set signatures.

Compact signature for unordered vector sets with application to image retrieval

Multiword expressions are mapped to identifiers using finite-state networks. Each of a plurality of multiword expressions is encoded into a regular expression. Each regular expression encodes a base form common to a plurality of derivative forms defined by ones of the multiword expressions. Each of the plurality of regular expressions is compiled with factorization into a set of finite-state networks. A union of the finite-state networks in the set of finite-state networks is performed to define a multiword finite-state network and a set of subnets. The multiword finite-state network and the set of subnets are traversed to identify a path corresponding to one of the plurality of multiword expressions, wherein only transitions originating from the multiword finite-state network are accounted for to ascertain a path number identifying a base form of the one of the plurality of multiword expressions.

Method and apparatus for mapping multiword expressions to identifiers using finite-state networks

Words of an input string are morphologically analyzed to identify their alternative base forms and parts of speech. The analyzed words of the input string are used to compile the input string into a first finite-state network. The first finite-state network is matched with a second finite-state network of multiword expressions to identify all subpaths of the first finite-state network that match one or more complete paths in the second finite-state network. Each matching subpath of the first finite-state network and path of the second finite-state network identify a multiword expression in the input string. The morphological analysis is performed without disambiguating words and without segmenting the input string into sentences in the input string to compile the first finite-state network with at least one path that identifies alternative base forms or parts of speech of a word in the input string.

Method and apparatus for recognizing multiword expressions

The invention relates to a method and a computer system for enhanced part-of-speech (POS-) tagging as well as grammatically disambiguating a phrase. A phrase is usually a short multiword expression that may be ambiguous. By introducing grammatical constraints the invention supports POS-tagging as well as grammatically disambiguating the phrase. According to an identifier for the phrase, the phrase is supplemented with artificial context information. The supplemented phrase is then POS-tagged or grammatically disambiguated. Important applications are POS-tagging, Automatic Term Encoding, Headword Detection and Information Retrieval.

Method and computer system for part-of-speech tagging of incomplete sentences

An executable for a new linguistic service is produced using preexisting source code for an ancestor service that is a less specified ancestor of the new linguistic service in a hierarchy. The preexisting source code is modified, such as by further specifying it, to produce modified source code for responding to requests for the new linguistic service, where each request identifies the new linguistic service and indicates linguistic data on which it is to be performed. The modified source code is then used to produce the executable for the new linguistic service. The preexisting source code can, for example, define a top-level class in an object-oriented programming language, with common parameters including input parameters with information for obtaining the linguistic data and result parameters with information for returning results of the new linguistic service.

Growing community of inventors

Meylan, France

Herve Poirier