3D and 2D/3D holograms model

The estimating problem of 3D holograms orientation selectivity on angular, orthogonal, and azimuthal sensitivity parameters is formulated and solved. Tenfold increase of density 3D, 2D/3D holograms in comparison with 2D holograms at given selectivity for ones is shown in theory and experimentally.     

Hierarchical Representations of 2D/3D Gray-Scale Images and Their 2D/3D Two-Way Conversion

This article proposes G-octree as an extension of G-quadtree to three dimensions. A G-octree reflects in its construction a hierarchy of gray-scale level value homogeneity, as well as a hierarchy of spatial resolution. The article also develops two-way G-quadtree/Goctree conversion procedures based on the algorithms for the binary case. These procedures provide an integrated processing environment for hierarchically represented 2D/3D gray.scale images. We demonstrate our approach with an application to the color coding of macro-autoradiography images taken from rat brains.     

2D/3D Isometric Transformation Using Spring-Mass System

２Ｄ／３ＤＩｓｏｍｅｔｒｉｃＴｒａｎｓｆｏｒｍａｔｉｏｎＵｓｉｎｇＳｐｒｉｎｇ＿ＭａｓＳｙｓｔｅｍＦａｎＪｉｎ１ＭａｔｈｅｗＭ．Ｆ．Ｙｕｅｎ２ＱｉｆｕＷａｎｇ１ＺｈｏｕＪｉ１１ＴｈｅＣＡＤＣｅｎｔｅｒｏｆＴｈｅＨｕａｚｈｏｎｇＵｎｖｉｅｒｓｉｔｙｏｆ...     

A 2D/3D model-based object tracking framework

This paper presents a robust framework for tracking complex objects in video sequences. Multiple hypothesis tracking (MHT) algorithm reported in (IEEE Trans. Pattern Anal. Mach. Intell. 18(2) (1996)) is modified to accommodate a high level representations (2D edge map, 3D models) of objects for tracking. The framework exploits the advantages of MHT algorithm which is capable of resolving data association/uncertainty and integrates it with object matching techniques to provide a robust behavior while tracking complex objects. To track objects in 2D, a 4D feature is used to represent edge/line segments and are tracked using MHT. In many practical applications 3D models provide more information about the object's pose (i.e., rotation information in the transformation space) which cannot be recovered using 2D edge information. Hence, a 3D model-based object tracking algorithm is also presented. A probabilistic Hausdorff image matching algorithm is incorporated into the framework in order to determine the geometric transformation that best maps the model features onto their corresponding ones in the image plane. 3D model of the object is used to constrain the tracker to operate in a consistent manner. Experimental results on real and synthetic image sequences are presented to demonstrate the efficacy of the proposed framework.     

2D/3D image registration using regression learning

In computer vision and image analysis, image registration between 2D projections and a 3D image that achieves high accuracy and near real-time computation is challenging. In this paper, we propose a novel method that can rapidly detect an object’s 3D rigid motion or deformation from a 2D projection image or a small set thereof. The method is called CLARET (Correction via Limited-Angle Residues in External Beam Therapy) and consists of two stages: registration preceded by shape space and regression learning. In the registration stage, linear operators are used to iteratively estimate the motion/deformation parameters based on the current intensity residue between the target projection(s) and the digitally reconstructed radiograph(s) (DRRs) of the estimated 3D image. The method determines the linear operators via a two-step learning process. First, it builds a low-order parametric model of the image region’s motion/deformation shape space from its prior 3D images. Second, using learning-time samples produced from the 3D images, it formulates the relationships between the model parameters and the co-varying 2D projection intensity residues by multi-scale linear regressions. The calculated multi-scale regression matrices yield the coarse-to-fine linear operators used in estimating the model parameters from the 2D projection intensity residues in the registration. The method’s application to Image-guided Radiation Therapy (IGRT) requires only a few seconds and yields good results in localizing a tumor under rigid motion in the head and neck and under respiratory deformation in the lung, using one treatment-time imaging 2D projection or a small set thereof.     

