HTML5图形图像处理技术研究

图形图像处理平台大部分是传统的C/S架构的桌面应用程序,维护困难,共享性差,而B/S架构的Web程序具有易维护、易共享的优点。本文研究了基于HTML5的Web图形图像处理技术,用HTML5实现了一个Web图形图像处理程序,并通过理论分析和实验得出:HTML5在Web图形图像处理上具有优势,存在基于HTML5实现Web处理图形图像的可能性。     

基于HTML5的微信游戏设计

随着互联网和Web技术的迅速发展,HTML5规范作为下一代Web应用开发的新标准被W3C和大多数世界主流的互联网公司所支持并推荐.HTML5拥有很多备受关注的新特性,同时其功能也在不断细化和完善并且趋于稳定.其中canvas的引入,使HTML5可以动态的生成各种图形、图表以及动画,已经完全具备游戏开发的基本条件.文中结合HTML5的canvas功能和图形面积算法介绍了《心灵感应》（一款HTML5微信小游戏）的游戏设计方案.     

一种小型标图应用系统设计

标图系统以GIS作为底图支撑应用较为广泛,但GIS底层开发比较复杂,编程初学者不易上手.从图形应用系统的基本原理出发,以简单的图片处理代替复杂的图形应用,设计和实现了一个既有图形处理功能又有标绘功能的教学实践程序.     

MapX在VC++中集成实现军用标图系统的研究

为适应军队信息化发展的要求,开发一个C^3I系统,首先要解决的问题就是开发一套适用于军事应用的标图系统。本文分析了GIS组件——MapX的特性,阐述了将MapX集成于VC 6．0中绘制军用图形的基本方法,并给出了实现军用标图系统的一种解决方案。     

基于HTML5技术的微商城设计与实现

基于HTML5的简洁、高效和良好的图形性能等新特征,越来越多的Web应用开发商使用HTML5技术进行Web移动端的开发和设计。通过对微商城的建设,采用HTML5技术实现海油电商平台推广宣传、产品信息展示、用户移动端注册、订单等信息查询、在线客服等功能。     

二三维联动战场可视化系统的研究与实现

采用动态分页调度算法结合LOD技术实现了海量三维地形数据的加载与显示,研究三维军标绘制技术,提出了一种基于可视范围动态计算投影区域的方法,解决了三维线、面标号纹理模糊不清问题。采用MVC设计模式搭建二三维联动战场可视化系统框架,实现了二三维在视域范围、态势标号、地理信息查询之间的联动。     

基于HTML5和WebGL的3DWebGIS构建与实现

提出了一套基于HTML5与网络图形库WebGL的三维WebGIS构建方案,该方案采用JSON格式对数据进行组织,通过AJAx技术进行数据传输,利用HTML5、WebGL技术进行三维数据展现,并构建了演示系统进行实现。结果表明：该方案具有免插件、跨平台、开放性、基于硬件加速等优点,能够在Web页面中提供良好的可交互的三维体验。     

HTML5新特性的教学方法

基于HTML5技术的网页和应用具有很好的移植性和可用性,用户的体验也非常友好,非常适合用于移动应用程序和游戏开发中,代表了移动互联网的发展趋势。本文总结归纳了HTML5的新特性,通过比较教学的方法讲述HTML5与传统的HTML的差异性,让学生在强烈的对比中学会HTML5的新特性并掌握新特性的使用方法。同时,在课堂上结合W3School TIY平台的演示效果,加深学生对所学知识的理解。最后,结合科学的课程设计,让学生在实操的过程中真正掌握HTML5的应用与开发技能。     

浅谈下一代Web开发标准的核心技术—HTML5

HTML5是近十几年来Web开发标准巨大的飞跃.HTML5为了更好的处理今天的互联网的应用,添加了很多新元素和功能,比如:图形的绘制;视频、音频、图像,以及同电脑的交互都被标准化.文章介绍了HTML5的新特性和技术,分析HTML5与现有主流技术的关系,研究了HTML5技术的局限性及发展前景.     

基于HTML 5的校园网应用系统的探讨

作为下一代Web应用标准的HTML 5,更加注重Web应用和表现及在移动Web平台良好的用户体验。HTML 5的浏览器/服务器的开发模式、对多媒体标签功能的支持以及在移动应用跨平台性等优势,对基于传统技术的校园网应用系统来说,在开发和使用中都有了很大改进。通过对HTML 5新特性和在校园应用系统优势的分析,旨在为校园网应用系统的开发提供新思路。     

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.     

结合三维几何形状信息和二维纹理的3D目标匹配

为了实现场景中三维目标与模型之间的匹配,提出了一种结合三维几何形状信息和二维纹理的三维目标匹配方法。首先提取场景中深度图像的尺度不变特征变换(SIFT)特征,用SIFT算法与三维模型重建时所用到的一系列2.5维深度图像进行一一匹配,找到与场景中目标姿态最为相似的深度图像,提取此深度图像的三维几何形状特征与模型进行匹配,实现模型的初始化,即将模型重置到与场景目标相接近的姿态。最后用融合二维纹理信息的迭代就近点（ICP）算法实现场景中目标与模型之间的匹配,从而得到场景中三维目标的准确姿态。实验结果验证了方法的可行性与精确性。     

