Partial Enumeration and Curvature Regularization

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Sökning: WFRF:(Boykov Yuri) > Partial Enumeration...

5 av 5
Föregående post
Nästa post
Till träfflistan

LIBRIS Formathandbok (Information om MARC21)

Fältnamn	Indikatorer	Metadata
000		03191naa a2200373 4500
001		oai:lup.lub.lu.se:dbaacf02-02a1-49a8-8497-5174f7279c5e
003		SwePub
008		160401s2013 \| \|\|\|\|\|\|\|\|\|\|\|000 \|\|eng\|
024	7	a https://lup.lub.lu.se/record/44336462 URI
024	7	a https://doi.org/10.1109/ICCV.2013.3652 DOI
040		a (SwePub)lu
041		a engb eng
042		9 SwePub
072	7	a kon2 swepub-publicationtype
072	7	a ref2 swepub-contenttype
100	1	a Olsson, Carlu Lund University,Lunds universitet,Matematik LTH,Matematikcentrum,Institutioner vid LTH,Lunds Tekniska Högskola,Mathematics (Faculty of Engineering),Centre for Mathematical Sciences,Departments at LTH,Faculty of Engineering, LTH4 aut0 (Swepub:lu)math-coo
245	1 0	a Partial Enumeration and Curvature Regularization
264	1	c 2013
300		a 8 s.
338		a electronic2 rdacarrier
520		a Energies with high-order non-submodular interactions have been shown to be very useful in vision due to their high modeling power. Optimization of such energies, however, is generally NP-hard. A naive approach that works for small problem instances is exhaustive search, that is, enumera- tion of all possible labelings of the underlying graph. We propose a general minimization approach for large graphs based on enumeration of labelings of certain small patches. This partial enumeration technique reduces complex high- order energy formulations to pairwise Constraint Satisfac- tion Problems with unary costs (uCSP), which can be ef- ficiently solved using standard methods like TRW-S. Our approach outperforms a number of existing state-of-the-art algorithms on well known difficult problems (e.g. curvature regularization, stereo, deconvolution); it gives near global minimum and better speed. Our main application of interest is curvature regular- ization. In the context of segmentation, our partial enu- meration technique allows to evaluate curvature directly on small patches using a novel integral geometry approach.
650	7	a NATURVETENSKAPx Matematik0 (SwePub)1012 hsv//swe
650	7	a NATURAL SCIENCESx Mathematics0 (SwePub)1012 hsv//eng
650	7	a NATURVETENSKAPx Data- och informationsvetenskapx Datorseende och robotik0 (SwePub)102072 hsv//swe
650	7	a NATURAL SCIENCESx Computer and Information Sciencesx Computer Vision and Robotics0 (SwePub)102072 hsv//eng
700	1	a Ulén, Johannesu Lund University,Lunds universitet,Matematik LTH,Matematikcentrum,Institutioner vid LTH,Lunds Tekniska Högskola,Mathematics (Faculty of Engineering),Centre for Mathematical Sciences,Departments at LTH,Faculty of Engineering, LTH4 aut0 (Swepub:lu)math-jsu
700	1	a Boykov, Yuri4 aut
700	1	a Kolmogorov, Vladimir4 aut
710	2	a Matematik LTHb Matematikcentrum4 org
773	0	t Computer Vision (ICCV), 2013 IEEE International Conference ong , s. 2936-2943q <2936-2943x 1550-5499
856	4	u https://portal.research.lu.se/files/4093276/4433651.pdfx primaryx freey FULLTEXT
856	4	u http://dx.doi.org/10.1109/ICCV.2013.365y FULLTEXT
856	4 8	u https://lup.lub.lu.se/record/4433646
856	4 8	u https://doi.org/10.1109/ICCV.2013.365

Om ämnet

NATURVETENSKAP: NATURVETENSKAP; och Matematik

NATURVETENSKAP: NATURVETENSKAP; och Data och informa ...; och Datorseende och ...

Artiklar i publikationen: Computer Vision ...

Av lärosätet: Lunds universitet

Sök utanför SwePub

Sök vidare i:: Google; Google Book Search; Google Scholar

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

LIBRIS.kb.se

Hitta via bibliotek

Till lärosätets databas

Hitta mer i SwePub

Sök utanför SwePub