To minimize the number of solutions in 3D resistivity inversion, an inherent problem in inversion, the amount of data considered have to be large and prior constraints need to be applied. Geological and geophysical da...To minimize the number of solutions in 3D resistivity inversion, an inherent problem in inversion, the amount of data considered have to be large and prior constraints need to be applied. Geological and geophysical data regarding the extent of a geological anomaly are important prior information. We propose the use of shape constraints in 3D electrical resistivity inversion, Three weighted orthogonal vectors (a normal and two tangent vectors) were used to control the resistivity differences at the boundaries of the anomaly. The spatial shape of the anomaly and the constraints on the boundaries of the anomaly are thus established. We incorporated the spatial shape constraints in the objective function of the 3D resistivity inversion and constructed the 3D resistivity inversion equation with spatial shape constraints. Subsequently, we used numerical modeling based on prior spatial shape data to constrain the direction vectors and weights of the 3D resistivity inversion. We established a reasonable range between the direction vectors and weights, and verified the feasibility and effectiveness of using spatial shape prior constraints in reducing excessive structures and the number of solutions. We applied the prior spatially shape-constrained inversion method to locate the aquifer at the Guangzhou subway. The spatial shape constraints were taken from ground penetrating radar data. The inversion results for the location and shape of the aquifer agree well with drilling data, and the number of inversion solutions is significantly reduced.展开更多
Non-negative matrix factorization (NMF) is a popular feature encoding method for image understanding due to its non-negative properties in representation, but the learnt basis images are not always local due to the ...Non-negative matrix factorization (NMF) is a popular feature encoding method for image understanding due to its non-negative properties in representation, but the learnt basis images are not always local due to the lack of explicit constraints in its objective. Various algebraic or geometric local constraints are hence proposed to shape the behaviour of the original NMF. Such constraints are usually rigid in the sense that they have to be specified beforehand instead of learning from the data. In this paper, we propose a flexible spatial constraint method for NMF learning based on factor analysis. Particularly, to learn the local spatial structure of the images, we apply a series of transformations such as orthogonal rotation and thresholding to the factor loading matrix obtained through factor analysis. Then we map the transformed loading matrix into a Laplacian matrix and incorporate this into a max-margin non-negative matrix factorization framework as a penalty term, aiming to learn a representation space which is non-negative, discriminative and localstructure-preserving. We verify the feasibility and effectiveness of the proposed method on several real world datasets with encouraging results.展开更多
This paper presents one novel spatial geometric constraints histogram descriptors (SGCHD) based on curvature mesh graph for automatic three-dimensional (3D) pollen particles recognition. In order to reduce high di...This paper presents one novel spatial geometric constraints histogram descriptors (SGCHD) based on curvature mesh graph for automatic three-dimensional (3D) pollen particles recognition. In order to reduce high dimensionality and noise disturbance arising from the abnormal record approach under microscopy, the separated surface curvature voxels are ex- tracted as primitive features to represent the original 3D pollen particles, which can also greatly reduce the computation time for later feature extraction process. Due to the good invariance to pollen rotation and scaling transformation, the spatial geometric constraints vectors are calculated to describe the spatial position correlations of the curvature voxels on the 3D curvature mesh graph. For exact similarity evaluation purpose, the bidirectional histogram algorithm is applied to the spatial geometric constraints vectors to obtain the statistical histogram descriptors with fixed dimensionality, which is invariant to the number and the starting position of the curvature voxels. Our experimental results compared with the traditional methods validate the argument that the presented descriptors are invariant to different pollen particles geometric transformations (such as posing change and spatial rotation), and high recognition precision and speed can be obtained simultaneously.展开更多
Since its inception,the Internet has been rapidly evolving.With the advancement of science and technology and the explosive growth of the population,the demand for the Internet has been on the rise.Many applications i...Since its inception,the Internet has been rapidly evolving.With the advancement of science and technology and the explosive growth of the population,the demand for the Internet has been on the rise.Many applications in education,healthcare,entertainment,science,and more are being increasingly deployed based on the internet.Concurrently,malicious threats on the internet are on the rise as well.Distributed Denial of Service(DDoS)attacks are among the most common and dangerous threats on the internet today.The scale and complexity of DDoS attacks are constantly growing.Intrusion Detection Systems(IDS)have been deployed and have demonstrated their effectiveness in defense against those threats.In addition,the research of Machine Learning(ML)and Deep Learning(DL)in IDS has gained effective results and significant attention.However,one of the challenges when applying ML and DL techniques in intrusion detection is the identification of unknown attacks.These attacks,which are not encountered during the system’s training,can lead to misclassification with significant errors.In this research,we focused on addressing the issue of Unknown Attack Detection,combining two methods:Spatial Location Constraint Prototype Loss(SLCPL)and Fuzzy C-Means(FCM).With the proposed method,we achieved promising results compared to traditional methods.The proposed method demonstrates a very high accuracy of up to 99.8%with a low false positive rate for known attacks on the Intrusion Detection Evaluation Dataset(CICIDS2017)dataset.Particularly,the accuracy is also very high,reaching 99.7%,and the precision goes up to 99.9%for unknown DDoS attacks on the DDoS Evaluation Dataset(CICDDoS2019)dataset.The success of the proposed method is due to the combination of SLCPL,an advanced Open-Set Recognition(OSR)technique,and FCM,a traditional yet highly applicable clustering technique.This has yielded a novel method in the field of unknown attack detection.This further expands the trend of applying DL and ML techniques in the development of intrusion detection systems and cybersecurity.Finally,implementing the proposed method in real-world systems can enhance the security capabilities against increasingly complex threats on computer networks.展开更多
The dynamic parameters of multiple projectiles that are fired using multi-barrel weapons in highfrequency continuous firing modes are important indicators to measure the performance of these weapons.The characteristic...The dynamic parameters of multiple projectiles that are fired using multi-barrel weapons in highfrequency continuous firing modes are important indicators to measure the performance of these weapons.The characteristics of multiple projectiles are high randomness and large numbers launched in a short period of time,making it very difficult to obtain the real dispersion parameters of the projectiles due to the occlusion or coincidence of multiple projectiles.Using six intersecting-screen testing system,in this paper,we propose an association recognition and matching algorithm of multiple projectiles using a temporal and spatial information constraint mechanism.We extract the output signal from each detection screen and then use the wavelet transform to process the output signal.We present a method to identify and extract the time values on which the projectiles pass through the detection screens using the wavelet transform modulus maximum theory.We then use the correlation of the output signals of three parallel detection screens to establish a correlation coefficient recognition constraint function for the multiple projectiles.Based on the premise of linear projectile motion,we establish a temporal and spatial constraint matching model using the projectile’s position coordinates in each detection screen and the projectile’s time constraints within the multiple intersecting-screen geometry.We then determine the time values of the multiple projectiles in each detection screen using an iterative search cycle registration,and finally obtain the flight parameters for the multiple projectiles in the presence of uncertainty.The proposed method and algorithm were verified experimentally and can solve the problem of uncertainty in projectiles flight parameter under different multiple projectile firing states.展开更多
Regularly checking the quantity of stored grain in warehouses is essential for the grain safety of a country.However,current manual inspection ways fail to get real-time measurement results and require spending a lot ...Regularly checking the quantity of stored grain in warehouses is essential for the grain safety of a country.However,current manual inspection ways fail to get real-time measurement results and require spending a lot of manpower and resources.In this paper,we proposed a computer vision-based method to automatically monitor the change in grain quantity of a granary.The proposed method was motivated from the observation that warehouse managers can use a camera to remotely monitor the grain security of a granary,which determines whether grain quantity is reduced by checking the distance between the grain surface and the grain loading line at the outlet of a granary.To this end,images were first captured by a camera,and a two-level spatial constraints-based SVM classifier was learned to detect the grain surface and the grain loading line of the images.During the test phase,the detected result of a test image obtained by SVM was further refined by Grab Cut with higher order potentials to get the more accurate segmentation result.Finally,the area between the grain surface and the grain loading line was calculated,and then compared with the previous measured one to determine whether the grain surface had dropped.The experiment results validate the effectiveness of the two-level spatial constraints SVM and the strategy for monitoring the change in grain quantity.展开更多
We present a lightweight and efficient semisupervised video object segmentation network based on the space-time memory framework.To some extent,our method solves the two difficulties encountered in traditional video o...We present a lightweight and efficient semisupervised video object segmentation network based on the space-time memory framework.To some extent,our method solves the two difficulties encountered in traditional video object segmentation:one is that the single frame calculation time is too long,and the other is that the current frame’s segmentation should use more information from past frames.The algorithm uses a global context(GC)module to achieve highperformance,real-time segmentation.The GC module can effectively integrate multi-frame image information without increased memory and can process each frame in real time.Moreover,the prediction mask of the previous frame is helpful for the segmentation of the current frame,so we input it into a spatial constraint module(SCM),which constrains the areas of segments in the current frame.The SCM effectively alleviates mismatching of similar targets yet consumes few additional resources.We added a refinement module to the decoder to improve boundary segmentation.Our model achieves state-of-the-art results on various datasets,scoring 80.1%on YouTube-VOS 2018 and a J&F score of 78.0%on DAVIS 2017,while taking 0.05 s per frame on the DAVIS 2016 validation dataset.展开更多
基金supported by the National Program on Key Basic Research Project of China(973 Program)(No.2013CB036002,No.2014CB046901)the National Major Scientific Equipment Developed Special Project(No.51327802)+3 种基金National Natural Science Foundation of China(No.51139004,No.41102183)the Research Fund for the Doctoral Program of Higher Education of China(No.20110131120070)Natural Science Foundation of Shandong Province(No.ZR2011EEQ013)the Graduate Innovation Fund of Shandong University(No.YZC12083)
文摘To minimize the number of solutions in 3D resistivity inversion, an inherent problem in inversion, the amount of data considered have to be large and prior constraints need to be applied. Geological and geophysical data regarding the extent of a geological anomaly are important prior information. We propose the use of shape constraints in 3D electrical resistivity inversion, Three weighted orthogonal vectors (a normal and two tangent vectors) were used to control the resistivity differences at the boundaries of the anomaly. The spatial shape of the anomaly and the constraints on the boundaries of the anomaly are thus established. We incorporated the spatial shape constraints in the objective function of the 3D resistivity inversion and constructed the 3D resistivity inversion equation with spatial shape constraints. Subsequently, we used numerical modeling based on prior spatial shape data to constrain the direction vectors and weights of the 3D resistivity inversion. We established a reasonable range between the direction vectors and weights, and verified the feasibility and effectiveness of using spatial shape prior constraints in reducing excessive structures and the number of solutions. We applied the prior spatially shape-constrained inversion method to locate the aquifer at the Guangzhou subway. The spatial shape constraints were taken from ground penetrating radar data. The inversion results for the location and shape of the aquifer agree well with drilling data, and the number of inversion solutions is significantly reduced.
文摘Non-negative matrix factorization (NMF) is a popular feature encoding method for image understanding due to its non-negative properties in representation, but the learnt basis images are not always local due to the lack of explicit constraints in its objective. Various algebraic or geometric local constraints are hence proposed to shape the behaviour of the original NMF. Such constraints are usually rigid in the sense that they have to be specified beforehand instead of learning from the data. In this paper, we propose a flexible spatial constraint method for NMF learning based on factor analysis. Particularly, to learn the local spatial structure of the images, we apply a series of transformations such as orthogonal rotation and thresholding to the factor loading matrix obtained through factor analysis. Then we map the transformed loading matrix into a Laplacian matrix and incorporate this into a max-margin non-negative matrix factorization framework as a penalty term, aiming to learn a representation space which is non-negative, discriminative and localstructure-preserving. We verify the feasibility and effectiveness of the proposed method on several real world datasets with encouraging results.
基金supported by the National Natural Science Foundation of China(Grant No.61375030)the Natural Science Foundation of Jiangsu Province,China(Grant No.BK20090149)the Natural Science Foundation of Higher Education Institutions of Jiangsu Province,China(Grant No.08KJD520019)
文摘This paper presents one novel spatial geometric constraints histogram descriptors (SGCHD) based on curvature mesh graph for automatic three-dimensional (3D) pollen particles recognition. In order to reduce high dimensionality and noise disturbance arising from the abnormal record approach under microscopy, the separated surface curvature voxels are ex- tracted as primitive features to represent the original 3D pollen particles, which can also greatly reduce the computation time for later feature extraction process. Due to the good invariance to pollen rotation and scaling transformation, the spatial geometric constraints vectors are calculated to describe the spatial position correlations of the curvature voxels on the 3D curvature mesh graph. For exact similarity evaluation purpose, the bidirectional histogram algorithm is applied to the spatial geometric constraints vectors to obtain the statistical histogram descriptors with fixed dimensionality, which is invariant to the number and the starting position of the curvature voxels. Our experimental results compared with the traditional methods validate the argument that the presented descriptors are invariant to different pollen particles geometric transformations (such as posing change and spatial rotation), and high recognition precision and speed can be obtained simultaneously.
基金This research was partly supported by the National Science and Technology Council,Taiwan with Grant Numbers 112-2221-E-992-045,112-2221-E-992-057-MY3 and 112-2622-8-992-009-TD1.
文摘Since its inception,the Internet has been rapidly evolving.With the advancement of science and technology and the explosive growth of the population,the demand for the Internet has been on the rise.Many applications in education,healthcare,entertainment,science,and more are being increasingly deployed based on the internet.Concurrently,malicious threats on the internet are on the rise as well.Distributed Denial of Service(DDoS)attacks are among the most common and dangerous threats on the internet today.The scale and complexity of DDoS attacks are constantly growing.Intrusion Detection Systems(IDS)have been deployed and have demonstrated their effectiveness in defense against those threats.In addition,the research of Machine Learning(ML)and Deep Learning(DL)in IDS has gained effective results and significant attention.However,one of the challenges when applying ML and DL techniques in intrusion detection is the identification of unknown attacks.These attacks,which are not encountered during the system’s training,can lead to misclassification with significant errors.In this research,we focused on addressing the issue of Unknown Attack Detection,combining two methods:Spatial Location Constraint Prototype Loss(SLCPL)and Fuzzy C-Means(FCM).With the proposed method,we achieved promising results compared to traditional methods.The proposed method demonstrates a very high accuracy of up to 99.8%with a low false positive rate for known attacks on the Intrusion Detection Evaluation Dataset(CICIDS2017)dataset.Particularly,the accuracy is also very high,reaching 99.7%,and the precision goes up to 99.9%for unknown DDoS attacks on the DDoS Evaluation Dataset(CICDDoS2019)dataset.The success of the proposed method is due to the combination of SLCPL,an advanced Open-Set Recognition(OSR)technique,and FCM,a traditional yet highly applicable clustering technique.This has yielded a novel method in the field of unknown attack detection.This further expands the trend of applying DL and ML techniques in the development of intrusion detection systems and cybersecurity.Finally,implementing the proposed method in real-world systems can enhance the security capabilities against increasingly complex threats on computer networks.
基金been supported by Project of the National Natural Science Foundation of China(No.62073256)the Shaanxi Provincial Science and Technology Department(No.2020GY-125)Xi’an Science and Technology Innovation talent service enterprise project(No.2020KJRC0041)。
文摘The dynamic parameters of multiple projectiles that are fired using multi-barrel weapons in highfrequency continuous firing modes are important indicators to measure the performance of these weapons.The characteristics of multiple projectiles are high randomness and large numbers launched in a short period of time,making it very difficult to obtain the real dispersion parameters of the projectiles due to the occlusion or coincidence of multiple projectiles.Using six intersecting-screen testing system,in this paper,we propose an association recognition and matching algorithm of multiple projectiles using a temporal and spatial information constraint mechanism.We extract the output signal from each detection screen and then use the wavelet transform to process the output signal.We present a method to identify and extract the time values on which the projectiles pass through the detection screens using the wavelet transform modulus maximum theory.We then use the correlation of the output signals of three parallel detection screens to establish a correlation coefficient recognition constraint function for the multiple projectiles.Based on the premise of linear projectile motion,we establish a temporal and spatial constraint matching model using the projectile’s position coordinates in each detection screen and the projectile’s time constraints within the multiple intersecting-screen geometry.We then determine the time values of the multiple projectiles in each detection screen using an iterative search cycle registration,and finally obtain the flight parameters for the multiple projectiles in the presence of uncertainty.The proposed method and algorithm were verified experimentally and can solve the problem of uncertainty in projectiles flight parameter under different multiple projectile firing states.
基金supported by Natural Science Project of Henan Science and Technology Department(Grant 162102210189,132102210494)Special Fund for Basic Scientific Research of Henan University of Technology(Grant 2016QNJH25)+1 种基金High-level Personnel Fund of Henan Province(Grant 21476062,31401918)Open fund of Key Laboratory of Grain Information Processing and Control(Grant KFJJ-2018-101)。
文摘Regularly checking the quantity of stored grain in warehouses is essential for the grain safety of a country.However,current manual inspection ways fail to get real-time measurement results and require spending a lot of manpower and resources.In this paper,we proposed a computer vision-based method to automatically monitor the change in grain quantity of a granary.The proposed method was motivated from the observation that warehouse managers can use a camera to remotely monitor the grain security of a granary,which determines whether grain quantity is reduced by checking the distance between the grain surface and the grain loading line at the outlet of a granary.To this end,images were first captured by a camera,and a two-level spatial constraints-based SVM classifier was learned to detect the grain surface and the grain loading line of the images.During the test phase,the detected result of a test image obtained by SVM was further refined by Grab Cut with higher order potentials to get the more accurate segmentation result.Finally,the area between the grain surface and the grain loading line was calculated,and then compared with the previous measured one to determine whether the grain surface had dropped.The experiment results validate the effectiveness of the two-level spatial constraints SVM and the strategy for monitoring the change in grain quantity.
基金partially supported by the National Natural Science Foundation of China(Grant Nos.61802197,62072449,and 61632003)the Science and Technology Development Fund,Macao SAR(Grant Nos.0018/2019/AKP and SKL-IOTSC(UM)-2021-2023)+1 种基金the Guangdong Science and Technology Department(Grant No.2020B1515130001)University of Macao(Grant Nos.MYRG2020-00253-FST and MYRG2022-00059-FST).
文摘We present a lightweight and efficient semisupervised video object segmentation network based on the space-time memory framework.To some extent,our method solves the two difficulties encountered in traditional video object segmentation:one is that the single frame calculation time is too long,and the other is that the current frame’s segmentation should use more information from past frames.The algorithm uses a global context(GC)module to achieve highperformance,real-time segmentation.The GC module can effectively integrate multi-frame image information without increased memory and can process each frame in real time.Moreover,the prediction mask of the previous frame is helpful for the segmentation of the current frame,so we input it into a spatial constraint module(SCM),which constrains the areas of segments in the current frame.The SCM effectively alleviates mismatching of similar targets yet consumes few additional resources.We added a refinement module to the decoder to improve boundary segmentation.Our model achieves state-of-the-art results on various datasets,scoring 80.1%on YouTube-VOS 2018 and a J&F score of 78.0%on DAVIS 2017,while taking 0.05 s per frame on the DAVIS 2016 validation dataset.