Abstract
Compressive coded rotating mirror (CCRM) camera is a novel highspeed imaging system that operates under amplitude optical encoding and frame sweeping modalities in a passive imaging mode that is capable of reconstructing 1400 frames from a single shot image acquisition and achieves the highest compression ratio of 368 compared to the other compressive sensing (CS) based singleshot imaging modalities. The integrated optical encoding and compression adds a strong layer of encryption on the observed data and facilitates the integration of the CCRM camera with the imaging applications that require highly efficient data encryption and compression due to capturing highly sensitive data or limited transmission and storage capacities. CCRM uses amplitude encoding that significantly extends the key space where the probability of having the exact encoder pattern is estimated as \(P\left( A\right) \ =\ 1/{10}^{122,500}\), hence drastically reducing the possibility of data recovery in a brute force manner. Data reconstruction is achieved under CS based algorithms where the obtained amplitudebased pattern from optical encoder operates as the key in the recovery process. Reconstruction on the experimental as well as the synthetic data at various compression ratios demonstrate that the estimated key with less than 95\(\%\) matching elements were unable to recover the data where the achieved averaged structural similarity (SSIM) of 0.25 before 95\(\%\) encoder similarity and 0.85 SSIM at 100\(\%\) encoder similarity demonstrates the highsensitivity of the proposed optical encryption technique.
Introduction
With recent advancements in highspeed imaging technologies, especially with the introduction of compressive sensing into their operation principle, highspeed imaging systems have become accessible for a wider range of applications, from capturing natural and ordinary dynamic scenes^{1,2} to highthroughput cell screening and classification^{3,4,5}. These imaging systems however were associated with their unique disadvantages such as the requirement for expensive shortpulse laser (operation only in active mode) and the dependency on the precise repetition of the ultrafast event during the captures (multishot imaging), lacking the capability of imaging the luminescent transient events, monochrome scaled captures, low number of captured frames (short duration of recording), demanding storage and transmission capacity requirements, extremely high built costs, high maintenance, oversized dimensions and highly complex operations. Coded compressive rotating mirror (CCRM) camera^{6} is a lowcost and compact novel highspeed imaging system that enables the capture of dynamic transient events in passive imaging mode in color format using optical encoding and compression hence facilitating the capture of events for longer durations with a considerably lower transmission and storage capacity requirements.
Within the wide range of highspeed imaging applications and alongside the requirements such as low build costs, compact dimensions and easytooperate functionality, there are some particular areas that demand several other key properties from their imaging systems such as the highly secured and encrypted data with compressed formats. Some of these applications include undervehicle inspection^{7,8}, quantumsecured imaging^{9}, secured data storage and transmission using digital holography^{10}, biometrics^{11,12} and military based applications^{13,14}. Therefore by the advancements in the aforementioned fields, the requirement for fast and secured data encryption and compression becomes increasingly important.
There are several industrystandard methods^{15,16} such as advanced encryption standard (AES)^{17} and RivestShamirAdleman (RSA)^{18} that have been widely adapted in industrial applications and have also been used within the current computer operating systems. In addition to these techniques, other encryption methods that has also been used in imaging fields can be divided into several categories^{19} of chaos^{20,21,22,23,24,25}, DNA based^{26,27,28}, cellular automata^{29,30,31}, fuzzy logic^{32,33,34} and transform based (e.g., Wavelet, Fourier, Frensel etc)^{35,36,37,38} as well as cryptographic techniques using compressive sensing (CS)^{39,40,41} in digital domain. These techniques require the initial acquisition and storage of the data in the memory of a processing unit where the aforementioned techniques can access the raw data and apply the encryption in a separate step. Therefore, the original and unsecured data require a large amount storage and transmission capacities, lengthy processing times and can be easily attacked by the intruders while in their unencrypted format.
Furthermore, optical based methods have been widely utilized in the field of image cryptography that is due to their faster computational speed and data processing in different optical domains. Methods such as double random phase encoding^{42} that implements two random phase diffusers in space and frequency domains, optical colour image encryption^{43} and multibeams interference with vector composition^{44}, utilize the advantages of optical imaging encoding where the data are stored in their encrypted format. These methods can be applied on lowspeed imaging systems where the data acquisition rate is the same as the frame rate of the detector. Additionally, these types of image encryption techniques only apply the optical encryption on the original data where the compression is an extra step that is commonly applied on the data after they have been stored on a memory unit hence requiring high storage and transmission capacities, similar to those methods in the digital domain. Therefore achieving both data encryption with high security and high compression in the optical domain, becomes a necessity to overcome the aforementioned shortcomings on the conventional data encryptioncompression modalities.
To address these matters, we utilize the CCRM camera^{6} to securely capture and compress the dynamic scene with high frame rates entirely in optical domain, hence overcoming the limitations of aforementioned video encryption and compression techniques. CCRM camera captures transient events in passive imaging mode and by relying on its optical encoding (key) and continuous frame sweep on the detector surface that achieves the highest compression ratio of 368 and highest sequence depth of 1400 frames form a single exposure (single capture) of the detector. The heavily compressed data from the CCRM camera that are encoded by the optical mask can only be decrypted using the observed pattern on the detector which is considered as the “key” to the reconstruction process. Alongside the high capture rate of the CCRM camera, the highly secured and compressed data format eliminates the aforementioned drawbacks of the conventional digital and optical encryptioncompression methods and provides a new imaging platform for the applications such as medical and military based imaging systems where the confidentiality of the data remain the first priority.
Operation of CCRM camera
Depicted in Fig. 1 is the configuration and operation principle of the coded compressive rotating mirror (CCRM) imaging system. During the capture of a dynamic scene, the image at time t is focused on an static optical mask (noted as 1) that is printed on a sodalime glass and consists of a random binary pattern with 50\(\%\) transmission ratio. The optically encoded image is then focused on the mirror rotating at R (rps) by a high speed motor and reflected towards a 2 dimensional (2D) detector (such as Complementary metaloxidesemiconductor (CMOS) or chargecoupled device (CCD)). The rotation of this mirror sweeps the individual frames across the surface of the detector module based on their time of arrival and overlaps them (optical compression) during a single exposure that creates a single pixel shift inbetween the adjacent frames (noted as 2). Capturing a scene in a single exposure of the detector, eliminates the limitation of digitization and readout time of the camera from the proposed scheme. The captured encoded and heavily compressed 2D frame is then transmitted through a channel and stored on a storage unit.
The mathematical representation of data acquisition process of the proposed CCRM imaging system can be formulated as
where \(y \in {\mathbb {R}}^{MN+(F1)M \times 1}\) is the captured data by the detector in a vectorized format, \(T \in {\mathbb {R}}^{MN+(F1)M \times MNF}\) is the linear operator of frame shifting and overlapping that is built upon F identity matrices, \(C \in {\mathbb {R}}^{MNF \times MNF}\) is the obtained motion profile of the sweep from the calibration points on the encoder in the form of a diagonal matrix, \(A \in {\mathbb {R}}^{MNF \times MNF}\) is the matrix that holds F encoding pattern of \(M \times N\) in a diagonal form, \(x \in {\mathbb {R}}^{MNF \times 1}\) represents the original frames in a vectorized format, and n is the additive zero mean Gaussian noise.
y represents the spatially coded and compressed observed data on the detector that contains the aggregate of individually encoded and temporally overlapped frames where each frame is positioned with a single pixel shift in the horizontal axis (sweep direction) compared to its adjacent frames. All the depicted operations in Eq. (1) occurs in the optical domain and therefore the entire function of encryption and compression happen at the operation speed of the imaging system without any requirements for external processing power or subsidiary operations at the digital domain. Here, we implement the Alternating Direction Method of Multipliers (ADMM)^{45} using the total variation (TV)^{46} as the regularizer function to decrypt and decompress the scene (\({\hat{x}}\)) from observed data (y).
This approach transforms the obtained equation into a minimization problem and solves the equation by minimizing the energy function via iterative calculations.
Decryption and decompression of the original scene can be achieved by solving the minimization problem that is
where \(\rho _k\ ,\ \rho _{tv}\) are the variable regularization and denoiser threshold parameters that are adjusted based on the calculated error at each iteration and \(w_{tv}\) is the regularizer weight for each horizontal, vertical and temporal domains and D is a regularization function that promotes sparsity in the dynamic scene. The linear operation of frame shifting and overlapping (represented by operator T) results in the compression and encryption of the data in CCRM camera^{4}.
Encryption properties of CCRM camera
Optical encoding using binary encoder patterns have been previously utilized in compressive sensing (CS) based highspeed imaging technologies^{1,2,3,4,47} where they have been considered as encoding patterns that enabled the temporal compression and the reconstruction of the data. This encoding pattern however has another significant role in highspeed imaging applications that is to efficiently encrypt the data in the optical domain which could have a high impact in the security of the captured data^{48}. The conventional data encoding techniques require all the raw data to be stored in an accessible storage unit prior to going through the encryption or compression stages. This process required a considerable amounts of storage and transmission capacities and in the cases of digital encryption methods  leaving the confidential data exposed to the possible threats. The sequential operations of optical encoding and compression in the CCRM camera enables the realtime data encryption and eliminates the potential exposure of the data.
In the optical setup of the CCRM camera, as the light transmits through the optical mask, the intensity values of the adjacent pixels interfere with the neighbouring pixels due to the light diffraction and changes the encoder pattern from binary into grey scale pattern. In the previous studies^{2,48} techniques to reverse the encoder pattern back into the binary format has been performed by implementing the commonly used binning process (e.g., 2 \(\times\) 2 or 3 \(\times\) 3) on the detector however this comes at a cost of the reduced spatial resolution of the detected image. CCRM camera exploits this feature of the optical encoder where by attaining a reference image of the encoder pattern on the detector prior to capturing the dynamic scene, the requirements for the binning process is eliminated therefore achieving higher spatial resolution compared to the aforementioned methods. Here, we configure the CCRM camera to capture a scene from the U.S. Air Force (USAF) static target (G2E4). As the dynamics of the scene in the frames are constant over time, by taking a single image of the target a reference image representing all the frames in the scene is obtained. This reference image is then used to evaluate the performance of the reconstruction algorithm by calculating the Peak Signal to Noise Ratio (PSNR) values and the Structural SIMilarity index measurement (SSIM)^{3,4}. Figure 2 shows the effect of quantizing the observed encoder data on the detector where it shown that the data reconstruction using the observed greyscale pattern has the highest reconstruction quality. Furthermore, increasing the dimension of encoder pixels (increased ratio between mask and detector pixel size) also reduces the reconstruction quality of the data when there binning process is not applied on the detector. We perform analysis on four datasets of blood cells flowing in a microfluidic chip (experimental data  courtesy of Kim Ulvberget @Greenlife.no)^{49}, droplet stream (experimental data from CCRM camera), speaking person (synthetic video dataset)^{50} and lighter spark (experimental data from CCRM camera). The authors confirm that all the procedures were performed in accordance with the relevant guidelines and regulations.
These datasets represent different types of applications and have diverse characteristics such as the object movement speed and direction, dynamic range, spatial resolution etc.
Key Analysis (KA) is often considered as a fundamental part of any encryption method that plays a critical role in defining the strength of the algorithm. Strong secret keys will have a large space and high sensitivity^{51}. Key space corresponds to the overall dimensions of the key where larger dimensions decrease the overall probability of estimating the secret key. Key sensitivity on the other hand, relates to the decryption using a partially known information from the secret key. Assuming the case where the decoder has no information about the secret key, given the number of k = 122,500 elements in the 2D encoder A(\(350\times 350\)), the total number of possible keys is \({10}^{122,500}\) hence the probability of having the exact encoder pattern is estimated as \(P\left( A\right) \ =\ 1/{10}^{122,500}\) which could be considered as an infinity small number. Base 10 in this expression is due to the fact that we use grey scaled pattern that is observed at the detector for reconstruction of the data. For the key sensitivity analysis, we use Mean Squared Error (MSE) and SSIM as the two main parameters for reconstruction quality assessments for the scenario that one has partial knowledge about the secret key. In the first scenario, we assume that the known key values to an unauthorised person with various known percentages are evenly spread across the encoder matrix. Therefore, in this scenario there is no continuity in the pattern of the known elements of the encoder. The second scenario however, considers that the partial yet continues sections of the encoder with various known percentages are known to an unauthorised person. In this scenario, we assume that the missing information from the encoder are located at the centre of the encoder matrix where they will be randomly estimated and the top and bottom section of the matrix hold the true encoding data. Depicted in Fig. 3 are the absolute difference between the true encoding pattern and the predicted pattern.
The black sections in figure represent the known information and the grey pixels show the differences between the original and the predicted values respectively. As the original encoder is assumed to be a grey scale pattern with 10 different intensity levels, the brighter pixels represent higher differences between the original and the estimated pixels.
Depicted in Fig. 4 are the reconstructed frames (for the case of 100 overlapped frames), SSIM and MSE measurements from immune cells dataset at various known percentages for scenario 1 and it shows that reconstruction quality of data is extremely sensitive to small percentage of unknown pattern on the estimated encoder.
The same types of recovery curves were observed on the same dataset in scenario 2 (depicted in Fig. 5) and three other aforementioned datasets (figures are not included due to the similarities in the graphs). Based on these presented data, with 95\(\%\) correctness of the encoder values the SSIM is reduced to 0.5 from 0.85 at 100\(\%\) similarity and the MSE is increased from 70 to 2200. This can be viewed as the minimum acceptable percentage for the encoder to achieve an acceptable data recovery in these datasets.
During the transmission stage over a channel, data can be altered by a variety of interference and additive noise where a robust decryption algorithm can recover the frames with low data loss^{23,38}. To test the performance of our decryption algorithm, two types of Salt and pepper noise (SPN) and additive white Gaussian noise (AWGN) are added to the encrypted data. Depicted in Figs. 6 and 7 are extracted frames and SSIM values from decryption of data at various noise levels respectively where due to the nature of the proposed reconstruction algorithm (iterative denoising defined as D(.) in Eq. 2), a robust and low loss data reconstruction is achieved.
Information Entropy (IE) measures the uncertainty of the information occurrence per bit in an image and is widely used in the applications of image compression and encryption^{23,38}. Shannon’s source coding theorem describes the definition of the optimal coding by the length of the code assigned to the i’th symbol (pixel) that is \(log_2P(i)\) where P(i) is the probability of the occurrence of the symbol i. The entropy H(p) is calculate as:
that is measured in bits per symbol (pixel values) where n is the number of the possible values per pixel. Assuming an 8 bit image, the ideal encryption method will have the entropy of 8. The mean calculated entropy of the aforementioned datasets is 7.48 with the min and max values of 7.34 and 7.64 that are very close to the expected ideal encryption value. Depicted in Table 1 are the full list of entropy measurements for various compressed and encoded frames for the aforementioned datasets.
Furthermore, Correlation Coefficient (CC)^{51} is another important analytical factor which measures the similarity between the corresponding pixels of an original and the reconstructed image that is obtained by the following equation
CC is the correlation coefficient between the plain and the reconstructed image, A is the plain image, B is the reconstructed image, \({\bar{A}}\) is the mean of the plain image, \({\bar{B}}\) is the mean of the reconstructed image and m, n are 2D dimensions of the images. Lower amounts of correlation indicate stronger encryption strength when the data are reconstructed with partially known encoder information. The mean calculated CC measurement for the reconstructed data with encoder similarity of 090\(\%\) in the aforementioned datasets are 0.25 with a minimum and maximum values of 0.22 and 0.28 respectively and therefore it is evident that the observed data from the detector are efficiently secured and are very sensitive to the slightest changes to the encoder data. Depicted in Fig. 8 is the measured CC values of the reconstructed data for different datasets at various encoder similarity percentages. Randomly estimated sections in the encoder effect the reconstruction quality of the data and to estimate this deviation in the reconstruction fidelity, the process is repeated 50 times where during each trial, a new randomly estimated encoder is used for data reconstruction.
In the industrystandard encryption techniques such as AES^{17} and RSA^{18} methods, the decryption stages also show high sensitivity to the changes in the keys where in the AES method, changing a single byte of the key prevents the decryption algorithm from recovering the data where the CC value drops to less than 0.1. RSA algorithm is also sensitive to the private key where by randomly estimating the private key an average CC of 0.23 is obtained from the decrypted data.
CC analysis can be further extended and applied on every pair of adjacent pixels in the encrypted frames where encryption schemes are expected to hide such correlations among pixels^{23,24,38}. The obtain this innerframe measurement, correlation values of adjacent pixels in three directions of horizontal, vertical and diagonal are calculated against the selected pixel and the correlation among the pixel pairs can be calculated as
where (x, y) is the combination of two directions (horizontal, vertical or diagonal) for the adjacent pixel pair. To measure the correlation of adjacent pixels, we select and analyse 1000 pairs of adjacent pixels from random locations of the original and encrypted images. Shown in Table 2 are correlation and correlation coefficients calculated from Eq. (5) where it shows low correlation between the adjacent pixels hence the effectiveness of the proposed method against statistical attacks.
In addition to the CC measurements, the Execution time (ET) is another critical parameter that is the time required to execute a given image or video encryptioncompression process which is typically considered as the combination of the compile and the run time of the algorithm in the digital domain. For practical implementation of image encryption, ET must be minimum for given data size. In the conventional schemes that are dependent on algorithms in the digital domain, this process can take between subsecond to seconds per frame (\(500 \times 500\) in RGB) and is linearly proportional to the dimensions and number of the frames, e.g. it takes 0.25 s per frame in^{51} that is more than 5.8 min to encode 1400 frames of a video. Industry standard AES and RSA methods are capable of encoding at the rates of 100 Mbps and 1 GBps respectively using a standard i5 2.5 Ghz central processing unit (CPU). Hence encryption of 1400 frames with the aforementioned dimensions takes 1.4 min using the AES128 encryption and 7 s for the RSA method whereas in the proposed CCRM scheme, the joint operations of encryption and compression takes 12 ms that is significantly faster than the conventional methods. This time is dependent on the rotation speed of the motor and the size of detector, and is independent of the dimension and number of frames.
Recording the dynamics of a phenomena often require multiple captures at different points in time (lifetimebased screening and characterization of fluorescent proteins, microfluidics analysis etc) or several captures from various viewing angles (textile strength testing, combustion and chemical reactions etc) depending on the nature of experiments. Therefore, the required storage and transmission capacities increase drastically and therefore data compression methods are often employed in such scenarios.
Compression is regarded as a reversable conversion of data that contains fewer number of bits compared to the original format which facilitates a more efficient storage and transmission of data. Data compression can be divided into two types: lossless and lossy techniques. Lossless compression is predominantly used for text or application files where a loss of information even at a very low rate can cause a major damage to the data. Lossless compression methods often use statistical information to reduce the data redundancies.
HuffmanCoding^{52} and Run Length Encoding^{53} are two common algorithms that allow for compression ratios of 2:1^{54}. On the other hand, lossy compression introduces some errors to the data during the compression stage and yet can be used for data types such as images, video and sound which contain large amounts of redundant data. These methods are capable of achieving compression at the rates of up to 10 Mbps using the aforementioned processing unit hence the joint operation of compression and encryption for the RGB video with dimension of \(500\times 500 \times 1400\) will take 15 min to complete. In these methods however high amounts of compression ratios often result in lower decompression quality that is seen as a tradeoff in lossy compression methods.
The compression process typically takes place prior to the encryption stage as the compression utilizes the sparsity in the spatial and temporal domains (intraframe and interframe compression) in the data. H.26(1,3,4,5) and MPEG(1,2,4)^{55,56} are two of the commonly used lossy compression methods for video data where compression ratios of 200:1^{55,56} can be obtained without losing substantial amounts of information from the frames. These methods however are associated with a drawback that is by having higher amounts of compression, the quality of the decompressed data is linearly reduced [50]. As an example, compression ratios of 50:1 and 200:1 yield SSIM of 0.95 and 0.84 respectively that will continue to decrease with higher compression ratios.
As it is shown in Fig. 9, the compression ratio and SSIM measurements are independent of each other in the CCRM camera where they only depend on the spatial dimensions of the scene where the SSIM measurements tend to converge to its lowest value at number of frames >= 2 times of the dimension of the frame. This enables the continuous recording and compression of the data without sacrificing the data quality in the reconstruction process. CCRM camera achieves high compression ratios (333 and 476 for 1k and 10k number of frames respectively) and maintains high decompression (reconstruction) quality by attaining high SSIM values (higher than 0.8 for 10k frames).
Variance analysis^{57} is another measurement to test the performance of the data encryption technique. Closeness of the variance between the encrypted data shows the strength of the encryption algorithm while the encoder (key) varies. Variance histogram analysis is defined as
where Z is the vector of the histogram values and Z = \(z_1,z_2,\ldots ,z_2 56\), \(z_i\) and \(z_j\) denote the number of pixels respectively.
Assuming A to be the key that is used to encrypt the frames, variance analysis can be conducted by by slightly changing the original key value and performing the encryption on the same set of frames. In the proposed scheme, as the key is represented by a 2dimensional matrix, we change the matrix (key) values at increments of 20% and calculate the variance of the histogram. Depicted in Fig. 10 are the histograms of the encrypted and compressed data sets (top row) and histograms of single frames from data set (bottom row) respectively.
Table 3 shows the calculated variance values for various encoding keys with difference percentages to the original key and it is evident that changes in the calculated variance values are small (encrypted images are uniform).
The proposed CCRM camera overcomes these fundamental limitations where it can achieve both compression and encryption at ultrahigh rates (12 ms) through the native builtin optical operation in which the requirement for storage and transmission capacities are substantially reduced. The optical encoding mechanism in CCRM camera, enables a secure data storage and handling in the imaging applications fields (e.g. medical imaging and military based applications) where information security and confidentiality remains one of the top priorities.
Conclusion
In this paper, we demonstrated the encryption and compression properties of the CCRM camera where it has shown to be a formidable imaging system for applications that demand highly encrypted and compressed data acquisition at high frame rates in a compact design and easytouse operation. CCRM camera integrates the video encryption and compression in the optical domain hence significantly improving the information security, storage and transmission capacities as well as achieving the highest compression ratio of 368 and the highest sequence depth of 1400 reconstructed frames from a single shot image acquisition compared to the other CS based imaging techniques. Conducted experiments demonstrate that the original data can only be recovered using the encryption key observed by the detector. Moreover by introducing amplitude encoding technique to the encryption and compression stages, the keyspace has been significantly extended hence substantially reducing the risk of brute force attacks on the data recovery. CCRM camera can be implemented in a variety of applications such as medical and military based imaging systems where the data security alongside the storage and transmission capacities are considered as critical factors.
References
Llull, P. et al. Coded aperture compressive temporal imaging. Opt. Express 21(9), 10526 (2013).
Gao, L., Liang, J., Li, C. & Wang, L. Singleshot compressed ultrafast photography at one hundred billion frames per second. Nature 516(7529), 74–77 (2014).
Lei, C. et al. GHz optical timestretch microscopy by compressive sensing. IEEE Photonics J. 9(2), 1–8 (2017).
Matin, A., Dai, B., Huang, Y. & Wang, X. Ultrafast imaging with optical encoding and compressive sensing. J. Lightwave Technol. 37(3), 761–768 (2019).
Goda, K., MotafakkerFard, A., Tsia, K. K. & Jalali, B. Serial time encoded amplified microscopy (STEAM) for highthroughput detection of rare cells. IEEE Photonics Soc. Winter Top. Meet. Ser. (WTM) 19(7), 64–65 (2010).
Matin, A. & Wang, X. Compressive coded rotating mirror camera for highspeed imaging. Photonics 8(2), 34 (2021).
Dickson, P. et al. Mosaic generation for under vehicle inspection. In Applications of Computer Vision (WACV) 251–256 (IEEE, 2002).
Sukumar, S. Robotic threedimensional imaging system for undervehicle inspection. J. Electron. Imaging 15(3), 033008 (2006).
Malik, M., MagañaLoaiza, O. & Boyd, R. Quantumsecured imaging. Appl. Phys. Lett. 101(24), 241103 (2012).
Tajahuerce, E. & Javidi, B. Encrypting threedimensional information with digital holography. Appl. Opt. 39(35), 6595 (2000).
Bell, T. & Zhang, S. Toward superfast threedimensional optical metrology with digital micromirror device platforms. Opt. Eng. 53(11), 112206 (2014).
Kittler, J., Hilton, A., Hamouz, M. & Illingworth, J. 3D assisted face recognition: A survey of 3D imaging, modelling and recognition approachest. In Computer Vision and Pattern Recognition (CVPR) 114 (IEEE, 2005).
Schilling, B., Barr, D., Templeton, G., Mizerka, L. & Trussell, C. Multiple return laser radar for threedimensional imaging through obscurations. Appl. Opt. 41(15), 2791–2799 (2002).
Trussell, W. 3D imaging for army applications, in aerospace/defense sensing, simulation and controls. Laser Radar Technol. Appl. 6(1), 126131 (2001).
Hassanien, A., Salem, A., Ramadan, R. & Kim, T. Advanced Machine Learning Technologies and Applications (Springer, 2012).
Burr, W. Selecting the advanced encryption standard. IEEE Secur. Priv. 1(2), 43–52 (2003).
Daemen, J. & Rijmen, V. The Design of Rijndael (Springer, 2001).
Rivest, R., Shamir, A. & Adleman, L. A method for obtaining digital signatures and publickey cryptosystems. Commun. ACM 21(2), 120–126 (1978).
Kaur, M. & Kumar, V. A comprehensive review on image encryption techniques. Arch. Comput. Methods Eng. 27(1), 15–43 (2018).
Gu, G. & Ling, J. A fast image encryption method by using chaotic 3D cat maps. Optik 125(17), 4700–4705 (2014).
Gao, T., Chen, Z., Gao, T. & Chen, Z. A new image encryption algorithm based on hyperchaos. Phys. Lett. A 372(4), 394–400 (2008).
Ye, G. Image scrambling encryption algorithm of pixel bit based on chaos map. Pattern Recogn. Lett. 31(5), 347–354 (2010).
Gao, X. et al. A new image encryption scheme based on fractionalorder hyperchaotic system and multiple image fusion. Sci. Rep. 11, 15737 (2021).
Ghaffari, A. Image compressionencryption method based on twodimensional sparse recovery and chaotic system. Sci. Rep. 11, 369. https://doi.org/10.1038/s41598020797474 (2021).
Yang, F., Mou, J., Liu, J., Ma, C. & Yan, H. Characteristic analysis of the fractionalorder hyperchaotic complex system and its image encryption application. Signal Process. 169, 107373 (2020).
Zhang, Q., Liu, L. & Wei, X. Improved algorithm for image encryption based on DNA encoding and multichaotic maps. AEUInt. J. Electron. C 68(3), 186–192 (2014).
Li, X., Wang, L., Yan, Y. & Liu, P. An improvement color image encryption algorithm based on DNA operations and real and complex chaotic systems. Optik 127(5), 2558–2565 (2016).
Wu, X., Kan, H. & Kurths, J. A new color image encryption scheme based on DNA sequences and multiple improved 1D chaotic maps. Appl. Soft Comput. 37, 24–39 (2015).
Wang, X. & Luan, D. A novel image encryption algorithm using chaos and reversible cellular automata. Commun. Nonlinear Sci. Numer. Simul. 18(11), 3075–3085 (2013).
Li, X., Xiao, D. & Wang, Q. Errorfree holographic frames encryption with CA pixelpermutation encoding algorithm. Opt. Lasers Eng. 100, 200–207 (2018).
Bakhshandeh, A. & Eslami, Z. An authenticated image encryption scheme based on chaotic maps and memory cellular automata. Opt. Lasers Eng. 51(6), 665–673 (2013).
Behnia, S., Akhavan, A., Akhshani, A. & Samsudin, A. Image encryption based on the Jacobian elliptic maps. J. Syst. Softw. 86(9), 2429–2438 (2013).
Nagaraj, S., Raju, G. & Rao, K. Image encryption using elliptic curve cryptograhy and matrix. Proc. Comput. Sci. 48, 276–281 (2015).
Liu, H., Wang, X. & Kadir, A. Color image encryption using Choquet fuzzy integral and hyper chaotic system. Optik—Int. J. Light Electron Opt. 124(18), 3527–3533 (2013).
Wang, Y., Wang, Y., Wang, Y., Li, H. & Sun, W. Optical image encryption based on binary Fourier transform computergenerated hologram and pixel scrambling technology. Opt. Lasers Eng. 45(7), 761–765 (2007).
Guo, Q., Liu, Z. & Liu, S. Color image encryption by using Arnold and discrete fractional random transforms in IHS space. Opt. Lasers Eng. 48(12), 1174–1181 (2010).
Zhao, H. et al. Multipleimage encryption based on position multiplexing of Fresnel phase. Opt. Commun. 286, 85–90 (2013).
Wang, X. & Su, Y. Color image encryption based on chaotic compressed sensing and twodimensional fractional Fourier transform. Sci. Rep. 10, 18556 (2020).
Lu, P., Xu, Z., Lu, X. & Liu, X. Digital image information encryption based on compressive sensing and double randomphase encoding technique. Optik 124(16), 2514–2518 (2013).
Liu, X., Mei, W. & Du, H. Simultaneous image compression, fusion and encryption algorithm based on compressive sensing and chaos. Opt. Commun. 366, 22–32 (2016).
Zhou, N., Li, H., Wang, D., Pan, S. & Zhou, Z. Image compression and encryption scheme based on 2D compressive sensing and fractional Mellin transform. Opt. Commun. 343, 10–21 (2015).
Wang, Q., Wei, M., Chen, X. & Miao, Z. Joint encryption and compression of 3D images based on tensor compressive sensing with nonautonomous 3D chaotic system. Multimed. Tools Appl. 77(2), 1715–1734 (2017).
Ding, X. & Chen, G. Optical color image encryption using position multiplexing technique based on phase truncation operation. Opt. Laser Technol. 57, 110–118 (2014).
Chen, L. et al. A new optical image encryption method based on multibeams interference and vector composition. Opt. Laser Technol. 69, 80–86 (2015).
Chan, S., Wang, X. & Elgendy, O. Plugandplay ADMM for image restoration: Fixedpoint convergence and applications. IEEE Trans. Comput. Imag. 3(1), 84–98 (2017).
Chambole, A. An algorithm for total variation minimization and applications. J. Math. Imag. Vis. 20(1/2), 89–97 (2004).
Liang, J., Gao, L., Hai, P., Li, C. & Wang, L. Encrypted three dimensional dynamic imaging using snapshot timeoffight compressed ultrafast photography. Sci. Rep. 5(1), 15504 (2007).
Guo, Q. et al. Compressive sensing based highspeed timestretch optical microscopy for twodimensional image acquisition. Opt. Express 23(23), 29639 (2015).
Ulvberget, K. Data set of the blood cells flowing in a microfluidic chip. Immune Cells (2018).
Speaking person data set, Elon Musk speech (2018).
Yang, Y., Pan, Q., Sun, S. & Xu, P. Novel image encryption based on quantum walks. Sci. Rep. 5(1), 7784 (2015).
Huffman, D. A. A method for the construction of minimum redundancy codes. Proc. Inst. Radio Eng. 40, 1098–1101 (1951).
Capon, J. A probabilistic model for runlength coding of pictures. IRE Trans. Inform. Theory, IT 5(4), 157–163 (1959).
Sayood, K. Introduction to Data Compression 4th edn, 768 (Elsevier Inc, 2012).
Jack, K. Digital Video and DSP 1st edn, 240 (Elsevier, 2008).
Salomon, D. & Motta, G. Handbook of Data Compression 5th edn, 1370 (Springer, 2010).
Zhang, Y. & Wang, X. A symmetric image encryption algorithm based on mixed linear–nonlinear coupled map lattice. Inf. Sci. 273, 329–351 (2014).
Funding
This work is partially supported by EPSRC Quantum Technology Hub in Quantum Communication Hub under EP/M013472/1 and EP/T001011/1.
Author information
Authors and Affiliations
Contributions
A.M. and X.W. developed the model, A.M. conducted the experiment(s), A.M. and X.W. analysed the results. All authors reviewed the manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Matin, A., Wang, X. Video encryption/compression using compressive coded rotating mirror camera. Sci Rep 11, 23191 (2021). https://doi.org/10.1038/s41598021025208
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598021025208
This article is cited by

Holographic Encryption of Color Video Stream with 4k Resolution Using Phase Liquid Crystal Light Modulators
Measurement Techniques (2023)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.