More Like this

1. Dam removal: Listening in: RIVER RESPONSE TO DAM REMOVAL

   https://doi.org/10.1002/2017WR020457  

   Foley, M. M.; Bellmore, J. R.; O'Connor, J. E.; Duda, J. J.; East, A. E.; Grant, G. E.; Anderson, C. W.; Bountry, J. A.; Collins, M. J.; Connolly, P. J.; et al (July 2017, Water Resources Research)
2. Photobombing Removal Benchmarking

   https://doi.org/10.1007/978-3-031-20716-7_5  

   Prakya, Sai P.; Sainath, Madamanchi M.V. (December 2022, ISVC 2022)

   Photobombing occurs very often in photography. This causes inconvenience to the main person(s) in the photos. Therefore, there is a legitimate need to remove the photobombing from taken images to produce a pleasing image. In this paper, the aim is to conduct a benchmark on this aforementioned problem. To this end, we first collect a dataset of images with undesired and distracting elements which requires the removal of photobombing. Then, we annotate the photobombed regions which should be removed. Next, different image inpainting methods are leveraged to remove the photobombed regions and reconstruct the image. We further invited professional photoshoppers to remove the unwanted regions. These photoshopped images are considered as the groundtruth. In our benchmark, several performance metrics are leveraged to compare the results of different methods with the groundtruth. The experiments provide insightful results which demonstrate the effectiveness of inpainting methods in this particular problem. 

   more » « less
3. Removal lemmas and approximate homomorphisms

   https://doi.org/10.1017/S0963548321000572  

   Fox, Jacob; Zhao, Yufei (July 2022, Combinatorics, Probability and Computing)

   Abstract We study quantitative relationships between the triangle removal lemma and several of its variants. One such variant, which we call the triangle-free lemma , states that for each $$\epsilon>0$$ there exists M such that every triangle-free graph G has an $$\epsilon$$ -approximate homomorphism to a triangle-free graph F on at most M vertices (here an $$\epsilon$$ -approximate homomorphism is a map $$V(G) \to V(F)$$ where all but at most $$\epsilon \left\lvert{V(G)}\right\rvert^2$$ edges of G are mapped to edges of F ). One consequence of our results is that the least possible M in the triangle-free lemma grows faster than exponential in any polynomial in $$\epsilon^{-1}$$ . We also prove more general results for arbitrary graphs, as well as arithmetic analogues over finite fields, where the bounds are close to optimal. 

   more » « less
4. The removal lemma for tournaments

   https://doi.org/10.1016/j.jctb.2018.10.001  

   Fox, Jacob; Gishboliner, Lior; Shapira, Asaf; Yuster, Raphael (May 2019, Journal of Combinatorial Theory, Series B)
5. Edge removal in undirected networks

   Langberg, M; Effros, M (July 2021, IEEE International Symposium on Information Theory (ISIT))

   null (Ed.)