二维和三维矢量场的可视化

矢量场可视化用来帮助人们直观理解二维和三维矢量场。由于目前的矢量场可视化方法只能展示二维矢量场的方向而不能展示强度,并且对于三维矢量场可视化的效果不太令人满意,因此本文提出了用线积分卷积来实现二维平面矢量场可视化,以及三维空间矢量场可视化的方法。对于线积分卷积中的流线跟踪,利用扩展的Bresenham画线算法的思想,实现了二维平面和三维空间流线的跟踪,并且通过建立一个二维表和三维表来分别存储二维平面矢量场和三维空间矢量场中每个点在流线中的上一个点和下一点的位置,来避免传统流线跟踪方法的冗余计算,提高了效率。对于二维平面矢量场,把线积分卷积的结果和矢量的强度进行加权平均,从而利用输出图像的纹理和颜色,共同来表现矢量场的方向和强度。对于三维空间矢量场,利用体线积分卷积（Volume Line Integral Convolution, Volume LIC）的方法来得到输出体纹理,并且用光线投射的体渲染方法来展示三维空间矢量场。结果显示出本文的方法能够清晰直观的看到二维平面矢量场和三维空间矢量场。     

2D and 3D Optimal Parallel Image Warping

Spatial image warping is useful for image processing and graphics. In this paper, we present concurrent-read-exclusive-write (CREW) and exclusive-read-exclusive-write (EREW) parallel-random-access-machine (PRAM) algorithms that achieve O(1) asymptotic run time. The significant result is the creative processor assignment that results in an EREW PRAM algorithm. The forward algorithm calculates any nonscaling affine transform including arbitrary skewings, translations, and rotations. The EREW algorithm is the most efficient in practice, and the MasPar MP-1 with 16K processors rotates a 4-million-element image in under a second and a 2-million-element volume in one-half of a second. This high performance allows interactive viewing of volumes from arbitrary viewpoints and illustrates linear speedup. This practical efficiency is analyzed and illustrated by using a bridging model of computation. We develop the mixed cost communication machine (MCCM) to quantify the communication costs and correlate these costs to the MasPar MP-1. The forward algorithm has provable N = 1 congestion on the MCCM, while the backward algorithm has congestion N > 1 which varies with the transform. There are also important quality advantages using our direct warping techniques; empirical measurements are given to provide comparisons to multipass warps.     

Tearing mode stability in 1D and 2D

A stability code for tearing modes in 1D and 2D straight equilibria in the tokamak scaling has been developed. It finds the lowest eigenvalues of a Hermitian problem which is obtained analytically by a reduction of the full problem. The main advantage is the powerful handling of equilibria with several resonant surfaces and displaying poloidal and radial mode couplings. The code has been successfully tested by comparing it with explicitly known analytical results for external kinks.     

Information availability in 2D and 3D displays

Why are 3D displays good for rapidly appreciating the third dimension of scenes? We show that information availability is more important than the 3D display format. Participants engaged in visual search for the attributes of altitude and pitch for coding schemes. This design let us disentangle the display format and information coding scheme so that we could properly evaluate the effect of each on performance     

Holes and Genus of 2D and 3D Digital Images

"Hole" has been a confusing idea in the 3D digital literature. We replace counting holes by the clear geometrical idea of counting non-separating cuts, and show that this gives the Betti number b₁, while b₀ counts components and b₂ cavities. Connected sets with equal b₁ and b₂ must match topologically when b₁ = 0 (implying simple connectedness). When b₁ ≠ 0, contrary to digital folklore, they need not. This paper is a conceptually self-contained introduction for computer scientists to these numbers of 2D and 3D images, and to other topological features such as Euler and linking numbers.     

Lacunarity analysis of raster datasets and 1D, 2D,and 3D point patterns

Spatial scale plays an important role in many fields. As a scale-dependent measure for spatial heterogeneity, lacunarity describes the distribution of gaps within a set at multiple scales. In Earth science, environmental science, and ecology, lacunarity has been increasingly used for multiscale modeling of spatial patterns. This paper presents the development and implementation of a geographic information system (GIS) software extension for lacunarity analysis of raster datasets and 1D, 2D, and 3D point patterns. Depending on the application requirement, lacunarity analysis can be performed in two modes: global mode or local mode. The extension works for: (1) binary (1-bit) and grey-scale datasets in any raster format supported by ArcGIS and (2) 1D, 2D, and 3D point datasets as shapefiles or geodatabase feature classes. For more effective measurement of lacunarity for different patterns or processes in raster datasets, the extension allows users to define an area of interest (AOI) in four different ways, including using a polygon in an existing feature layer. Additionally, directionality can be taken into account when grey-scale datasets are used for local lacunarity analysis. The methodology and graphical user interface (GUI) are described. The application of the extension is demonstrated using both simulated and real datasets, including Brodatz texture images, a Spaceborne Imaging Radar (SIR-C) image, simulated 1D points on a drainage network, and 3D random and clustered point patterns. The options of lacunarity analysis and the effects of polyline arrangement on lacunarity of 1D points are also discussed. Results from sample data suggest that the lacunarity analysis extension can be used for efficient modeling of spatial patterns at multiple scales.