Structured light 3D measurement technology undergoes continuous development and perfection since its appearance. Today, it has become a relatively mature technology widely used in various fields. However, there are still some problems to be solved in the development of structured light 3D measurement technology. In particular, the effect of highlight on the measurement results when measuring specularly reflective objects gets more and more noticeable. The specular reflection-induced highlight is one of the difficulties in 3D measurement of structured light, and the existing technology is unable to meet the requirements of increasingly complex and precise measurement work. This paper summarizes the domestic and foreign representative research results on highlight suppression methods based on structured light 3D measurement, which can be divided into three categories: software-based suppression method, hardware-based suppression method, and software-hardware combined suppression method.
{"title":"Review of Highlight Suppression Methods for Structured Light 3D Measurement","authors":"Jiangwen Tang, Xinke Xu, Yuanhui Peng, Liang Xue, Kaiqiang Xie","doi":"10.1145/3561518.3561529","DOIUrl":"https://doi.org/10.1145/3561518.3561529","url":null,"abstract":"Structured light 3D measurement technology undergoes continuous development and perfection since its appearance. Today, it has become a relatively mature technology widely used in various fields. However, there are still some problems to be solved in the development of structured light 3D measurement technology. In particular, the effect of highlight on the measurement results when measuring specularly reflective objects gets more and more noticeable. The specular reflection-induced highlight is one of the difficulties in 3D measurement of structured light, and the existing technology is unable to meet the requirements of increasingly complex and precise measurement work. This paper summarizes the domestic and foreign representative research results on highlight suppression methods based on structured light 3D measurement, which can be divided into three categories: software-based suppression method, hardware-based suppression method, and software-hardware combined suppression method.","PeriodicalId":196224,"journal":{"name":"Proceedings of the 6th International Conference on Graphics and Signal Processing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123358545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kangming Du, Xin Lyu, C. Zhang, Xin Li, Tao Zeng, Liancheng Zhao
In the traditional image encryption algorithm where permutation and diffusion are performed independently, multiple image scans are required, which reduces the encryption efficiency. In this paper, a fast image encryption scheme based on simultaneous permutation-diffusion is proposed, which performs simultaneous permutation-diffusion row by row and column by column. Firstly, the sorting and cyclic-shift are combined for the permutation. The permutation index sequence of the first row/column is obtained by sorting, and the rest is updated by the cyclic-shift operation related to the plain image, which can resist the chosen-plaintext attack. Secondly, cross-diffusion is performed with dynamic index sequences, which enhances the randomness of the diffusion behavior. Finally, the permutation and diffusion are performed at the same time. Therefore, a round of permutation and diffusion only needs to scan the image once, which improves the encryption efficiency. Note that our scheme only needs to generate and sort chaotic sequences with row/column level length, which reduces the iteration times of the chaotic system and sorting length. In addition, all index sequences are updated at row/column level, which is faster than pixel-level. The simulation results and security analysis show that our scheme has higher encryption efficiency than existing similar methods, and has sufficient security to resist common attacks.
{"title":"A Fast Image Encryption Scheme Based on Simultaneous Permutation-Diffusion","authors":"Kangming Du, Xin Lyu, C. Zhang, Xin Li, Tao Zeng, Liancheng Zhao","doi":"10.1145/3561518.3561520","DOIUrl":"https://doi.org/10.1145/3561518.3561520","url":null,"abstract":"In the traditional image encryption algorithm where permutation and diffusion are performed independently, multiple image scans are required, which reduces the encryption efficiency. In this paper, a fast image encryption scheme based on simultaneous permutation-diffusion is proposed, which performs simultaneous permutation-diffusion row by row and column by column. Firstly, the sorting and cyclic-shift are combined for the permutation. The permutation index sequence of the first row/column is obtained by sorting, and the rest is updated by the cyclic-shift operation related to the plain image, which can resist the chosen-plaintext attack. Secondly, cross-diffusion is performed with dynamic index sequences, which enhances the randomness of the diffusion behavior. Finally, the permutation and diffusion are performed at the same time. Therefore, a round of permutation and diffusion only needs to scan the image once, which improves the encryption efficiency. Note that our scheme only needs to generate and sort chaotic sequences with row/column level length, which reduces the iteration times of the chaotic system and sorting length. In addition, all index sequences are updated at row/column level, which is faster than pixel-level. The simulation results and security analysis show that our scheme has higher encryption efficiency than existing similar methods, and has sufficient security to resist common attacks.","PeriodicalId":196224,"journal":{"name":"Proceedings of the 6th International Conference on Graphics and Signal Processing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124376054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The emotion matching model is a method suitable for evaluating the matching degree of words and songs, but only through the emotion matching model cannot make a correct evaluation for evaluating the matching degree of words and songs. In order to improve this problem, this paper proposes an intelligent evaluation algorithm for the matching degree of lyrics and songs based on LabVIEW digital images. On the basis of analyzing the relationship between LabVIEW digital images and music melody, emotional feature analysis technology and algorithm description, the MagnaTagATune data set and the MusiClef data set are selected. And the 300 music in the MirexMood dataset to verify the model matching effect through experiments. The experimental results show that the calculation model can reasonably evaluate the emotional content of music lyrics, and make accurate and intelligent evaluation of music.
{"title":"An Intelligent Evaluation Algorithm for the Matching Degree of Music Lyrics Based on LabVIEW Digital Image","authors":"Chenyan Dai","doi":"10.1145/3561518.3561524","DOIUrl":"https://doi.org/10.1145/3561518.3561524","url":null,"abstract":"The emotion matching model is a method suitable for evaluating the matching degree of words and songs, but only through the emotion matching model cannot make a correct evaluation for evaluating the matching degree of words and songs. In order to improve this problem, this paper proposes an intelligent evaluation algorithm for the matching degree of lyrics and songs based on LabVIEW digital images. On the basis of analyzing the relationship between LabVIEW digital images and music melody, emotional feature analysis technology and algorithm description, the MagnaTagATune data set and the MusiClef data set are selected. And the 300 music in the MirexMood dataset to verify the model matching effect through experiments. The experimental results show that the calculation model can reasonably evaluate the emotional content of music lyrics, and make accurate and intelligent evaluation of music.","PeriodicalId":196224,"journal":{"name":"Proceedings of the 6th International Conference on Graphics and Signal Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116732812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proceedings of the 6th International Conference on Graphics and Signal Processing","authors":"","doi":"10.1145/3561518","DOIUrl":"https://doi.org/10.1145/3561518","url":null,"abstract":"","PeriodicalId":196224,"journal":{"name":"Proceedings of the 6th International Conference on Graphics and Signal Processing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130474927","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：