94(10), 1981–1997 (2017)ĭonoho, D., Johnstone, I.: Ideal spatial adaptation by wavelet shrinkage. 10(2), 266–277 (2001)Ĭhen, C., Leng, J., Xu, G.: A general framework of piecewise-polynomial Mumford–Shah model for image segmentation. Numerische Mathematik 76(2), 167–188 (1997)Ĭhan, T., Vese, L.: Active contours without edges. 33(02), 261–288 (1999)Ĭhambolle, A., Lions, P.-L.: Image recovery via total variation minimization and related problems. 55(3), 827–863 (1995)Ĭhambolle, A.: Finite-differences discretizations of the Mumford–Shah functional. 83(2), 397–420 (2015)Ĭhambolle, A.: Image segmentation by variational methods: Mumford and Shah functional and the discrete approximations. Technical report, Massachusetts Institute of Technology (1965)Ĭarriero, M., Leaci, A., Tomarelli, F.: A survey on the Blake–Zisserman functional. 11(1), 2–12 (1989)īoykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. MIT Press, Cambridge (1987)īlake, A.: Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction. Springer, Berlin (2004)īellman, R., Roth, R.: Curve fitting by segmented straight lines. 51(1), 39–54 (1989)īar, L., Sochen, N., Kiryati, N.: Variational pairing of image segmentation and blind restoration. 23(3), 1904–1937 (2013)Īuger, I., Lawrence, C.: Algorithms for the optimal identification of segment neighborhoods. 43(1), 41–57 (2005)Īrtina, M., Fornasier, M., Solombrino, F.: Linearly constrained nonsmooth and nonconvex minimization. 43(8), 999–1036 (1990)Īrandiga, F., Cohen, A., Donat, R., Dyn, N.: Interpolation and approximation of piecewise smooth functions. 75(3), 1500–1534 (2017)Īmbrosio, L., Tortorelli, V.M.: Approximation of functional depending on jumps by elliptic functional via \(\gamma \)-convergence. Our reference implementation processes signals with more than 10,000 elements in less than 1 s.Īmat, S., Li, Z., Ruiz, J.: On an new algorithm for function approximation with full accuracy in the presence of discontinuities based on the immersed interface method. We complement these results with a numerical study. Further, we obtain stability results for the proposed algorithms. Remarkably, they thus achieve the worst case complexity of the fastest solver for the piecewise constant Mumford–Shah model (which is the simplest model of the class). We show that the worst case complexity of all proposed schemes is quadratic in the length of the signal. As a main contribution, we derive fast minimization algorithms for Mumford–Shah models of arbitrary orders. In this work, we study these models in the univariate situation: we discuss important differences to the first order Mumford–Shah model, and we obtain uniqueness results for their solutions. This can be improved by building on splines of higher order which leads to higher order Mumford–Shah models. A significant limitation of the standard Mumford–Shah model is that linear trends-and in general polynomial trends-in the data are not well preserved. Minimizing the Mumford–Shah functional is frequently used for smoothing signals or time series with discontinuities.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |