Neutron Spectrum Unfolding Method Based on Compressed Sensing Theory
Accurate information of neutron spectrum is very important for design and operation of nuclear facilities. The current unfolding methods commonly use the prior information as the initial values of the iteration process, which limits implementation of multiple prior information during the unfolding p...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Editorial Board of Atomic Energy Science and Technology
2024-06-01
|
| Series: | Yuanzineng kexue jishu |
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850248942527184896 |
|---|---|
| author | WU Guanghao1, SHAO Gang2, SHI Guang3, LIU Bin4, 5, PAN Liangming4, 5, WANG Feng4, 5, ZHOU Xiaowei4, 5 |
| author_facet | WU Guanghao1, SHAO Gang2, SHI Guang3, LIU Bin4, 5, PAN Liangming4, 5, WANG Feng4, 5, ZHOU Xiaowei4, 5 |
| author_sort | WU Guanghao1, SHAO Gang2, SHI Guang3, LIU Bin4, 5, PAN Liangming4, 5, WANG Feng4, 5, ZHOU Xiaowei4, 5 |
| collection | DOAJ |
| description | Accurate information of neutron spectrum is very important for design and operation of nuclear facilities. The current unfolding methods commonly use the prior information as the initial values of the iteration process, which limits implementation of multiple prior information during the unfolding process and accuracies of the unfolding results are difficult to be enhanced. In this paper, a neutron spectrum unfolding method based on compressed sensing theory was proposed. Multiple prior information can be implemented into the unfolding process due to the basic principle of the compressed sensing theory. The proposed method includes two processes, such as the sparse representation process and the sparse reconstruction process. Two kinds of algorithms, the K-SVD algorithm and the online dictionary learning algorithm, were applied for sparse representation. The K-SVD algorithm is efficient and easy to be implemented. However, computation always fail while the singularity of the training matrix increases. The online dictionary learning algorithm uses the stochastic approximation. It assumes the training set as a distribution and processes one sample from the distribution during each iteration. Hence, the online dictionary learning algorithm can effectively avoid the computation failure caused by matrix singularity. Algorithms based on -norm and -norm were applied for sparse reconstruction. The -norm based algorithm has the closet meaning to sparsity but lacks the ability of suppressing noises containing in the measured data. The -norm based algorithm equivalents the sparse reconstruction to the LASSO equation, which has better performance on suppressing noises. The proposed unfolding method was applied to unfolding problems of multi-sphere spectrometer of measuring several typical neutron spectra. The K-SVD algorithm was applied for sparse representation and the -norm based algorithm was applied for sparse reconstruction. The unfolded spectra agree well with the standard solutions. High accuracies can be obtained with implementation of multiple prior information. Moreover, measured data of multiple activation foils at the irradiation surveillance capsule was also unfolded with the proposed method. To avoid computational failure caused by singularity of the training matrix, the online dictionary learning algorithm was applied for sparse representation. And the -norm based algorithm was applied for sparse reconstruction to suppress noises contained in the measured data. The unfolded spectra agree well with the standard solutions. Besides, dependence of the unfolding process on the number of equations is reduced as a result of implementation of multiple prior information, allowing successful unfolding with acceptable accuracies while removing fission detectors such as 238U and 237Np, which lays theoretical foundation for removal of fission detectors in radiation surveillance project. |
| format | Article |
| id | doaj-art-b913268e2ac246da9c7fcbc7c90eeef9 |
| institution | OA Journals |
| issn | 1000-6931 |
| language | English |
| publishDate | 2024-06-01 |
| publisher | Editorial Board of Atomic Energy Science and Technology |
| record_format | Article |
| series | Yuanzineng kexue jishu |
| spelling | doaj-art-b913268e2ac246da9c7fcbc7c90eeef92025-08-20T01:58:36ZengEditorial Board of Atomic Energy Science and TechnologyYuanzineng kexue jishu1000-69312024-06-015861311131810.7538/yzk.2023.youxian.0675Neutron Spectrum Unfolding Method Based on Compressed Sensing TheoryWU Guanghao1, SHAO Gang2, SHI Guang3, LIU Bin4, 5, PAN Liangming4, 5, WANG Feng4, 5, ZHOU Xiaowei4, 501. Chengdu Hezong Nuclear Power Engineering Co., Ltd., Nuclear Power Institute of China, Chengdu 610213, China 2. Fujian Fuqing Nuclear Power Co., Ltd., Fuqing 350300, China 3. Civil Engineering Design Sub-institute, Nuclear Power Institute of China, Chengdu 610213, China 4. Key Laboratory of Low-grade Energy Utilization Technologies and Systems, Ministry of Education, Chongqing University, Chongqing 400044, China 5. Department of Nuclear Engineering and Technology, Chongqing University, Chongqing 400044, ChinaAccurate information of neutron spectrum is very important for design and operation of nuclear facilities. The current unfolding methods commonly use the prior information as the initial values of the iteration process, which limits implementation of multiple prior information during the unfolding process and accuracies of the unfolding results are difficult to be enhanced. In this paper, a neutron spectrum unfolding method based on compressed sensing theory was proposed. Multiple prior information can be implemented into the unfolding process due to the basic principle of the compressed sensing theory. The proposed method includes two processes, such as the sparse representation process and the sparse reconstruction process. Two kinds of algorithms, the K-SVD algorithm and the online dictionary learning algorithm, were applied for sparse representation. The K-SVD algorithm is efficient and easy to be implemented. However, computation always fail while the singularity of the training matrix increases. The online dictionary learning algorithm uses the stochastic approximation. It assumes the training set as a distribution and processes one sample from the distribution during each iteration. Hence, the online dictionary learning algorithm can effectively avoid the computation failure caused by matrix singularity. Algorithms based on -norm and -norm were applied for sparse reconstruction. The -norm based algorithm has the closet meaning to sparsity but lacks the ability of suppressing noises containing in the measured data. The -norm based algorithm equivalents the sparse reconstruction to the LASSO equation, which has better performance on suppressing noises. The proposed unfolding method was applied to unfolding problems of multi-sphere spectrometer of measuring several typical neutron spectra. The K-SVD algorithm was applied for sparse representation and the -norm based algorithm was applied for sparse reconstruction. The unfolded spectra agree well with the standard solutions. High accuracies can be obtained with implementation of multiple prior information. Moreover, measured data of multiple activation foils at the irradiation surveillance capsule was also unfolded with the proposed method. To avoid computational failure caused by singularity of the training matrix, the online dictionary learning algorithm was applied for sparse representation. And the -norm based algorithm was applied for sparse reconstruction to suppress noises contained in the measured data. The unfolded spectra agree well with the standard solutions. Besides, dependence of the unfolding process on the number of equations is reduced as a result of implementation of multiple prior information, allowing successful unfolding with acceptable accuracies while removing fission detectors such as 238U and 237Np, which lays theoretical foundation for removal of fission detectors in radiation surveillance project.neutron spectrum unfoldingcompressed sensing theorysparse representationsparse reconstruction |
| spellingShingle | WU Guanghao1, SHAO Gang2, SHI Guang3, LIU Bin4, 5, PAN Liangming4, 5, WANG Feng4, 5, ZHOU Xiaowei4, 5 Neutron Spectrum Unfolding Method Based on Compressed Sensing Theory Yuanzineng kexue jishu neutron spectrum unfolding compressed sensing theory sparse representation sparse reconstruction |
| title | Neutron Spectrum Unfolding Method Based on Compressed Sensing Theory |
| title_full | Neutron Spectrum Unfolding Method Based on Compressed Sensing Theory |
| title_fullStr | Neutron Spectrum Unfolding Method Based on Compressed Sensing Theory |
| title_full_unstemmed | Neutron Spectrum Unfolding Method Based on Compressed Sensing Theory |
| title_short | Neutron Spectrum Unfolding Method Based on Compressed Sensing Theory |
| title_sort | neutron spectrum unfolding method based on compressed sensing theory |
| topic | neutron spectrum unfolding compressed sensing theory sparse representation sparse reconstruction |
| work_keys_str_mv | AT wuguanghao1shaogang2shiguang3liubin45panliangming45wangfeng45zhouxiaowei45 neutronspectrumunfoldingmethodbasedoncompressedsensingtheory |