![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Hartmut Schröder
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [c13]Martin Max Richter, Fabian Nasse, Hartmut Schröder:
Motion adaptive Kalman filter for super-resolution. Visual Information Processing and Communication 2011: 78820A - 2010
- [c12]Martin Max Richter, Mathias Stober, Hartmut Schröder:
Quality controlled artifact reduction. EUSIPCO 2010: 621-625 - [c11]Peter Westermann, Hartmut Schröder:
On the scalability of SIMD processing for software defined radio algorithms. ICSAMOS 2010: 309-317
2000 – 2009
- 2009
- [c10]Peter Westermann, Hartmut Schröder:
Constraints on the SIMD vectorization of radix-2 and mixed-radix FFTS. EUSIPCO 2009: 1274-1278 - [c9]Peter Westermann, Hartmut Schröder:
Modeling Scalable SIMD DSPs in LISA. SAMOS 2009: 161-170 - 2008
- [c8]Carsten Dolar, Hartmut Schröder:
Modeling perceived LCD moving image representation. Color Imaging: Processing, Hardcopy, and Applications 2008: 68070E - [c7]Sebastian Lenke, Hartmut Schröder:
Classification based polynomial image interpolation. Image Processing: Algorithms and Systems 2008: 681214 - 2005
- [c6]Hendrik Lange, Hartmut Schröder:
Evaluation Strategies for Coarse Grained Reconfigurable Architectures. FPL 2005: 586-589 - 2004
- [c5]Henning Lorch, Peter Morguet, Hartmut Schröder:
Fingerprint Distortion Measurement. ECCV Workshop BioAW 2004: 111-123 - 2002
- [c4]Ortwin Franzen, Hartmut Schröder:
Nonlinear polyphase image rate conversion. EUSIPCO 2002: 1-4 - 2001
- [j3]Zhichun Lei, Ortwin Franzen, Jörg Brakensiek, Hartmut Schröder:
Constant modulus algorithm for blind equalization of multipath transmitted video signals in cable networks. Signal Process. Image Commun. 16(5): 413-420 (2001)
1990 – 1999
- 1998
- [j2]Ortwin Franzen, Holger Blume
, Hartmut Schröder:
FIR-filter design with spatial and frequency design constraints using evolution strategies. Signal Process. 68(3): 295-306 (1998) - [j1]Zhichun Lei, Hartmut Schröder:
Adaptive equalisation of multipath interference for mobile video signal reception. IEEE Trans. Broadcast. 44(2): 172-181 (1998) - 1997
- [c3]Zhichun Lei, Peter Appelhans, Hartmut Schröder:
Image processing techniques for blind TV ghost cancellation. ICASSP 1997: 2561-2564 - 1996
- [c2]Aishy Amer, Hartmut Schröder:
A new video noise reduction algorithm using spatial subbands. ICECS 1996: 45-48 - 1995
- [c1]Ludwig Schwoerer, Matthias Lück, Hartmut Schröder:
Integration of VHDL into a system design environment. EURO-DAC 1995: 268-273
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-04-25 05:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint