Research on the spectral reconstruction of a low-dimensional filter array micro-spectrometer based on a truncated singular value decomposition-convex optimization algorithm

Jiakun Zhang; Liu Zhang; Ying Song; Yan Zheng

Home/Archive/arXiv

arXiv · 2209.07531

Research on the spectral reconstruction of a low-dimensional filter array micro-spectrometer based on a truncated singular value decomposition-convex optimization algorithm

Jiakun Zhang·Liu Zhang·Ying Song·Yan Zheng

View original source ↗Read source document ↗Export metadata ↓

Abstract

Currently, the engineering of miniature spectrometers mainly faces three problems: the mismatch between the number of filters at the front end of the detector and the spectral reconstruction accuracy; the lack of a stable spectral reconstruction algorithm; and the lack of a spectral reconstruction evaluation method suitable for engineering. Therefore, based on 20 sets of filters, this paper classifies and optimizes the filter array by the K-means algorithm and particle swarm algorithm, and obtains the optimal filter combination under different matrix dimensions. Then, the truncated singular value decomposition-convex optimization algorithm is used for high-precision spectral reconstruction, and the detailed spectral reconstruction process of two typical target spectra is described. In terms of spectral evaluation, due to the strong randomness of the target detected during the working process of the spectrometer, the standard value of the target spectrum cannot be obtained. Therefore, for the first time, we adopt the method of joint cross-validation of multiple sets of data for spectral evaluation. The results show that when the random error of positive or negative 2 code values is applied multiple times for reconstruction, the spectral angle cosine value between the reconstructed curves becomes more than 0.995, which proves that the spectral reconstruction under this algorithm has high stability. At the same time, the spectral angle cosine value of the spectral reconstruction curve and the standard curve can reach above 0.99, meaning that it realizes a high-precision spectral reconstruction effect. A high-precision spectral reconstruction algorithm based on truncated singular value-convex optimization, which is suitable for engineering applications, is established in this paper, providing important scientific research value for the engineering application of micro-spectrometers.

Explore related subjects

physics.data-an

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Jiakun Zhang, Liu Zhang, Ying Song, Yan Zheng. 2022-09-15. Research on the spectral reconstruction of a low-dimensional filter array micro-spectrometer based on a truncated singular value decomposition-convex optimization algorithm. https://arxiv.org/abs/2209.07531

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Comparison of Image Processing Models in Quark Gluon Jet Classification

Quark-gluon discrimination provides a useful test case for studying how different machine-learning architectures learn the spatial structure of QCD radiation. In this work, we compare convolutional neural network (CNN), Vision Transformers (ViT), and hierarchical Swin Transformers using the same three-channel jet-image representation, consisting of charged-particle momentum, neutral-particle momentum, and charged-particle multiplicity from PYTHIA 8 jets. We study their performance for different training-set sizes and fine-tuning configurations, with particular attention to the role of local and global information in the jet images. CNN and Swin models consistently perform better than ViT in the cases studied. Since both CNN and Swin retain a strong local component in their architectures, this suggests that local jet substructure plays an important role in quark-gluon discrimination. The performance of the hierarchical Swin model also suggests that combining local features over larger spatial scales is useful. Block-wise fine-tuning improves the performance of the Transformer models, although the improvement becomes smaller and the training less stable as more blocks are unfrozen. We also find that self-supervised Momentum Contrast (MoCo) pretraining improves the model initialization, particularly when the amount of labeled training data is limited. Based on these observations, we developed a smaller Swin model adopted to the jet-image representation used in this study. It achieves comparable performance with substantially fewer parameters. The results show that it is important to adapt the model architecture and training procedure to the specific input characteristics of High Energy Physics (HEP) data when applying vision models in HEP.

physics.data-an↗

arXiv2026

Online local learning for generative thermodynamic computing

Generative thermodynamic computers turn thermal noise into structured data through Langevin dynamics. We train these systems with a local update at each integration step. The reverse-path Onsager-Machlup objective yields a coupling gradient that is a symmetric sum of local residual-state correlations. We apply this gradient immediately rather than accumulating it over a full trajectory. In digital simulations using MNIST prototypes, online and trajectory-batch training reach similar validation losses on fixed noising paths. Models trained online release less heat on average in all five independently seeded pairs, with both models' parameters held fixed during sampling. Auxiliary classifier and nearest-prototype measures change modestly, while pairwise diversity decreases. The response to noise depends strongly on where the errors enter: independent zero-mean errors in the formed updates produce little heat change over a finite range of noise amplitudes, whereas residual offset and temporal correlation have much larger effects. Storing trained couplings requires substantially less precision than resolving deterministic updates during training. Together, these results establish a local online training method and show how update timing, noise structure, and precision affect generative thermodynamic computing.

physics.data-an↗

arXiv2026

Information-Loss Location Estimation and Curvature-Scale Analysis of Physical Measurements: A Gaussian, Cauchy, and Logistic Neutron-Lifetime Benchmark

We develop and implement a two-step location-scale analysis for repeated physical measurements when the underlying distribution is not known. For a chosen substitute distribution, stationarity of population Kullback-Leibler information loss at fixed scale motivates the location score, which we apply to the observed measurements through empirical cross-entropy. Steiner's curvature rule then defines a companion scale separately. We place Gaussian, Cauchy, and logistic substitutes in one common construction and implement them reproducibly on a physics benchmark. For the logistic substitute, we pair the established bounded location score with a scale defined by the curvature rule rather than by a fitted tuning constant or a scale-likelihood equation. For Gaussian measurements with different quoted uncertainties, an experiment-level curvature convention and a stated variance mapping give an exact algebraic connection to a standard residual-based variance estimate for a weighted fit. Applied to a published 21-measurement neutron-lifetime compilation, the inverse-variance weighted, most frequent value, and logistic locations are 878.689, 881.164, and 882.835 s, respectively. These values are benchmark results of the compared constructions and are not proposed as a new recommended neutron lifetime.

physics.data-an↗