可靠性矩阵QvvP重复计算的快速递归方法

Shan Jie
{"title":"可靠性矩阵QvvP重复计算的快速递归方法","authors":"Shan Jie","doi":"10.1016/0031-8663(89)90031-8","DOIUrl":null,"url":null,"abstract":"<div><p>In quality analysis, optimization design and blunder detection of many photogrammetric problems, repeated computation of reliability matrix <em>QvvP</em> is often required. In this paper, a new recursive method for repeated computation of <em>QvvP</em> is developed. From a test on a bundle block adjustment, it is shown that this new method posesses much higher computational efficiency than the conventional methods.</p></div>","PeriodicalId":101020,"journal":{"name":"Photogrammetria","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1989-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0031-8663(89)90031-8","citationCount":"3","resultStr":"{\"title\":\"A fast recursive method for repeated computation of reliability matrix QvvP\",\"authors\":\"Shan Jie\",\"doi\":\"10.1016/0031-8663(89)90031-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In quality analysis, optimization design and blunder detection of many photogrammetric problems, repeated computation of reliability matrix <em>QvvP</em> is often required. In this paper, a new recursive method for repeated computation of <em>QvvP</em> is developed. From a test on a bundle block adjustment, it is shown that this new method posesses much higher computational efficiency than the conventional methods.</p></div>\",\"PeriodicalId\":101020,\"journal\":{\"name\":\"Photogrammetria\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0031-8663(89)90031-8\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Photogrammetria\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0031866389900318\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Photogrammetria","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0031866389900318","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在许多摄影测量问题的质量分析、优化设计和失误检测中,经常需要重复计算可靠性矩阵QvvP。本文提出了一种新的QvvP重复计算递归方法。通过对一个束块平差的测试表明,该方法比传统方法具有更高的计算效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A fast recursive method for repeated computation of reliability matrix QvvP

In quality analysis, optimization design and blunder detection of many photogrammetric problems, repeated computation of reliability matrix QvvP is often required. In this paper, a new recursive method for repeated computation of QvvP is developed. From a test on a bundle block adjustment, it is shown that this new method posesses much higher computational efficiency than the conventional methods.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Author index News Calendar A fast recursive method for repeated computation of reliability matrix QvvP The benefit of remote sensing activities of the Joint Research Centre (JRC) in Europe and Africa
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1