Error-Tolerant Image Compositing
Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the compo...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Tao, Michael W. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2012 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media New York 2012 |
|---|
| Übergeordnetes Werk: |
Enthalten in: International journal of computer vision - Springer US, 1987, 103(2012), 2 vom: 13. Okt., Seite 178-189 |
|---|---|
| Übergeordnetes Werk: |
volume:103 ; year:2012 ; number:2 ; day:13 ; month:10 ; pages:178-189 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11263-012-0579-7 |
|---|
| Katalog-ID: |
OLC2057747441 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2057747441 | ||
| 003 | DE-627 | ||
| 005 | 20230504072140.0 | ||
| 007 | tu | ||
| 008 | 200819s2012 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11263-012-0579-7 |2 doi | |
| 035 | |a (DE-627)OLC2057747441 | ||
| 035 | |a (DE-He213)s11263-012-0579-7-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Tao, Michael W. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Error-Tolerant Image Compositing |
| 264 | 1 | |c 2012 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media New York 2012 | ||
| 520 | |a Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the composited image regions do not match. One option is to modify the region boundary to minimize such mismatches. However, this option may not always be sufficient or applicable, e.g., the user or algorithm may not allow the selection to be altered. We propose a new approach to gradient-domain compositing that is robust to inaccuracies and prevents color bleeding without changing the boundary location. Our approach improves standard gradient-domain compositing in two ways. First, we define the boundary gradients such that the produced gradient field is nearly integrable. Second, we control the integration process to concentrate residuals where they are less conspicuous. We show that our approach can be formulated as a standard least-squares problem that can be solved with a sparse linear system akin to the classical Poisson equation. We demonstrate results on a variety of scenes. The visual quality and run-time complexity compares favorably to other approaches. | ||
| 650 | 4 | |a Gradient-domain compositing | |
| 650 | 4 | |a Visual masking | |
| 700 | 1 | |a Johnson, Micah K. |4 aut | |
| 700 | 1 | |a Paris, Sylvain |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t International journal of computer vision |d Springer US, 1987 |g 103(2012), 2 vom: 13. Okt., Seite 178-189 |w (DE-627)129354252 |w (DE-600)155895-X |w (DE-576)018081428 |x 0920-5691 |7 nnns |
| 773 | 1 | 8 | |g volume:103 |g year:2012 |g number:2 |g day:13 |g month:10 |g pages:178-189 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11263-012-0579-7 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2004 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_2012 | ||
| 912 | |a GBV_ILN_2244 | ||
| 912 | |a GBV_ILN_4046 | ||
| 912 | |a GBV_ILN_4700 | ||
| 951 | |a AR | ||
| 952 | |d 103 |j 2012 |e 2 |b 13 |c 10 |h 178-189 | ||
| author_variant |
m w t mw mwt m k j mk mkj s p sp |
|---|---|
| matchkey_str |
article:09205691:2012----::rotlrniaeo |
| hierarchy_sort_str |
2012 |
| publishDate |
2012 |
| allfields |
10.1007/s11263-012-0579-7 doi (DE-627)OLC2057747441 (DE-He213)s11263-012-0579-7-p DE-627 ger DE-627 rakwb eng 004 VZ Tao, Michael W. verfasserin aut Error-Tolerant Image Compositing 2012 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2012 Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the composited image regions do not match. One option is to modify the region boundary to minimize such mismatches. However, this option may not always be sufficient or applicable, e.g., the user or algorithm may not allow the selection to be altered. We propose a new approach to gradient-domain compositing that is robust to inaccuracies and prevents color bleeding without changing the boundary location. Our approach improves standard gradient-domain compositing in two ways. First, we define the boundary gradients such that the produced gradient field is nearly integrable. Second, we control the integration process to concentrate residuals where they are less conspicuous. We show that our approach can be formulated as a standard least-squares problem that can be solved with a sparse linear system akin to the classical Poisson equation. We demonstrate results on a variety of scenes. The visual quality and run-time complexity compares favorably to other approaches. Gradient-domain compositing Visual masking Johnson, Micah K. aut Paris, Sylvain aut Enthalten in International journal of computer vision Springer US, 1987 103(2012), 2 vom: 13. Okt., Seite 178-189 (DE-627)129354252 (DE-600)155895-X (DE-576)018081428 0920-5691 nnns volume:103 year:2012 number:2 day:13 month:10 pages:178-189 https://doi.org/10.1007/s11263-012-0579-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4700 AR 103 2012 2 13 10 178-189 |
| spelling |
10.1007/s11263-012-0579-7 doi (DE-627)OLC2057747441 (DE-He213)s11263-012-0579-7-p DE-627 ger DE-627 rakwb eng 004 VZ Tao, Michael W. verfasserin aut Error-Tolerant Image Compositing 2012 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2012 Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the composited image regions do not match. One option is to modify the region boundary to minimize such mismatches. However, this option may not always be sufficient or applicable, e.g., the user or algorithm may not allow the selection to be altered. We propose a new approach to gradient-domain compositing that is robust to inaccuracies and prevents color bleeding without changing the boundary location. Our approach improves standard gradient-domain compositing in two ways. First, we define the boundary gradients such that the produced gradient field is nearly integrable. Second, we control the integration process to concentrate residuals where they are less conspicuous. We show that our approach can be formulated as a standard least-squares problem that can be solved with a sparse linear system akin to the classical Poisson equation. We demonstrate results on a variety of scenes. The visual quality and run-time complexity compares favorably to other approaches. Gradient-domain compositing Visual masking Johnson, Micah K. aut Paris, Sylvain aut Enthalten in International journal of computer vision Springer US, 1987 103(2012), 2 vom: 13. Okt., Seite 178-189 (DE-627)129354252 (DE-600)155895-X (DE-576)018081428 0920-5691 nnns volume:103 year:2012 number:2 day:13 month:10 pages:178-189 https://doi.org/10.1007/s11263-012-0579-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4700 AR 103 2012 2 13 10 178-189 |
| allfields_unstemmed |
10.1007/s11263-012-0579-7 doi (DE-627)OLC2057747441 (DE-He213)s11263-012-0579-7-p DE-627 ger DE-627 rakwb eng 004 VZ Tao, Michael W. verfasserin aut Error-Tolerant Image Compositing 2012 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2012 Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the composited image regions do not match. One option is to modify the region boundary to minimize such mismatches. However, this option may not always be sufficient or applicable, e.g., the user or algorithm may not allow the selection to be altered. We propose a new approach to gradient-domain compositing that is robust to inaccuracies and prevents color bleeding without changing the boundary location. Our approach improves standard gradient-domain compositing in two ways. First, we define the boundary gradients such that the produced gradient field is nearly integrable. Second, we control the integration process to concentrate residuals where they are less conspicuous. We show that our approach can be formulated as a standard least-squares problem that can be solved with a sparse linear system akin to the classical Poisson equation. We demonstrate results on a variety of scenes. The visual quality and run-time complexity compares favorably to other approaches. Gradient-domain compositing Visual masking Johnson, Micah K. aut Paris, Sylvain aut Enthalten in International journal of computer vision Springer US, 1987 103(2012), 2 vom: 13. Okt., Seite 178-189 (DE-627)129354252 (DE-600)155895-X (DE-576)018081428 0920-5691 nnns volume:103 year:2012 number:2 day:13 month:10 pages:178-189 https://doi.org/10.1007/s11263-012-0579-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4700 AR 103 2012 2 13 10 178-189 |
| allfieldsGer |
10.1007/s11263-012-0579-7 doi (DE-627)OLC2057747441 (DE-He213)s11263-012-0579-7-p DE-627 ger DE-627 rakwb eng 004 VZ Tao, Michael W. verfasserin aut Error-Tolerant Image Compositing 2012 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2012 Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the composited image regions do not match. One option is to modify the region boundary to minimize such mismatches. However, this option may not always be sufficient or applicable, e.g., the user or algorithm may not allow the selection to be altered. We propose a new approach to gradient-domain compositing that is robust to inaccuracies and prevents color bleeding without changing the boundary location. Our approach improves standard gradient-domain compositing in two ways. First, we define the boundary gradients such that the produced gradient field is nearly integrable. Second, we control the integration process to concentrate residuals where they are less conspicuous. We show that our approach can be formulated as a standard least-squares problem that can be solved with a sparse linear system akin to the classical Poisson equation. We demonstrate results on a variety of scenes. The visual quality and run-time complexity compares favorably to other approaches. Gradient-domain compositing Visual masking Johnson, Micah K. aut Paris, Sylvain aut Enthalten in International journal of computer vision Springer US, 1987 103(2012), 2 vom: 13. Okt., Seite 178-189 (DE-627)129354252 (DE-600)155895-X (DE-576)018081428 0920-5691 nnns volume:103 year:2012 number:2 day:13 month:10 pages:178-189 https://doi.org/10.1007/s11263-012-0579-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4700 AR 103 2012 2 13 10 178-189 |
| allfieldsSound |
10.1007/s11263-012-0579-7 doi (DE-627)OLC2057747441 (DE-He213)s11263-012-0579-7-p DE-627 ger DE-627 rakwb eng 004 VZ Tao, Michael W. verfasserin aut Error-Tolerant Image Compositing 2012 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2012 Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the composited image regions do not match. One option is to modify the region boundary to minimize such mismatches. However, this option may not always be sufficient or applicable, e.g., the user or algorithm may not allow the selection to be altered. We propose a new approach to gradient-domain compositing that is robust to inaccuracies and prevents color bleeding without changing the boundary location. Our approach improves standard gradient-domain compositing in two ways. First, we define the boundary gradients such that the produced gradient field is nearly integrable. Second, we control the integration process to concentrate residuals where they are less conspicuous. We show that our approach can be formulated as a standard least-squares problem that can be solved with a sparse linear system akin to the classical Poisson equation. We demonstrate results on a variety of scenes. The visual quality and run-time complexity compares favorably to other approaches. Gradient-domain compositing Visual masking Johnson, Micah K. aut Paris, Sylvain aut Enthalten in International journal of computer vision Springer US, 1987 103(2012), 2 vom: 13. Okt., Seite 178-189 (DE-627)129354252 (DE-600)155895-X (DE-576)018081428 0920-5691 nnns volume:103 year:2012 number:2 day:13 month:10 pages:178-189 https://doi.org/10.1007/s11263-012-0579-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4700 AR 103 2012 2 13 10 178-189 |
| language |
English |
| source |
Enthalten in International journal of computer vision 103(2012), 2 vom: 13. Okt., Seite 178-189 volume:103 year:2012 number:2 day:13 month:10 pages:178-189 |
| sourceStr |
Enthalten in International journal of computer vision 103(2012), 2 vom: 13. Okt., Seite 178-189 volume:103 year:2012 number:2 day:13 month:10 pages:178-189 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Gradient-domain compositing Visual masking |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
International journal of computer vision |
| authorswithroles_txt_mv |
Tao, Michael W. @@aut@@ Johnson, Micah K. @@aut@@ Paris, Sylvain @@aut@@ |
| publishDateDaySort_date |
2012-10-13T00:00:00Z |
| hierarchy_top_id |
129354252 |
| dewey-sort |
14 |
| id |
OLC2057747441 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2057747441</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504072140.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2012 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11263-012-0579-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2057747441</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11263-012-0579-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tao, Michael W.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Error-Tolerant Image Compositing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2012</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the composited image regions do not match. One option is to modify the region boundary to minimize such mismatches. However, this option may not always be sufficient or applicable, e.g., the user or algorithm may not allow the selection to be altered. We propose a new approach to gradient-domain compositing that is robust to inaccuracies and prevents color bleeding without changing the boundary location. Our approach improves standard gradient-domain compositing in two ways. First, we define the boundary gradients such that the produced gradient field is nearly integrable. Second, we control the integration process to concentrate residuals where they are less conspicuous. We show that our approach can be formulated as a standard least-squares problem that can be solved with a sparse linear system akin to the classical Poisson equation. We demonstrate results on a variety of scenes. The visual quality and run-time complexity compares favorably to other approaches.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gradient-domain compositing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Visual masking</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Johnson, Micah K.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Paris, Sylvain</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of computer vision</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">103(2012), 2 vom: 13. Okt., Seite 178-189</subfield><subfield code="w">(DE-627)129354252</subfield><subfield code="w">(DE-600)155895-X</subfield><subfield code="w">(DE-576)018081428</subfield><subfield code="x">0920-5691</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:103</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:2</subfield><subfield code="g">day:13</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:178-189</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11263-012-0579-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">103</subfield><subfield code="j">2012</subfield><subfield code="e">2</subfield><subfield code="b">13</subfield><subfield code="c">10</subfield><subfield code="h">178-189</subfield></datafield></record></collection>
|
| author |
Tao, Michael W. |
| spellingShingle |
Tao, Michael W. ddc 004 misc Gradient-domain compositing misc Visual masking Error-Tolerant Image Compositing |
| authorStr |
Tao, Michael W. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129354252 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0920-5691 |
| topic_title |
004 VZ Error-Tolerant Image Compositing Gradient-domain compositing Visual masking |
| topic |
ddc 004 misc Gradient-domain compositing misc Visual masking |
| topic_unstemmed |
ddc 004 misc Gradient-domain compositing misc Visual masking |
| topic_browse |
ddc 004 misc Gradient-domain compositing misc Visual masking |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
International journal of computer vision |
| hierarchy_parent_id |
129354252 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
International journal of computer vision |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129354252 (DE-600)155895-X (DE-576)018081428 |
| title |
Error-Tolerant Image Compositing |
| ctrlnum |
(DE-627)OLC2057747441 (DE-He213)s11263-012-0579-7-p |
| title_full |
Error-Tolerant Image Compositing |
| author_sort |
Tao, Michael W. |
| journal |
International journal of computer vision |
| journalStr |
International journal of computer vision |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2012 |
| contenttype_str_mv |
txt |
| container_start_page |
178 |
| author_browse |
Tao, Michael W. Johnson, Micah K. Paris, Sylvain |
| container_volume |
103 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Tao, Michael W. |
| doi_str_mv |
10.1007/s11263-012-0579-7 |
| dewey-full |
004 |
| title_sort |
error-tolerant image compositing |
| title_auth |
Error-Tolerant Image Compositing |
| abstract |
Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the composited image regions do not match. One option is to modify the region boundary to minimize such mismatches. However, this option may not always be sufficient or applicable, e.g., the user or algorithm may not allow the selection to be altered. We propose a new approach to gradient-domain compositing that is robust to inaccuracies and prevents color bleeding without changing the boundary location. Our approach improves standard gradient-domain compositing in two ways. First, we define the boundary gradients such that the produced gradient field is nearly integrable. Second, we control the integration process to concentrate residuals where they are less conspicuous. We show that our approach can be formulated as a standard least-squares problem that can be solved with a sparse linear system akin to the classical Poisson equation. We demonstrate results on a variety of scenes. The visual quality and run-time complexity compares favorably to other approaches. © Springer Science+Business Media New York 2012 |
| abstractGer |
Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the composited image regions do not match. One option is to modify the region boundary to minimize such mismatches. However, this option may not always be sufficient or applicable, e.g., the user or algorithm may not allow the selection to be altered. We propose a new approach to gradient-domain compositing that is robust to inaccuracies and prevents color bleeding without changing the boundary location. Our approach improves standard gradient-domain compositing in two ways. First, we define the boundary gradients such that the produced gradient field is nearly integrable. Second, we control the integration process to concentrate residuals where they are less conspicuous. We show that our approach can be formulated as a standard least-squares problem that can be solved with a sparse linear system akin to the classical Poisson equation. We demonstrate results on a variety of scenes. The visual quality and run-time complexity compares favorably to other approaches. © Springer Science+Business Media New York 2012 |
| abstract_unstemmed |
Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the composited image regions do not match. One option is to modify the region boundary to minimize such mismatches. However, this option may not always be sufficient or applicable, e.g., the user or algorithm may not allow the selection to be altered. We propose a new approach to gradient-domain compositing that is robust to inaccuracies and prevents color bleeding without changing the boundary location. Our approach improves standard gradient-domain compositing in two ways. First, we define the boundary gradients such that the produced gradient field is nearly integrable. Second, we control the integration process to concentrate residuals where they are less conspicuous. We show that our approach can be formulated as a standard least-squares problem that can be solved with a sparse linear system akin to the classical Poisson equation. We demonstrate results on a variety of scenes. The visual quality and run-time complexity compares favorably to other approaches. © Springer Science+Business Media New York 2012 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4700 |
| container_issue |
2 |
| title_short |
Error-Tolerant Image Compositing |
| url |
https://doi.org/10.1007/s11263-012-0579-7 |
| remote_bool |
false |
| author2 |
Johnson, Micah K. Paris, Sylvain |
| author2Str |
Johnson, Micah K. Paris, Sylvain |
| ppnlink |
129354252 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11263-012-0579-7 |
| up_date |
2024-07-03T16:08:51.597Z |
| _version_ |
1803574765523304448 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2057747441</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504072140.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2012 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11263-012-0579-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2057747441</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11263-012-0579-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tao, Michael W.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Error-Tolerant Image Compositing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2012</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and reshuffling. While easy to implement, these gradient-domain techniques often generate bleeding artifacts where the composited image regions do not match. One option is to modify the region boundary to minimize such mismatches. However, this option may not always be sufficient or applicable, e.g., the user or algorithm may not allow the selection to be altered. We propose a new approach to gradient-domain compositing that is robust to inaccuracies and prevents color bleeding without changing the boundary location. Our approach improves standard gradient-domain compositing in two ways. First, we define the boundary gradients such that the produced gradient field is nearly integrable. Second, we control the integration process to concentrate residuals where they are less conspicuous. We show that our approach can be formulated as a standard least-squares problem that can be solved with a sparse linear system akin to the classical Poisson equation. We demonstrate results on a variety of scenes. The visual quality and run-time complexity compares favorably to other approaches.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gradient-domain compositing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Visual masking</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Johnson, Micah K.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Paris, Sylvain</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of computer vision</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">103(2012), 2 vom: 13. Okt., Seite 178-189</subfield><subfield code="w">(DE-627)129354252</subfield><subfield code="w">(DE-600)155895-X</subfield><subfield code="w">(DE-576)018081428</subfield><subfield code="x">0920-5691</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:103</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:2</subfield><subfield code="g">day:13</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:178-189</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11263-012-0579-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">103</subfield><subfield code="j">2012</subfield><subfield code="e">2</subfield><subfield code="b">13</subfield><subfield code="c">10</subfield><subfield code="h">178-189</subfield></datafield></record></collection>
|
| score |
7.4006166 |