Pairwise matching of 3D fragments using fast fourier transform

Altantsetseg, Enkhbayar; Matsuyama, Katsutsugu; Konno, Kouichi

doi:10.1007/s00371-014-0959-9

Cited by 22 publications

(11 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Their method only finds similar parts and does not provide a point-to-point correspondence relationship. E Altantsetseg et al [16] used a Fourier transform-based method to extract the curves on the fracture surfaces as the features to match the sections. E. Vendrell et al [17] provided a general solution to the problem of unconstrained reorganization, in which the feature points of the fragments were first extracted to generate the PFH descriptors that were matched, and then the geometric constraint was used to perform mismatch elimination.…”

Section: A Pairwise Matchingmentioning

confidence: 99%

Developing a Reassembling Algorithm for Broken Objects

Jia

Yang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Section: A Pairwise Matchingmentioning

confidence: 99%

Developing a Reassembling Algorithm for Broken Objects

Jia

Yang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

“…[BTFN*08] observe that in the case of degraded and eroded fracture surfaces, match uncertainty hampers feature‐based matching; they propose a computationally efficient brute‐force technique to exhaustively evaluate all possible least‐squares alignments along edges of a set of fresco fragments (Figure ). A recent approach [AMK14] introduces a new method for pairwise matching of broken fragments from unorganized point clouds. The new descriptor contains both a cluster of feature points and curves along the principal directions of the cluster; point cluster is obtained by analysing micro‐curvature of the surface, while the associated curves are approximated using Fourier series.…”

Section: Micro‐geometrymentioning

confidence: 99%

A Survey of Geometric Analysis in Cultural Heritage

Pintus

Pal

Yang

et al. 2015

Computer Graphics Forum

View full text Add to dashboard Cite

We present a review of recent techniques for performing geometric analysis in cultural heritage applications. The survey is aimed at researchers in the areas of computer graphics, computer vision, and cultural heritage computing, as well as to scholars and practitioners in the cultural heritage field. The problems considered include shape perception enhancement, restoration and preservation support, monitoring over time, object interpretation, and collection analysis. All of these problems typically rely on an understanding of the structure of the shapes in question at both a local and global level. In this survey, we discuss the different problem forms and review the main solution methods, aided by classification criteria based on the geometric scale at which the analysis is performed and the cardinality of the relationships among object parts exploited during the analysis. We finalize the report by discussing open problems and future perspectives.

show abstract

“…In the pairwise matching stage, a general opinion is to extract one or more geometric features of a pair of fragments and determine whether they match through features similarity. According to the geometric features, methods can be roughly classified into point-based [3,4], curve-based [5][6][7], and surface-based [8][9][10]. For example, Pan et al [3] detected key points of point cloud and encoded their local features with the binary shape contest (BSC) descriptor.…”

Section: Introductionmentioning

confidence: 99%

SPPD: A Novel Reassembly Method for 3D Terracotta Warrior Fragments Based on Fracture Surface Information

Yao

Chu

Tang

et al. 2021

IJGI

View full text Add to dashboard Cite

As one of China′s most precious cultural relics, the excavation and protection of the Terracotta Warriors pose significant challenges to archaeologists. A fairly common situation in the excavation is that the Terracotta Warriors are mostly found in the form of fragments, and manual reassembly among numerous fragments is laborious and time-consuming. This work presents a fracture-surface-based reassembling method, which is composed of SiamesePointNet, principal component analysis (PCA), and deep closest point (DCP), and is named SPPD. Firstly, SiamesePointNet is proposed to determine whether a pair of point clouds of 3D Terracotta Warrior fragments can be reassembled. Then, a coarse-to-fine registration method based on PCA and DCP is proposed to register the two fragments into a reassembled one. The above two steps iterate until the termination condition is met. A series of experiments on real-world examples are conducted, and the results demonstrate that the proposed method performs better than the conventional reassembling methods. We hope this work can provide a valuable tool for the virtual restoration of three-dimension cultural heritage artifacts.

show abstract

Pairwise matching of 3D fragments using fast fourier transform

Cited by 22 publications

References 25 publications

Developing a Reassembling Algorithm for Broken Objects

Developing a Reassembling Algorithm for Broken Objects

A Survey of Geometric Analysis in Cultural Heritage

SPPD: A Novel Reassembly Method for 3D Terracotta Warrior Fragments Based on Fracture Surface Information

Contact Info

Product

Resources

About