Segmentation is one of the key problems in remote sensing imageprocessing, and a cluster hierarchy is a powerful tool to analyze data on multiple scales. In this paper, we present an optimal hierarchical remote sensi...
详细信息
This paper investigates how to maintain an efficient dynamic ordered set of bit strings, which is an important problem in the field of information search and information processing. Generally, a dynamic ordered set is...
详细信息
This paper investigates how to maintain an efficient dynamic ordered set of bit strings, which is an important problem in the field of information search and information processing. Generally, a dynamic ordered set is required to support 5 essential operations including search, insertion, deletion, max-value retrieval and next-larger-value retrieval. Based on previous research fruits, we present an advanced data structure named rich binary tree （RBT）, which follows both the binary-search-tree property and the digital-search-tree property. Also, every key K keeps the most significant difference bit （MSDB） between itself and the next larger value among K＇s ancestors, as well as that between itself and the next smaller one among its ancestors. With the new data structure, we can maintain a dynamic ordered set in O（L） time. Since computers represent objects in binary mode, our method has a big potential in application. In fact, RBT can be viewed as a general-purpose data structure for problems concerning order, such as search, sorting and maintaining a priority queue. For example, when RBT is applied in sorting, we get a linear-time algorithm with regard to the key number and its performance is far better than quick-sort. What is more powerful than quick-sort is that RBT supports constant-time dynamic insertion/deletion.
When faced with a large support point spread function (PSF), the iterative expectation-maximization (EM) algorithm, which is often used for PSF identification, is very sensitive to the initial PSF estimate. To deal wi...
详细信息
When faced with a large support point spread function (PSF), the iterative expectation-maximization (EM) algorithm, which is often used for PSF identification, is very sensitive to the initial PSF estimate. To deal with this problem, the authors propose to do EM image identification and restoration in the subband domain. After the image is first divided into subbands, the EM algorithm is applied to each subband separately. Since the PSF can be taken to have smaller support in each subband, these subbands should be less of a problem with the EM model identification. They also introduce an adaptive subband EM method for use in the upper frequency subbands.
The team design becomes increasingly important to future manufacturing industry. This paper focus on the key issues of collaborative 3D design system through Internet or Intranet in CSCW(computer Support for Cooperati...
详细信息
ISBN:
(纸本)9780863418273
The team design becomes increasingly important to future manufacturing industry. This paper focus on the key issues of collaborative 3D design system through Internet or Intranet in CSCW(computer Support for Cooperative Work). In the paper, we propose our solutions of concurrency control tactics, collaboration aware, multi-mode communications network management, synchronous real-time protection in a collaborative 3D design system. Based on Open Source Projects-Open CASCADE and Adaptive Communication Environment (ACE), we implement our collaborative 3D design system, and experiments show our system can meet the requirements of some 3D cooperative modeling design applications.
This paper presents some new virtual reality methods for house layout and furnishing to realize interactive high realistic presentation of a furnished house. Virtual houses and furniture are built from actual schedule...
详细信息
ISBN:
(纸本)9780863418273
This paper presents some new virtual reality methods for house layout and furnishing to realize interactive high realistic presentation of a furnished house. Virtual houses and furniture are built from actual schedule drawing data by 3D-modeling technology. This paper mainly proposes four ways of demonstrating virtual house on Internet, including indoor virtual tour, fix-position panorama browse, interactively indoor touring and globe view of house layout. Taking advantage of these ways, customers can navigate in the virtual house environment through Internet, observing the layout of houses from different angles and performing some interactive actions to show house style clearly.
This paper introduces a shape descriptor based on a combination of topological image analysis and texture information. Critical points of a shape’s skeleton are determined first. The shape is described according to p...
详细信息
Possibilities and techniques for the combined use of SAR and high resolution optical satellite imagery are discussed. Differences in imaging geometry and scene illumination complicate the analysis of multi-sensor data...
Unlike a B'ezier curve,a spline curve is hard to be obtained through geometric corner cutting on control polygons because the degree elevation operator is difficult to be obtained and geometric convergence is hard...
详细信息
Unlike a B'ezier curve,a spline curve is hard to be obtained through geometric corner cutting on control polygons because the degree elevation operator is difficult to be obtained and geometric convergence is hard to be *** order to obtain geometric construction algorithm on C-B-splines,firstly we construct the degree elevation operator by using bi-order splines in this *** we can obtain a control polygon sequence by degree elevation based on the degree elevation operator derived from a C-B-spline ***,we prove that this polygon sequence will converge to initial C-B-spline *** geometric construction algorithm possesses strong geometric *** is also simple,stable and suitable for hardware to *** algorithm is important for CAD modeling systems,since many common engineering curves such as ellipse,helix,*** be represented explicitly by C-B-splines.
This paper presents an approach to derive critical points of a shape, the basis of a Reeb graph, using a combination of a medial axis skeleton and features along this skeleton. A Reeb graph captures the topology of a ...
详细信息
We describe an algorithm for three-dimensional display of discrete objects in a discrete space. There are no restrictions on the objects: they may be concave or convex, have holes (including interior holes) and can co...
详细信息
暂无评论