Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bata Vasic

dblp:75/11268 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Digital forensics and information hiding · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding › watermarking
3d mesh watermarking
0.212013
Simplification Resilient LDPC-Coded Sparse-QIM Watermarking for 3D-Meshes · IEEE Trans. Multim. 2013
Digital forensics and information hiding
watermarking
0.212013
Simplification Resilient LDPC-Coded Sparse-QIM Watermarking for 3D-Meshes · IEEE Trans. Multim. 2013
Coding theory › error-correcting codes › insertion and deletion › insertion-deletion channel
deletion-correcting codes
0.212013
Simplification Resilient LDPC-Coded Sparse-QIM Watermarking for 3D-Meshes · IEEE Trans. Multim. 2013
Coding theory
error-correcting codes
0.212013
Simplification Resilient LDPC-Coded Sparse-QIM Watermarking for 3D-Meshes · IEEE Trans. Multim. 2013

Methods — techniques the papers use, named apart from their topics

quantization index modulation · 0.3LDPC coding · 0.3
YearPublicationVenuePosition
2013 Simplification Resilient LDPC-Coded Sparse-QIM Watermarking for 3D-Meshes
abstract
We propose a blind watermarking scheme for 3D meshes that combines sparse quantization index modulation (QIM) with deletion correction codes. The QIM operates on the vertices in rough concave regions of the surface thus ensuring impeccability, while the deletion correction code recovers the data hidden in the vertices, which is removed by mesh optimization and/or simplification. The proposed scheme offers two orders of magnitude better performance in terms of recovered watermark bit error rate compared to the existing schemes of similar payloads and fidelity constraints.
Bata Vasic, Bane Vasic
IEEE Trans. Multim.1