首页 > 其他分享 >单像素成像中观测矩阵的设计

单像素成像中观测矩阵的设计

时间:2023-10-28 13:55:58浏览次数:32  
标签:methods random 矩阵 However 像素 patterns sampling 成像

1.2022-Deep Learning Optimized Terahertz Single-Pixel Imaging
创新点:However, all these reports focus on reducing the sampling rate or the number of patterns M, but leave the sampling time per pattern t0 untouched.
观测矩阵:However, these compressed sensing algorithms adopt nonorthogonal random patterns, hindering further compression of the sampling ratio. To tackle this problem, deterministic model-based techniques, which adopt deterministic orthogonal basis patterns such as Hadamard patterns or Fourier patterns to encode the THz fields, and utilize matrix operations to reconstruct THz images, have been proposed recently.
算法:Most ghost imagingmodels based on deep convolutional neural networks do not make full use of the hierarchical features from the original low-quality images, thereby resulting in relatively-low performance.

2.2020-Broadband high-resolution terahertz single-pixel imaging(调制器调制深度100%)
观测矩阵:There are many methods to generate patterns for masking an object (with ON and OFF pixels that transmit and block the optical signal, respectively), including the Hadamard, Fourier , and Toeplitz methods. The generated masks should be orthogonal to each other and equally ON:OFF pixel weighted for faster reconstruction. However, pseudo-random pattern reconstruction methods, i.e., nonorthogonal patterns with a small number of new pixels per mask, have been proven to be as effective as those using fully random patterns. 

标签:methods,random,矩阵,However,像素,patterns,sampling,成像
From: https://www.cnblogs.com/mawenjing/p/17794025.html

相关文章

  • 三元组存储稀疏矩阵
    1#define_CRT_SECURE_NO_WARNINGS2#include<iostream>3#define_CRT_SECURE_NO_WARNINGS4usingnamespacestd;56intarr[11][11];78structTripleArray9{10introw;11intcol;12intval;13};14//三元表1516intmai......
  • day 2 数组 977.有序数组的平方、209.长度最小的子数组、59.螺旋矩阵 Ⅱ
    977.有序数组的平方题目链接:977.有序数组的平方视频教程文章教程思路最直观的解法:暴力解题,每个数先平方,然后再快速排序,时间复杂度为O(n+nlogn)规律:该数组本身是非递减顺序,在平方后其实依然有顺序,左右两边大中间小。双指针利用观察到的规律,可以利用双指针在数......
  • 矩阵快速幂优化dp
    寻址连续优化for(inti=1;i<=n;i++)for(intk=1;k<=n;k++)if(a.a[i][k])for(intj=1;j<=n;j++)c.a[i][j]=(c.a[i][j]+1ll*a.a[i][k]*b.a[k][j])%mod;P3216[HNOI2011]数学作业(普通套路)题目......
  • 代码随想录算法训练营第一天 | 977.有序数组的平方 ,209.长度最小的子数组 ,59.螺旋矩
    今日学习的文章链接和视频链接https://programmercarl.com/0977.有序数组的平方.htmlhttps://programmercarl.com/0209.长度最小的子数组.htmlhttps://programmercarl.com/0059.螺旋矩阵II.html977.有序数组的平方菜鸡刚开始只会暴力,记录一下双指针:varsortedSquares=......
  • 【算法题】2906. 构造乘积矩阵
    题目:给你一个下标从0开始、大小为n*m的二维整数矩阵grid,定义一个下标从0开始、大小为n*m的的二维矩阵p。如果满足以下条件,则称p为grid的乘积矩阵:对于每个元素p[i][j],它的值等于除了grid[i][j]外所有元素的乘积。乘积对12345取余数。返回grid的乘积矩......
  • cuda vectorized实现矩阵转置
    使用了共享内存和向量化传输,目前为止效果最好的一个实现__global__voidtransposeSmemVec(float*input,float*output,constintX,constintY){__shared__floatsmem[32*4*32];unsignedintix=4*(blockDim.x*blockIdx.x+threadIdx.x);......
  • C++前缀和算法:构造乘积矩阵
    题目给你一个下标从0开始、大小为n*m的二维整数矩阵grid,定义一个下标从0开始、大小为n*m的的二维矩阵p。如果满足以下条件,则称p为grid的乘积矩阵:对于每个元素p[i][j],它的值等于除了grid[i][j]外所有元素的乘积。乘积对12345取余数。返回grid的乘积......
  • 神秘矩阵树
    求图的所有生成树边权和\(k\)次方之和,\(n,k\le50\)。Sol:展开\(k\)次方后会得到\(\sum{k!\overw_1!w_2!...w_{n-1}!}\prode_i^{w_i}\)之类的式子,你发现给每条树边设个生成函数\(f_i(x)=e^{e_ix}\),答案就是\(k![x^k]\prodf_i(x)\),于是你用矩阵树,带\(1\simnk+1\)......
  • 3.4 数组和特殊矩阵
    3.4.1数组的定义知识总览     知识总结    未完待续......
  • 【二】矩阵及其运算
            ......