Reactive 2D/3D garment pattern design modification

This paper presents a new 3D garment simulation result update algorithm for the 2D garment pattern design modification. The proposed algorithm enables the 3D garment fitting simulation result directly to react to the modification in the 2D patterns. The algorithm performs a topological invariant deformation of the 2D pattern mesh after the boundary of the 2D pattern undergoes a topological consistent modification. The length of each of the edges in the mesh defined as the equilibrium state parameter is updated and then directly used in the 3D garment fitting simulation to update the original simulation result. The advantage of the proposed algorithm is that the mesh topology of the 2D garment pattern is preserved and thus simplifies the numerical scheme by maintaining the consistency of the matrix equation. With this approach, the 3D garment fitting simulation does not need to repeat the entire simulation for every modification and can react to the 2D pattern modification efficiently and speedily.     

2D/3D image registration on the GPU

We present a method that performs a rigid 2D/3D image registration efficiently on the Graphical Processing Unit (GPU). As one main contribution of this paper, we propose an efficient method for generating realistic DRRs that are visually similar to x-ray images. Therefore, we model some of the electronic post-processes of current x-ray C-arm-systems. As another main contribution, the GPU is used to compute eight intensity-based similarity measures between the DRR and the x-ray image in parallel. A combination of these eight similarity measures is used as a new similarity measure for the optimization. We evaluated the performance and the precision of our 2D/3D image registration algorithm using two phantom models. Compared to a CPU + GPU algorithm, which calculates the similarity measures on the CPU, our GPU algorithm is between three and six times faster. In contrast to single similarity measures, our new similarity measure achieved precise and robust registration results for both phantom models.     

脊柱手术导航中分步式2D/3D图像配准方法

为实现微创脊柱手术导航,提出一种将脊柱术前CT与其术中X射线图像配准的方法.首先基于一种最近点迭代法进行快速粗配准;然后提取图像的梯度特征,根据投影变换原理,采用寻找具有CT最大梯度投影位置的方法进行精配准.在模拟数据及临床标本上进行实验的配准率分别为92%和78%. 实验结果表明:该方法鲁棒性强、人工干预少、适合于临床应用.     

DCT-based objective quality assessment metric of 2D/3D image

With the increasing growth of multimedia applications over the networking in recent years, users have put forward much higher requirements for multimedia quality of experience (QoE) than before. One of the representative requirements is the image quality. Therefore, the image quality assessment ranging from two-dimension (2D) image to three-dimension (3D) image has been getting much attention. In this paper, an efficient objective image quality assessment metric in block-based discrete cosine transform (DCT) coding is proposed. The metric incorporates properties of human visual system (HVS) to improve its validity and reliability in evaluating the quality of stereoscopic image. This is fulfilled by calculating the local pixel-based distortions in frequency domain, combining the simplified models of local visibility properties embodied in frequency domain, which consist of region of interest (ROI) mechanism (visual sensitivity), contrast sensitivity function (CSF) and contrast masking effect. The performance of the proposed metric is compared with other currently state-of-the-art objective image quality assessment metrics. The experimental results have demonstrated that the proposed metric is highly consistent with the subjective test scores. Moreover, the performance of the metric is also confirmed with the popular IRCCyN/IVC database. Therefore, the proposed metric is promising in term of the practical efficiency and reliability for real-life multimedia applications.     

Fast 2D/3D object representation with growing neural gas

This work presents the design of a real-time system to model visual objects with the use of self-organising networks. The architecture of the system addresses multiple computer vision tasks such as image segmentation, optimal parameter estimation and object representation. We first develop a framework for building non-rigid shapes using the growth mechanism of the self-organising maps, and then we define an optimal number of nodes without overfitting or underfitting the network based on the knowledge obtained from information-theoretic considerations. We present experimental results for hands and faces, and we quantitatively evaluate the matching capabilities of the proposed method with the topographic product. The proposed method is easily extensible to 3D objects, as it offers similar features for efficient mesh reconstruction.

     

Local Upsampling Fourier Transform for accurate 2D/3D image registration

