Name
Abstract | ||
|---|---|---|
One of the most crucial steps for automatically reconstructing ripped-up documents is to find a globally consistent solution from the ambiguous candidate matches. However, little work has been done so far to solve this problem in a general computational framework without using application-specific features. In this paper, we propose a global approach for reconstructing ripped-up documents by first finding candidate matches from document fragments using curve matching and then disambiguating these candidates through a relaxation process to reconstruct the original document. The candidate disambiguation problem is formulated in a relaxation scheme, in which the definition of compatibility between neighboring matches is proposed and global consistency is defined as the global criterion. Initially, global match confidences are assigned to each of the candidate matches. After that, the overall local relationships among neighboring matches are evaluated by computing their global consistency. Then these confidences are iteratively updated using the gradient projection method to maximize the criterion. This leads to a globally consistent solution and thus provides a sound document reconstruction. The overall performance of our approach in several practical experiments is illustrated. The results indicate that the reconstruction of ripped-up documents up to fifty pieces is possibly accomplished automatically. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/TPAMI.2007.1163 | IEEE Trans. Pattern Anal. Mach. Intell. |
Keywords | Field | DocType |
neighboring match,candidate disambiguation problem,finding candidate,consistent solution,global match confidence,ripped-up documents,global approach,global consistency,global criterion,ripped-up document,ambiguous candidate,globally consistent reconstruction,iterative method,curve fitting,robustness,image reconstruction,shape,assembly,compatibility,relaxation | Gradient method,Iterative reconstruction,Computer vision,Data mining,Curve fitting,Computer science,Curve matching,Iterative method,Projection method,Robustness (computer science),Artificial intelligence,Global consistency | Journal |
Volume | Issue | ISSN |
30 | 1 | 0162-8828 |
Citations | PageRank | References |
68 | 2.87 | 28 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liangjia Zhu | 1 | 92 | 9.07 |
| Zongtan Zhou | 2 | 412 | 33.89 |
| Dewen Hu | 3 | 1290 | 101.20 |