Dictionary Learning Algorithms and Applications by Bogdan Dumitrescu
Home > Science & Mathematics > Mathematics > Applied mathematics > Mathematical modelling > Dictionary Learning Algorithms and Applications
Dictionary Learning Algorithms and Applications

Dictionary Learning Algorithms and Applications


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
About the Book

This book covers all the relevant dictionary learning algorithms, presenting them in full detail and showing their distinct characteristics while also revealing the similarities. It gives implementation tricks that are often ignored but that are crucial for a successful program. Besides MOD, K-SVD, and other standard algorithms, it provides the significant dictionary learning problem variations, such as regularization, incoherence enforcing, finding an economical size, or learning adapted to specific problems like classification. Several types of dictionary structures are treated, including shift invariant; orthogonal blocks or factored dictionaries; and separable dictionaries for multidimensional signals. Nonlinear extensions such as kernel dictionary learning can also be found in the book. The discussion of all these dictionary types and algorithms is enriched with a thorough numerical comparison on several classic problems, thus showing the strengths and weaknesses of each algorithm. A few selected applications, related to classification, denoising and compression, complete the view on the capabilities of the presented dictionary learning algorithms. The book is accompanied by code for all algorithms and for reproducing most tables and figures.

  • Presents all relevant dictionary learning algorithms - for the standard problem and its main variations - in detail and ready for implementation;
  • Covers all dictionary structures that are meaningful in applications;
  • Examines the numerical properties of the algorithms and shows how to choose the appropriate dictionary learning algorithm.


About the Author:

Bogdan Dumitrescu received the M.S. and Ph.D. degrees in 1987 and 1993, respectively, from University Politehnica of Bucharest, Romania. He is a Professor with the Department of Automatic Control and Computers, University Politehnica of Bucharest. He held several visiting research positions at Tampere International Center for Signal Processing, Tampere University of Technology, Finland, in particular that of Finnish Distinguished Professor (FiDiPro) fellow (2010-2013). He was Associate Editor (2008-2012) and Area Editor (2010-2014) at IEEE Transactions on Signal Processing. He is the author of the book "Positive trigonometric polynomials and Signal Processing applications" (Springer 2007, second edition Springer 2017). His scientific interests are in optimization, numerical methods, and their applications to signal processing.

Paul Irofti graduated from the University Politehnica of Bucharest in 2008 and received his PhD in 2016 with the thesis "Parallel Dictionary Learning Algorithms for Sparse Representations" from the same university. He is a Lecturer with the Department of Computer Science, University of Bucharest. His scientific interests are in numerical methods, signal processing and parallel algorithms accompanied by a vast, hands-on, more than 10 years' experience in the open-source community and industry. His publications are focused on dictionary learning algorithms.


Best Sellers



Product Details
  • ISBN-13: 9783030087616
  • Publisher: Springer International Publishing
  • Publisher Imprint: Springer
  • Height: 235 mm
  • No of Pages: 284
  • Spine Width: 0 mm
  • Width: 155 mm
  • ISBN-10: 3030087611
  • Publisher Date: 14 Dec 2018
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Weight: 750 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Dictionary Learning Algorithms and Applications
Springer International Publishing -
Dictionary Learning Algorithms and Applications
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Dictionary Learning Algorithms and Applications

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!