An accurate image registration method based on Local Upsampling Fourier Transform (LUFT) is developed in this paper. It uses a hierarchical strategy to estimate more accurate image pair’s registration parameters, which consists of a coarse estimation and a robust and efficient refinement stage as well. The initial parameter is estimated through a conventional Phase Only Correlation (POC) method in the coarse stage, and then it is refined by the Local Upsampling Fourier Transform in frequency domain to achieve higher accuracy. Furthermore, as will be shown in many experiments, the LUFT can achieve more accurate translation and rotation estimation, and it is efficient, robust to noise, and it can be applied to accurate 2D and 3D image rotation and translation estimation.     

Interactive 3D/2D visualization for geophysical data processing and interpretation

A new 3D/2D interactive display server was developed for the IGeoS geophysical data processing framework presented earlier. With introduction of this major component, the framework becomes conceptually complete and potentially bridges the gap between traditional processing and interpretation geophysical software.The display server utilizes Qt toolkit and OpenGL graphics libraries while taking advantage of the object-oriented design of the core data processing system. It operates by creating image object trees that are automatically propagated to the server(s) residing on the same or remote hosts and producing complex, structured, and interactive data displays. The displays support custom interactive graphical user interfaces, which are constructed entirely by the user and do not require computer coding. With over 200 specialized processing tools available, this approach allows creating 3D visualizations and building custom interactive data analysis, interpretation, and modeling tools in many areas of application. In particular, we show examples of integration of seismic ray tracing, gravity, and receiver function modeling and inversion in deep crustal studies.     

Facial video coding/decoding at ultra-low bit-rate: a 2D/3D model-based approach

A real-time facial video coding/decoding system was proposed based on the establishment of 2D/3D mixed coding/decoding scheme. It has better rate/distortion performance at ultra-low bit-rate. Multi-measurements and online appearance models were applied to track the 3D facial motion from video by the improved particle filtering. 3D facial animation was produced by combining the parameterized model and muscular model. 3D hair was synthesized based on the hair detection result in video. 3D coding/decoding result of foreground and 2D coding/decoding result of background were stitched seamlessly. At ultra-low bit-rate, the objective experiment confirmed the comprehensive advantage between coding efficiency and decoding quality of this system, and the subjective experiment indicated the suitability of subjective face identification by it.     

3D Fabrication of 2D Mechanisms

The success of physics sandbox applications and physics‐based puzzle games is a strong indication that casual users and hobbyists enjoy designing mechanisms, for educational or entertainment purposes. In these applications, a variety of mechanisms are designed by assembling two‐dimensional shapes, creating gears, cranks, cams, and racks. The experience is made enjoyable by the fact that the user does not need to worry about the intricate geometric details that would be necessary to produce a real mechanism. In this paper, we propose to start from such casual designs of mechanisms and turn them into a 3D model that can be printed onto widely available, inexpensive filament based 3D printers. Our intent is to empower the users of such tools with the ability to physically realize their mechanisms and see them operate in the real world. To achieve this goal we tackle several challenges. The input 2D mechanism allows for some parts to overlap during simulation. These overlapping parts have to be resolved into non‐intersecting 3D parts in the real mechanism. We introduce a novel scheme based on the idea of including moving parts into one another whenever possible. This reduces bending stresses on axles compared to previous methods. Our approach supports sliding parts and arbitrarily shaped mechanical parts in the 2D input. The exact 3D shape of the parts is inferred from the 2D input and the simulation of the mechanism, using boolean operations between shapes. The input mechanism is often simply attached to the background. We automatically synthesize a chassis by formulating a topology optimization problem, taking into account the stresses exerted by the mechanism on the chassis through time.     

A practical 2D/3D SLAM using directional patterns of an indoor structure

