Pearson / Gabbouj | Nonlinear Digital Filtering with Python | Buch | 978-1-4987-1411-2 | sack.de

Buch, Englisch, 308 Seiten, Format (B × H): 156 mm x 235 mm, Gewicht: 630 g

Pearson / Gabbouj

Nonlinear Digital Filtering with Python


1. Auflage 2015
ISBN: 978-1-4987-1411-2
Verlag: CRC Press

Buch, Englisch, 308 Seiten, Format (B × H): 156 mm x 235 mm, Gewicht: 630 g

ISBN: 978-1-4987-1411-2
Verlag: CRC Press


Nonlinear Digital Filtering with Python: An Introduction discusses important structural filter classes including the median filter and a number of its extensions (e.g., weighted and recursive median filters), and Volterra filters based on polynomial nonlinearities. Adopting both structural and behavioral approaches in characterizing and designing nonlinear digital filters, this book:

- Begins with an expedient introduction to programming in the free, open-source computing environment of Python

- Uses results from algebra and the theory of functional equations to construct and characterize behaviorally defined nonlinear filter classes

- Analyzes the impact of a range of useful interconnection strategies on filter behavior, providing Python implementations of the presented filters and interconnection strategies

- Proposes practical, bottom-up strategies for designing more complex and capable filters from simpler components in a way that preserves the key properties of these components

- Illustrates the behavioral consequences of allowing recursive (i.e., feedback) interconnections in nonlinear digital filters while highlighting a challenging but promising research frontier

Nonlinear Digital Filtering with Python: An Introduction supplies essential knowledge useful for developing and implementing data cleaning filters for dynamic data analysis and time-series modeling.

Pearson / Gabbouj Nonlinear Digital Filtering with Python jetzt bestellen!

Weitere Infos & Material


Introduction. Python. Linear and Volterra Filters. Median Filters and Some Extensions. Forms of Nonlinear Behavior. Composite Structures: Bottom-Up Design. Recursive Structures and Stability.


Ronald K. Pearson is a data scientist with DataRobot. He previously held industrial, business, and academic positions at organizations including the DuPont Company, Swiss Federal Institute of Technology (ETH Zurich), Tampere University of Technology, and Travelers Companies. He holds a Ph.D in electrical engineering and computer science from the Massachusetts Institute of Technology, and has published conference and journal papers on topics ranging from nonlinear dynamic model structure selection to the problems of disguised missing data in predictive modeling. Dr. Pearson has authored or co-authored four previous books, the most recent being Exploring Data in Engineering, the Sciences, and Medicine.

Moncef Gabbouj is an Academy of Finland professor of signal processing at Tampere University of Technology. He holds a B.Sc in electrical engineering from Oklahoma State University, and an M.Sc and Ph.D in electrical engineering from Purdue University. Dr. Gabbouj is internationally recognized for his research in nonlinear signal and image processing and analysis. His research also includes multimedia analysis, indexing and retrieval, machine learning, voice conversion, and video processing and coding. Previously, Dr. Gabbouj held visiting professorships at institutions including the Hong Kong University of Science and Technology, Purdue University, University of Southern California, and American University of Sharjah.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.