Joint compression and encryption of visual data using orthogonal parametric transforms

Puchala, Dariusz; Yatsymirskyy, Mykhaylo

doi:10.1515/bpasts-2016-0042

Cited by 11 publications

(8 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The obtained rotation‐based structure is shown in Figure 6, and the rotation angles α and the scaling coefficients k are collected in Table 1. The structure is less sensitive to the changes in the quantisation of the filter coefficients than the convolution‐based direct implementation structure [18].…”

Section: Design Examplementioning

confidence: 99%

Synthesis algorithm of low sensitivity non‐separableN‐D finite impulse response filters configured of fast orthogonal 1‐D rotation structures implemented in field programmable gate arrays IC

Poczekajło

Wawryn

2022

IET Signal Processing

View full text Add to dashboard Cite

In the article, a low sensitivity synthesis algorithm of a non-separable N-dimensional (N-D) finite impulse response filter implemented in Field Programmable Gate Arrays (FPGA) is proposed. The synthesis and implementation algorithms determine a pipelined non-separable N-D finite impulse response filter structure consisting of fast Givens rotator structures. The filter transfer function is expressed as a function of N independent 1-D orthogonal transfer functions in each of N directions to avoid difficult, multidimensional equation computation. The rotator structure is obtained using the COR-DIC algorithm. The proposed synthesis algorithm was used to design and optimise the structure of the Laplacian of Gaussian (LoG) 3-D filter. The obtained filter was implemented in FPGA IC and its parameters, sensitivity, processing time and signal-toquantisation noise ratio, were simulated and measured. The assessed results were compared with the theoretical analysis of the filter parameters. In order to verify the advantages of the proposed filtering solution, the parameter results were compared with the results of the convolution direct implementation and the orthogonal/non-orthogonal state-space implementation of the LoG 3-D filter.

show abstract

Section: Design Examplementioning

confidence: 99%

Synthesis algorithm of low sensitivity non‐separableN‐D finite impulse response filters configured of fast orthogonal 1‐D rotation structures implemented in field programmable gate arrays IC

Poczekajło

Wawryn

2022

IET Signal Processing

View full text Add to dashboard Cite

show abstract

“…Then the mapping of the bits of the private key ( q bits resulting in

different values) onto the values of parameters (from the range

) can be implemented according to the formula

, where

for

(c.f. [ 13 , 31 ]). Then the concatenation of the bit representations of numbers

is the part of the private key

describing the transformation.…”

Section: Fast Parametric Orthogonal Transformsmentioning

confidence: 99%

“…In this paper we analyze in more details the novel scheme for encryption and compression of images according to the ETC scenario, which was was proposed during the 2020 Data Compression Conference (see [ 12 ]). The encryption stage takes advantage of linear orthogonal transforms and the known approach of image data mixing within blocks selected from different areas of an image [ 13 ]. Such operation in the encryption process allows to keep the statistical characteristics of the image, which is crucial from the point of view of the succeeding compression stage.…”

Section: Introductionmentioning

confidence: 99%

Image Statistics Preserving Encrypt-then-Compress Scheme Dedicated for JPEG Compression Standard

Puchala

Stokfiszewski

Yatsymirskyy

2021

Entropy

View full text Add to dashboard Cite

In this paper, the authors analyze in more details an image encryption scheme, proposed by the authors in their earlier work, which preserves input image statistics and can be used in connection with the JPEG compression standard. The image encryption process takes advantage of fast linear transforms parametrized with private keys and is carried out prior to the compression stage in a way that does not alter those statistical characteristics of the input image that are crucial from the point of view of the subsequent compression. This feature makes the encryption process transparent to the compression stage and enables the JPEG algorithm to maintain its full compression capabilities even though it operates on the encrypted image data. The main advantage of the considered approach is the fact that the JPEG algorithm can be used without any modifications as a part of the encrypt-then-compress image processing framework. The paper includes a detailed mathematical model of the examined scheme allowing for theoretical analysis of the impact of the image encryption step on the effectiveness of the compression process. The combinatorial and statistical analysis of the encryption process is also included and it allows to evaluate its cryptographic strength. In addition, the paper considers several practical use-case scenarios with different characteristics of the compression and encryption stages. The final part of the paper contains the additional results of the experimental studies regarding general effectiveness of the presented scheme. The results show that for a wide range of compression ratios the considered scheme performs comparably to the JPEG algorithm alone, that is, without the encryption stage, in terms of the quality measures of reconstructed images. Moreover, the results of statistical analysis as well as those obtained with generally approved quality measures of image cryptographic systems, prove high strength and efficiency of the scheme’s encryption stage.

show abstract

“…However, it should be noted that the used algorithms do not allow us to divide the complex data correctly. The solution of this problem can be achieved by the use of the modern methods of complex data processing [10,11] within the framework of the objective clustering inductive technology and implementation of this technology based on other clustering algorithms.…”

Section: Review Of the Literaturementioning

confidence: 99%

Implementation of Dbscan Clustering Algorithm Within the Framework of the Objective Clustering Inductive Technology Based on R and Knime Tools

Babichev

Vyshemyrska

Lytvynenko

2019

Radio Electronics, Computer Science, Control

View full text Add to dashboard Cite

Context. The problem of the data clustering within the framework of the objective clustering inductive technology is considered. Practical implementation of the obtained hybrid model based on the complex use of R and KNIME tools is performed. The object of the study is the hybrid model of the data clustering based on the complex use of both DBSCAN clustering algorithm and the objective clustering inductive technology. Objective. The aim of the work is the creation of the hybrid model of the objective clustering based on DBSCAN clustering algorithm and its practical implementation on the basis of the complex use of both R and KNIME tools. Method. The inductive methods of complex systems modelling have been used as the basis to determine the optimal parameters of DBSCAN clustering algorithm within the framework of the objective clustering inductive technology. The practical implementation of this technology involves: the use of two equal power subsets, which contain the same quantity of pairwise similar objects; calculation of the internal and the external clustering quality criteria; calculation of the complex balance criterion, maximum value of which corresponds to the best clustering in terms of the used criteria. Implementation of this process involves two main stages. Firstly, the optimal values of the EPS parameter were determined at each step within the range of the minPts value changes. The charts of the complex balance criterion versus the EPS value were obtained for each minPts value as the results of this stage implementation. Then, the analysis of the obtained intermediate results was performed in order to determine the optimal solution, which corresponds to both the maximum value of the complex balance criterion on the one side and the aims of the current clustering on the other side. Results. The developed hybrid model has been implemented based on software KNIME with the use of plugins, which have been written in software R. The efficiency of the model was tasted with the use of the different data: low dimensional data of the computing school of East Finland University; Fisher's iris; gene expression profiles of the patients, which were investigated on lung cancer. Conclusions. The results of the simulation have shown high efficiency of the proposed method. The studied objects were distributed into clusters correctly in all cases. The proposed method allows us to decrease the reproducibility error, since the solution concerning determination of the clustering algorithm optimal parameters was taken based on both the clustering results obtained on equal power subsets separately and the difference of the clustering results obtained on the two equal power subsets.

show abstract

Joint compression and encryption of visual data using orthogonal parametric transforms

Cited by 11 publications

References 31 publications

Synthesis algorithm of low sensitivity non‐separableN‐D finite impulse response filters configured of fast orthogonal 1‐D rotation structures implemented in field programmable gate arrays IC

Synthesis algorithm of low sensitivity non‐separableN‐D finite impulse response filters configured of fast orthogonal 1‐D rotation structures implemented in field programmable gate arrays IC

Image Statistics Preserving Encrypt-then-Compress Scheme Dedicated for JPEG Compression Standard

Implementation of Dbscan Clustering Algorithm Within the Framework of the Objective Clustering Inductive Technology Based on R and Knime Tools

Contact Info

Product

Resources

About