Deformable Model Fitting by Regularized Landmark Mean-Shift

Deformable model fitting has been actively pursued in the computer vision community for over a decade. As a result, numerous approaches have been proposed with varying degrees of success. A class of approaches that has shown substantial promise is one that makes independent predictions regarding loc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of computer vision 2011-01, Vol.91 (2), p.200-215
Hauptverfasser: Saragih, Jason M., Lucey, Simon, Cohn, Jeffrey F.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 215
container_issue 2
container_start_page 200
container_title International journal of computer vision
container_volume 91
creator Saragih, Jason M.
Lucey, Simon
Cohn, Jeffrey F.
description Deformable model fitting has been actively pursued in the computer vision community for over a decade. As a result, numerous approaches have been proposed with varying degrees of success. A class of approaches that has shown substantial promise is one that makes independent predictions regarding locations of the model’s landmarks, which are combined by enforcing a prior over their joint motion. A common theme in innovations to this approach is the replacement of the distribution of probable landmark locations, obtained from each local detector, with simpler parametric forms. In this work, a principled optimization strategy is proposed where nonparametric representations of these likelihoods are maximized within a hierarchy of smoothed estimates. The resulting update equations are reminiscent of mean-shift over the landmarks but with regularization imposed through a global prior over their joint motion. Extensions to handle partial occlusions and reduce computational complexity are also presented. Through numerical experiments, this approach is shown to outperform some common existing methods on the task of generic face fitting.
doi_str_mv 10.1007/s11263-010-0380-4
format Article
fullrecord <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671242668</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A364691942</galeid><sourcerecordid>A364691942</sourcerecordid><originalsourceid>FETCH-LOGICAL-c452t-64981c9adced65aff4349d40314db4099d8cff0c7ddbf7da5596fb96099628bf3</originalsourceid><addsrcrecordid>eNp1kVtLHTEUhYO04Kn1B_RtoAjtQ3TnMpkJPonWVjgiqH0OmVzG2DkZm8xA7a9vDiNSBclDIPtbm5W1EPpE4JAANEeZECoYBgIYWAuY76AVqRuGCYf6HVqBpIBrIcku-pDzPQDQlrIVOj5zfkwb3Q2uuhytG6rzME0h9lX3WF27fh50Cn-drdY62o1Ov6pLpyO-uQt--ojeez1kt_9076Gf599uT3_g9dX3i9OTNTa8phMWXLbESG2Ns6LW3nPGpeXACLcdBylta7wH01jb-cbqupbCd1KUiaBt59ke-rLsfUjj79nlSW1CNm4YdHTjnBURDaGcCtEW9PMr9H6cUyzuFCkJlWg4gUIdLlSvB6dC9OOUtCnHuk0wY3Q-lPcTJngJTHJaBF9fCAozuT9Tr-ec1cXN9UuWLKxJY87JefWQQknuURFQ267U0pUqXaltV4oXzcGTbZ2NHnzS0YT8LKTFNmv41jhduFxGsXfpv--9ufwfwUygWg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1112038410</pqid></control><display><type>article</type><title>Deformable Model Fitting by Regularized Landmark Mean-Shift</title><source>SpringerLink Journals - AutoHoldings</source><creator>Saragih, Jason M. ; Lucey, Simon ; Cohn, Jeffrey F.</creator><creatorcontrib>Saragih, Jason M. ; Lucey, Simon ; Cohn, Jeffrey F.</creatorcontrib><description>Deformable model fitting has been actively pursued in the computer vision community for over a decade. As a result, numerous approaches have been proposed with varying degrees of success. A class of approaches that has shown substantial promise is one that makes independent predictions regarding locations of the model’s landmarks, which are combined by enforcing a prior over their joint motion. A common theme in innovations to this approach is the replacement of the distribution of probable landmark locations, obtained from each local detector, with simpler parametric forms. In this work, a principled optimization strategy is proposed where nonparametric representations of these likelihoods are maximized within a hierarchy of smoothed estimates. The resulting update equations are reminiscent of mean-shift over the landmarks but with regularization imposed through a global prior over their joint motion. Extensions to handle partial occlusions and reduce computational complexity are also presented. Through numerical experiments, this approach is shown to outperform some common existing methods on the task of generic face fitting.</description><identifier>ISSN: 0920-5691</identifier><identifier>EISSN: 1573-1405</identifier><identifier>DOI: 10.1007/s11263-010-0380-4</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Analysis ; Applied sciences ; Artificial Intelligence ; Computer Imaging ; Computer Science ; Computer science; control theory; systems ; Computer vision ; Deformation ; Detectors ; Estimates ; Exact sciences and technology ; Fittings ; Formability ; Image Processing and Computer Vision ; Innovations ; Landmarks ; Machine vision ; Mathematical models ; Optimization ; Pattern Recognition ; Pattern Recognition and Graphics ; Pattern recognition. Digital image processing. Computational geometry ; Sensors ; Theoretical computing ; Vision</subject><ispartof>International journal of computer vision, 2011-01, Vol.91 (2), p.200-215</ispartof><rights>Springer Science+Business Media, LLC 2010</rights><rights>2015 INIST-CNRS</rights><rights>COPYRIGHT 2011 Springer</rights><rights>Springer Science+Business Media, LLC 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c452t-64981c9adced65aff4349d40314db4099d8cff0c7ddbf7da5596fb96099628bf3</citedby><cites>FETCH-LOGICAL-c452t-64981c9adced65aff4349d40314db4099d8cff0c7ddbf7da5596fb96099628bf3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11263-010-0380-4$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11263-010-0380-4$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=23843740$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Saragih, Jason M.</creatorcontrib><creatorcontrib>Lucey, Simon</creatorcontrib><creatorcontrib>Cohn, Jeffrey F.</creatorcontrib><title>Deformable Model Fitting by Regularized Landmark Mean-Shift</title><title>International journal of computer vision</title><addtitle>Int J Comput Vis</addtitle><description>Deformable model fitting has been actively pursued in the computer vision community for over a decade. As a result, numerous approaches have been proposed with varying degrees of success. A class of approaches that has shown substantial promise is one that makes independent predictions regarding locations of the model’s landmarks, which are combined by enforcing a prior over their joint motion. A common theme in innovations to this approach is the replacement of the distribution of probable landmark locations, obtained from each local detector, with simpler parametric forms. In this work, a principled optimization strategy is proposed where nonparametric representations of these likelihoods are maximized within a hierarchy of smoothed estimates. The resulting update equations are reminiscent of mean-shift over the landmarks but with regularization imposed through a global prior over their joint motion. Extensions to handle partial occlusions and reduce computational complexity are also presented. Through numerical experiments, this approach is shown to outperform some common existing methods on the task of generic face fitting.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Analysis</subject><subject>Applied sciences</subject><subject>Artificial Intelligence</subject><subject>Computer Imaging</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>Computer vision</subject><subject>Deformation</subject><subject>Detectors</subject><subject>Estimates</subject><subject>Exact sciences and technology</subject><subject>Fittings</subject><subject>Formability</subject><subject>Image Processing and Computer Vision</subject><subject>Innovations</subject><subject>Landmarks</subject><subject>Machine vision</subject><subject>Mathematical models</subject><subject>Optimization</subject><subject>Pattern Recognition</subject><subject>Pattern Recognition and Graphics</subject><subject>Pattern recognition. Digital image processing. Computational geometry</subject><subject>Sensors</subject><subject>Theoretical computing</subject><subject>Vision</subject><issn>0920-5691</issn><issn>1573-1405</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kVtLHTEUhYO04Kn1B_RtoAjtQ3TnMpkJPonWVjgiqH0OmVzG2DkZm8xA7a9vDiNSBclDIPtbm5W1EPpE4JAANEeZECoYBgIYWAuY76AVqRuGCYf6HVqBpIBrIcku-pDzPQDQlrIVOj5zfkwb3Q2uuhytG6rzME0h9lX3WF27fh50Cn-drdY62o1Ov6pLpyO-uQt--ojeez1kt_9076Gf599uT3_g9dX3i9OTNTa8phMWXLbESG2Ns6LW3nPGpeXACLcdBylta7wH01jb-cbqupbCd1KUiaBt59ke-rLsfUjj79nlSW1CNm4YdHTjnBURDaGcCtEW9PMr9H6cUyzuFCkJlWg4gUIdLlSvB6dC9OOUtCnHuk0wY3Q-lPcTJngJTHJaBF9fCAozuT9Tr-ec1cXN9UuWLKxJY87JefWQQknuURFQ267U0pUqXaltV4oXzcGTbZ2NHnzS0YT8LKTFNmv41jhduFxGsXfpv--9ufwfwUygWg</recordid><startdate>20110101</startdate><enddate>20110101</enddate><creator>Saragih, Jason M.</creator><creator>Lucey, Simon</creator><creator>Cohn, Jeffrey F.</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>ISR</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20110101</creationdate><title>Deformable Model Fitting by Regularized Landmark Mean-Shift</title><author>Saragih, Jason M. ; Lucey, Simon ; Cohn, Jeffrey F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c452t-64981c9adced65aff4349d40314db4099d8cff0c7ddbf7da5596fb96099628bf3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Analysis</topic><topic>Applied sciences</topic><topic>Artificial Intelligence</topic><topic>Computer Imaging</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>Computer vision</topic><topic>Deformation</topic><topic>Detectors</topic><topic>Estimates</topic><topic>Exact sciences and technology</topic><topic>Fittings</topic><topic>Formability</topic><topic>Image Processing and Computer Vision</topic><topic>Innovations</topic><topic>Landmarks</topic><topic>Machine vision</topic><topic>Mathematical models</topic><topic>Optimization</topic><topic>Pattern Recognition</topic><topic>Pattern Recognition and Graphics</topic><topic>Pattern recognition. Digital image processing. Computational geometry</topic><topic>Sensors</topic><topic>Theoretical computing</topic><topic>Vision</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Saragih, Jason M.</creatorcontrib><creatorcontrib>Lucey, Simon</creatorcontrib><creatorcontrib>Cohn, Jeffrey F.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of computer vision</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Saragih, Jason M.</au><au>Lucey, Simon</au><au>Cohn, Jeffrey F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Deformable Model Fitting by Regularized Landmark Mean-Shift</atitle><jtitle>International journal of computer vision</jtitle><stitle>Int J Comput Vis</stitle><date>2011-01-01</date><risdate>2011</risdate><volume>91</volume><issue>2</issue><spage>200</spage><epage>215</epage><pages>200-215</pages><issn>0920-5691</issn><eissn>1573-1405</eissn><abstract>Deformable model fitting has been actively pursued in the computer vision community for over a decade. As a result, numerous approaches have been proposed with varying degrees of success. A class of approaches that has shown substantial promise is one that makes independent predictions regarding locations of the model’s landmarks, which are combined by enforcing a prior over their joint motion. A common theme in innovations to this approach is the replacement of the distribution of probable landmark locations, obtained from each local detector, with simpler parametric forms. In this work, a principled optimization strategy is proposed where nonparametric representations of these likelihoods are maximized within a hierarchy of smoothed estimates. The resulting update equations are reminiscent of mean-shift over the landmarks but with regularization imposed through a global prior over their joint motion. Extensions to handle partial occlusions and reduce computational complexity are also presented. Through numerical experiments, this approach is shown to outperform some common existing methods on the task of generic face fitting.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s11263-010-0380-4</doi><tpages>16</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0920-5691
ispartof International journal of computer vision, 2011-01, Vol.91 (2), p.200-215
issn 0920-5691
1573-1405
language eng
recordid cdi_proquest_miscellaneous_1671242668
source SpringerLink Journals - AutoHoldings
subjects Algorithmics. Computability. Computer arithmetics
Algorithms
Analysis
Applied sciences
Artificial Intelligence
Computer Imaging
Computer Science
Computer science
control theory
systems
Computer vision
Deformation
Detectors
Estimates
Exact sciences and technology
Fittings
Formability
Image Processing and Computer Vision
Innovations
Landmarks
Machine vision
Mathematical models
Optimization
Pattern Recognition
Pattern Recognition and Graphics
Pattern recognition. Digital image processing. Computational geometry
Sensors
Theoretical computing
Vision
title Deformable Model Fitting by Regularized Landmark Mean-Shift
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T12%3A08%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Deformable%20Model%20Fitting%20by%20Regularized%20Landmark%20Mean-Shift&rft.jtitle=International%20journal%20of%20computer%20vision&rft.au=Saragih,%20Jason%20M.&rft.date=2011-01-01&rft.volume=91&rft.issue=2&rft.spage=200&rft.epage=215&rft.pages=200-215&rft.issn=0920-5691&rft.eissn=1573-1405&rft_id=info:doi/10.1007/s11263-010-0380-4&rft_dat=%3Cgale_proqu%3EA364691942%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1112038410&rft_id=info:pmid/&rft_galeid=A364691942&rfr_iscdi=true