Video snapshot compressive imaging(Video SCI) modulates scenes using various encoding masks and captures compressed measurements with a low-speed camera during a single exposure. Subsequently, reconstruction algorithm...Video snapshot compressive imaging(Video SCI) modulates scenes using various encoding masks and captures compressed measurements with a low-speed camera during a single exposure. Subsequently, reconstruction algorithms restore image sequences of dynamic scenes, offering advantages such as reduced bandwidth and storage space requirements. The temporal correlation in video data is crucial for Video SCI, as it leverages the temporal relationships among frames to enhance the efficiency and quality of reconstruction algorithms, particularly for fast-moving objects.This paper discretizes video frames to create image datasets with the same data volume but differing temporal correlations. We utilized the state-of-the-art(SOTA) reconstruction framework, EfficientSCI++, to train various compressed reconstruction models with these differing temporal correlations. Evaluating the reconstruction results from these models, our simulation experiments confirm that a reduction in temporal correlation leads to decreased reconstruction accuracy. Additionally, we simulated the reconstruction outcomes of datasets devoid of temporal correlation, illustrating that models trained on non-temporal data affect the temporal feature extraction capabilities of transformers, resulting in negligible impacts on the evaluation of reconstruction results for non-temporal correlation test datasets.展开更多
This paper proposes an application of compressive imaging systems to the problem of wide-area video surveillance systems. A parallel coded aperture compressive imaging system and a corresponding motion target detectio...This paper proposes an application of compressive imaging systems to the problem of wide-area video surveillance systems. A parallel coded aperture compressive imaging system and a corresponding motion target detection algorithm in video using compressive image data are developed. Coded masks with random Gaussian, Toeplitz and random binary are utilized to simulate the compressive image respectively. For compressive images, a mixture of the Gaussian distribution is applied to the compressed image field to model the background. A simple threshold test in compressive sampling image is used to declare motion objects. Foreground image retrieval from underdetermined measurement using the total variance optimization algorithm is explored. The signal-to-noise ratio （SNR） is employed to evaluate the image quality recovered from the compressive sampling signals, and receiver operation characteristic （ROC） curves are used to quantify the performance of the motion detection algorithm. Experimental results demonstrate that the low dimensional compressed imaging representation is sufficient to determine spatial motion targets. Compared with the random Gaussian and Toeplitz mask, motion detection algorithms using the random binary phase mask can yield better detection results. However using the random Gaussian and Toeplitz phase mask can achieve high resolution reconstructed images.展开更多
Single-pixel cameras, which employ either structured illumination or image modulation and compressive sensing algorithms, provide an alternative approach to imaging in scenarios where the use of a detector array is re...Single-pixel cameras, which employ either structured illumination or image modulation and compressive sensing algorithms, provide an alternative approach to imaging in scenarios where the use of a detector array is restricted or difficult because of cost or technological constraints. In this work, we present a robust imaging method based on compressive imaging that sets two thresholds to select the measurement data for image reconstruction. The experimental and numerical simulation results show that the proposed double-threshold compressive imaging protocol provides better image quality than previous compressive imaging schemes. Faster imaging speeds can be attained using this scheme because it requires less data storage space and computing time. Thus, this denoising method offers a very effective approach to promote the implementation of compressive imaging in real-time practical applications.展开更多
This Letter presents a simple and effective method to improve the signal-to-noise ratio（SNR） of compressing imaging. The main principles of the proposed method are the correlation of the image signals and the random...This Letter presents a simple and effective method to improve the signal-to-noise ratio（SNR） of compressing imaging. The main principles of the proposed method are the correlation of the image signals and the randomness of the noise. Multiple low SNR images are reconstructed firstly by the compressed sensing reconstruction algorithm, and then two-dimensional time delay integration technology is adopted to improve the SNR. Results show that the proposed method can improve the SNR performance efficiently and it is easy to apply the a lgorithm to the real project.展开更多
Spectral imaging is an important tool for a wide variety of applications. We present a technique for spectral imaging using computational imaging pattern based on compressive sensing （CS）. The spectral and spatial i...Spectral imaging is an important tool for a wide variety of applications. We present a technique for spectral imaging using computational imaging pattern based on compressive sensing （CS）. The spectral and spatial infor- mation is simultaneously obtained using a fiber spectrometer and the spatial light modulation without mechanical scanning. The method allows high-speed, stable, and sub sampling acquisition of spectral data from specimens. The relationship between sampling rate and image quality is discussed and two CS algorithms are compared.展开更多
The isotherm is an important feature of infrared satellite cloud images (ISCI), which can directly reveal substantial information of cloud systems. The isotherm extraction of ISCI can remove the redundant information ...The isotherm is an important feature of infrared satellite cloud images (ISCI), which can directly reveal substantial information of cloud systems. The isotherm extraction of ISCI can remove the redundant information and therefore helps to compress the information of ISCI. In this paper, an isotherm extraction method is presented. The main aggregate of clouds can be segmented based on mathematical morphology. T algorithm and IP algorithm are then applied to extract the isotherms from the main aggregate of clouds. A concrete example for the extraction of isotherm based on IBM SP2 is described. The result shows that this is a high efficient algorithm. It can be used in feature extractions of infrared images for weather forecasts.展开更多
Plug-and-play priors are popular for solving illposed imaging inverse problems. Recent efforts indicate that the convergence guarantee of the imaging algorithms using plug-andplay priors relies on the assumption of bo...Plug-and-play priors are popular for solving illposed imaging inverse problems. Recent efforts indicate that the convergence guarantee of the imaging algorithms using plug-andplay priors relies on the assumption of bounded denoisers. However, the bounded properties of existing plugged Gaussian denoisers have not been proven explicitly. To bridge this gap, we detail a novel provable bounded denoiser termed as BMDual,which combines a trainable denoiser using dual tight frames and the well-known block-matching and 3D filtering(BM3D)denoiser. We incorporate multiple dual frames utilized by BMDual into a novel regularization model induced by a solver. The proposed regularization model is utilized for compressed sensing magnetic resonance imaging(CSMRI). We theoretically show the bound of the BMDual denoiser, the bounded gradient of the CSMRI data-fidelity function, and further demonstrate that the proposed CSMRI algorithm converges. Experimental results also demonstrate that the proposed algorithm has a good convergence behavior, and show the effectiveness of the proposed algorithm.展开更多
This paper proposes a verifiable secret image sharing scheme based on compressive sensing, secret sharing, and image hashing. In this scheme, Toeplitz matrix generated by two chaotic maps is employed as measurement ma...This paper proposes a verifiable secret image sharing scheme based on compressive sensing, secret sharing, and image hashing. In this scheme, Toeplitz matrix generated by two chaotic maps is employed as measurement matrix. With the help of Shamir threshold scheme and image hashing, the receivers can obtain the stored values and the hash value of image. In the verifying stage and restoring stage, there must be at least t legal receivers to get the effective information. By comparing the hash value of the restored image with the hash value of original image, the scheme can effectively prevent the attacker from tampering or forging the shared images. Experimental results show that the proposed scheme has good recovery performance, can effectively reduce space, and is suitable for real-time transmission, storage, and verification.展开更多
Ultrahigh-speed imaging is an essential tool for capturing fast dynamic scenes across various fields.Despite the development of numerous technical strategies,achieving ultrahigh-speed imaging with high spatiotemporal ...Ultrahigh-speed imaging is an essential tool for capturing fast dynamic scenes across various fields.Despite the development of numerous technical strategies,achieving ultrahigh-speed imaging with high spatiotemporal resolution and substantial sequence depth remains a significant challenge.To address this issue,we present a compressive ultrahigh-speed imaging technique based on acousto-optic frequency sweeping,termed AOFSCUSI.AOFS-CUSI employs light with rapidly time-varying spectra generated by acousto-optic modulation to illuminate dynamic scenes,records spatio-spectral information using snapshot compressive imaging,and ultimately reconstructs spatiotemporal information through time-spectrum mapping.This technique achieves a temporal resolution of 1.55 million frames per second,a spatial resolution of 228 lp/mm,and a sequence depth of 31 in a single shot.We experimentally validate the superior performance of AOFS-CUSI by capturing the rotation of an optical chopper,the movement of microspheres in a microchannel,and the femtosecondlaser-induced cavitation bubble dynamics.By eliminating the requirement for ultrafast laser sources and simultaneously extending the temporal window,AOFS-CUSI offers an excellent solution for recording and analyzing various fast dynamics,presenting significant potential for applications in both fundamental and applied research.展开更多
Single-shot ultrafast compressed imaging(UCI)is an effective tool for studying ultrafast dynamics in physics,chemistry,or material science because of its excellent high frame rate and large frame number.However,the ra...Single-shot ultrafast compressed imaging(UCI)is an effective tool for studying ultrafast dynamics in physics,chemistry,or material science because of its excellent high frame rate and large frame number.However,the random code(Rcode)used in traditional UCI will lead to low-frequency noise covering high-frequency information due to its uneven sampling interval,which is a great challenge in the fidelity of large-frame reconstruction.Here,a high-frequency enhanced compressed active photography(H-CAP)is proposed.By uniformizing the sampling interval of R-code,H-CAP capture the ultrafast process with a random uniform sampling mode.This sampling mode makes the high-frequency sampling energy dominant,which greatly suppresses the low-frequency noise blurring caused by R-code and achieves high-frequency information of image enhanced.The superior dynamic performance and large-frame reconstruction ability of H-CAP are verified by imaging optical self-focusing effect and static object,respectively.We applied H-CAP to the spatial-temporal characterization of double-pulse induced silicon surface ablation dynamics,which is performed within 220 frames in a single-shot of 300 ps.H-CAP provides a high-fidelity imaging method for observing ultrafast unrepeatable dynamic processes with large frames.展开更多
With the rapid development of digital communication and the widespread use of the Internet of Things,multi-view image compression has attracted increasing attention as a fundamental technology for image data communica...With the rapid development of digital communication and the widespread use of the Internet of Things,multi-view image compression has attracted increasing attention as a fundamental technology for image data communication.Multi-view image compression aims to improve compression efficiency by leveraging correlations between images.However,the requirement of synchronization and inter-image communication at the encoder side poses significant challenges,especially for constrained devices.In this study,we introduce a novel distributed image compression model based on the attention mechanism to address the challenges associated with the availability of side information only during decoding.Our model integrates an encoder network,a quantization module,and a decoder network,to ensure both high compression performance and high-quality image reconstruction.The encoder uses a deep Convolutional Neural Network(CNN)to extract high-level features from the input image,which then pass through the quantization module for further compression before undergoing lossless entropy coding.The decoder of our model consists of three main components that allow us to fully exploit the information within and between images on the decoder side.Specifically,we first introduce a channel-spatial attention module to capture and refine information within individual image feature maps.Second,we employ a semi-coupled convolution module to extract both shared and specific information in images.Finally,a cross-attention module is employed to fuse mutual information extracted from side information.The effectiveness of our model is validated on various datasets,including KITTI Stereo and Cityscapes.The results highlight the superior compression capabilities of our method,surpassing state-of-the-art techniques.展开更多
Nonlinear transforms have significantly advanced learned image compression(LIC),particularly using residual blocks.This transform enhances the nonlinear expression ability and obtain compact feature representation by ...Nonlinear transforms have significantly advanced learned image compression(LIC),particularly using residual blocks.This transform enhances the nonlinear expression ability and obtain compact feature representation by enlarging the receptive field,which indicates how the convolution process extracts features in a high dimensional feature space.However,its functionality is restricted to the spatial dimension and network depth,limiting further improvements in network performance due to insufficient information interaction and representation.Crucially,the potential of high dimensional feature space in the channel dimension and the exploration of network width/resolution remain largely untapped.In this paper,we consider nonlinear transforms from the perspective of feature space,defining high-dimensional feature spaces in different dimensions and investigating the specific effects.Firstly,we introduce the dimension increasing and decreasing transforms in both channel and spatial dimensions to obtain high dimensional feature space and achieve better feature extraction.Secondly,we design a channel-spatial fusion residual transform(CSR),which incorporates multi-dimensional transforms for a more effective representation.Furthermore,we simplify the proposed fusion transform to obtain a slim architecture(CSR-sm),balancing network complexity and compression performance.Finally,we build the overall network with stacked CSR transforms to achieve better compression and reconstruction.Experimental results demonstrate that the proposed method can achieve superior ratedistortion performance compared to the existing LIC methods and traditional codecs.Specifically,our proposed method achieves 9.38%BD-rate reduction over VVC on Kodak dataset.展开更多
To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical mode...To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical model for residual redundancy and a low complexity joint source-channel decoding（JSCD） algorithm are proposed. The complicated residual redundancy in wavelet compressed images is decomposed into several independent 1-D probability check equations composed of Markov chains and it is regarded as a natural channel code with a structure similar to the low density parity check （LDPC） code. A parallel sum-product （SP） and iterative JSCD algorithm is proposed. Simulation results show that the proposed JSCD algorithm can make full use of residual redundancy in different directions to correct errors and improve the peak signal noise ratio （PSNR） of the reconstructed image and reduce the complexity and delay of JSCD. The performance of JSCD is more robust than the traditional separated encoding system with arithmetic coding in the same data rate.展开更多
[Objective] The aim was to present a proposal about a new image compression technology, in order to make the image be able to be stored in a smaller space and be transmitted with smaller bit rate on the premise of gua...[Objective] The aim was to present a proposal about a new image compression technology, in order to make the image be able to be stored in a smaller space and be transmitted with smaller bit rate on the premise of guaranteeing image quality in the rape crop monitoring system in Qinling Mountains. [Method] In the proposal, the color image was divided into brightness images with three fundamental colors, followed by sub-image division and DCT treatment. Then, coefficients of transform domain were quantized, and encoded and compressed as per Huffman coding. Finally, decompression was conducted through inverse process and decompressed images were matched. [Result] The simulation results show that when compression ratio of the color image of rape crops was 11.972 3∶1, human can not distinguish the differences between the decompressed images and the source images with naked eyes; when ratio was as high as 53.565 6∶1, PSNR was still above 30 dD,encoding efficiency achieved over 0.78 and redundancy was less than 0.22. [Conclusion] The results indicate that the proposed color image compression technology can achieve higher compression ratio on the premise of good image quality. In addition, image encoding quality and decompressed images achieved better results, which fully met requirement of image storage and transmission in monitoring system of rape crop in the Qinling Mountains.展开更多
Remote passive drone detection in the presence of strong background noise is challenging,since they are point objects and cannot be recognized by their contour detection.In this study,we introduce a new passive single...Remote passive drone detection in the presence of strong background noise is challenging,since they are point objects and cannot be recognized by their contour detection.In this study,we introduce a new passive single-photon dynamic imaging method using quantum compressed sensing.This method utilizes the inherent randomness of photon radiation and detection to construct a compressive imaging system.It captures the broadband dynamic features of the point object through sparse photon detection,achieving a detectable bandwidth up to 2.05 GHz,which is significantly higher than current photon-counting imaging techniques.The method also shows excellent noise resistance,achieving high-quality imaging with a signal-to-background ratio of 1/332.This technique significantly enhances the use of single-photon imaging in real-world applications.展开更多
A blind digital image forensic method for detecting copy-paste forgery between JPEG images was proposed.Two copy-paste tampering scenarios were introduced at first:the tampered image was saved in an uncompressed forma...A blind digital image forensic method for detecting copy-paste forgery between JPEG images was proposed.Two copy-paste tampering scenarios were introduced at first:the tampered image was saved in an uncompressed format or in a JPEG compressed format.Then the proposed detection method was analyzed and simulated for all the cases of the two tampering scenarios.The tampered region is detected by computing the averaged sum of absolute difference(ASAD) images between the examined image and a resaved JPEG compressed image at different quality factors.The experimental results show the advantages of the proposed method:capability of detecting small and/or multiple tampered regions,simple computation,and hence fast speed in processing.展开更多
By investigating the limitation of existing wavelet tree based image compression methods, we propose a novel wavelet fractal image compression method in this paper. Briefly, the initial errors are appointed given the ...By investigating the limitation of existing wavelet tree based image compression methods, we propose a novel wavelet fractal image compression method in this paper. Briefly, the initial errors are appointed given the different levels of importance accorded the frequency sublevel band wavelet coefficients. Higher frequency sublevel bands would lead to larger initial errors. As a result, the sizes of sublevel blocks and super blocks would be changed according to the initial errors. The matching sizes between sublevel blocks and super blocks would be changed according to the permitted errors and compression rates. Systematic analyses are performed and the experimental results demonstrate that the proposed method provides a satisfactory performance with a clearly increasing rate of compression and speed of encoding without reducing SNR and the quality of decoded images. Simulation results show that our method is superior to the traditional wavelet tree based methods of fractal image compression.展开更多
Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability...Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45√N times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than √N for most images, and it is more efficient than the pure quantum algorithm.展开更多
Scalable video coding (SVC), as the Scalable Extension of H.264/AVC, is an ongoing international video coding standard designed for network adaptive or device adaptive applications and also offers high coding efficien...Scalable video coding (SVC), as the Scalable Extension of H.264/AVC, is an ongoing international video coding standard designed for network adaptive or device adaptive applications and also offers high coding efficiency. However, packet losses often occur over unreliable networks even for base layer of SVC and have severe impact on the playback quality of compressed video. Until now, no literature has discussed error concealment support for standard SVC bit-stream. In this paper, we provide robust and effective error concealment techniques for SVC with spatial scalability. Experimental results showed that the proposed methods provide substantial improvement, both subjectively and objectively, without a significant complexity overhead.展开更多
Based on Jacquin's work. this paper presents an adaptive block-based fractal image coding scheme. Firstly. masking functions are used to classify range blocks and weight the mean Square error (MSE) of images. Seco...Based on Jacquin's work. this paper presents an adaptive block-based fractal image coding scheme. Firstly. masking functions are used to classify range blocks and weight the mean Square error (MSE) of images. Secondly, an adaptive block partition scheme is introduced by developing the quadtree partition method. Thirdly. a piecewise uniform quantization strategy is appled to quantize the luminance shifting. Finally. experiment results are shown and compared with what reported by Jacquin and Lu to verify the validity of the methods addressed by the authors.展开更多
基金supported in part by the National Natural Science Foundation of China (No. U23B2011)。
文摘Video snapshot compressive imaging(Video SCI) modulates scenes using various encoding masks and captures compressed measurements with a low-speed camera during a single exposure. Subsequently, reconstruction algorithms restore image sequences of dynamic scenes, offering advantages such as reduced bandwidth and storage space requirements. The temporal correlation in video data is crucial for Video SCI, as it leverages the temporal relationships among frames to enhance the efficiency and quality of reconstruction algorithms, particularly for fast-moving objects.This paper discretizes video frames to create image datasets with the same data volume but differing temporal correlations. We utilized the state-of-the-art(SOTA) reconstruction framework, EfficientSCI++, to train various compressed reconstruction models with these differing temporal correlations. Evaluating the reconstruction results from these models, our simulation experiments confirm that a reduction in temporal correlation leads to decreased reconstruction accuracy. Additionally, we simulated the reconstruction outcomes of datasets devoid of temporal correlation, illustrating that models trained on non-temporal data affect the temporal feature extraction capabilities of transformers, resulting in negligible impacts on the evaluation of reconstruction results for non-temporal correlation test datasets.
基金supported by the National Natural Science Foundation of China (61271375)BIT Foundation (2012CX04054)
文摘This paper proposes an application of compressive imaging systems to the problem of wide-area video surveillance systems. A parallel coded aperture compressive imaging system and a corresponding motion target detection algorithm in video using compressive image data are developed. Coded masks with random Gaussian, Toeplitz and random binary are utilized to simulate the compressive image respectively. For compressive images, a mixture of the Gaussian distribution is applied to the compressed image field to model the background. A simple threshold test in compressive sampling image is used to declare motion objects. Foreground image retrieval from underdetermined measurement using the total variance optimization algorithm is explored. The signal-to-noise ratio （SNR） is employed to evaluate the image quality recovered from the compressive sampling signals, and receiver operation characteristic （ROC） curves are used to quantify the performance of the motion detection algorithm. Experimental results demonstrate that the low dimensional compressed imaging representation is sufficient to determine spatial motion targets. Compared with the random Gaussian and Toeplitz mask, motion detection algorithms using the random binary phase mask can yield better detection results. However using the random Gaussian and Toeplitz phase mask can achieve high resolution reconstructed images.
基金supported by the National Natural Science Foundation of China(Nos.11675014,61605218,61601442,61575207,and 61474123)the National Major Scientific Instruments Development Project of China(No.2013YQ030595)+2 种基金the National Defense Science and Technology Innovation Foundation of Chinese Academy of Sciences,the Science and Technology Innovation Foundation of Chinese Academy of Sciences(No.CXJJ-16S047)the Program of International Science and Technology Cooperation(No.2016YFE0131500)the Advance Research Project(No.30102070101)
文摘Single-pixel cameras, which employ either structured illumination or image modulation and compressive sensing algorithms, provide an alternative approach to imaging in scenarios where the use of a detector array is restricted or difficult because of cost or technological constraints. In this work, we present a robust imaging method based on compressive imaging that sets two thresholds to select the measurement data for image reconstruction. The experimental and numerical simulation results show that the proposed double-threshold compressive imaging protocol provides better image quality than previous compressive imaging schemes. Faster imaging speeds can be attained using this scheme because it requires less data storage space and computing time. Thus, this denoising method offers a very effective approach to promote the implementation of compressive imaging in real-time practical applications.
基金supported by the National Natural Science Foundation of China(No.11503010)the Fundamental Research Funds for the Central Universities(No.30916015103)
文摘This Letter presents a simple and effective method to improve the signal-to-noise ratio（SNR） of compressing imaging. The main principles of the proposed method are the correlation of the image signals and the randomness of the noise. Multiple low SNR images are reconstructed firstly by the compressed sensing reconstruction algorithm, and then two-dimensional time delay integration technology is adopted to improve the SNR. Results show that the proposed method can improve the SNR performance efficiently and it is easy to apply the a lgorithm to the real project.
基金Supported by the National Major Scientific Instruments Development Project of China under Grant No 2013YQ030595the National Natural Science Foundation of China under Grant Nos 11675014,61601442,61605218,61474123 and 61575207+2 种基金the Science and Technology Innovation Foundation of Chinese Academy of Sciences under Grant No CXJJ-16S047,the National Defense Science and Technology Innovation Foundation of Chinese Academy of Sciencesthe Program of International S&T Cooperation under Grant No 2016YFE0131500the Advance Research Project under Grant No 30102070101
文摘Spectral imaging is an important tool for a wide variety of applications. We present a technique for spectral imaging using computational imaging pattern based on compressive sensing （CS）. The spectral and spatial infor- mation is simultaneously obtained using a fiber spectrometer and the spatial light modulation without mechanical scanning. The method allows high-speed, stable, and sub sampling acquisition of spectral data from specimens. The relationship between sampling rate and image quality is discussed and two CS algorithms are compared.
文摘The isotherm is an important feature of infrared satellite cloud images (ISCI), which can directly reveal substantial information of cloud systems. The isotherm extraction of ISCI can remove the redundant information and therefore helps to compress the information of ISCI. In this paper, an isotherm extraction method is presented. The main aggregate of clouds can be segmented based on mathematical morphology. T algorithm and IP algorithm are then applied to extract the isotherms from the main aggregate of clouds. A concrete example for the extraction of isotherm based on IBM SP2 is described. The result shows that this is a high efficient algorithm. It can be used in feature extractions of infrared images for weather forecasts.
基金supported in part by the National Natural Science Foundation of China (62371414,61901406)the Hebei Natural Science Foundation (F2020203025)+2 种基金the Young Talent Program of Universities and Colleges in Hebei Province (BJ2021044)the Hebei Key Laboratory Project (202250701010046)the Central Government Guides Local Science and Technology Development Fund Projects(216Z1602G)。
文摘Plug-and-play priors are popular for solving illposed imaging inverse problems. Recent efforts indicate that the convergence guarantee of the imaging algorithms using plug-andplay priors relies on the assumption of bounded denoisers. However, the bounded properties of existing plugged Gaussian denoisers have not been proven explicitly. To bridge this gap, we detail a novel provable bounded denoiser termed as BMDual,which combines a trainable denoiser using dual tight frames and the well-known block-matching and 3D filtering(BM3D)denoiser. We incorporate multiple dual frames utilized by BMDual into a novel regularization model induced by a solver. The proposed regularization model is utilized for compressed sensing magnetic resonance imaging(CSMRI). We theoretically show the bound of the BMDual denoiser, the bounded gradient of the CSMRI data-fidelity function, and further demonstrate that the proposed CSMRI algorithm converges. Experimental results also demonstrate that the proposed algorithm has a good convergence behavior, and show the effectiveness of the proposed algorithm.
基金Supported by the National Natural Science Foundation of China(61572089,61502399)the Natural Science Foundation of Chongqing Science and Technology Commission(cstc2017jcyj BX0008,cstc2015jcyj A40039)+2 种基金the Fundamental Research Funds for the Central Universities(106112017 CDJQJ188830,106112017CDJXY180005,106112014CDJZR185501)the Research Program of Chongqing Education Commission(JK15012027,JK1601225)the Scientific Research Project of Yangtze Normal University(2015XJXM39,2015XJXM31)
文摘This paper proposes a verifiable secret image sharing scheme based on compressive sensing, secret sharing, and image hashing. In this scheme, Toeplitz matrix generated by two chaotic maps is employed as measurement matrix. With the help of Shamir threshold scheme and image hashing, the receivers can obtain the stored values and the hash value of image. In the verifying stage and restoring stage, there must be at least t legal receivers to get the effective information. By comparing the hash value of the restored image with the hash value of original image, the scheme can effectively prevent the attacker from tampering or forging the shared images. Experimental results show that the proposed scheme has good recovery performance, can effectively reduce space, and is suitable for real-time transmission, storage, and verification.
基金National Natural Science Foundation of China(12325408,12274129,12374274,12274139,62175066,92150102,62475070,12474404,12471368)Shanghai Municipal Education Commission(2024AI01007)+1 种基金Open Fund of Guangdong Provincial Key Laboratory of Nanophotonic Manipulation(202504)Guangdong ST Program(2023B1212010008).
文摘Ultrahigh-speed imaging is an essential tool for capturing fast dynamic scenes across various fields.Despite the development of numerous technical strategies,achieving ultrahigh-speed imaging with high spatiotemporal resolution and substantial sequence depth remains a significant challenge.To address this issue,we present a compressive ultrahigh-speed imaging technique based on acousto-optic frequency sweeping,termed AOFSCUSI.AOFS-CUSI employs light with rapidly time-varying spectra generated by acousto-optic modulation to illuminate dynamic scenes,records spatio-spectral information using snapshot compressive imaging,and ultimately reconstructs spatiotemporal information through time-spectrum mapping.This technique achieves a temporal resolution of 1.55 million frames per second,a spatial resolution of 228 lp/mm,and a sequence depth of 31 in a single shot.We experimentally validate the superior performance of AOFS-CUSI by capturing the rotation of an optical chopper,the movement of microspheres in a microchannel,and the femtosecondlaser-induced cavitation bubble dynamics.By eliminating the requirement for ultrafast laser sources and simultaneously extending the temporal window,AOFS-CUSI offers an excellent solution for recording and analyzing various fast dynamics,presenting significant potential for applications in both fundamental and applied research.
基金supported by the National Science Foundation of China(No.12127806,No.62175195 and No.12304382)the International Joint Research Laboratory for Micro/Nano Manufacturing and Measurement Technologies.
文摘Single-shot ultrafast compressed imaging(UCI)is an effective tool for studying ultrafast dynamics in physics,chemistry,or material science because of its excellent high frame rate and large frame number.However,the random code(Rcode)used in traditional UCI will lead to low-frequency noise covering high-frequency information due to its uneven sampling interval,which is a great challenge in the fidelity of large-frame reconstruction.Here,a high-frequency enhanced compressed active photography(H-CAP)is proposed.By uniformizing the sampling interval of R-code,H-CAP capture the ultrafast process with a random uniform sampling mode.This sampling mode makes the high-frequency sampling energy dominant,which greatly suppresses the low-frequency noise blurring caused by R-code and achieves high-frequency information of image enhanced.The superior dynamic performance and large-frame reconstruction ability of H-CAP are verified by imaging optical self-focusing effect and static object,respectively.We applied H-CAP to the spatial-temporal characterization of double-pulse induced silicon surface ablation dynamics,which is performed within 220 frames in a single-shot of 300 ps.H-CAP provides a high-fidelity imaging method for observing ultrafast unrepeatable dynamic processes with large frames.
基金supported by the National Natural Science Foundation of China(Key Program)(No.11932013)the Tianjin Science and Technology Plan Project(No.22PTZWHZ00040)。
文摘With the rapid development of digital communication and the widespread use of the Internet of Things,multi-view image compression has attracted increasing attention as a fundamental technology for image data communication.Multi-view image compression aims to improve compression efficiency by leveraging correlations between images.However,the requirement of synchronization and inter-image communication at the encoder side poses significant challenges,especially for constrained devices.In this study,we introduce a novel distributed image compression model based on the attention mechanism to address the challenges associated with the availability of side information only during decoding.Our model integrates an encoder network,a quantization module,and a decoder network,to ensure both high compression performance and high-quality image reconstruction.The encoder uses a deep Convolutional Neural Network(CNN)to extract high-level features from the input image,which then pass through the quantization module for further compression before undergoing lossless entropy coding.The decoder of our model consists of three main components that allow us to fully exploit the information within and between images on the decoder side.Specifically,we first introduce a channel-spatial attention module to capture and refine information within individual image feature maps.Second,we employ a semi-coupled convolution module to extract both shared and specific information in images.Finally,a cross-attention module is employed to fuse mutual information extracted from side information.The effectiveness of our model is validated on various datasets,including KITTI Stereo and Cityscapes.The results highlight the superior compression capabilities of our method,surpassing state-of-the-art techniques.
基金supported by the Key Program of the National Natural Science Foundation of China(Grant No.62031013)Guangdong Province Key Construction Discipline Scientific Research Capacity Improvement Project(Grant No.2022ZDJS117).
文摘Nonlinear transforms have significantly advanced learned image compression(LIC),particularly using residual blocks.This transform enhances the nonlinear expression ability and obtain compact feature representation by enlarging the receptive field,which indicates how the convolution process extracts features in a high dimensional feature space.However,its functionality is restricted to the spatial dimension and network depth,limiting further improvements in network performance due to insufficient information interaction and representation.Crucially,the potential of high dimensional feature space in the channel dimension and the exploration of network width/resolution remain largely untapped.In this paper,we consider nonlinear transforms from the perspective of feature space,defining high-dimensional feature spaces in different dimensions and investigating the specific effects.Firstly,we introduce the dimension increasing and decreasing transforms in both channel and spatial dimensions to obtain high dimensional feature space and achieve better feature extraction.Secondly,we design a channel-spatial fusion residual transform(CSR),which incorporates multi-dimensional transforms for a more effective representation.Furthermore,we simplify the proposed fusion transform to obtain a slim architecture(CSR-sm),balancing network complexity and compression performance.Finally,we build the overall network with stacked CSR transforms to achieve better compression and reconstruction.Experimental results demonstrate that the proposed method can achieve superior ratedistortion performance compared to the existing LIC methods and traditional codecs.Specifically,our proposed method achieves 9.38%BD-rate reduction over VVC on Kodak dataset.
文摘To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical model for residual redundancy and a low complexity joint source-channel decoding（JSCD） algorithm are proposed. The complicated residual redundancy in wavelet compressed images is decomposed into several independent 1-D probability check equations composed of Markov chains and it is regarded as a natural channel code with a structure similar to the low density parity check （LDPC） code. A parallel sum-product （SP） and iterative JSCD algorithm is proposed. Simulation results show that the proposed JSCD algorithm can make full use of residual redundancy in different directions to correct errors and improve the peak signal noise ratio （PSNR） of the reconstructed image and reduce the complexity and delay of JSCD. The performance of JSCD is more robust than the traditional separated encoding system with arithmetic coding in the same data rate.
基金Supported by Special Fund for Scientific Research of Shannxi Education Department(No:2010JK463)Shaanxi Natural Science Foundation(2011JE012)~~
文摘[Objective] The aim was to present a proposal about a new image compression technology, in order to make the image be able to be stored in a smaller space and be transmitted with smaller bit rate on the premise of guaranteeing image quality in the rape crop monitoring system in Qinling Mountains. [Method] In the proposal, the color image was divided into brightness images with three fundamental colors, followed by sub-image division and DCT treatment. Then, coefficients of transform domain were quantized, and encoded and compressed as per Huffman coding. Finally, decompression was conducted through inverse process and decompressed images were matched. [Result] The simulation results show that when compression ratio of the color image of rape crops was 11.972 3∶1, human can not distinguish the differences between the decompressed images and the source images with naked eyes; when ratio was as high as 53.565 6∶1, PSNR was still above 30 dD,encoding efficiency achieved over 0.78 and redundancy was less than 0.22. [Conclusion] The results indicate that the proposed color image compression technology can achieve higher compression ratio on the premise of good image quality. In addition, image encoding quality and decompressed images achieved better results, which fully met requirement of image storage and transmission in monitoring system of rape crop in the Qinling Mountains.
基金supported by Shanxi Province Science and Technology Major Special Project(202201010101005)the Natural Science Foundation of China(U22A2091,62105193,62127817,62075120,62075122,62222509,62205187,6191101445 and 62305200)+5 种基金China Postdoctoral Science Foundation(2022M722006)National Key Research and Development Program of China(2022YFA1404201)Shanxi Province Science and Technology Innovation Talent Team(No.202204051001014)Science and Technology Cooperation Project of Shanxi Province(202104041101021)Shanxi“1331 Project”111 projects(D18001).
文摘Remote passive drone detection in the presence of strong background noise is challenging,since they are point objects and cannot be recognized by their contour detection.In this study,we introduce a new passive single-photon dynamic imaging method using quantum compressed sensing.This method utilizes the inherent randomness of photon radiation and detection to construct a compressive imaging system.It captures the broadband dynamic features of the point object through sparse photon detection,achieving a detectable bandwidth up to 2.05 GHz,which is significantly higher than current photon-counting imaging techniques.The method also shows excellent noise resistance,achieving high-quality imaging with a signal-to-background ratio of 1/332.This technique significantly enhances the use of single-photon imaging in real-world applications.
基金Project(61172184) supported by the National Natural Science Foundation of ChinaProject(200902482) supported by China Postdoctoral Science Foundation Specially Funded ProjectProject(12JJ6062) supported by the Natural Science Foundation of Hunan Province,China
文摘A blind digital image forensic method for detecting copy-paste forgery between JPEG images was proposed.Two copy-paste tampering scenarios were introduced at first:the tampered image was saved in an uncompressed format or in a JPEG compressed format.Then the proposed detection method was analyzed and simulated for all the cases of the two tampering scenarios.The tampered region is detected by computing the averaged sum of absolute difference(ASAD) images between the examined image and a resaved JPEG compressed image at different quality factors.The experimental results show the advantages of the proposed method:capability of detecting small and/or multiple tampered regions,simple computation,and hence fast speed in processing.
基金Project 60571049 supported by the National Natural Science Foundation of China
文摘By investigating the limitation of existing wavelet tree based image compression methods, we propose a novel wavelet fractal image compression method in this paper. Briefly, the initial errors are appointed given the different levels of importance accorded the frequency sublevel band wavelet coefficients. Higher frequency sublevel bands would lead to larger initial errors. As a result, the sizes of sublevel blocks and super blocks would be changed according to the initial errors. The matching sizes between sublevel blocks and super blocks would be changed according to the permitted errors and compression rates. Systematic analyses are performed and the experimental results demonstrate that the proposed method provides a satisfactory performance with a clearly increasing rate of compression and speed of encoding without reducing SNR and the quality of decoded images. Simulation results show that our method is superior to the traditional wavelet tree based methods of fractal image compression.
文摘Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45√N times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than √N for most images, and it is more efficient than the pure quantum algorithm.
文摘Scalable video coding (SVC), as the Scalable Extension of H.264/AVC, is an ongoing international video coding standard designed for network adaptive or device adaptive applications and also offers high coding efficiency. However, packet losses often occur over unreliable networks even for base layer of SVC and have severe impact on the playback quality of compressed video. Until now, no literature has discussed error concealment support for standard SVC bit-stream. In this paper, we provide robust and effective error concealment techniques for SVC with spatial scalability. Experimental results showed that the proposed methods provide substantial improvement, both subjectively and objectively, without a significant complexity overhead.
文摘Based on Jacquin's work. this paper presents an adaptive block-based fractal image coding scheme. Firstly. masking functions are used to classify range blocks and weight the mean Square error (MSE) of images. Secondly, an adaptive block partition scheme is introduced by developing the quadtree partition method. Thirdly. a piecewise uniform quantization strategy is appled to quantize the luminance shifting. Finally. experiment results are shown and compared with what reported by Jacquin and Lu to verify the validity of the methods addressed by the authors.
