{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1025865","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1025865","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1025865","kernelVersion":"v1","immutable":true,"modified":"2026-01-14T19:50:38Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1025865","name":"A computational framework for image-based constrained registration","headline":"A computational framework for image-based constrained registration","description":"scientific article; zbMATH DE number 5569006","url":"https://portal.mardi4nfdi.de/entity/Q1025865","datePublished":"2009-06-23","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q652566"},{"@id":"https://portal.mardi4nfdi.de/entity/Q882093"},{"@id":"https://portal.mardi4nfdi.de/entity/Q601681"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q92813"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.LAA.2009.03.020","url":"https://doi.org/10.1016/J.LAA.2009.03.020"},"sameAs":["https://doi.org/10.1016/J.LAA.2009.03.020"],"comment":"The authors develop a framework for local constrained image registration and apply it to rigidity and volume constraints. It is worth to emphasize that there are a few features that distinguish the method presented in this paper compared to others. The features are as follows: \\begin{itemize}\\item[1.] The proposed method uses constraints rather than a penalty and in view of this fact the constraints are actually fulfilled. Additionally, using constrained optimization does not require choosing a penalty parameter. \\item[2.] The Lagrangian approach saves the need to track the domain of the constraints but adds the cost of computing the determinant of the Jocobian. \\item[3.] They use sequential quadratic programming for solving the constrained optimization problem. \\item[4.] They examine rigidity and volume constraints. They present that the increase of computations stayed moderate with approximately 15\\% compared to a unconstrained approach.  At the end, in the numerical experiments they show that adding constraints can increase the reliability of non parametric registration and reduce the inherent non-uniqueness of the problems. As the results they advocate that adding constraints will became common practice in image registrations.\\end{itemize}","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2577824"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3033185"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4702314"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4409539"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1964054"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4409542"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1398065"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3507912"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4389207"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4785868"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4266285"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4664402"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1859703"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4441256"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4255577"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1411784"}]},"provenance":{"prov:generatedAtTime":"2026-01-14T19:50:38Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}