This study investigates how artificial intelligence(AI)algorithms enable mainstream media to achieve precise emotional matching and improve communication efficiency through reconstructed communication logic.As digital...This study investigates how artificial intelligence(AI)algorithms enable mainstream media to achieve precise emotional matching and improve communication efficiency through reconstructed communication logic.As digital intelligence technology rapidly evolves,mainstream media organizations are increasingly leveraging AI-driven empathy algorithms to enhance audience engagement and optimize content delivery.This research employs a mixed-methods approach,combining quantitative analysis of algorithmic performance metrics with qualitative examination of media communication patterns.Through systematic review of 150 academic papers and analysis of data from 12 major media platforms,this study reveals that algorithmic empathy systems can improve emotional resonance by 34.7%and increase audience engagement by 28.3%compared to traditional communication methods.The findings demonstrate that AI algorithms reconstruct media communication logic through three primary pathways:emotional pattern recognition,personalized content curation,and real-time sentiment adaptation.However,the study also identifies significant challenges including algorithmic bias,emotional authenticity concerns,and ethical implications of automated empathy.The research contributes to understanding how mainstream media can leverage AI technology to build high-quality empathetic communication while maintaining journalistic integrity and social responsibility.展开更多
Choosing appropriate background field data is crucial for gravity field matching navigation.Current research mainly uses gravity anomaly data or gravity gradient data as background fields.However,using gravity gradien...Choosing appropriate background field data is crucial for gravity field matching navigation.Current research mainly uses gravity anomaly data or gravity gradient data as background fields.However,using gravity gradient invariants in existing research is seldom a concern.The gravity gradient tensor has three invariants,named as I_(1),I_(2)and I_(3).I_(1) is a Laplace operator outside the Earth and a Poison operator inside the Earth.The focus of this study is to discuss the performance of the other two invariants of gravity gradients in matching navigation based on the Iterative Closest Contour Point(ICCP)algorithm and compare the matching results with that of the gravity gradient Tzz.The results show that they have almost the same performance when there is no noise,and the background data noises have a large impact on the matching results.There are differences in the anti-interference ability of observation noises for the different components.Under the same random noises in the observations,I2performs a little better than the other two components in terms of position error standard deviation.According to the investigations,since attitude errors can not be avoided and influence the positioning based on Tzz,we recommend adopting invariants of gravity gradients,especially I2,for matching navigation in actual cases.展开更多
The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained...The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained based on the chirp sub-bottom profiler data collected in the Chukchi Plateau area during the 11th Arctic Expedition of China.The time-domain adaptive search matching algorithm was used and validated on our established theoretical model.The misfit between the inversion result and the theoretical model is less than 0.067%.The grain size was calculated according to the empirical relationship between the acoustic impedance and the grain size of the sediment.The average acoustic impedance of sub-seafloor strata is 2.5026×10^(6) kg(s m^(2))^(-1)and the average grain size(θvalue)of the seafloor surface sediment is 7.1498,indicating the predominant occurrence of very fine silt sediment in the study area.Comparison of the inversion results and the laboratory measurements of nearby borehole samples shows that they are in general agreement.展开更多
Motivated by the business model called“community group buying”(CGB),which has emerged in China and some countries in Southeast Asia,such as Singapore and Indonesia,we develop algorithms that could help CGB platforms...Motivated by the business model called“community group buying”(CGB),which has emerged in China and some countries in Southeast Asia,such as Singapore and Indonesia,we develop algorithms that could help CGB platforms match consumers with stage-stations(the picking up center under the CGB mode).By altering the fundamental design of the existing hierarchy algorithms,improvements are achieved.It is proven that our method has a faster running speed and greater space efficiency.Our algorithms avoid traversal and compress the time complexities of matching a consumer with a stage-station and updating the storage information to O(logM)and O(MlogG),where M is the number of stage-stations and G is that of the platform’s stock-keeping units.Simulation comparisons of our algorithms with the current methods of CGB platforms show that our approaches can effectively reduce delivery costs.An interesting observation of the simula-tions is worthy of note:Increasing G may incur higher costs since it makes inventories more dispersed and delivery prob-lems more complicated.展开更多
In recent years,many visual positioning algorithms have been proposed based on computer vision and they have achieved good results.However,these algorithms have a single function,cannot perceive the environment,and ha...In recent years,many visual positioning algorithms have been proposed based on computer vision and they have achieved good results.However,these algorithms have a single function,cannot perceive the environment,and have poor versatility,and there is a certain mismatch phenomenon,which affects the positioning accuracy.Therefore,this paper proposes a location algorithm that combines a target recognition algorithm with a depth feature matching algorithm to solve the problem of unmanned aerial vehicle(UAV)environment perception and multi-modal image-matching fusion location.This algorithm was based on the single-shot object detector based on multi-level feature pyramid network(M2Det)algorithm and replaced the original visual geometry group(VGG)feature extraction network with the ResNet-101 network to improve the feature extraction capability of the network model.By introducing a depth feature matching algorithm,the algorithm shares neural network weights and realizes the design of UAV target recognition and a multi-modal image-matching fusion positioning algorithm.When the reference image and the real-time image were mismatched,the dynamic adaptive proportional constraint and the random sample consensus consistency algorithm(DAPC-RANSAC)were used to optimize the matching results to improve the correct matching efficiency of the target.Using the multi-modal registration data set,the proposed algorithm was compared and analyzed to verify its superiority and feasibility.The results show that the algorithm proposed in this paper can effectively deal with the matching between multi-modal images(visible image–infrared image,infrared image–satellite image,visible image–satellite image),and the contrast,scale,brightness,ambiguity deformation,and other changes had good stability and robustness.Finally,the effectiveness and practicability of the algorithm proposed in this paper were verified in an aerial test scene of an S1000 sixrotor UAV.展开更多
To improve the performance of the traditional map matching algorithms in freeway traffic state monitoring systems using the low logging frequency GPS （global positioning system） probe data, a map matching algorithm ...To improve the performance of the traditional map matching algorithms in freeway traffic state monitoring systems using the low logging frequency GPS （global positioning system） probe data, a map matching algorithm based on the Oracle spatial data model is proposed. The algorithm uses the Oracle road network data model to analyze the spatial relationships between massive GPS positioning points and freeway networks, builds an N-shortest path algorithm to find reasonable candidate routes between GPS positioning points efficiently, and uses the fuzzy logic inference system to determine the final matched traveling route. According to the implementation with field data from Los Angeles, the computation speed of the algorithm is about 135 GPS positioning points per second and the accuracy is 98.9%. The results demonstrate the effectiveness and accuracy of the proposed algorithm for mapping massive GPS positioning data onto freeway networks with complex geometric characteristics.展开更多
Multi-modal image matching is crucial in aerospace applications because it can fully exploit the complementary and valuable information contained in the amount and diversity of remote sensing images.However,it remains...Multi-modal image matching is crucial in aerospace applications because it can fully exploit the complementary and valuable information contained in the amount and diversity of remote sensing images.However,it remains a challenging task due to significant non-linear radiometric,geometric differences,and noise across different sensors.To improve the performance of heterologous image matching,this paper proposes a normalized self-similarity region descriptor to extract consistent structural information.We first construct the pointwise self-similarity region descriptor based on the Euclidean distance between adjacent image blocks to reflect the structural properties of multi-modal images.Then,a linear normalization approach is used to form Modality Independent Region Descriptor(MIRD),which can effectively distinguish structural features such as points,lines,corners,and flat between multi-modal images.To further improve the matching accuracy,the included angle cosine similarity metric is adopted to exploit the directional vector information of multi-dimensional feature descriptors.The experimental results show that the proposed MIRD has better matching accuracy and robustness for various multi-modal image matching than the state-of-the-art methods.MIRD can effectively extract consistent geometric structure features and suppress the influence of SAR speckle noise using non-local neighboring image blocks operation,effectively applied to various multi-modal image matching.展开更多
A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low freq...A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.展开更多
A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algo...A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algorithm to common image deformations; however, if there are similar regions in images, SIFT algorithm still generates some analogical descriptors and provides many mismatches. This paper examines the local image descriptor used by SIFT and presents a new algorithm by integrating SIFT with two-dimensional moment invariants and disparity gradient to improve the matching results. In the new algorithm, decision tree is used, and the whole matching process is divided into three levels with different primitives. Matching points are considered as correct ones only when they satisfy all the three similarity measurements. Experiment results demonstrate that the new approach is more reliable and accurate.展开更多
The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditiona...The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditional algorithms. The purpose of this paper is to develop a novel algorithm of packet matching based on improving differential evolutionary algorithm, which also combines with classic packets matching algorithms to improve the performance of algorithm. For the sake of objectivity, the statistics method was used to compute the fitting value. Experiments showed that this new algorithm effectively improved the performance in the speed and storage space, as compared with the traditional one. For the first time, evolutionary algorithm is used to solve the network data packet forwarding, and packets can be forwarded at the linear speed. In addition, this new algorithm is universal, so it can be adapted for many equipment.展开更多
An adaptive technique adopting quantum genetic algorithm （QGA） for antenna impedance tuning is presented. Three examples are given with different types of antenna impedance. The frequency range of the dual standards...An adaptive technique adopting quantum genetic algorithm （QGA） for antenna impedance tuning is presented. Three examples are given with different types of antenna impedance. The frequency range of the dual standards is from 1.7 to 2.2 GHz. Simulation results show that the proposed tuning technique can achieve good accuracy of impedance matching and load power. The reflection coefficient and VSWR obtained are also very close to their ideal values. Comparison of the proposed QGA tuning method with conventional genetic algorithm based tuning method is Moreover, the proposed method can be useful for software wireless bands. also given, which shows that the QGA tuning algorithm is much faster. defined radio systems using a single antenna for multiple mobile and展开更多
Due to requirements and necessities in digital image research, image matching is considered as a key, essential and complicating point especially for machine learning. According to its convenience and facility, the mo...Due to requirements and necessities in digital image research, image matching is considered as a key, essential and complicating point especially for machine learning. According to its convenience and facility, the most applied algorithm for image feature point extraction and matching is Speeded-Up Robust Feature (SURF). The enhancement for scale invariant feature transform (SIFT) algorithm promotes the effectiveness of the algorithm as well as facilitates the possibility, while the application of the algorithm is being applied in a present time computer vision system. In this research work, the aim of SURF algorithm is to extract image features, and we have incorporated RANSAC algorithm to filter matching points. The images were juxtaposed and asserted experiments utilizing pertinent image improvement methods. The idea based on merging improvement technology through SURF algorithm is put forward to get better quality of feature points matching the efficiency and appropriate image improvement methods are adopted for different feature images which are compared and verified by experiments. Some results have been explained there which are the effects of lighting on the underexposed and overexposed images.展开更多
The rapid identification of planting patterns for major crops in a large irrigated district has vital importance for irrigation management,water fee collection,and crop yield estimation.In this study,the OTSU algorith...The rapid identification of planting patterns for major crops in a large irrigated district has vital importance for irrigation management,water fee collection,and crop yield estimation.In this study,the OTSU algorithm and Mean-Shift algorithm were employed to automatically determine threshold values for mapping two main rotated crop patterns at the pixel scale.A time series analysis was conducted to extract the spatial distribution of rice-wheat and wheat-maize rotations in the Chuanhang irrigation district from 2016 to 2020.The results demonstrate that both threshold segmentation algorithms are reliable in extracting the spatial distribution of the crops,with an overall accuracy exceeding 80%.Additionally,both Kappa coefficients surpass 0.7,indicating better performance by OTSU method.Over the period from 2016 to 2020,the area occupied by rice-wheat rotation cropping ranged from 12500 to 14400 hm 2;whereas wheat-maize rotation cropping exhibited smaller and more variable areas ranging from 19730 to 34070 hm 2.These findings highlight how remote sensing-based approaches can provide reliable support for rapidly and accurately identifying the spatial distribution of main crop rotation patterns within a large irrigation district.展开更多
A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. F...A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.展开更多
The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decis...The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decision diagram (ADD) or variants thereof provides canonical forms to represent and manipulate Boolean functions and pseudo-Boolean functions efficiently. ADD and OBDD-based symbolic algorithms give improved results for large-scale combinatorial optimization problems by searching nodes and edges implicitly. We present novel symbolic ADD formulation and algorithm for maximum weighted matching in bipartite graphs. The symbolic algorithm implements the Hungarian algorithm in the context of ADD and OBDD formulation and manipulations. It begins by setting feasible labelings of nodes and then iterates through a sequence of phases. Each phase is divided into two stages. The first stage is building equality bipartite graphs, and the second one is finding maximum cardinality matching in equality bipartite graph. The second stage iterates through the following steps: greedily searching initial matching, building layered network, backward traversing node-disjoint augmenting paths, updating cardinality matching and building residual network. The symbolic algorithm does not require explicit enumeration of the nodes and edges, and therefore can handle many complex executions in each step. Simulation experiments indicate that symbolic algorithm is competitive with traditional algorithms.展开更多
A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The f...A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.展开更多
E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking d...E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.展开更多
A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer...A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer transaction database consisting of customer_id, transaction time, and transaction items demonstrate that the proposed algorithm performs better than SPADE attributed to its philosophy to generate a candidate set by matching two sequences in the middle place so as to reduce the number of the candidate sets.展开更多
The paper analyze and improve the SIFT optimized algorithm, and proposes an image matching method for SIFT algorithm based on quasi Euclidean distance and KD-tree. Experiments show that this algorithm has matching mor...The paper analyze and improve the SIFT optimized algorithm, and proposes an image matching method for SIFT algorithm based on quasi Euclidean distance and KD-tree. Experiments show that this algorithm has matching more points, high matching accuracy, no repealed points and higher advantage of matching efficiency based on keeping the basic characteristics of SIFT algorithm unchanged, and provides precise matching point to generate precise image stitching and other related fields of the follow-up product. At the same time, this method was applied to the layout optimization and achieved good results.展开更多
This paper presents an efficient pattern matching algorithm (FSW). FSW improves the searching process for a pattern in a text. It scans the text with the help of four sliding windows. The windows are equal to the leng...This paper presents an efficient pattern matching algorithm (FSW). FSW improves the searching process for a pattern in a text. It scans the text with the help of four sliding windows. The windows are equal to the length of the pattern, allowing multiple alignments in the searching process. The text is divided into two parts;each part is scanned from both sides simultaneously using two sliding windows. The four windows slide in parallel in both parts of the text. The comparisons done between the text and the pattern are done from both of the pattern sides in parallel. The conducted experiments show that FSW achieves the best overall results in the number of attempts and the number of character comparisons compared to the pattern matching algorithms: Two Sliding Windows (TSW), Enhanced Two Sliding Windows algorithm (ETSW) and Berry-Ravindran algorithm (BR). The best time case is calculated and found to be??while the average case time complexity is??.展开更多
文摘This study investigates how artificial intelligence(AI)algorithms enable mainstream media to achieve precise emotional matching and improve communication efficiency through reconstructed communication logic.As digital intelligence technology rapidly evolves,mainstream media organizations are increasingly leveraging AI-driven empathy algorithms to enhance audience engagement and optimize content delivery.This research employs a mixed-methods approach,combining quantitative analysis of algorithmic performance metrics with qualitative examination of media communication patterns.Through systematic review of 150 academic papers and analysis of data from 12 major media platforms,this study reveals that algorithmic empathy systems can improve emotional resonance by 34.7%and increase audience engagement by 28.3%compared to traditional communication methods.The findings demonstrate that AI algorithms reconstruct media communication logic through three primary pathways:emotional pattern recognition,personalized content curation,and real-time sentiment adaptation.However,the study also identifies significant challenges including algorithmic bias,emotional authenticity concerns,and ethical implications of automated empathy.The research contributes to understanding how mainstream media can leverage AI technology to build high-quality empathetic communication while maintaining journalistic integrity and social responsibility.
基金funded by the Key Laboratory of Smart Earth(No.KF2023YB01-12)the National Natural Science Foundation of China(No.42074017)+1 种基金the Key Laboratory Fund Project for Simulation of Complex Electronic Systems(614201004022210)the Chinese Academy of Sciences Youth Innovation Promotion Association(2022126)。
文摘Choosing appropriate background field data is crucial for gravity field matching navigation.Current research mainly uses gravity anomaly data or gravity gradient data as background fields.However,using gravity gradient invariants in existing research is seldom a concern.The gravity gradient tensor has three invariants,named as I_(1),I_(2)and I_(3).I_(1) is a Laplace operator outside the Earth and a Poison operator inside the Earth.The focus of this study is to discuss the performance of the other two invariants of gravity gradients in matching navigation based on the Iterative Closest Contour Point(ICCP)algorithm and compare the matching results with that of the gravity gradient Tzz.The results show that they have almost the same performance when there is no noise,and the background data noises have a large impact on the matching results.There are differences in the anti-interference ability of observation noises for the different components.Under the same random noises in the observations,I2performs a little better than the other two components in terms of position error standard deviation.According to the investigations,since attitude errors can not be avoided and influence the positioning based on Tzz,we recommend adopting invariants of gravity gradients,especially I2,for matching navigation in actual cases.
基金supported by the National Key R&D Program of China (No.2021YFC2801202)the National Natural Science Foundation of China (No.42076224)the Fundamental Research Funds for the Central Universities (No.202262012)。
文摘The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained based on the chirp sub-bottom profiler data collected in the Chukchi Plateau area during the 11th Arctic Expedition of China.The time-domain adaptive search matching algorithm was used and validated on our established theoretical model.The misfit between the inversion result and the theoretical model is less than 0.067%.The grain size was calculated according to the empirical relationship between the acoustic impedance and the grain size of the sediment.The average acoustic impedance of sub-seafloor strata is 2.5026×10^(6) kg(s m^(2))^(-1)and the average grain size(θvalue)of the seafloor surface sediment is 7.1498,indicating the predominant occurrence of very fine silt sediment in the study area.Comparison of the inversion results and the laboratory measurements of nearby borehole samples shows that they are in general agreement.
基金supported by the National Natural Science Foundation of China(71991464,71921001)Fundamental Research Funds for the Central Universities,General Program(WK2040000053)Key Program(YD2040002027)。
文摘Motivated by the business model called“community group buying”(CGB),which has emerged in China and some countries in Southeast Asia,such as Singapore and Indonesia,we develop algorithms that could help CGB platforms match consumers with stage-stations(the picking up center under the CGB mode).By altering the fundamental design of the existing hierarchy algorithms,improvements are achieved.It is proven that our method has a faster running speed and greater space efficiency.Our algorithms avoid traversal and compress the time complexities of matching a consumer with a stage-station and updating the storage information to O(logM)and O(MlogG),where M is the number of stage-stations and G is that of the platform’s stock-keeping units.Simulation comparisons of our algorithms with the current methods of CGB platforms show that our approaches can effectively reduce delivery costs.An interesting observation of the simula-tions is worthy of note:Increasing G may incur higher costs since it makes inventories more dispersed and delivery prob-lems more complicated.
基金supported in part by the National Natural Science Foundation of China under Grant 62276274in part by the Natural Science Foundation of Shaanxi Province under Grant 2020JM-537,and in part by the Aeronautical Science Fund under Grant 201851U8012(corresponding author:Xiaogang Yang).
文摘In recent years,many visual positioning algorithms have been proposed based on computer vision and they have achieved good results.However,these algorithms have a single function,cannot perceive the environment,and have poor versatility,and there is a certain mismatch phenomenon,which affects the positioning accuracy.Therefore,this paper proposes a location algorithm that combines a target recognition algorithm with a depth feature matching algorithm to solve the problem of unmanned aerial vehicle(UAV)environment perception and multi-modal image-matching fusion location.This algorithm was based on the single-shot object detector based on multi-level feature pyramid network(M2Det)algorithm and replaced the original visual geometry group(VGG)feature extraction network with the ResNet-101 network to improve the feature extraction capability of the network model.By introducing a depth feature matching algorithm,the algorithm shares neural network weights and realizes the design of UAV target recognition and a multi-modal image-matching fusion positioning algorithm.When the reference image and the real-time image were mismatched,the dynamic adaptive proportional constraint and the random sample consensus consistency algorithm(DAPC-RANSAC)were used to optimize the matching results to improve the correct matching efficiency of the target.Using the multi-modal registration data set,the proposed algorithm was compared and analyzed to verify its superiority and feasibility.The results show that the algorithm proposed in this paper can effectively deal with the matching between multi-modal images(visible image–infrared image,infrared image–satellite image,visible image–satellite image),and the contrast,scale,brightness,ambiguity deformation,and other changes had good stability and robustness.Finally,the effectiveness and practicability of the algorithm proposed in this paper were verified in an aerial test scene of an S1000 sixrotor UAV.
文摘To improve the performance of the traditional map matching algorithms in freeway traffic state monitoring systems using the low logging frequency GPS （global positioning system） probe data, a map matching algorithm based on the Oracle spatial data model is proposed. The algorithm uses the Oracle road network data model to analyze the spatial relationships between massive GPS positioning points and freeway networks, builds an N-shortest path algorithm to find reasonable candidate routes between GPS positioning points efficiently, and uses the fuzzy logic inference system to determine the final matched traveling route. According to the implementation with field data from Los Angeles, the computation speed of the algorithm is about 135 GPS positioning points per second and the accuracy is 98.9%. The results demonstrate the effectiveness and accuracy of the proposed algorithm for mapping massive GPS positioning data onto freeway networks with complex geometric characteristics.
基金supported by the National Natural Science Foundation of China,China(No.61801491)。
文摘Multi-modal image matching is crucial in aerospace applications because it can fully exploit the complementary and valuable information contained in the amount and diversity of remote sensing images.However,it remains a challenging task due to significant non-linear radiometric,geometric differences,and noise across different sensors.To improve the performance of heterologous image matching,this paper proposes a normalized self-similarity region descriptor to extract consistent structural information.We first construct the pointwise self-similarity region descriptor based on the Euclidean distance between adjacent image blocks to reflect the structural properties of multi-modal images.Then,a linear normalization approach is used to form Modality Independent Region Descriptor(MIRD),which can effectively distinguish structural features such as points,lines,corners,and flat between multi-modal images.To further improve the matching accuracy,the included angle cosine similarity metric is adopted to exploit the directional vector information of multi-dimensional feature descriptors.The experimental results show that the proposed MIRD has better matching accuracy and robustness for various multi-modal image matching than the state-of-the-art methods.MIRD can effectively extract consistent geometric structure features and suppress the influence of SAR speckle noise using non-local neighboring image blocks operation,effectively applied to various multi-modal image matching.
基金supported by the National Natural Science Foundation of China (6117212711071002)+1 种基金the Specialized Research Fund for the Doctoral Program of Higher Education (20113401110006)the Innovative Research Team of 211 Project in Anhui University (KJTD007A)
文摘A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.
文摘A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algorithm to common image deformations; however, if there are similar regions in images, SIFT algorithm still generates some analogical descriptors and provides many mismatches. This paper examines the local image descriptor used by SIFT and presents a new algorithm by integrating SIFT with two-dimensional moment invariants and disparity gradient to improve the matching results. In the new algorithm, decision tree is used, and the whole matching process is divided into three levels with different primitives. Matching points are considered as correct ones only when they satisfy all the three similarity measurements. Experiment results demonstrate that the new approach is more reliable and accurate.
基金Supported by the National Natural Science Foundation of China(61070008)the Humanities and Social Science Youth Fund of the Ministry of Education(11YJC870012)+2 种基金the Youth Fund of Jiangxi Province Department of Education(GJJ11106)the Natural Science Foundation of Colleges and Universities of Anhui Province Department of Education(KJ2010B096)the Industrial Research Projects of Nanchang Scienceand Technology Bureau,Jiangxi(07110076)
文摘The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditional algorithms. The purpose of this paper is to develop a novel algorithm of packet matching based on improving differential evolutionary algorithm, which also combines with classic packets matching algorithms to improve the performance of algorithm. For the sake of objectivity, the statistics method was used to compute the fitting value. Experiments showed that this new algorithm effectively improved the performance in the speed and storage space, as compared with the traditional one. For the first time, evolutionary algorithm is used to solve the network data packet forwarding, and packets can be forwarded at the linear speed. In addition, this new algorithm is universal, so it can be adapted for many equipment.
基金Projects(61102039, 51107034) supported by the National Natural Science Foundation of ChinaProject(2011FJ3080) supported by the Planned Science and Technology Project of Hunan Province ChinaProject supported by Fundamental Research Funds for the Central Universities, China
文摘An adaptive technique adopting quantum genetic algorithm （QGA） for antenna impedance tuning is presented. Three examples are given with different types of antenna impedance. The frequency range of the dual standards is from 1.7 to 2.2 GHz. Simulation results show that the proposed tuning technique can achieve good accuracy of impedance matching and load power. The reflection coefficient and VSWR obtained are also very close to their ideal values. Comparison of the proposed QGA tuning method with conventional genetic algorithm based tuning method is Moreover, the proposed method can be useful for software wireless bands. also given, which shows that the QGA tuning algorithm is much faster. defined radio systems using a single antenna for multiple mobile and
文摘Due to requirements and necessities in digital image research, image matching is considered as a key, essential and complicating point especially for machine learning. According to its convenience and facility, the most applied algorithm for image feature point extraction and matching is Speeded-Up Robust Feature (SURF). The enhancement for scale invariant feature transform (SIFT) algorithm promotes the effectiveness of the algorithm as well as facilitates the possibility, while the application of the algorithm is being applied in a present time computer vision system. In this research work, the aim of SURF algorithm is to extract image features, and we have incorporated RANSAC algorithm to filter matching points. The images were juxtaposed and asserted experiments utilizing pertinent image improvement methods. The idea based on merging improvement technology through SURF algorithm is put forward to get better quality of feature points matching the efficiency and appropriate image improvement methods are adopted for different feature images which are compared and verified by experiments. Some results have been explained there which are the effects of lighting on the underexposed and overexposed images.
基金Jiangsu Water Science and Technology Project(2021081)。
文摘The rapid identification of planting patterns for major crops in a large irrigated district has vital importance for irrigation management,water fee collection,and crop yield estimation.In this study,the OTSU algorithm and Mean-Shift algorithm were employed to automatically determine threshold values for mapping two main rotated crop patterns at the pixel scale.A time series analysis was conducted to extract the spatial distribution of rice-wheat and wheat-maize rotations in the Chuanhang irrigation district from 2016 to 2020.The results demonstrate that both threshold segmentation algorithms are reliable in extracting the spatial distribution of the crops,with an overall accuracy exceeding 80%.Additionally,both Kappa coefficients surpass 0.7,indicating better performance by OTSU method.Over the period from 2016 to 2020,the area occupied by rice-wheat rotation cropping ranged from 12500 to 14400 hm 2;whereas wheat-maize rotation cropping exhibited smaller and more variable areas ranging from 19730 to 34070 hm 2.These findings highlight how remote sensing-based approaches can provide reliable support for rapidly and accurately identifying the spatial distribution of main crop rotation patterns within a large irrigation district.
文摘A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.
文摘The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decision diagram (ADD) or variants thereof provides canonical forms to represent and manipulate Boolean functions and pseudo-Boolean functions efficiently. ADD and OBDD-based symbolic algorithms give improved results for large-scale combinatorial optimization problems by searching nodes and edges implicitly. We present novel symbolic ADD formulation and algorithm for maximum weighted matching in bipartite graphs. The symbolic algorithm implements the Hungarian algorithm in the context of ADD and OBDD formulation and manipulations. It begins by setting feasible labelings of nodes and then iterates through a sequence of phases. Each phase is divided into two stages. The first stage is building equality bipartite graphs, and the second one is finding maximum cardinality matching in equality bipartite graph. The second stage iterates through the following steps: greedily searching initial matching, building layered network, backward traversing node-disjoint augmenting paths, updating cardinality matching and building residual network. The symbolic algorithm does not require explicit enumeration of the nodes and edges, and therefore can handle many complex executions in each step. Simulation experiments indicate that symbolic algorithm is competitive with traditional algorithms.
基金supported by the National Natural Science Foundation of China(71171038)
文摘A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.
文摘E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.
文摘A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer transaction database consisting of customer_id, transaction time, and transaction items demonstrate that the proposed algorithm performs better than SPADE attributed to its philosophy to generate a candidate set by matching two sequences in the middle place so as to reduce the number of the candidate sets.
文摘The paper analyze and improve the SIFT optimized algorithm, and proposes an image matching method for SIFT algorithm based on quasi Euclidean distance and KD-tree. Experiments show that this algorithm has matching more points, high matching accuracy, no repealed points and higher advantage of matching efficiency based on keeping the basic characteristics of SIFT algorithm unchanged, and provides precise matching point to generate precise image stitching and other related fields of the follow-up product. At the same time, this method was applied to the layout optimization and achieved good results.
文摘This paper presents an efficient pattern matching algorithm (FSW). FSW improves the searching process for a pattern in a text. It scans the text with the help of four sliding windows. The windows are equal to the length of the pattern, allowing multiple alignments in the searching process. The text is divided into two parts;each part is scanned from both sides simultaneously using two sliding windows. The four windows slide in parallel in both parts of the text. The comparisons done between the text and the pattern are done from both of the pattern sides in parallel. The conducted experiments show that FSW achieves the best overall results in the number of attempts and the number of character comparisons compared to the pattern matching algorithms: Two Sliding Windows (TSW), Enhanced Two Sliding Windows algorithm (ETSW) and Berry-Ravindran algorithm (BR). The best time case is calculated and found to be??while the average case time complexity is??.
