A multiscale method for the reassembly of two-dimensional fragmented objects

Leitão, Helena Cristina da Gama; Stolfi, Jorge

doi:10.1109/tpami.2002.1033215

Cited by 160 publications

(42 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Step 6: Determine if the obtained perturbation solution satisfies formula (2). If the generated function value of is greater than of , then accept as a new solution of this iteration; otherwise, accept as the new solution with a probability of .…”

Section: Assembling Algorithmmentioning

confidence: 99%

“…If the generated function value of is greater than of , then accept as a new solution of this iteration; otherwise, accept as the new solution with a probability of . (2) Of which, is the initial solution, the perturbation solution.…”

Section: Assembling Algorithmmentioning

confidence: 99%

“…There are large amounts of existing research on irregular fragment assembly technology, for example Leitao & Stolfi's use of incremental dynamic programming sequence matching [2]. Luo [3] suggested using an edge detection algorithm based on linking scanned line segments to compose a closed curve of fragment edges; line and circle interpolation methods are adopted to guarantee scanning direction continuity.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A study of automatically assembling paper fragments on simulated annealing algorithm

Xian¹,

Qin²,

Shi³

et al. 2015

Proceedings of the 2015 International Conference on Electrical, Computer Engineering and Electronics

View full text Add to dashboard Cite

Abstract. In this paper, a study is conducted on assembling paper fragments with regular edge geometry, using the example of rectangular pieces. During the assembly process, visual information of the fragments' is digitally extracted by MATLAB software to achieve the corresponding grey value matrix; edge characteristics are derived and used to find fragments which belong in the first column. Adjacent rows are matched subsequently according to similarity and an annealing algorithm is used to join the paper fragments by setting edge goodness of fit as the objective function. From practice, it is found that the above method increases assembly efficiency as well as accuracy. This is of significant value to the relevant fields of fragment assembly.

show abstract

Section: Assembling Algorithmmentioning

confidence: 99%

Section: Assembling Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A study of automatically assembling paper fragments on simulated annealing algorithm

Xian¹,

Qin²,

Shi³

et al. 2015

Proceedings of the 2015 International Conference on Electrical, Computer Engineering and Electronics

View full text Add to dashboard Cite

show abstract

“…These characteristics concern orientation of pieces, whether there are missing pieces, whether the exterior boundary is known beforehand (such as a rectangular grid), whether there is a unique solution, and what types of junctions between pieces are allowed (Kleber, 2009). Some approaches consider image features of the pieces, such as color and texture (Nielsen, Drewsen, & Hansen, 2008) and others consider shape of pieces (Da Gama Leitao & Stolfi, 2002;Freeman & Garder, 1964;Goldberg, Malon, & Bern, 2002;Horst & Beichl, 1996;Krebs et al, 1997;Kong & Kimia, 2001;Lee et al, 2003;McBride & Kimia, 2003;Radack & Badler, 1982;Stringfellow et al, 2008;Zhu, Zhou & Hu, 2008), while (Weiss-Cohen & Halevi, 2005;Yao & Shao, 2003) consider both.…”

Section: Introductionmentioning

confidence: 99%

Solving the T-Joint Problem in Reconstructing 2-D Objects

Stringfellow¹,

Simpson²,

Enloe³

et al. 2010

Proceedings of the International Conference on Imaging Theory and Applications and International Conference on Information Visu

View full text Add to dashboard Cite

Abstract:This paper describes a solution to the T-joint problem in matching 2D fragments of an object. Matching fragments of an object is useful for solving puzzles or reassembling archaeological fragments. Many factors, such as the number of pieces and the complex shapes of pieces make this a difficult problem. Various approaches to this problem exist. This paper presents an approach to solving the T-joint problem, which comes up in assembling fragments. The work described in this paper starts with a 2D object that should be easy to extend to 3D problems.

show abstract

“…As in [3] we will distinguish between an ideal case of shredded remnants and the real, observed, case. In the ideal case we define the following rules:…”

Section: Problem Definitionmentioning

confidence: 99%

Shredded document reconstruction using MPEG-7 standard descriptors

El-Afifi

Karaki

Korban

et al.

Proceedings of the Fourth IEEE International Symposium on Signal Processing and Information Technology, 2004.

View full text Add to dashboard Cite

Abstract-The recovery of paper documents which have been disposed of is an important issue in many contexts, such as forensics and investigation sciences. The automatization of the process by means of image processing techniques can give a considerable help in the problem solution. We propose in this paper an overall architecture for the reconstruction of strip-cut shredded documents, paying particular attention to the possibility of using MPEG-7 descriptors for the strip content description.

show abstract

A multiscale method for the reassembly of two-dimensional fragmented objects

Cited by 160 publications

References 19 publications

A study of automatically assembling paper fragments on simulated annealing algorithm

A study of automatically assembling paper fragments on simulated annealing algorithm

Solving the T-Joint Problem in Reconstructing 2-D Objects

Shredded document reconstruction using MPEG-7 standard descriptors

Contact Info

Product

Resources

About