U.S. flag

An official website of the United States government

Dot gov

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Https

Secure .gov websites use HTTPS
A lock () or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Breadcrumb

  1. Home

Fast Dynamic Programming for Elastic Registration of Curves

This is a software suite for computing optimal diffeomorphisms for elastic registration of curves. Algorithm adapt-DP is based on DP (dynamic programming) restricted to an adapting strip which is able to perform this computation in linear time. Description of Algorithm adapt-DP can be found in "Fast Dynamic Programming for Elastic Registration of Curves", Proceedings of the 2nd International Workshop on Differential Geometry in Computer Vision and Machine Learning (DIFF-CVML'16) in conjunction with Computer Vision Pattern Recognition Conference (CVPR) 2016, Las Vegas, Nevada, June 26-July 1, 2016. The zip file Fast_Dynamic_Programming.zip contains copies of implementation of Algorithm adapt-DP as Fortran files (a Matlab Fortran mex file and a Python compatible Fortran file) for execution with Matlab/Python, Matlab/Python test files for executing adapt-DP Matlab Fortran mex file and Python compatible Fortran file, respectively, example data files, usage instructions in README files, etc.

About this Dataset

Updated: 2024-02-22
Metadata Last Updated: 2018-06-01
Date Created: N/A
Views:
Data Provided by:
dynamic programming
Dataset Owner: N/A

Access this data

Contact dataset owner Landing Page URL
Download URL
Table representation of structured data
Title Fast Dynamic Programming for Elastic Registration of Curves
Description This is a software suite for computing optimal diffeomorphisms for elastic registration of curves. Algorithm adapt-DP is based on DP (dynamic programming) restricted to an adapting strip which is able to perform this computation in linear time. Description of Algorithm adapt-DP can be found in "Fast Dynamic Programming for Elastic Registration of Curves", Proceedings of the 2nd International Workshop on Differential Geometry in Computer Vision and Machine Learning (DIFF-CVML'16) in conjunction with Computer Vision Pattern Recognition Conference (CVPR) 2016, Las Vegas, Nevada, June 26-July 1, 2016. The zip file Fast_Dynamic_Programming.zip contains copies of implementation of Algorithm adapt-DP as Fortran files (a Matlab Fortran mex file and a Python compatible Fortran file) for execution with Matlab/Python, Matlab/Python test files for executing adapt-DP Matlab Fortran mex file and Python compatible Fortran file, respectively, example data files, usage instructions in README files, etc.
Modified N/A
Publisher Name National Institute of Standards and Technology
Contact mailto:javier.bernal@nist.gov
Keywords dynamic programming , shape analysis , elastic registration , adapting strip
{
    "identifier": "6FCA2C44E87B3E49E05324570681DCB11939",
    "accessLevel": "public",
    "references": [
        "https:\/\/dx.doi.org\/10.1109\/CVPRW.2016.137"
    ],
    "contactPoint": {
        "hasEmail": "mailto:javier.bernal@nist.gov",
        "fn": "Javier Bernal"
    },
    "programCode": [
        "006:045"
    ],
    "@type": "dcat:Dataset",
    "landingPage": "https:\/\/data.nist.gov\/od\/id\/6FCA2C44E87B3E49E05324570681DCB11939",
    "description": "This is a software suite for computing optimal diffeomorphisms for elastic registration of curves. Algorithm adapt-DP is based on DP (dynamic programming) restricted to an adapting strip which is able to perform this computation in linear time. Description of Algorithm adapt-DP can be found in \"Fast Dynamic Programming for Elastic Registration of Curves\", Proceedings of the 2nd International Workshop on Differential Geometry in Computer Vision and Machine Learning (DIFF-CVML'16) in conjunction with Computer Vision Pattern Recognition Conference (CVPR) 2016, Las Vegas, Nevada, June 26-July 1, 2016. The zip file Fast_Dynamic_Programming.zip contains copies of implementation of Algorithm adapt-DP as Fortran files (a Matlab Fortran mex file and a Python compatible Fortran file) for execution with Matlab\/Python, Matlab\/Python test files for executing adapt-DP Matlab Fortran mex file and Python compatible Fortran file, respectively, example data files, usage instructions in README files, etc.",
    "language": [
        "en"
    ],
    "title": "Fast Dynamic Programming for Elastic Registration of Curves",
    "distribution": [
        {
            "downloadURL": "https:\/\/math.nist.gov\/~JBernal\/Fast_Dynamic_Programming.zip",
            "format": "zip file",
            "description": "zip file with copies of implementation of Algorithm adapt-DP as Fortran files (a Matlab Fortran mex file and a Python compatible Fortran file) for execution with Matlab\/Python, Matlab\/Python test file for executing adapt-DP Matlab Fortran mex file and Python compatible Fortran file, respectively, example data files, usage intructions in README files, etc. Algorithm adapt-DP is based on DP (dynamic programming) restricted to an adapting strip for computing in linear time optimal diffeomorphisms for elastic registration of curves. Description of Algorithm adapt-DP can be found in \"Fast Dynamic Programming for Elastic Registration of Curves\", Proceedings of the 2nd International Workshop on Differential Geometry in Computer Vision and Machine Learning (DIFF-CVML'16) in conjunction with Computer Vision Pattern Recognition Conference (CVPR) 2016, Las Vegas, Nevada, June 26-July 1, 2016.",
            "mediaType": "application\/pdf",
            "title": "Fast_Dynamic_Programming.zip"
        },
        {
            "downloadURL": "https:\/\/data.nist.gov\/od\/ds\/6FCA2C44E87B3E49E05324570681DCB11939\/Fast_Dynamic_Programming.zip.sha256",
            "format": "SHA256",
            "description": "Hash of the data file",
            "mediaType": "text\/plain",
            "title": "SHA256 Hash"
        },
        {
            "downloadURL": "https:\/\/data.nist.gov\/od\/ds\/6FCA2C44E87B3E49E05324570681DCB11939\/Fast_Dynamic_Programming.zip",
            "format": "zip archive",
            "description": "zip file with copies of implementation of Algorithm adapt-DP as Fortran files (a Matlab Fortran mex file and a Python compatible Fortran file) for execution with Matlab\/Python, Matlab\/Python test file for executing adapt-DP Matlab Fortran mex file and Python compatible Fortran file, respectively, example data files, usage intructions in README files, etc. Algorithm adapt-DP is based on DP (dynamic programming) restricted to an adapting strip for computing in linear time optimal diffeomorphisms for elastic registration of curves. Description of Algorithm adapt-DP can be found in \"Fast Dynamic Programming for Elastic Registration of Curves\", Proceedings of the 2nd International Workshop on Differential Geometry in Computer Vision and Machine Learning (DIFF-CVML'16) in conjunction with Computer Vision Pattern Recognition Conference (CVPR) 2016, Las Vegas, Nevada, June 26-July 1, 2016.",
            "mediaType": "application\/zip",
            "title": "Fast_Dynamic_Programming.zip"
        },
        {
            "accessURL": "https:\/\/doi.org\/10.18434\/T4\/1502501",
            "format": "text\/html",
            "description": "DOI Access to Fast Dynamic Programming for Elastic Registration of Curves",
            "title": "DOI Access to Fast Dynamic Programming for Elastic Registration of Curves"
        }
    ],
    "license": "https:\/\/www.nist.gov\/open\/license",
    "bureauCode": [
        "006:55"
    ],
    "modified": "2018-06-01 00:00:00",
    "publisher": {
        "@type": "org:Organization",
        "name": "National Institute of Standards and Technology"
    },
    "accrualPeriodicity": "irregular",
    "theme": [
        "Mathematics and Statistics:Image and signal processing"
    ],
    "keyword": [
        "dynamic programming",
        "shape analysis",
        "elastic registration",
        "adapting strip"
    ]
}

Was this page helpful?