排序方式: 共有65条查询结果,搜索用时 15 毫秒
51.
52.
Jing-Jun Wu 《中国物理 B》2022,31(5):54216-054216
Once the metalenses are fabricated, the functions of most metalenses are invariable. The tunability and reconfigurability are useful and cost-saving for metalenses in realistic applications. We demonstrate this tunability here via a novel hybrid metalens with the strategic placement of an ultra-thin VO2 layer. The hybrid metalens is capable of dynamically modulating the focusing intensity of transmitted light at a wavelength of 1550 nm, and demonstrate a 42.28% focusing efficiency of the incident light and 70.01% modulation efficiency. The hybrid metalens' optothermal simulations show an optothermal conversion process of dynamic focusing, and a maximum laser density of 1.76×103 W/cm2 can be handled at an ambient temperature lower than 330 K. The hybrid metalens proposed in this work, a light-dose sensitive tunable smart metalens that can protect other instruments/systems or materials from being damaged, has its specific applications such as in anti-satellite blinding, bio-imaging, etc. 相似文献
53.
54.
傅里叶干涉成像光谱技术中的重构方法 总被引:5,自引:2,他引:3
在干涉成像光谱仪的光谱复原中,由于系统存在各种误差,若直接对所得干涉图进行傅里叶变换重构,得到的光谱图会产生较大误差甚至错误。介绍了Sagnac型干涉成像光谱仪基本原理,针对上述问题得到一套对采集得到的干涉图进行光谱重构的方法,通过对所采集干涉图进行消趋势项、切趾、相位校正、共轭对称化等步骤的处理,再进行重构,即可有效避免直接重构所带来的误差,使用所研制的原理样机对氦灯等单色光源进行光谱曲线重构实验,得到的光谱强度分布曲线与标称曲线基本吻合,光谱复原精度达到了4nm,具有较好的重构效果。 相似文献
55.
基于DCT算法的种子点相位解包算法 总被引:4,自引:1,他引:3
移相干涉术由于其高精度被广泛应用在光学元件的面形测量上,而由移相算法得到的相位数据被包裹在[-π,π]之间。基于区域生长理论的相位解包算法(种子点法)可以高精度地实现连贯区域的相位解包,基于离散余弦变换的最小二乘解包(DCT)算法可以实现矩形区域的相位解包,而实际测量中,经常会碰到被测件的有效区域为非矩形的分离区域。因此,在分析前两种算法优缺点的基础上,提出了基于DCT算法的种子点相位解包算法。首先运用DCT算法对整个包裹相位进行解包,然后运用种子点法分别解包各分离区域,再通过DCT算法求得的种子点干涉级次实现各分离区域解包相位的统一。实验结果表明,该方法克服了种子点法和DCT算法的缺点,可以准确、快速地实现分离区域干涉图包裹相位的解包,且比这两种算法具有更好的稳定性和更高的精度。 相似文献
56.
A three-dimensional(3D)wavelet coder based on 3D significance tree splitting is proposed for hyperspectral image compression.3D discrete wavelet transform(DWT)is applied to explore the spatial and spectral correlations.Then the 3D significance tree structure is constructed in 3D wavelet domain,and wavelet coefficients are encoded via 3D significance tree splitting.This proposed algorithm does not need to use ordered lists,moreover it has less complexity and requires lower fixed memory than 3D set partitioning in hierarchical trees(SPIHT)algorithm and 3D set partitioned embedded block(SPECK)algorithm.The numerical experiments on AVIRIS images show that the proposed algorithm outperforms 3D SPECK,and has a minor loss of performance compared with 3D SPIHT.This algorithm is suitable for simple hardware implementation and can be applied to progressive transmission. 相似文献
57.
58.
59.
60.