A Fast Method to Minimize L! Error Norm for Geometric Vision Problems

dc.contributor.authorSeo, Yongduek
dc.contributor.authorHartley, Richard
dc.coverage.spatialRio de Janeiro Brazil
dc.date.accessioned2015-12-08T22:16:44Z
dc.date.createdOctober 14-20 2007
dc.date.issued2007
dc.date.updated2015-12-08T08:04:04Z
dc.description.abstractMinimizing L∞ error norm for some geometric vision problems provides global optimization using the well-developed algorithm called SOCP (second order cone programming). Because the error norm belongs to quasi-convex functions, bisection method is utiliz
dc.identifier.urihttp://hdl.handle.net/1885/30810
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE Inc)
dc.relation.ispartofseriesIEEE International Conference on Computer Vision (ICCV 2007)
dc.sourceProceedings of ICCV 2007
dc.subjectKeywords: Computer networks; Computer vision; International conferences; Artificial intelligence
dc.titleA Fast Method to Minimize L! Error Norm for Geometric Vision Problems
dc.typeConference paper
local.bibliographicCitation.startpage8
local.contributor.affiliationSeo, Yongduek, Sogang University
local.contributor.affiliationHartley, Richard, College of Engineering and Computer Science, ANU
local.contributor.authoremailu4022238@anu.edu.au
local.contributor.authoruidHartley, Richard, u4022238
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080104 - Computer Vision
local.identifier.ariespublicationu4334215xPUB77
local.identifier.doi10.1109/ICCV.2007.4408913
local.identifier.scopusID2-s2.0-50649097168
local.identifier.uidSubmittedByu4334215
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
01_Seo_A_Fast_Method_to_Minimize_L!_2007.pdf
Size:
984.71 KB
Format:
Adobe Portable Document Format