default search action
Andreas Langer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Martin Alkämper, Stephan Hilb, Andreas Langer
:
A primal-dual adaptive finite element method for total variation based motion estimation. CoRR abs/2404.03125 (2024) - [i3]Andreas Langer, Sara Behnamian:
DeepTV: A neural network approach for total variation minimization. CoRR abs/2409.05569 (2024) - [i2]Thomas Jacumin, Andreas Langer:
An Adaptive Finite Difference Method for Total Variation Minimization. CoRR abs/2410.13608 (2024) - 2023
- [j12]Stephan Hilb, Andreas Langer
A Primal-Dual Finite Element Method for Scalar and Vectorial Total Variation Minimization. J. Sci. Comput. 96(1): 24 (2023) - 2022
- [i1]Stephan Hilb, Andreas Langer
A General Decomposition Method for a Convex Problem Related to Total Variation Minimization. CoRR abs/2211.00101 (2022)
2010 – 2019
- 2019
- [j11]Andreas Langer
Locally adaptive total variation for removing mixed Gaussian-impulse noise. Int. J. Comput. Math. 96(2): 298-316 (2019) - [j10]Andreas Langer
Overlapping Domain Decomposition Methods for Total Variation Denoising. SIAM J. Numer. Anal. 57(3): 1411-1444 (2019) - 2018
- [j9]Andreas Langer
Investigating the Influence of Box-Constraints on the Solution of a Total Variation Model via an Efficient Primal-Dual Method. J. Imaging 4(1): 12 (2018) - 2017
- [j8]Andreas Langer
Automated Parameter Selection for Total Variation Minimization in Image Restoration. J. Math. Imaging Vis. 57(2): 239-268 (2017) - [j7]Michael Hintermüller
Optimal Selection of the Regularization Function in a Weighted Total Variation Model. Part II: Algorithm, Its Analysis and Numerical Tests. J. Math. Imaging Vis. 59(3): 515-533 (2017) - 2015
- [j6]Michael Hintermüller
Non-Overlapping Domain Decomposition Methods For Dual Total Variation Based Image Denoising. J. Sci. Comput. 62(2): 456-481 (2015) - [c1]José Moreira, Stephan Leuschner, Nenad Stevanovic, Harald Pretl
9.2 A single-chip HSPA transceiver with fully integrated 3G CMOS power amplifiers. ISSCC 2015: 1-3 - 2013
- [j5]Andreas Langer
Bregmanized Domain Decomposition for Image Restoration. J. Sci. Comput. 54(2-3): 549-576 (2013) - [j4]Michael Hintermüller
Subspace Correction Methods for a Class of Nonsmooth and Nonadditive Convex Variational Problems with Mixed L1/L2 Data-Fidelity in Image Processing. SIAM J. Imaging Sci. 6(4): 2134-2173 (2013) - 2012
- [j3]Massimo Fornasier, Yunho Kim
Wavelet Decomposition Method for L2//TV-Image Deblurring. SIAM J. Imaging Sci. 5(3): 857-885 (2012) - 2011
- [j2]Andreas Langer:
On the syntomic regulator for products of elliptic curves. J. Lond. Math. Soc. 84(2): 495-513 (2011) - 2010
- [j1]Massimo Fornasier, Andreas Langer
A convergent overlapping domain decomposition method for total variation minimization. Numerische Mathematik 116(4): 645-685 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: