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

Kannan Karthik

dblp:82/4423 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
1since 2021 · last 2023
—ORCID · none

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

Security and privacy · 3 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 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.

Network and information security
1 paper
Digital forensics and information hiding · 83% Cryptographic primitives and cryptanalysis · 17%

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

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding
fingerprinting
0.012004
Video Fingerprinting and Encryption Principles for Digital Rights Management · Proc. IEEE 2004
Digital forensics and information hiding › fingerprinting
video fingerprinting
0.012004
Video Fingerprinting and Encryption Principles for Digital Rights Management · Proc. IEEE 2004
Digital forensics and information hiding
watermarking
0.012004
Video Fingerprinting and Encryption Principles for Digital Rights Management · Proc. IEEE 2004
Cryptographic primitives and cryptanalysis
encryption
0.012004
Video Fingerprinting and Encryption Principles for Digital Rights Management · Proc. IEEE 2004
Cryptographic primitives and cryptanalysis › encryption
partial encryption
0.012004
Video Fingerprinting and Encryption Principles for Digital Rights Management · Proc. IEEE 2004

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

video scrambling · 0.0
YearPublicationVenuePosition
2023 Image life trails based on contrast reduction models for face counter-spoofing
abstract
Abstract Natural face images are both content and context-rich, in the sense that they carry significant immersive information via depth cues embedded in the form of self-shadows or a space varying blur. Images of planar face prints, on the other hand, tend to have lower contrast and also suppressed depth cues. In this work, a solution is proposed, to detect planar print spoofing by enhancing self-shadow patterns present in face images. This process is facilitated and siphoned via the application of a non-linear iterative functional map, which is used to produce a contrast reductionist image sequence, termed as an image life trail. Subsequent images in this trail tend to have lower contrast in relation to the previous iteration. Differences taken across this image sequence help in bringing out the self-shadows already present in the original image. The proposed solution has two fronts: (i) a calibration and customization heavy 2-class client specific model construction process, based on self-shadow statistics, in which the model has to be trained with respect to samples from the new environment, and (ii) a subject independent and virtually environment independent model building procedure using random scans and Fourier descriptors, which can be cross-ported and applied to new environments without prior training. For the first case, where calibration and customization is required, overall mean error rate for the calibration-set (reduced CASIA dataset) was found to be 0.3106%, and the error rates for other datasets such OULU-NPU and CASIA-SURF were 1.1928% and 2.2462% respectively. For the second case, which involved building a 1-class and 2-class model using CASIA alone and testing completely on OULU, the error rates were 5.86% and 2.34% respectively, comparable to the customized solution for OULU-NPU.
Balaji Rao Katika, Kannan Karthik
EURASIP J. Inf. Secur.2
2020 Correction of complex purple fringing by green-channel compensation and local luminance adaptation
abstract
In natural photography, defects in camera imaging pipeline often result in some form of colour noise or distortion. Nature of this distortion is generally intertwined with scene dependent variables such as positioning, intensity and composition of light source and local object colour reflectivity. One such defect is called purple fringing aberration (PFA). PFA problems are of two types, one of which corresponds to a localised fringing effect near high contrast zones (termed as Isolated PFA or IS‐PFA) and the second which corresponds to a widespread semi‐transparent purple haze over a large part of natural scene (termed as complex PFA or C‐PFA). Much of the PFA‐correction solutions have been driven towards IS‐PFA and very little towards C‐PFA. Based on a premise that in C‐PFA, green channel is heavily suppressed and noisy, while colour information in red and blue channels are largely conserved, authors propose a green‐channel compensation algorithm for restoring true natural colours in fringe affected region. To correct white‐tuft produced by proposed compensation algorithm, they also devise a suitable localised luminance adaptation procedure to equalise perceived changes in luminance profile. Comparisons with state‐of‐the‐art methods devised to combat this purple haze effect yield promising results for a majority of test cases.
Parveen Malik, Kannan Karthik
IET Image Process.2
2020 Face anti-spoofing by identity masking using random walk patterns and outlier detection
Balaji Rao Katika, Kannan Karthik
Pattern Anal. Appl.2
2013 Virtually Reconfigurable Secure Wireless Networks Using Broadcast Tokens
Kannan Karthik
NSS1
2012 A robust alignment-free fingerprint hashing algorithm based on minimum distance graphs
Priyanka Das 0001, Kannan Karthik, Boul Chandra Garai
Pattern Recognit.2
2007 A novel anti-collusion coding scheme tailored to track linear collusions
abstract
A set of semi-fragile watermarks Wfr= {V1, V2,.., Vv} can be used as building blocks for constructing any digital fingerprint. One such family, is obtained by modulating the sign bits alone of selective DCT-AC coefficients, where, each Vjrepresents the positions of a disjoint subset of modulated coefficients. We show that a linear collusion of Kjand '0' its erasure. By design, each block Vjis unperturbed by specific collusion patterns and so by facilitating complementary coverage of each newly added block Vj+1, a compact anti-collusion code (ACC)for tracking linear collusions can be constructed.
Kannan Karthik, Dimitrios Hatzinakos
IAS1
2004 Video Fingerprinting and Encryption Principles for Digital Rights Management
abstract
This paper provides a tutorial and survey of digital fingerprinting and video scrambling algorithms based on partial encryption. Necessary design tradeoffs for algorithm development are highlighted for multicast communication environments. We also propose a novel architecture for joint fingerprinting and decryption that holds promise for a better compromise between practicality and security for emerging digital rights management applications.
Deepa Kundur, Kannan Karthik
Proc. IEEE2