Spatiotemporal Tree Filtering for Enhancing Image Change Detection
Change detection has received extensive attention because of its realistic significance and broad application fields. However, none of the existing change detection algorithms can handle all scenarios and tasks so far. Different from the most of contributions from the research community in recent years, this paper does not work on designing new change detection algorithms. We, instead, solve the problem from another perspective by enhancing the raw detection results after change detection. As a result, the proposed method is applicable to various kinds of change detection methods, and regardless of how the results are detected. In this paper, we propose Fast Spatiotemporal Tree Filter (FSTF), a purely unsupervised detection method, to enhance coarse binary detection masks obtained by different kinds of change detection methods. In detail, the proposed FSTF has adopted a volumetric structure to effectively synthesize spatiotemporal information of the same target from the current time and history frames to enhance detection. The computational complexity analyzed in the view of graph theory also show that the fast realization of FSTF is a linear time algorithm, which is capable of handling efficient on-line detection tasks. Finally, comprehensive experiments based on qualitative and quantitative analysis verify that FSTF-based change detection enhancement is superior to several other state-of-the-art methods including fully connected Conditional Random Field (CRF), joint bilateral filter, and guided filter. It is illustrated that FSTF is versatile enough to also improve saliency detection as well as semantic image segmentation.
Medienart: |
E-Artikel |
---|
Erscheinungsjahr: |
2020 |
---|---|
Erschienen: |
2020 |
Enthalten in: |
Zur Gesamtaufnahme - volume:PP |
---|---|
Enthalten in: |
IEEE transactions on image processing : a publication of the IEEE Signal Processing Society - PP(2020) vom: 24. Aug. |
Sprache: |
Englisch |
---|
Beteiligte Personen: |
Li, Dawei [VerfasserIn] |
---|
Links: |
---|
Themen: |
---|
Anmerkungen: |
Date Revised 27.02.2024 published: Print-Electronic Citation Status Publisher |
---|
doi: |
10.1109/TIP.2020.3017339 |
---|
funding: |
|
---|---|
Förderinstitution / Projekttitel: |
|
PPN (Katalog-ID): |
NLM314070869 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | NLM314070869 | ||
003 | DE-627 | ||
005 | 20240229163214.0 | ||
007 | cr uuu---uuuuu | ||
008 | 231225s2020 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1109/TIP.2020.3017339 |2 doi | |
028 | 5 | 2 | |a pubmed24n1308.xml |
035 | |a (DE-627)NLM314070869 | ||
035 | |a (NLM)32833635 | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
100 | 1 | |a Li, Dawei |e verfasserin |4 aut | |
245 | 1 | 0 | |a Spatiotemporal Tree Filtering for Enhancing Image Change Detection |
264 | 1 | |c 2020 | |
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 Revised 27.02.2024 | ||
500 | |a published: Print-Electronic | ||
500 | |a Citation Status Publisher | ||
520 | |a Change detection has received extensive attention because of its realistic significance and broad application fields. However, none of the existing change detection algorithms can handle all scenarios and tasks so far. Different from the most of contributions from the research community in recent years, this paper does not work on designing new change detection algorithms. We, instead, solve the problem from another perspective by enhancing the raw detection results after change detection. As a result, the proposed method is applicable to various kinds of change detection methods, and regardless of how the results are detected. In this paper, we propose Fast Spatiotemporal Tree Filter (FSTF), a purely unsupervised detection method, to enhance coarse binary detection masks obtained by different kinds of change detection methods. In detail, the proposed FSTF has adopted a volumetric structure to effectively synthesize spatiotemporal information of the same target from the current time and history frames to enhance detection. The computational complexity analyzed in the view of graph theory also show that the fast realization of FSTF is a linear time algorithm, which is capable of handling efficient on-line detection tasks. Finally, comprehensive experiments based on qualitative and quantitative analysis verify that FSTF-based change detection enhancement is superior to several other state-of-the-art methods including fully connected Conditional Random Field (CRF), joint bilateral filter, and guided filter. It is illustrated that FSTF is versatile enough to also improve saliency detection as well as semantic image segmentation | ||
650 | 4 | |a Journal Article | |
700 | 1 | |a Yan, Siyuan |e verfasserin |4 aut | |
700 | 1 | |a Zhao, Mingbo |e verfasserin |4 aut | |
700 | 1 | |a Chow, Tommy W S |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 PP(2020) vom: 24. Aug. |w (DE-627)NLM09821456X |x 1941-0042 |7 nnns |
773 | 1 | 8 | |g volume:PP |g year:2020 |g day:24 |g month:08 |
856 | 4 | 0 | |u http://dx.doi.org/10.1109/TIP.2020.3017339 |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a GBV_NLM | ||
951 | |a AR | ||
952 | |d PP |j 2020 |b 24 |c 08 |