This paper presents a practical two-dimensional (2D)/three-dimensional (3D) simultaneous localization and mapping (SLAM) algorithm using directional features for ordinary indoor environments; this algorithm is adaptable to various conditions, computationally inexpensive, and accurate enough to use for practical applications. The proposed algorithm uses odometry acquired from other sensors or other algorithms as the initial estimate and the directional features of indoor structures as landmarks. The directional features can only correct the rotation error of the odometry. However, we show that the greater part of the translation error of the odometry can also be corrected when the directional features are detected at almost positions accurately. In that case, there is no need to use other kinds of features to correct translation error. The directions of indoor structures have two advantages as landmarks. First, the extraction of them is not affected by obstacles. Second, the number of them is small regardless of the size of the building. Because of these advantages, the proposed SLAM algorithm shows robustness for parameters and lightweight properties. From extensive experiments with 2D/3D datasets taken from different buildings, we show the practicality of the proposed algorithm. We also demonstrate that the 2D algorithm runs in real time on a low-end smartphone.     

All to-all communication with minimum start-up costs in 2D/3D toriand meshes

All-to-all communication patterns occur in many important parallel algorithms. This paper presents new algorithms for all-to-all communication patterns (all-to-all broadcast and all-to-all personalized exchange) for wormhole switched 2D/3D torus- and mesh-connected multiprocessors. The algorithms use message combining to minimize message start-ups at the expense of larger message sizes. The unique feature of these algorithms is that they are the first algorithms that we know of that operate in a bottom-up fashion rather than a recursive, top-down manner. For a 2^d×2^d torus or mesh, the algorithms for all-to-all personalized exchange have time complexity of O(2^3d). An important property of the algorithms is the O(d) time due to message start-ups, compared with O(2^d) for current algorithms. This is particularly important for modern parallel architectures where the start-up cost of message transmissions still dominates, except for very large block sizes. Finally, the 2D algorithms for all-to-all personalized exchange are extended to O(2^4d) algorithms in a 2^d×2^d×2^d3D torus or mesh. These algorithms also retain the important property of O(d) time due to message start-ups     

All-To-All Personalized Communication in Wormhole-Routed 2D/3D Meshes and Multidimensional Interconnection Networks

2004.29计算机工程与应用1INTRODUCTIONInamessage-passingmulti-computernetwork,processorsoftenneedtocommunicatewitheachotherforvariousrea-sons,suchasloadbalancing,eventsynchronization,anddataexchange.Basedonthenumberofsendingandreceivingpro-cessors,thesecommunicationscanbeclassifiedintocommuni-cationpatternssuchasone-to-one(unicast),one-to-many(multicast),one-to-all(broadcast),andall-to-all.Thenatureofthemessagetobesentcanbeclassifiedaspersonalizedornon-personalized.Theall-to-allpersonalized…     

Bandwidth-optimal complete exchange on wormhole-routed 2D/3D torusnetworks: a diagonal-propagation approach

All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. Several complete exchange algorithms have been proposed in the literature for wormhole meshes. However, these algorithms, when applied to tori, cannot take advantage of wrap-around interconnections to implement complete exchange with reduced latency. In this paper, a new diagonal-propagation approach is proposed to develop a set of complete exchange algorithms for 2D and 3D tori. This approach exploits the symmetric interconnections of tori and allows to develop a communication schedule consisting of several contention-free phases. These algorithms are indirect in nature and they use message combining to reduce the number of phases (message start-ups). It is shown that these algorithms effectively use the bisection bandwidth of a torus which is twice that for an equal sized mesh, to achieve complete exchange in time which is almost half of the best known complete exchange time on an equal sized mesh. The effectiveness of these algorithms is verified through simulation studies for varying system and technological parameters. It is also demonstrated that synchronous implementations of these algorithms (by introducing barriers between phases) lead to reduced latency for complete exchange with large messages, while the asynchronous ones are better for smaller messages     

一种无缝集成的二三维联动WebGIS设计及实现

传统二维GIS具有强大的空间查询、分析功能,而三维GIS具有很好的空间直观显示性。实现二三维GIS的联动与互操作,可以充分发挥二三维GIS各自的优点。本文提出了一种有效可行的解决方案,实现了具有实时联动漫游、缩放和信息标注等功能的WebGIS二三维联动系统。