Many efforts have been devoted to efficient task scheduling in Multi-Unmanned Aerial Vehicle(UAV)edge computing.However,the heterogeneity of UAV computation resource,and the task re-allocating between UAVs have not be...Many efforts have been devoted to efficient task scheduling in Multi-Unmanned Aerial Vehicle(UAV)edge computing.However,the heterogeneity of UAV computation resource,and the task re-allocating between UAVs have not been fully considered yet.Moreover,most existing works neglect the fact that a task can only be executed on the UAV equipped with its desired service function(SF).In this backdrop,this paper formulates the task scheduling problem as a multi-objective task scheduling problem,which aims at maximizing the task execution success ratio while minimizing the average weighted sum of all tasks’completion time and energy consumption.Optimizing three coupled goals in a realtime manner with the dynamic arrival of tasks hinders us from adopting existing methods,like machine learning-based solutions that require a long training time and tremendous pre-knowledge about the task arrival process,or heuristic-based ones that usually incur a long decision-making time.To tackle this problem in a distributed manner,we establish a matching theory framework,in which three conflicting goals are treated as the preferences of tasks,SFs and UAVs.Then,a Distributed Matching Theory-based Re-allocating(DiMaToRe)algorithm is put forward.We formally proved that a stable matching can be achieved by our proposal.Extensive simulation results show that Di Ma To Re algorithm outperforms benchmark algorithms under diverse parameter settings and has good robustness.展开更多
Road traffic monitoring is an imperative topic widely discussed among researchers.Systems used to monitor traffic frequently rely on cameras mounted on bridges or roadsides.However,aerial images provide the flexibilit...Road traffic monitoring is an imperative topic widely discussed among researchers.Systems used to monitor traffic frequently rely on cameras mounted on bridges or roadsides.However,aerial images provide the flexibility to use mobile platforms to detect the location and motion of the vehicle over a larger area.To this end,different models have shown the ability to recognize and track vehicles.However,these methods are not mature enough to produce accurate results in complex road scenes.Therefore,this paper presents an algorithm that combines state-of-the-art techniques for identifying and tracking vehicles in conjunction with image bursts.The extracted frames were converted to grayscale,followed by the application of a georeferencing algorithm to embed coordinate information into the images.The masking technique eliminated irrelevant data and reduced the computational cost of the overall monitoring system.Next,Sobel edge detection combined with Canny edge detection and Hough line transform has been applied for noise reduction.After preprocessing,the blob detection algorithm helped detect the vehicles.Vehicles of varying sizes have been detected by implementing a dynamic thresholding scheme.Detection was done on the first image of every burst.Then,to track vehicles,the model of each vehicle was made to find its matches in the succeeding images using the template matching algorithm.To further improve the tracking accuracy by incorporating motion information,Scale Invariant Feature Transform(SIFT)features have been used to find the best possible match among multiple matches.An accuracy rate of 87%for detection and 80%accuracy for tracking in the A1 Motorway Netherland dataset has been achieved.For the Vehicle Aerial Imaging from Drone(VAID)dataset,an accuracy rate of 86%for detection and 78%accuracy for tracking has been achieved.展开更多
As the fundamental problem in the computer vision area,image matching has wide applications in pose estimation,3D reconstruction,image retrieval,etc.Suffering from the influence of external factors,the process of imag...As the fundamental problem in the computer vision area,image matching has wide applications in pose estimation,3D reconstruction,image retrieval,etc.Suffering from the influence of external factors,the process of image matching using classical local detectors,e.g.,scale-invariant feature transform(SIFT),and the outlier filtering approaches,e.g.,Random sample consensus(RANSAC),show high computation speed and pool robustness under changing illumination and viewpoints conditions,while image matching approaches with deep learning strategy(such as HardNet,OANet)display reliable achievements in large-scale datasets with challenging scenes.However,the past learning-based approaches are limited to the distinction and quality of the dataset and the training strategy in the image-matching approaches.As an extension of the previous conference paper,this paper proposes an accurate and robust image matching approach using fewer training data in an end-to-end manner,which could be used to estimate the pose error This research first proposes a novel dataset cleaning and construction strategy to eliminate the noise and improve the training efficiency;Secondly,a novel loss named quadratic hinge triplet loss(QHT)is proposed to gather more effective and stable feature matching;Thirdly,in the outlier filtering process,the stricter OANet and bundle adjustment are applied for judging samples by adding the epipolar distance constraint and triangulation constraint to generate more outstanding matches;Finally,to recall the matching pairs,dynamic guided matching is used and then submit the inliers after the PyRANSAC process.Multiple evaluation metrics are used and reported in the 1st place in the Track1 of CVPR Image-Matching Challenge Workshop.The results show that the proposed method has advanced performance in large-scale and challenging Phototourism benchmark.展开更多
Urban shrinkage has emerged as a widespread phenomenon globally and has a significant impact on land,particularly in terms of land use and price.This study focuses on 2851 county-level cities in China in 2005–2018(ex...Urban shrinkage has emerged as a widespread phenomenon globally and has a significant impact on land,particularly in terms of land use and price.This study focuses on 2851 county-level cities in China in 2005–2018(excluding Hong Kong,Macao,Taiwan,and‘no data’areas in Qinhai-Tibet Plateau)as the fundamental units of analysis.By employing nighttime light(NTL)data to identify shrinking cities,the propensity score matching(PSM)model was used to quantitatively examine the impact of shrinking cities on land prices,and evaluate the magnitude of this influence.The findings demonstrate the following:1)there were 613 shrinking cities in China,with moderate shrinkage being the most prevalent and severe shrinkage being the least.2)Regional disparities are evident in the spatial distribution of shrinking cities,especially in areas with diverse terrain.3)The spatial pattern of land price exhibits a significant correlated to the economic and administrative levels.4)Shrinking cities significantly negatively impact on the overall land price(ATT=–0.1241,P<0.05).However,the extent of the effect varies significantly among different spatial regions.This study contributes novel insights into the investigation of land prices and shrinking cities,ultimately serving as a foundation for government efforts to promote the sustainable development of urban areas.展开更多
The current particle filtering map matching algorithm has problems such as low map utilization and poor accuracy of turnoff positioning, etc. This paper proposed an improved particle filtering-based map-matching algor...The current particle filtering map matching algorithm has problems such as low map utilization and poor accuracy of turnoff positioning, etc. This paper proposed an improved particle filtering-based map-matching algorithm for the inertial positioning of personnel. The historical moment position constraint and feasible region constraint of particles were introduced in this paper. A resampling method based on multi-stage backtracking of particles was proposed. Therefore, the effectiveness of newly generated particles could be guaranteed. The utilization rate of map information could be improved, thus enhancing the accuracy of personnel localization. The walking experiment results showed that, compared with the traditional PDR algorithm, the proposed method had higher localization accuracy and better repeatability of the localization trajectory for multi-turn paths. Under the total travel of 480 meters, the deviation of the starting end point was less than 2 meters, which was about 0.4% of the total travel.展开更多
Phase-matching quantum key distribution is a promising scheme for remote quantum key distribution,breaking through the traditional linear key-rate bound.In practical applications,finite data size can cause significant...Phase-matching quantum key distribution is a promising scheme for remote quantum key distribution,breaking through the traditional linear key-rate bound.In practical applications,finite data size can cause significant system performance to deteriorate when data size is below 1010.In this work,an improved statistical fluctuation analysis method is applied for the first time to two decoy-states phase-matching quantum key distribution,offering a new insight and potential solutions for improving the key generation rate and the maximum transmission distance while maintaining security.Moreover,we also compare the influence of the proposed improved statistical fluctuation analysis method on system performance with those of the Gaussian approximation and Chernoff-Hoeffding boundary methods on system performance.The simulation results show that the proposed scheme significantly improves the key generation rate and maximum transmission distance in comparison with the Chernoff-Hoeffding approach,and approach the results obtained when the Gaussian approximation is employed.At the same time,the proposed scheme retains the same security level as the Chernoff-Hoeffding method,and is even more secure than the Gaussian approximation.展开更多
Analysis and recognition of ancient scripts is a challenging task as these scripts are inscribed on pillars,stones,or leaves.Optical recognition systems can help in preserving,sharing,and accelerate the study of the a...Analysis and recognition of ancient scripts is a challenging task as these scripts are inscribed on pillars,stones,or leaves.Optical recognition systems can help in preserving,sharing,and accelerate the study of the ancient scripts,but lack of standard dataset for such scripts is a major constraint.Although many scholars and researchers have captured and uploaded inscription images on various websites,manual searching,downloading and extraction of these images is tedious and error prone.Web search queries return a vast number of irrelevant results,and manually extracting images for a specific script is not scalable.This paper proposes a novelmultistage system to identify the specific set of script images from a large set of images downloaded from web sources.The proposed system combines the two most important pattern matching techniques-Scale Invariant Feature Transform(SIFT)and Template matching,in a sequential pipeline,and by using the key strengths of each technique,the system can discard irrelevant images while retaining a specific type of images.展开更多
BACKGROUND Although the location of proximal cancer of the remnant stomach is the same as that of primary proximal cancer of the stomach,its clinical characteristics and prognosis are still controversial.AIM To evalua...BACKGROUND Although the location of proximal cancer of the remnant stomach is the same as that of primary proximal cancer of the stomach,its clinical characteristics and prognosis are still controversial.AIM To evaluate the clinicopathological features and prognosis factors of gastric stump cancer(GSC)and primary proximal gastric cancer(PGC).METHODS From January,2005 to December,2016,178 patients with GSC and 957 cases with PGC who received surgical treatment were enrolled.Patients in both groups underwent 1:1 propensity score matching analysis,and both clinical and pathological data were systematically collected for statistical purposes.Quality of RESULTS One hundred and fifty-two pairs were successfully matched after propensity score matching analysis.Of the 15 demographic and pathological variables collected,the analysis further revealed that the number of lymph nodes and positive lymph nodes were different prognostic and clinicopathological factors between PGC and GSC.Univariate and multivariate analyses showed that gender,differentiation degree and tumor-node-metastasis stage were independent risk factors for patients with GSC.Gender,vascular invasion,differentiation degree,depth of infiltration,positive lymph nodes,and tumor-node-metastasis stage were independent risk factors for patients with PGC.The 5-year overall survival and cancer-specific survival of patients with GSC were significantly lower than those in the PGC group,the scores for overall quality of life in the GSC-malignant group were lower than the GSC-benign,and the differences were statistically significant.CONCLUSION The differences in clinicopathological characteristics between GSC and PGC were clarified,and PGC had a better prognosis than GSC.展开更多
OBJECTIVE To assess the feasibility and safety of the minimalistic approach to left atrial appendage occlusion(LAAO) guided by cardiac computed tomography angiography(CCTA).METHODS Ninety consecutive patients who unde...OBJECTIVE To assess the feasibility and safety of the minimalistic approach to left atrial appendage occlusion(LAAO) guided by cardiac computed tomography angiography(CCTA).METHODS Ninety consecutive patients who underwent LAAO, with or without CCTA-guided, were matched(1:2). Each step of the LAAO procedure in the computed tomography(CT) guidance group(CT group) was directed by preprocedural CT planning. In the control group, LAAO was performed using the standard method. All patients were followed up for 12 months, and device surveillance was conducted using CCTA.RESULTS A total of 90 patients were included in the analysis, with 30 patients in the CT group and 60 matched patients in the control group. All patients were successfully implanted with Watchman devices. The mean ages for the CT group and the control group were 70.0 ± 9.4 years and 68.4 ± 11.9 years(P = 0.52), respectively. The procedure duration(45.6 ± 10.7 min vs. 58.8 ± 13.0 min,P < 0.001) and hospital stay(7.5 ± 2.4 day vs. 9.6 ± 2.8 day, P = 0.001) in the CT group was significantly shorter compared to the control group. However, the total radiation dose was higher in the CT group compared to the control group(904.9 ± 348.0 m Gy vs.711.9 ± 211.2 m Gy, P = 0.002). There were no significant differences in periprocedural pericardial effusion(3.3% vs. 6.3%, P = 0.8) between the two groups. The rate of postprocedural adverse events(13.3% vs. 18.3%, P = 0.55) were comparable between both groups at 12 months follow-up.CONCLUSIONS CCTA is capable of detailed LAAO procedure planning. Minimalistic LAAO with preprocedural CCTA planning was feasible and safe, with shortened procedure time and acceptable increased radiation and contras consumption. For patients with contraindications to general anesthesia and/or transesophageal echocardiography, this promising method may be an alternative to conventional LAAO.展开更多
Pattern matching method is one of the classic classifications of existing online portfolio selection strategies. This article aims to study the key aspects of this method—measurement of similarity and selection of si...Pattern matching method is one of the classic classifications of existing online portfolio selection strategies. This article aims to study the key aspects of this method—measurement of similarity and selection of similarity sets, and proposes a Portfolio Selection Method based on Pattern Matching with Dual Information of Direction and Distance (PMDI). By studying different combination methods of indicators such as Euclidean distance, Chebyshev distance, and correlation coefficient, important information such as direction and distance in stock historical price information is extracted, thereby filtering out the similarity set required for pattern matching based investment portfolio selection algorithms. A large number of experiments conducted on two datasets of real stock markets have shown that PMDI outperforms other algorithms in balancing income and risk. Therefore, it is suitable for the financial environment in the real world.展开更多
Feature matching plays a key role in computer vision. However, due to the limitations of the descriptors, the putative matches are inevitably contaminated by massive outliers.This paper attempts to tackle the outlier ...Feature matching plays a key role in computer vision. However, due to the limitations of the descriptors, the putative matches are inevitably contaminated by massive outliers.This paper attempts to tackle the outlier filtering problem from two aspects. First, a robust and efficient graph interaction model,is proposed, with the assumption that matches are correlated with each other rather than independently distributed. To this end, we construct a graph based on the local relationships of matches and formulate the outlier filtering task as a binary labeling energy minimization problem, where the pairwise term encodes the interaction between matches. We further show that this formulation can be solved globally by graph cut algorithm. Our new formulation always improves the performance of previous localitybased method without noticeable deterioration in processing time,adding a few milliseconds. Second, to construct a better graph structure, a robust and geometrically meaningful topology-aware relationship is developed to capture the topology relationship between matches. The two components in sum lead to topology interaction matching(TIM), an effective and efficient method for outlier filtering. Extensive experiments on several large and diverse datasets for multiple vision tasks including general feature matching, as well as relative pose estimation, homography and fundamental matrix estimation, loop-closure detection, and multi-modal image matching, demonstrate that our TIM is more competitive than current state-of-the-art methods, in terms of generality, efficiency, and effectiveness. The source code is publicly available at http://github.com/YifanLu2000/TIM.展开更多
基金supported by the National Natural Science Foundation of China under Grant 62171465。
文摘Many efforts have been devoted to efficient task scheduling in Multi-Unmanned Aerial Vehicle(UAV)edge computing.However,the heterogeneity of UAV computation resource,and the task re-allocating between UAVs have not been fully considered yet.Moreover,most existing works neglect the fact that a task can only be executed on the UAV equipped with its desired service function(SF).In this backdrop,this paper formulates the task scheduling problem as a multi-objective task scheduling problem,which aims at maximizing the task execution success ratio while minimizing the average weighted sum of all tasks’completion time and energy consumption.Optimizing three coupled goals in a realtime manner with the dynamic arrival of tasks hinders us from adopting existing methods,like machine learning-based solutions that require a long training time and tremendous pre-knowledge about the task arrival process,or heuristic-based ones that usually incur a long decision-making time.To tackle this problem in a distributed manner,we establish a matching theory framework,in which three conflicting goals are treated as the preferences of tasks,SFs and UAVs.Then,a Distributed Matching Theory-based Re-allocating(DiMaToRe)algorithm is put forward.We formally proved that a stable matching can be achieved by our proposal.Extensive simulation results show that Di Ma To Re algorithm outperforms benchmark algorithms under diverse parameter settings and has good robustness.
基金supported by a grant from the Basic Science Research Program through the National Research Foundation(NRF)(2021R1F1A1063634)funded by the Ministry of Science and ICT(MSIT),Republic of KoreaThe authors are thankful to the Deanship of Scientific Research at Najran University for funding this work under the Research Group Funding Program Grant Code(NU/RG/SERC/13/40)+2 种基金Also,the authors are thankful to Prince Satam bin Abdulaziz University for supporting this study via funding from Prince Satam bin Abdulaziz University project number(PSAU/2024/R/1445)This work was also supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project Number(PNURSP2023R54)Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘Road traffic monitoring is an imperative topic widely discussed among researchers.Systems used to monitor traffic frequently rely on cameras mounted on bridges or roadsides.However,aerial images provide the flexibility to use mobile platforms to detect the location and motion of the vehicle over a larger area.To this end,different models have shown the ability to recognize and track vehicles.However,these methods are not mature enough to produce accurate results in complex road scenes.Therefore,this paper presents an algorithm that combines state-of-the-art techniques for identifying and tracking vehicles in conjunction with image bursts.The extracted frames were converted to grayscale,followed by the application of a georeferencing algorithm to embed coordinate information into the images.The masking technique eliminated irrelevant data and reduced the computational cost of the overall monitoring system.Next,Sobel edge detection combined with Canny edge detection and Hough line transform has been applied for noise reduction.After preprocessing,the blob detection algorithm helped detect the vehicles.Vehicles of varying sizes have been detected by implementing a dynamic thresholding scheme.Detection was done on the first image of every burst.Then,to track vehicles,the model of each vehicle was made to find its matches in the succeeding images using the template matching algorithm.To further improve the tracking accuracy by incorporating motion information,Scale Invariant Feature Transform(SIFT)features have been used to find the best possible match among multiple matches.An accuracy rate of 87%for detection and 80%accuracy for tracking in the A1 Motorway Netherland dataset has been achieved.For the Vehicle Aerial Imaging from Drone(VAID)dataset,an accuracy rate of 86%for detection and 78%accuracy for tracking has been achieved.
文摘As the fundamental problem in the computer vision area,image matching has wide applications in pose estimation,3D reconstruction,image retrieval,etc.Suffering from the influence of external factors,the process of image matching using classical local detectors,e.g.,scale-invariant feature transform(SIFT),and the outlier filtering approaches,e.g.,Random sample consensus(RANSAC),show high computation speed and pool robustness under changing illumination and viewpoints conditions,while image matching approaches with deep learning strategy(such as HardNet,OANet)display reliable achievements in large-scale datasets with challenging scenes.However,the past learning-based approaches are limited to the distinction and quality of the dataset and the training strategy in the image-matching approaches.As an extension of the previous conference paper,this paper proposes an accurate and robust image matching approach using fewer training data in an end-to-end manner,which could be used to estimate the pose error This research first proposes a novel dataset cleaning and construction strategy to eliminate the noise and improve the training efficiency;Secondly,a novel loss named quadratic hinge triplet loss(QHT)is proposed to gather more effective and stable feature matching;Thirdly,in the outlier filtering process,the stricter OANet and bundle adjustment are applied for judging samples by adding the epipolar distance constraint and triangulation constraint to generate more outstanding matches;Finally,to recall the matching pairs,dynamic guided matching is used and then submit the inliers after the PyRANSAC process.Multiple evaluation metrics are used and reported in the 1st place in the Track1 of CVPR Image-Matching Challenge Workshop.The results show that the proposed method has advanced performance in large-scale and challenging Phototourism benchmark.
基金Under the auspices of National Natural Science Foundation of China(No.42071222,41771194)。
文摘Urban shrinkage has emerged as a widespread phenomenon globally and has a significant impact on land,particularly in terms of land use and price.This study focuses on 2851 county-level cities in China in 2005–2018(excluding Hong Kong,Macao,Taiwan,and‘no data’areas in Qinhai-Tibet Plateau)as the fundamental units of analysis.By employing nighttime light(NTL)data to identify shrinking cities,the propensity score matching(PSM)model was used to quantitatively examine the impact of shrinking cities on land prices,and evaluate the magnitude of this influence.The findings demonstrate the following:1)there were 613 shrinking cities in China,with moderate shrinkage being the most prevalent and severe shrinkage being the least.2)Regional disparities are evident in the spatial distribution of shrinking cities,especially in areas with diverse terrain.3)The spatial pattern of land price exhibits a significant correlated to the economic and administrative levels.4)Shrinking cities significantly negatively impact on the overall land price(ATT=–0.1241,P<0.05).However,the extent of the effect varies significantly among different spatial regions.This study contributes novel insights into the investigation of land prices and shrinking cities,ultimately serving as a foundation for government efforts to promote the sustainable development of urban areas.
文摘The current particle filtering map matching algorithm has problems such as low map utilization and poor accuracy of turnoff positioning, etc. This paper proposed an improved particle filtering-based map-matching algorithm for the inertial positioning of personnel. The historical moment position constraint and feasible region constraint of particles were introduced in this paper. A resampling method based on multi-stage backtracking of particles was proposed. Therefore, the effectiveness of newly generated particles could be guaranteed. The utilization rate of map information could be improved, thus enhancing the accuracy of personnel localization. The walking experiment results showed that, compared with the traditional PDR algorithm, the proposed method had higher localization accuracy and better repeatability of the localization trajectory for multi-turn paths. Under the total travel of 480 meters, the deviation of the starting end point was less than 2 meters, which was about 0.4% of the total travel.
文摘Phase-matching quantum key distribution is a promising scheme for remote quantum key distribution,breaking through the traditional linear key-rate bound.In practical applications,finite data size can cause significant system performance to deteriorate when data size is below 1010.In this work,an improved statistical fluctuation analysis method is applied for the first time to two decoy-states phase-matching quantum key distribution,offering a new insight and potential solutions for improving the key generation rate and the maximum transmission distance while maintaining security.Moreover,we also compare the influence of the proposed improved statistical fluctuation analysis method on system performance with those of the Gaussian approximation and Chernoff-Hoeffding boundary methods on system performance.The simulation results show that the proposed scheme significantly improves the key generation rate and maximum transmission distance in comparison with the Chernoff-Hoeffding approach,and approach the results obtained when the Gaussian approximation is employed.At the same time,the proposed scheme retains the same security level as the Chernoff-Hoeffding method,and is even more secure than the Gaussian approximation.
文摘Analysis and recognition of ancient scripts is a challenging task as these scripts are inscribed on pillars,stones,or leaves.Optical recognition systems can help in preserving,sharing,and accelerate the study of the ancient scripts,but lack of standard dataset for such scripts is a major constraint.Although many scholars and researchers have captured and uploaded inscription images on various websites,manual searching,downloading and extraction of these images is tedious and error prone.Web search queries return a vast number of irrelevant results,and manually extracting images for a specific script is not scalable.This paper proposes a novelmultistage system to identify the specific set of script images from a large set of images downloaded from web sources.The proposed system combines the two most important pattern matching techniques-Scale Invariant Feature Transform(SIFT)and Template matching,in a sequential pipeline,and by using the key strengths of each technique,the system can discard irrelevant images while retaining a specific type of images.
文摘BACKGROUND Although the location of proximal cancer of the remnant stomach is the same as that of primary proximal cancer of the stomach,its clinical characteristics and prognosis are still controversial.AIM To evaluate the clinicopathological features and prognosis factors of gastric stump cancer(GSC)and primary proximal gastric cancer(PGC).METHODS From January,2005 to December,2016,178 patients with GSC and 957 cases with PGC who received surgical treatment were enrolled.Patients in both groups underwent 1:1 propensity score matching analysis,and both clinical and pathological data were systematically collected for statistical purposes.Quality of RESULTS One hundred and fifty-two pairs were successfully matched after propensity score matching analysis.Of the 15 demographic and pathological variables collected,the analysis further revealed that the number of lymph nodes and positive lymph nodes were different prognostic and clinicopathological factors between PGC and GSC.Univariate and multivariate analyses showed that gender,differentiation degree and tumor-node-metastasis stage were independent risk factors for patients with GSC.Gender,vascular invasion,differentiation degree,depth of infiltration,positive lymph nodes,and tumor-node-metastasis stage were independent risk factors for patients with PGC.The 5-year overall survival and cancer-specific survival of patients with GSC were significantly lower than those in the PGC group,the scores for overall quality of life in the GSC-malignant group were lower than the GSC-benign,and the differences were statistically significant.CONCLUSION The differences in clinicopathological characteristics between GSC and PGC were clarified,and PGC had a better prognosis than GSC.
基金supported by the Logistics Support Ministry of China (No.22BJZ41)the Capital's Funds for Health Improvement and Research (No.CFH2024-2-5071)。
文摘OBJECTIVE To assess the feasibility and safety of the minimalistic approach to left atrial appendage occlusion(LAAO) guided by cardiac computed tomography angiography(CCTA).METHODS Ninety consecutive patients who underwent LAAO, with or without CCTA-guided, were matched(1:2). Each step of the LAAO procedure in the computed tomography(CT) guidance group(CT group) was directed by preprocedural CT planning. In the control group, LAAO was performed using the standard method. All patients were followed up for 12 months, and device surveillance was conducted using CCTA.RESULTS A total of 90 patients were included in the analysis, with 30 patients in the CT group and 60 matched patients in the control group. All patients were successfully implanted with Watchman devices. The mean ages for the CT group and the control group were 70.0 ± 9.4 years and 68.4 ± 11.9 years(P = 0.52), respectively. The procedure duration(45.6 ± 10.7 min vs. 58.8 ± 13.0 min,P < 0.001) and hospital stay(7.5 ± 2.4 day vs. 9.6 ± 2.8 day, P = 0.001) in the CT group was significantly shorter compared to the control group. However, the total radiation dose was higher in the CT group compared to the control group(904.9 ± 348.0 m Gy vs.711.9 ± 211.2 m Gy, P = 0.002). There were no significant differences in periprocedural pericardial effusion(3.3% vs. 6.3%, P = 0.8) between the two groups. The rate of postprocedural adverse events(13.3% vs. 18.3%, P = 0.55) were comparable between both groups at 12 months follow-up.CONCLUSIONS CCTA is capable of detailed LAAO procedure planning. Minimalistic LAAO with preprocedural CCTA planning was feasible and safe, with shortened procedure time and acceptable increased radiation and contras consumption. For patients with contraindications to general anesthesia and/or transesophageal echocardiography, this promising method may be an alternative to conventional LAAO.
文摘Pattern matching method is one of the classic classifications of existing online portfolio selection strategies. This article aims to study the key aspects of this method—measurement of similarity and selection of similarity sets, and proposes a Portfolio Selection Method based on Pattern Matching with Dual Information of Direction and Distance (PMDI). By studying different combination methods of indicators such as Euclidean distance, Chebyshev distance, and correlation coefficient, important information such as direction and distance in stock historical price information is extracted, thereby filtering out the similarity set required for pattern matching based investment portfolio selection algorithms. A large number of experiments conducted on two datasets of real stock markets have shown that PMDI outperforms other algorithms in balancing income and risk. Therefore, it is suitable for the financial environment in the real world.
基金supported by the National Natural Science Foundation of China (62276192)。
文摘Feature matching plays a key role in computer vision. However, due to the limitations of the descriptors, the putative matches are inevitably contaminated by massive outliers.This paper attempts to tackle the outlier filtering problem from two aspects. First, a robust and efficient graph interaction model,is proposed, with the assumption that matches are correlated with each other rather than independently distributed. To this end, we construct a graph based on the local relationships of matches and formulate the outlier filtering task as a binary labeling energy minimization problem, where the pairwise term encodes the interaction between matches. We further show that this formulation can be solved globally by graph cut algorithm. Our new formulation always improves the performance of previous localitybased method without noticeable deterioration in processing time,adding a few milliseconds. Second, to construct a better graph structure, a robust and geometrically meaningful topology-aware relationship is developed to capture the topology relationship between matches. The two components in sum lead to topology interaction matching(TIM), an effective and efficient method for outlier filtering. Extensive experiments on several large and diverse datasets for multiple vision tasks including general feature matching, as well as relative pose estimation, homography and fundamental matrix estimation, loop-closure detection, and multi-modal image matching, demonstrate that our TIM is more competitive than current state-of-the-art methods, in terms of generality, efficiency, and effectiveness. The source code is publicly available at http://github.com/YifanLu2000/TIM.
