期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
A solution for digital image management in spatial databases
1
作者 LIUChen MAXiu-jun +2 位作者 XIEKun-qing LIUYu FENGXue-bing 《重庆邮电学院学报(自然科学版)》 2004年第5期161-164,共4页
Digital Orthographic Map (DOM) can be used in various applications because it contains both image features and terrain information. Spatial database management systems aim at the effective and efficient management of ... Digital Orthographic Map (DOM) can be used in various applications because it contains both image features and terrain information. Spatial database management systems aim at the effective and efficient management of data related to a space, engineering design and so on. Thereby spatial database provides an efficient solution for managing DOM. According to large amounts of the DOM data in storage, a data compression based on wavelet is introduced into the storage. Another strategy to solve this problem is to decompose the raw image into tiles and store the tiles individually as separate tuples. The metadata of DOM can be used to organize and manage spatial information, especially for spatial data sharing and fast locating. A tool for browsing, zooming and querying the DOM data is also designed. We implemented these ideas in SISP(Spatial Information Sharing System) and applied the subsystem into the DOM management of Beijing City, which is an component of the Beijing Spatial Information Infrastructure. 展开更多
关键词 数字图象管理 空间数据库 DOM 空间元数据 图象数据库
在线阅读 下载PDF
A Parallel Voting Scheme for Aspect Recovery
2
作者 陈珂 石川真澄 《Journal of Computer Science & Technology》 SCIE EI CSCD 1995年第5期385-402,共18页
Recently, a qualitative approach was proposed for 3-D shape recovery based on a hybrid object representation[1]. In this approach, aspect recovery is the most important stage which binds regions in the image into mean... Recently, a qualitative approach was proposed for 3-D shape recovery based on a hybrid object representation[1]. In this approach, aspect recovery is the most important stage which binds regions in the image into meaningful aspects to support 3-D primitive recovery. There is no known polynondal time algo-rithm to solve this problem. The previous approach dealt with this problem by using a heuristic method based on the conditional probability. Unlike the previous method, this paper presents a novel parallel voting scheme to conquer the problem for efficiency. For this purpose) the previous global aspect rep-resentation is replaced with a distributed representation of aspects. Based on this representation, a three-layer parallel voting network for aspect recovery is proposed. For evaluating likelihood, a continuous Hopfield net is employed so that all aspect coverings in decreasing order of likelihood can be enumerated.The paper describes this method in detail and demonstrates its usefulness with simulation. 展开更多
关键词 Computer vision 3-D shape recovery parallel computing voting scheme Hopfield net
原文传递
Block TERM factorization of block matrices
3
作者 SHEYiyuan HAOPenqwei 《Science in China(Series F)》 2004年第4期421-436,共16页
Reversible integer mapping (or integer transform) is a useful way to realize lossless coding, and this technique has been used for multi-component image compression in the new international image compression standard ... Reversible integer mapping (or integer transform) is a useful way to realize lossless coding, and this technique has been used for multi-component image compression in the new international image compression standard JPEG 2000. For any nonsingular linear transform of finite dimension, its integer transform can be implemented by factorizing the transform matrix into 3 triangular elementary reversible matrices (TERMs) or a series of single-row elementary reversible matrices (SERMs). To speed up and parallelize integer transforms, we study block TERM and SERM factorizations in this paper. First, to guarantee flexible scaling manners, the classical determinant (det) is generalized to a matrix function, DET, which is shown to have many important properties analogous to those of det. Then based on DET, a generic block TERM factorization, BLUS, is presented for any nonsingular block matrix. Our conclusions can cover the early optimal point factorizations and provide an efficient way to implement integer transforms for large matrices. 展开更多
关键词 integer mapping lossless coding parallel computing DETERMINANT block matrix factorization.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部