Discrete Point Based Signatures and Applications to Document ...
Recommend Documents
Applications to Document Matching. Nemanja Spasojevic1, Guillaume Poncin2, and Dan Bloomberg3. Google Inc., 1600 Amphitheatre Parkway, Mountain View ...
similarity detection and image lookup from a database of indexed images. This .... 3: Signature precision/recall evaluat
Available online 6 May 2011 ... generate the chameleon signature without interacting with the designated recipient, and ... This will create a strong disincentive.
Abstract. In this paper, we propose two group-oriented (t; n) blind threshold signature schemes based on the discrete logarithm problem. By these schemes, any ...
Instead of a single signer, two blind threshold signature schemes 15] have .... The digital signature scheme with the restoration method can be de ned similarly.
Since blind signature schemes provide perfect unlinkability, such e-cash ...... 16] Solms, S and Naccache, D On blind signatures and perfect crime, Computer &.
A Digital Image-based Elasto-Tomography (DIET) system for breast cancer ... paper presents a part of the 3D surface motion capture process, the problem of ...
The Fiat-Shamir paradigm of transforming identification schemes into digital .... elements r0,r1,...,rn as well as a limited access to a discrete log oracle DLOM. A.
the adversary to learn the group secret key. So far, the on-line e-cash systems proposed in [2, 6] are the most efficient and prac- tical ones. The aim of these ...
Jul 19, 1995 - Theoretical Computer Science and Information Security. Technical Report. TR-95-11-D. Comment: \Cryptanalysis" of the blind signatures ...
Dec 4, 2014 - Department of Mathematics, University of Georgia, Athens GA ...... Motion capture using joint ... PhD thesis, Carnegie Mellon University, 1999. ...... [14] DGtal: Digital geometry tools and algorithms library. http://libdgtal.org.
Freeman 1993. J.K. Truss. Discrete Mathematics for Computer Science,. Addison
-Wesley 1991. R. Johnsonbaugh. Discrete Mathematics, Prentice Hall 2000.
application of verifiable encryption to group signatures with separability, these schemes do not need ... A verifiable encryption scheme is in its basic form a two-party protocol between a prover Ð and a ... Examples are digital pay- mentsystems ...
series of expanding ellipses with focal starting point and target point, and its total ... among the vertex of obstacles that caused collisions. This algorithm does not ...
I wanted to give students studying computer science all of ..... A two-term introductory course can include all the opti
Matthew Walsh. Indiana-Purdue University, Fort. Wayne. Gideon Weinstein. Western Governors University. David Wilczynski.
b) The apple trees will bloom if it stays warm for a week. ...... by her mother, who encouraged her intellectual talents
memory and time required to perform it, are all covered in this text. Algorithms ... There are many applications to comp
Finally, we apply the proposed multi-certification signature scheme to public key infrastructure (PKI) and privilege management infrastructure (PMI), and.
Now assume that in order to create a certain signature at least k out of the. n parties need to combine their ... ing a digital signature). We consider the use of ring ...
hiding his identity. The scheme is said to be signer ambiguous in the sense that ... Emmanuel Bresson, Jacques Stern and Michael Szydlo public key, no setup ...
DISCRETE MATHEMATICS WITH APPLICATIONS, 4th Edition by Susanna S.
Epp. Great effort was made to insure as error-free a product as possible.
Weak dependencies have been ignored. More details can be found in the ...... We can construct compound propositions usin
Fixed point theory is a fascinating subject, with an enormous number of applications in various fields of mathematics. Maybe due to this transversal character, ...
Discrete Point Based Signatures and Applications to Document ...
Sep 15, 2011 - Based Signatures and Applications to. Document Matching. Nemanja Spasojevic, Guillaume Poncin, and Dan Bloomberg. September 15 th.
Discrete Point Based Signatures and Applications to Document Matching Nemanja Spasojevic, Guillaume Poncin, and Dan Bloomberg September 15th 2011, Ravenna, Italy
Background (Duplicate Page Detection) ● Find duplicate pages for a given set of scans of physically same book. Assumption: ○ has to handle at time corpus of ~10k text pages ○ pages rich in text ○ < 4o of rotation from image to image ○ some translation ○ needs to be quick ○ simple to use (discrete signatures, for easy indexing / lookup)
Background (example)
Background (Image Lookup) ● See how well we perform in image lookup mode. Test how robust algorithm is for something it was not designed for: ○ index clean, images ○ lookup by image take with cell phone camera ○ skew ○ rotation ○ blur ○ part of original page
Other Aproaches ● Image matching well studied problem ○ SURF, SIFT, FIT work well at point matching across images and image lookup ○ do not work as well for repetetive patterns such as text documents ● Document page matching ○ Locally Likely Arrangement Hashing (LLAH), Nakai, et. al. ■ affine invariant ■ produces thousands of signatures per page ■ precise ■ handles 10k image corpus
Algorithm Possible inputs: ● raw image (operate on word centroids) ● OCR-ed text with word bounding boxes (operate on word bounding box center) ● PDF with word bounding box info (operate on word bounding box center)
Algorithm (Image Processing)
Signature Generation Algorithm
Signature Instability Signature is composed of N sub-signatures: S = [s(0)][s(1)]...[s(N-1)] Instability of signatures comes from: ● Small shifts may lead to changes in discretized angle value (e.g. s(0) flipping from 13 to 14 due to small word position shifts) ● order of sub-signatures may change (s(0) and s(1) swap as they had almost same radial distance)
Duplicate Page Detection (metrics) ● The similarity based on signature sets is calculated as:
● The similarity based on matched (aligned) word bounding boxes:
Duplicate Page Detection (example) Js = 19%
Jb = 93%
Duplicate Page Detection (example) Js = 5%
Jb = 37%
Image Lookup
Image Lookup Examples
Image Lookup Examples
Image Lookup Result Index Size [pages] Accuracy
Signature Size [bits]
4.1k
0.966
16
4.1k 1M
0.949 0.871
32 32
1M pages index (32bit signatures) stats: ● 386M signatures total ● stored as sorted array () fits in ~4GB of memory ● 0.8% of all signatures filtered (those repeated on 1k or more pages) ● each query on average returns 2000 canidates
Conclusion ● Simple schema for point cloud based discrete signature generation ● Filtering based on signature stability estimate ● Superposing signatures ● Duplicate page detection ● Image lookup by cell phone camera image query (87.1% accuracy for 1M pages indexed)