A coding-based method to solve the image matching problems in stereovision measurement is presented. The solution is to add and append an identity ID to the retro-reflect point, so it can be identified efficiently und...A coding-based method to solve the image matching problems in stereovision measurement is presented. The solution is to add and append an identity ID to the retro-reflect point, so it can be identified efficiently under the complicated circumstances and has the characteristics of rotation, zooming, and deformation independence. Its design architecture and implementation process in details based on the theory of stereovision measurement are described. The method is effective on reducing processing data time, improving accuracy of image matching and automation of measuring system through experiments.展开更多
Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In ...Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In this paper, this problem is formulated as a heuristic depth-first graph search problem at first. The graph node expanding method and rules are given. Then, rollout strategies are applied, which can be combined with the heuristic graph search algorithms, in a computationally more efficient manner than the optimal strategies, to obtain solutions superior to those using the greedy heuristic algorithms. The proposed rollout-based test points selection algorithm is illustrated and tested using an analog circuit and a set of simulated integer-coded fault wise tables. Computa- tional results are shown, which suggest that the rollout strategy policies are significantly better than other strategies.展开更多
Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of t...Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of traditional exhaustive is low. A tradeoff method between the high time complexity and low space complexity is proposed. At first, a new fault-pair table is constructed based on the integer-coded fault wise table. The fault-pair table consists of two columns： one column represents fault pair and the other represents test points set that can distinguish the corresponding faults. Then, the rows are arranged in ascending order according to the cardinality of corresponding test points set. Thirdly, test points in the top rows are selected one by one until all fault pair are isolated. During the test points selection process, the rows that contain selected test points are deleted and then the dimension of fault-pair table decreases gradually. The proposed test points selection algorithm is illustrated and tested using an integercoded fault wise table derived from a real analog circuit. Computational results suggest show policies are better than the exhaustive strategy.展开更多
Data Matrix(DM)codes have been widely used in industrial production.The reading of DM code usually includes positioning and decoding.Accurate positioning is a prerequisite for successful decoding.Traditional image pro...Data Matrix(DM)codes have been widely used in industrial production.The reading of DM code usually includes positioning and decoding.Accurate positioning is a prerequisite for successful decoding.Traditional image processing methods have poor adaptability to pollution and complex backgrounds.Although deep learning-based methods can automatically extract features,the bounding boxes cannot entirely fit the contour of the code.Further image processing methods are required for precise positioning,which will reduce efficiency.Because of the above problems,a CenterNet-based DM code key point detection network is proposed,which can directly obtain the four key points of the DM code.Compared with the existing methods,the degree of fitness is higher,which is conducive to direct decoding.To further improve the positioning accuracy,an enhanced loss function is designed,including DM code key point heatmap loss,standard DM code projection loss,and polygon Intersection-over-Union(IoU)loss,which is beneficial for the network to learn the spatial geometric characteristics of DM code.The experiment is carried out on the self-made DM code key point detection dataset,including pollution,complex background,small objects,etc.,which uses the Average Precision(AP)of the common object detection metric as the evaluation metric.AP reaches 95.80%,and Frames Per Second(FPS)gets 88.12 on the test set of the proposed dataset,which can achieve real-time performance in practical applications.展开更多
Based on the coded and non-coded targets, the targets are extracted from the images according to their size, shape and intensity etc., and thus an improved method to identify the unique identity（D） of every coded ta...Based on the coded and non-coded targets, the targets are extracted from the images according to their size, shape and intensity etc., and thus an improved method to identify the unique identity（D） of every coded target is put forward and the non-coded and coded targets are classified. Moreover, the gray scale centroid algorithm is applied to obtain the subpixel location of both uncoded and coded targets. The initial matching of the uncoded target correspondences between an image pair is established according to similarity and compatibility, which are based on the ID correspondences of the coded targets. The outliers in the initial matching of the uncoded target are eliminated according to three rules to finally obtain the uncoded target correspondences. Practical examples show that the algorithm is rapid, robust and is of high precision and matching ratio.展开更多
A novel diagrammtic method is proposed to show the angular distribution of bases of human protein sequences. Using this method, the distribution sphere[1-4] is divided into four regions with same volume. The picture i...A novel diagrammtic method is proposed to show the angular distribution of bases of human protein sequences. Using this method, the distribution sphere[1-4] is divided into four regions with same volume. The picture is clearer and more intuitive than that in [1] .A rule on the angular distribution of the representative points of bases of protein sequences is given. Besides, in 300 representative pointS of human protein sequence samples we find that there are three (not only one) points outside the sphere.展开更多
Contamination of food may occur at any point during the food distribution channel. However, mishandling of food at the last segment of food distribution where food is prepared for consumption often causes outbreaks. K...Contamination of food may occur at any point during the food distribution channel. However, mishandling of food at the last segment of food distribution where food is prepared for consumption often causes outbreaks. Keeping food safe in hospitals is particularly imperative because of the population they serve and the potentially hazardous environment. This article presents the results of a pencil and paper self-reported survey on the knowledge of Mexican food code, NOM-093-SSA1-1994, and field observation of the compliance of the code among the hospital foodservice employees in Guadalajara, México. One hundred twenty-seven employees from six public and private hospitals participated in the study. Of the respondents, 81.5% were aware of the importance of personal hygiene in food safety. Professional attire including hair restraints and mouth cover were always used. These participants, however seldom used thermometers, and only 37% of respondents knew the correct temperatures for refrigeration. In most hospitals correct procedures for sanitizing food contact surfaces that were prescribed by the sanitizing chemical manufacturers were practiced. Only 25% of the participants knew that their work was defined by the food code. Strategies for dissemination of the food code, and food safety training of the employees are urgently needed. Commitment and support of the hospital are needed in order to improve safe food handling practices in these hospitals.展开更多
Point cloud compression is critical to deploy 3D representation of the physical world such as 3D immersive telepresence,autonomous driving,and cultural heritage preservation.However,point cloud data are distributed ir...Point cloud compression is critical to deploy 3D representation of the physical world such as 3D immersive telepresence,autonomous driving,and cultural heritage preservation.However,point cloud data are distributed irregularly and discontinuously in spatial and temporal domains,where redundant unoccupied voxels and weak correlations in 3D space make achieving efficient compression a challenging problem.In this paper,we propose a spatio-temporal context-guided algorithm for lossless point cloud geometry compression.The proposed scheme starts with dividing the point cloud into sliced layers of unit thickness along the longest axis.Then,it introduces a prediction method where both intraframe and inter-frame point clouds are available,by determining correspondences between adjacent layers and estimating the shortest path using the travelling salesman algorithm.Finally,the few prediction residual is efficiently compressed with optimal context-guided and adaptive fastmode arithmetic coding techniques.Experiments prove that the proposed method can effectively achieve low bit rate lossless compression of point cloud geometric information,and is suitable for 3D point cloud compression applicable to various types of scenes.展开更多
基金This project is supported by National Natural Science Foundation of China(No.50475176) and Municipal Natural Science Foundation of Beijing(No.KZ200511232019).
文摘A coding-based method to solve the image matching problems in stereovision measurement is presented. The solution is to add and append an identity ID to the retro-reflect point, so it can be identified efficiently under the complicated circumstances and has the characteristics of rotation, zooming, and deformation independence. Its design architecture and implementation process in details based on the theory of stereovision measurement are described. The method is effective on reducing processing data time, improving accuracy of image matching and automation of measuring system through experiments.
基金supported by Commission of Science Technology and Industry for National Defence of China under Grant No.A1420061264National Natural Science Foundation of China under Grant No.60934002General Armament Department under Grand No.51317040102)
文摘Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In this paper, this problem is formulated as a heuristic depth-first graph search problem at first. The graph node expanding method and rules are given. Then, rollout strategies are applied, which can be combined with the heuristic graph search algorithms, in a computationally more efficient manner than the optimal strategies, to obtain solutions superior to those using the greedy heuristic algorithms. The proposed rollout-based test points selection algorithm is illustrated and tested using an analog circuit and a set of simulated integer-coded fault wise tables. Computa- tional results are shown, which suggest that the rollout strategy policies are significantly better than other strategies.
基金supported by National Natural Science Foundation of China under Grant No.60934002General Armament Department under Grant No.51317040102
文摘Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of traditional exhaustive is low. A tradeoff method between the high time complexity and low space complexity is proposed. At first, a new fault-pair table is constructed based on the integer-coded fault wise table. The fault-pair table consists of two columns： one column represents fault pair and the other represents test points set that can distinguish the corresponding faults. Then, the rows are arranged in ascending order according to the cardinality of corresponding test points set. Thirdly, test points in the top rows are selected one by one until all fault pair are isolated. During the test points selection process, the rows that contain selected test points are deleted and then the dimension of fault-pair table decreases gradually. The proposed test points selection algorithm is illustrated and tested using an integercoded fault wise table derived from a real analog circuit. Computational results suggest show policies are better than the exhaustive strategy.
基金funded by the Youth Project of National Natural Science Foundation of China(52002031)the General Project of Shaanxi Province Science and Technology Development Planned Project(2023-JC-YB-600)+1 种基金Postgraduate Education and Teaching Research University-Level Project of Central University Project(300103131033)the Transportation Research Project of Shaanxi Transport Department(23-108 K).
文摘Data Matrix(DM)codes have been widely used in industrial production.The reading of DM code usually includes positioning and decoding.Accurate positioning is a prerequisite for successful decoding.Traditional image processing methods have poor adaptability to pollution and complex backgrounds.Although deep learning-based methods can automatically extract features,the bounding boxes cannot entirely fit the contour of the code.Further image processing methods are required for precise positioning,which will reduce efficiency.Because of the above problems,a CenterNet-based DM code key point detection network is proposed,which can directly obtain the four key points of the DM code.Compared with the existing methods,the degree of fitness is higher,which is conducive to direct decoding.To further improve the positioning accuracy,an enhanced loss function is designed,including DM code key point heatmap loss,standard DM code projection loss,and polygon Intersection-over-Union(IoU)loss,which is beneficial for the network to learn the spatial geometric characteristics of DM code.The experiment is carried out on the self-made DM code key point detection dataset,including pollution,complex background,small objects,etc.,which uses the Average Precision(AP)of the common object detection metric as the evaluation metric.AP reaches 95.80%,and Frames Per Second(FPS)gets 88.12 on the test set of the proposed dataset,which can achieve real-time performance in practical applications.
基金The National Natural Science Foundation of China(No50475041)
文摘Based on the coded and non-coded targets, the targets are extracted from the images according to their size, shape and intensity etc., and thus an improved method to identify the unique identity（D） of every coded target is put forward and the non-coded and coded targets are classified. Moreover, the gray scale centroid algorithm is applied to obtain the subpixel location of both uncoded and coded targets. The initial matching of the uncoded target correspondences between an image pair is established according to similarity and compatibility, which are based on the ID correspondences of the coded targets. The outliers in the initial matching of the uncoded target are eliminated according to three rules to finally obtain the uncoded target correspondences. Practical examples show that the algorithm is rapid, robust and is of high precision and matching ratio.
文摘A novel diagrammtic method is proposed to show the angular distribution of bases of human protein sequences. Using this method, the distribution sphere[1-4] is divided into four regions with same volume. The picture is clearer and more intuitive than that in [1] .A rule on the angular distribution of the representative points of bases of protein sequences is given. Besides, in 300 representative pointS of human protein sequence samples we find that there are three (not only one) points outside the sphere.
文摘Contamination of food may occur at any point during the food distribution channel. However, mishandling of food at the last segment of food distribution where food is prepared for consumption often causes outbreaks. Keeping food safe in hospitals is particularly imperative because of the population they serve and the potentially hazardous environment. This article presents the results of a pencil and paper self-reported survey on the knowledge of Mexican food code, NOM-093-SSA1-1994, and field observation of the compliance of the code among the hospital foodservice employees in Guadalajara, México. One hundred twenty-seven employees from six public and private hospitals participated in the study. Of the respondents, 81.5% were aware of the importance of personal hygiene in food safety. Professional attire including hair restraints and mouth cover were always used. These participants, however seldom used thermometers, and only 37% of respondents knew the correct temperatures for refrigeration. In most hospitals correct procedures for sanitizing food contact surfaces that were prescribed by the sanitizing chemical manufacturers were practiced. Only 25% of the participants knew that their work was defined by the food code. Strategies for dissemination of the food code, and food safety training of the employees are urgently needed. Commitment and support of the hospital are needed in order to improve safe food handling practices in these hospitals.
文摘Point cloud compression is critical to deploy 3D representation of the physical world such as 3D immersive telepresence,autonomous driving,and cultural heritage preservation.However,point cloud data are distributed irregularly and discontinuously in spatial and temporal domains,where redundant unoccupied voxels and weak correlations in 3D space make achieving efficient compression a challenging problem.In this paper,we propose a spatio-temporal context-guided algorithm for lossless point cloud geometry compression.The proposed scheme starts with dividing the point cloud into sliced layers of unit thickness along the longest axis.Then,it introduces a prediction method where both intraframe and inter-frame point clouds are available,by determining correspondences between adjacent layers and estimating the shortest path using the travelling salesman algorithm.Finally,the few prediction residual is efficiently compressed with optimal context-guided and adaptive fastmode arithmetic coding techniques.Experiments prove that the proposed method can effectively achieve low bit rate lossless compression of point cloud geometric information,and is suitable for 3D point cloud compression applicable to various types of scenes.
