As a classical problem in spatial databases， Aggregate Nearest Neighbor （ANN） query is of great importance in the optimization of network link structures， the location selection of logistics distribution points and the car-sharing services， and can effectively contribute to the development of fields such as logistics， mobile Internet industry and operations research. The existing research has some shortcomings： lack of efficient index structure for large-scale dynamic road network data， low query efficiency of the algorithms when the data point locations move in real time and network weights update dynamically. To address these problems， an ANN query algorithm in dynamic scenarios was proposed. Firstly， with adopting G-tree as the road network index， a pruning algorithm combining spatial index structures such as quadtrees and k-d trees with the Incremental Euclidean Restriction （IER） algorithm was proposed to solve ANN queries in statistic space. Then， aiming at the issue of frequent updates of data point locations in dynamic scenarios， the time window and safe zone update strategy were added to reduce the iteration times of the algorithm， experimental results showed that the efficiency could be improved by 8% to 85%. Finally， for ANN query problems with road network weight changed， based on historical query results， two correction based continuous query algorithms were proposed to obtain the current query results according to the increment of weight changes. In certain scenarios， these algorithms can reduce errors by approximately 50%. The theoretical research and experimental results show that the proposed algorithms can solve the ANN query problems in dynamic scenarios efficiently and more accurately.

Aiming at the inaccurate positioning problem of salient object in the previous weakly supervised salient object detection algorithms， a weakly supervised salient object detection algorithm based on bounding box annotation was proposed. In the proposed algorithm， the minimum bounding rectangle boxes， which are the bounding boxes of all objects in the image were adopted as supervision information. Firstly， the initial saliency map was generated based on the bounding box annotation and GrabCut algorithm. Then， a correction module for missing object was designed to obtain the optimized saliency map. Finally， by combining the advantages of the traditional methods and deep learning methods， the optimized saliency map was used as the pseudo ground-truth to learn a salient object detection model through neural network. Comparison of the proposed algorithm and six unsupervised and four weakly supervised saliency detection algorithms was carried on four public datasets. Experimental results show that the proposed algorithm significantly outperforms comparison algorithms in both Max F-measure value （Max-F） and Mean Absolute Error （MAE） on four datasets. Compared with SBB （Sales Bounding Boxes）， which is also a weakly supervised method based on boundary box annotation， the annotation method of the proposed algorithm is simpler. Experiments were conducted on four datasets， ECSSD， DUTS-TE， HKU-IS， DUT-OMRON， and the Max-F increased by 1.82%， 4.00%， 1.27% and 5.33% respectively， and the MAE decreased by 13.89%， 15.07%， 8.77% and 13.33%， respectively. It can be seen that the proposed algorithm is a weakly supervised salient object detection algorithm with good detection performance.