|
|
|
|
LEADER |
01000caa a22002652 4500 |
001 |
NLM272167002 |
003 |
DE-627 |
005 |
20250221165153.0 |
007 |
cr uuu---uuuuu |
008 |
231224s2017 xx |||||o 00| ||eng c |
024 |
7 |
|
|a 10.1109/TIP.2017.2704431
|2 doi
|
028 |
5 |
2 |
|a pubmed25n0907.xml
|
035 |
|
|
|a (DE-627)NLM272167002
|
035 |
|
|
|a (NLM)28534771
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Yu, Miao
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Dynamic Graph Cuts in Parallel
|
264 |
|
1 |
|c 2017
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
500 |
|
|
|a Date Completed 30.07.2018
|
500 |
|
|
|a Date Revised 30.07.2018
|
500 |
|
|
|a published: Print-Electronic
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a This paper aims at bridging the two important trends in efficient graph cuts in the literature, the one is to decompose a graph into several smaller subgraphs to take the advantage of parallel computation, the other is to reuse the solution of the max-flow problem on a residual graph to boost the efficiency on another similar graph. Our proposed parallel dynamic graph cuts algorithm takes the advantages of both, and is extremely efficient for certain dynamically changing MRF models in computer vision. The performance of our proposed algorithm is validated on two typical dynamic graph cuts problems: the foreground-background segmentation in video, where similar graph cuts problems need to be solved in sequential and GrabCut, where graph cuts are used iteratively
|
650 |
|
4 |
|a Journal Article
|
700 |
1 |
|
|a Shen, Shuhan
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Hu, Zhanyi
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 26(2017), 8 vom: 20. Aug., Seite 3775-3788
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
773 |
1 |
8 |
|g volume:26
|g year:2017
|g number:8
|g day:20
|g month:08
|g pages:3775-3788
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2017.2704431
|3 Volltext
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 26
|j 2017
|e 8
|b 20
|c 08
|h 3775-3788
|