Home > Technology & Engineering > Electronics & communications engineering > Electronics engineering > Circuits & components > Algorithms for Efficient and Fast 3d-Hevc Depth Map Encoding
38%
Algorithms for Efficient and Fast 3d-Hevc Depth Map Encoding

Algorithms for Efficient and Fast 3d-Hevc Depth Map Encoding

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This book describes and analyzes in detail the encoding effort and the encoding tool usage applied to 3D-HEVC depth map coding. Based on the analyzed information, the authors introduce efficient algorithms for accelerating the available encoding tools. The contributions discussed in this book include four algorithms for reducing intra-frame encoding effort and three algorithms for reducing inter-frame encoding effort. The presented results demonstrate several levels of encoding effort reduction with different impacts in the encoding efficiency, surpassing state-of-the-art solutions by more than 50% the encoding effort with only 0.3% encoding efficiency loss.


About the Author:

Gustavo Sanchez is a Professor at the IFFarroupilha, Brazil. Sanchez received the Electrical Engineer degree from the Sul-Rio-Grandense Federal Institute of Education, Science and Technology and B.S. degree in Computer Science from the Federal University of Pelotas. He received his M.Sc. degree in Computer Science from the Federal University of Pelotas and his Ph.D. degree in Computer Science at the Pontifical Catholic University of Rio Grande do Sul. His research interests include complexity reduction algorithms, hardware-friendly algorithms and dedicated hardware design for 2D and 3D video coding.

Luciano Agostini is a professor at Federal University of Pelotas (UFPel), Brazil, where he leads the Video Technology Research Group (ViTech). He is a Brazilian distinguished researcher with a CNPq PQ-1D grant and received the M.S. and Ph.D. degrees from Federal University of Rio Grande do Sul (UFRGS), Brazil. He was the Executive Vice President for Research and Graduate Studies at UFPel. His research interest is primarily in 2D and 3D video coding, algorithmic optimization, arithmetic circuits and digital systems. Dr. Agostini has published more than 250 articles in journals and international events. He is a Senior Member of ACM and a Senior Member IEEE, where he is a member of CAS, CS, and SPS societies. He is also member of SBC and SBMicro Brazilian societies.

César Marcon is a Professor at the Polytechnic School of Pontifical Catholic University of Rio Grande do Sul (PUCRS). He is a Brazilian distinguished researcher with a CNPq PQ-2 grant. Prof. Marcon received the Ph.D. degree in Computer Science from Federal University of Rio Grande do Sul (UFRGS), Brazil. Professor Marcon is Senior Member of the Institute of Electrical and Electronics Engineers (IEEE) and Member of the Brazilian Computer Society (SBC). He is advisor of M.Sc. and Ph.D. graduate students at Graduate Program in Computer Science of PUCRS. He has more than 100 papers published in prestigious journals and conference proceedings. Prof. Marcon coordinate several research projects in areas of telecom, healthcare, and telemedicine. His research interests are in the areas of embedded systems in the telecom domain, MPSoC architectures, partitioning and mapping application tasks, fault-tolerance and real-time operating systems.


Best Sellers



Product Details
  • ISBN-13: 9783030259266
  • Publisher: Springer International Publishing
  • Publisher Imprint: Springer
  • Height: 234 mm
  • No of Pages: 83
  • Spine Width: 6 mm
  • Width: 156 mm
  • ISBN-10: 3030259269
  • Publisher Date: 06 Sep 2019
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Weight: 317 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Algorithms for Efficient and Fast 3d-Hevc Depth Map Encoding
Springer International Publishing -
Algorithms for Efficient and Fast 3d-Hevc Depth Map Encoding
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.

Algorithms for Efficient and Fast 3d-Hevc Depth Map Encoding

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!