IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v388y2021ics0096300320304951.html
   My bibliography  Save this article

Coordinate descent optimization for one-to-one correspondence and supervised classification of 3D shapes

Author

Listed:
  • Samir, Chafik
  • Huang, Wen

Abstract

Recent developments in shape analysis and retrieval play an important role in a wide variety of applications that potentially require matching of objects with different geometries. In shape classification, there is no natural way to represent an object but the similarity measure, distance between representations or descriptors, depends heavily on the strategy of computing optimal correspondences. In this paper we introduce a new numerical method for registering surfaces. Thus, finding an optimal one-to-one correspondence between their shapes. Unfortunately, solving this type of optimization problem is generally hard because the solutions space is nonlinear with no natural manifold structure on it. To overcome such limitations we make use of recent methods to represent objects then we find optimal correspondences using a discretized approximation of the search space. The proposed method has the advantage of extending the Riemannian analysis of 3D curves in a natural way for surfaces. We demonstrate the proposed algorithms using different public datasets for 2D and 3D objects matching and classification.

Suggested Citation

  • Samir, Chafik & Huang, Wen, 2021. "Coordinate descent optimization for one-to-one correspondence and supervised classification of 3D shapes," Applied Mathematics and Computation, Elsevier, vol. 388(C).
    • Handle: RePEc:eee:apmaco:v:388:y:2021:i:c:s0096300320304951
    DOI: 10.1016/j.amc.2020.125539
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320304951
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125539?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Li, Xin & Chang, Yubo, 2018. "Non-uniform interpolatory subdivision surface," Applied Mathematics and Computation, Elsevier, vol. 324(C), pages 239-253.
    2. Allasia, Giampietro & Cavoretto, Roberto & De Rossi, Alessandra, 2018. "Hermite–Birkhoff interpolation on scattered data on the sphere and other manifolds," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 35-50.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Samir, Chafik & Adouani, Ines, 2019. "C1 interpolating Bézier path on Riemannian manifolds, with applications to 3D shape space," Applied Mathematics and Computation, Elsevier, vol. 348(C), pages 371-384.
    2. Mustafa, Ghulam & Hameed, Rabia, 2019. "Families of non-linear subdivision schemes for scattered data fitting and their non-tensor product extensions," Applied Mathematics and Computation, Elsevier, vol. 359(C), pages 214-240.
    3. Xia, Peng & Lei, Na & Dong, Tian, 2023. "On the linearization methods for univariate Birkhoff rational interpolation," Applied Mathematics and Computation, Elsevier, vol. 445(C).
    4. Kaijun Peng & Jieqing Tan & Li Zhang, 2023. "Polynomial-Based Non-Uniform Ternary Interpolation Surface Subdivision on Quadrilateral Mesh," Mathematics, MDPI, vol. 11(2), pages 1-22, January.
    5. Baotao Chi & Shengmin Bai & Qianjian Guo & Yaoming Zhang & Wei Yuan & Can Li, 2023. "A New Definition of the Dual Interpolation Curve for CAD Modeling and Geometry Defeaturing," Mathematics, MDPI, vol. 11(16), pages 1-19, August.
    6. Cavoretto, R. & De Rossi, A. & Perracchione, E., 2023. "Learning with Partition of Unity-based Kriging Estimators," Applied Mathematics and Computation, Elsevier, vol. 448(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:388:y:2021:i:c:s0096300320304951. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.