ID |
原文 |
译文 |
40516 |
为评价星载JPEG-LS压缩算法对图像质量的影响,并为在轨压缩比的设置提供技术支撑,以高分多模卫星的应用为背景,从典型场景数据的压缩质量客观评价及典型任务的应用效果两方面构建图像压缩评测模型. |
In order to evaluate the influence of on-board JPEG-LS compression algorithm on image quality, and provide technical support for the setting of on-orbit compression ratio, with the application of high-resolution multi-mode satellites as the background, the image compression evaluation model is built from two aspects: objective evaluation of compression quality of typical scene data and application effects of typical tasks. |
40517 |
通过对压缩前后图像质量的二维失真度、光谱失真度、空间失真度等客观指标的分析,以及对图像分类、目标检测、特征提取与匹配等典型应用效果的比较,为压缩算法对图像质量的影响提供客观性指标统计数据及应用性效果对比数据支撑,证实该算法可满足用户需求. |
Through the analysis of objective indicators such as two-dimensional distortion, spectral distortion, and spatial distortion of image quality before and after compression, and comparison of typical application effects such as image classification, target detection, feature extraction and matching, which provides objective index statistical data and application effect comparison data support for the impact of compression algorithms on image quality, confirming that the algorithm can meet user needs. |
40518 |
同时为用户具体应用需求提供了建议,也为在轨影像数据市场的合理化分配与拓展提供了支持. |
At the same time, it provides suggestions for users' specific application needs, and supports the rational distribution and expansion of the on-orbit image data market. |
40519 |
面向个性化约束的空间关键词查询是数据库查询领域的热点问题,其中快速性和匹配性是衡量此类查询优劣的核心问题. |
Spatial keyword query oriented to personalized constraints is a hot issue in the field of database query, in which the rapidity and matching are the core issues to evaluate the merits of such query. |
40520 |
传统空间关键词范围查询无法匹配除地理位置和关键词信息以外的带有个性化约束条件下的查询,且大多数二维空间下的索引结构的构建更新速度和查询效率较低. |
The traditional spatial keyword range query is unable to match the query with personalized constraints except geographical location and keyword information, and the construction and update speed and query efficiency of most index structures in two-dimensional space are low. |
40521 |
针对上述问题,提出了一种带否定关键词约束(即用户不喜欢的关键词)的查询模式.采用Geohash字符串表示兴趣点对象,对字符串排序后构建B+树作为二叉树的叶节点,通过二叉树过滤带否定关键词的对象,构建了基于Geohash的混合索引结构BGIB-Tree. |
Aiming at these problems, puts forward a constraint with negative keywords(i.e., users don't like keywords) query model, USES the Geohash string representation point of interest object, built after the string sorting B+Tree as a binary Tree leaf nodes, through the binary Tree to filter object with negative keywords, to build a hybrid index structure based on Geohash BGIB-Tree. |
40522 |
在此基础上,依靠Geohash编码的递归性,设计了前缀匹配搜索算法. |
On this basis, the prefix matching search algorithm is designed based on the recursion of Geohash encoding. |
40523 |
以区域编码和对象编码前缀匹配为剪枝策略,快速找到满足空间约束的兴趣点, |
The pruning strategy is based on the region encoding and the object encoding prefix matching to quickly find the points of interest that meet the spatial constraints. |
40524 |
最后在倒排索引中双向搜索即可完成查询. |
Finally, the query can be completed by two-way search in the inverted index. |
40525 |
通过与IR-Tree和BIR-Tree对比,在真实数据集上对BGIB-Tree的构建时间与相关参数对查询算法的影响做出验证, |
By comparing with IR-Tree and BIR-Tree, the influence of BGIB-tree's construction time and related parameters on the query algorithm was verified on the real data set. |