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

Vasiliy Sachnev

dblp:68/321 · also Vasily Sachnev · DBLP profile ↗
← Back
10ranked-venue papers
7as first author
0since 2021 · last 2019
0000-0001-7063-5069ORCID · corroborated

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

Security and privacy · 6 · 5 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorTheory of computation · 1Applied, interdisciplinary, general and emerging computing · 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
2 papers
Digital forensics and information hiding · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding
steganography
0.112012
An Efficient Embedder for BCH Coding for Steganography · IEEE Trans. Inf. Theory 2012
Digital forensics and information hiding
data embedding
0.112008
A Novel Difference Expansion Transform for Reversible Data Embedding · IEEE Trans. Inf. Forensics Secur. 2008
Digital forensics and information hiding › data embedding
difference expansion
0.112008
A Novel Difference Expansion Transform for Reversible Data Embedding · IEEE Trans. Inf. Forensics Secur. 2008
Digital forensics and information hiding › steganography
reversible data hiding
0.112008
A Novel Difference Expansion Transform for Reversible Data Embedding · IEEE Trans. Inf. Forensics Secur. 2008
Coding theory › error-correcting codes › cyclic codes
BCH codes
0.012012
An Efficient Embedder for BCH Coding for Steganography · IEEE Trans. Inf. Theory 2012
Coding theory
syndrome coding
0.012012
An Efficient Embedder for BCH Coding for Steganography · IEEE Trans. Inf. Theory 2012

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

location map · 0.1difference expansion transform · 0.1
YearPublicationVenuePosition
2019 Skewed Histogram Shifting for Reversible Data Hiding Using a Pair of Extreme Predictions
abstract
Reversible data hiding hides data in an image such that the original image is recoverable. This paper presents a novel embedding framework with reduced distortion called skewed histogram shifting using a pair of extreme predictions. Unlike traditional prediction error histogram shifting schemes, where only one good prediction is used to generate a prediction error histogram, the proposed scheme uses a pair of extreme predictions to generate two skewed histograms. By exploiting the structure of the skewed histogram, only the pixels from the peak and the short tail are used for embedding, which decreases the distortion from the lesser number of pixels being shifted. Detailed experiments and analysis are provided using several image databases.
Suah Kim, Xiaochao Qu, Vasiliy Sachnev, Hyoung Joong Kim
IEEE Trans. Circuits Syst. Video Technol.3
2015 Multi-class BCGA-ELM based classifier that identifies biomarkers associated with hallmarks of cancer
abstract
BACKGROUND: Traditional cancer treatments have centered on cytotoxic drugs and general purpose chemotherapy that may not be tailored to treat specific cancers. Identification of molecular markers that are related to different types of cancers might lead to discovery of drugs that are patient and disease specific. This study aims to use microarray gene expression cancer data to identify biomarkers that are indicative of different types of cancers. Our aim is to provide a multi-class cancer classifier that can simultaneously differentiate between cancers and identify type-specific biomarkers, through the application of the Binary Coded Genetic Algorithm (BCGA) and a neural network based Extreme Learning Machine (ELM) algorithm. RESULTS: BCGA and ELM are combined and used to select a subset of genes that are present in the Global Cancer Mapping (GCM) data set. This set of candidate genes contains over 52 biomarkers that are related to multiple cancers, according to the literature. They include APOA1, VEGFC, YWHAZ, B2M, EIF2S1, CCR9 and many other genes that have been associated with the hallmarks of cancer. BCGA-ELM is tested on several cancer data sets and the results are compared to other classification methods. BCGA-ELM compares or exceeds other algorithms in terms of accuracy. We were also able to show that over 50% of genes selected by BCGA-ELM on GCM data are cancer related biomarkers. CONCLUSIONS: We were able to simultaneously differentiate between 14 different types of cancers, using only 92 genes, to achieve a multi-class classification accuracy of 95.4% which is between 21.6% and 38% higher than other results in the literature for multi-class cancer classification. Our findings suggest that computational algorithms such as BCGA-ELM can facilitate biomarker-driven integrated cancer research that can lead to a detailed understanding of the complexities of cancer.
Vasiliy Sachnev, Saras Saraswathi, Rashid Niaz, Andrzej Kloczkowski, Suresh Sundaram 0002
BMC Bioinform.1
2012 An Attempt to Generalize Distortion Measure for JPEG Steganography
Vasiliy Sachnev, Hyoung Joong Kim
IWDW1
2012 An Efficient Embedder for BCH Coding for Steganography
abstract
This paper presents an improved data hiding technique based on BCH (n,k,t) coding. The proposed embedder hides data into a block of input data by modifying some coefficients in the block in order to null the syndrome. The proposed embedder can hide data with less computational time and less storage capacity compared to the existing methods. The complexity of the proposed method is linear while that of other methods are exponential for any block sizen. Thus, it is easy to extend this method to a largen. The BCH syndrome coding for steganography is now viable ascribed to the reduced complexity and its simplicity of the proposed embedder.
Rongyue Zhang, Vasiliy Sachnev, Magnus Bakke Botnan, Hyoung Joong Kim
IEEE Trans. Inf. Theory2
2011 An Improved Matrix Encoding Scheme for JPEG Steganography
Vasiliy Sachnev, Hyoung Joong Kim
IWDW1
2010 Ternary Data Hiding Technique for JPEG Steganography
Vasiliy Sachnev, Hyoung Joong Kim
IWDW1
2009 Reversible Watermarking Algorithm Using Sorting and Prediction
abstract
This paper presents a reversible or lossless watermarking algorithm for images without using a location map in most cases. This algorithm employs prediction errors to embed data into an image. A sorting technique is used to record the prediction errors based on magnitude of its local variance. Using sorted prediction errors and, if needed, though rarely, a reduced size location map allows us to embed more data into the image with less distortion. The performance of the proposed reversible watermarking scheme is evaluated using different images and compared with four methods: those of Kamstra and Heijmans, Thodi and Rodriguez, and Lee et al. The results clearly indicate that the proposed scheme can embed more data with less distortion.
Vasiliy Sachnev, Hyoung Joong Kim, Jeho Nam, Suresh Sundaram 0002, Yun Q. Shi 0001
IEEE Trans. Circuits Syst. Video Technol.1
2008 A Novel Approach for JPEG Steganography
Vasiliy Sachnev, Hyoung Joong Kim, Rongyue Zhang, Yongsoo Choi
IWDW1
2008 A Novel Difference Expansion Transform for Reversible Data Embedding
abstract
Reversible data embedding theory has marked a new epoch for data hiding and information security. Being reversible, the original data and the embedded data should be completely restored. Difference expansion transform is a remarkable breakthrough in reversible data-hiding schemes. The difference expansion method achieves high embedding capacity and keeps distortion low. This paper shows that the difference expansion method with the simplified location map and new expandability can achieve more embedding capacity while keeping the distortion at the same level as the original expansion method. Performance of the proposed scheme in this paper is shown to be better than the original difference expansion scheme by Tian and its improved version by Kamstra and Heijmans. This improvement can be possible by exploiting the quasi-Laplace distribution of the difference values.
Hyoung Joong Kim, Vasiliy Sachnev, Yun Q. Shi 0001, Jeho Nam, Hyon-Gon Choo
IEEE Trans. Inf. Forensics Secur.2
2007 An Improved Reversible Difference Expansion Watermarking Algorithm
Vasiliy Sachnev, Hyoung Joong Kim, Shijun Xiang, Jeho Nam
IWDW1