Yatish J. NaikRaikar

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

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

Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Computer graphics and multimedia
1 paper
Image and video coding · 100%
Network and information security
1 paper
Digital forensics and information hiding · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › block-based coding
JPEG
0.112010
Data Embedding in JPEG Bitstream by Code Mapping · IEEE Trans. Image Process. 2010
Digital forensics and information hiding
data embedding
0.112010
Data Embedding in JPEG Bitstream by Code Mapping · IEEE Trans. Image Process. 2010

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

variable length code mapping · 0.2error concealment · 0.2
YearPublicationVenuePosition
2010 Data Embedding in JPEG Bitstream by Code Mapping
abstract
We propose an algorithm to embed data directly in the bitstream of JPEG imagery. The motivation for this approach is that images are seldom available in uncompressed form. Algorithms that operate in spatial domain, or even in coefficient domain, require full (or at best) partial decompression. Our approach exploits the fact that only a fraction of JPEG code space is actually used by available encoders. Data embedding is performed by mapping a used variable length code (VLC) to an unused VLC. However, standard viewers unaware of the change will not properly display the image. We address this problem by a novel error concealment technique. Concealment works by remapping run/size values of marked VLCs so that standard viewers do not lose synchronization and displays the image with minimum loss of quality. It is possible for the embedded image to be visually identical to the original even though the two files are bitwise different. The algorithm is fast and transparent and embedding is reversible and file-size preserving. Under certain circumstances, file size may actually decrease despite carrying a payload.
Bijan G. Mobasseri, Robert J. Berger II, Michael P. Marcinak, Yatish J. NaikRaikar
IEEE Trans. Image Process.4