轻轨房山线跨永定河中堤工程模型试验研究

北京市轨道交通房山线稻田站—世界公园站区间跨越永定河和稻田水库,永定河中堤为砂砾石均质堤,为了防治液化进行模型试验,为工程提供依据。     

An algorithm for automatic 2D finite element mesh generation with line constraints

In this study, an algorithm is designed specifically for automatic finite element (FE) mesh generation on the transverse structure of hulls reinforced by stiffeners. Stiffeners attached to the transverse structure are considered as line constraints in the geometry boundary. For the FE mesh generation used in this study, the line constraints are treated as boundaries and by that means the geometry domain attached to the line constraints is decomposed into sub-domains, constrained only by the closed boundaries. Then, the mesh can be generated directly on those sub-domains by the traditional approach. The performance of the proposed algorithm is evaluated and the quality of the generated mesh meets expectations.     

Modeling the impact of spectral sensor configurations on the FLD retrieval accuracy of sun-induced chlorophyll fluorescence

Chlorophyll fluorescence is related to photosynthesis and can serve as a remote sensing proxy for estimating photosynthetic energy conversion and carbon uptake. Recent advances in sensor technology allow remote measurements of the sun-induced chlorophyll fluorescence signal (Fs) at leaf and canopy scale. The commonly used Fraunhofer Line Depth (FLD) principle exploits spectrally narrow atmospheric oxygen absorption bands and relates Fs to the difference of the absorption feature depth of a fluorescensing and a non-fluorescensing surface. However, due to the nature of these narrow bands, Fs retrieval results depend not only on vegetation species type or environmental conditions, but also on instrument technology and processing algorithms. Thus, an evaluation of all influencing factors and their separate quantification is required to further improve Fs retrieval and to allow a reproducible interpretation of Fs signals.Here we present a modeling study that isolates and quantifies the impacts of sensor characteristics, such as spectral sampling interval (SSI), spectral resolution (SR), signal to noise ratio (SNR), and spectral shift (SS) on the accuracy of Fs measurements in the oxygen A band centered at 760 nm (O₂-A). Modeled high resolution radiance spectra associated with known Fs were spectrally resampled, taking into consideration the various sensor properties. Fs was retrieved using the three most common FLD retrieval methods, namely the original FLD method (sFLD), the modified FLD (3FLD) and the improved FLD (iFLD). The analysis investigates parameter ranges, which are representative for field and airborne instruments currently used in Fs research (e.g., ASD FieldSpec, OceanOptics HR, AirFLEX, AISA, APEX, CASI, and MERIS).Our results show that the most important parameter affecting the retrieval accuracy is SNR, SR accounts for ≤ 40% of the error, the SSI for ≤ 12%, and SS for ≤ 7% of the error. A trade-off study revealed that high SR can partly compensate for low SNR. There is a strong interrelation between all parameters and the impact of specific parameters can compensate or amplify the influence of others. Hence, the combination of all parameters must be considered by the evaluation of sensors and their potential for Fs retrieval. In general, the standard FLD method strongly overestimates Fs, while 3FLD and iFLD provide a more accurate estimation of Fs. We conclude that technical sensor specifications and the retrieval methods cause a significant variability in retrieved Fs signals. Results are intended to be one relevant component of the total uncertainty budget of Fs retrieval and have to be considered in the interpretation of retrieved Fs signals.     

Wavelet Rasterization

We present a method for analytically calculating an anti‐aliased rasterization of arbitrary polygons or fonts bounded by Bézier curves in 2D as well as oriented triangle meshes in 3D. Our algorithm rasterizes multiple resolutions simultaneously using a hierarchical wavelet representation and is robust to degenerate inputs. We show that using the simplest wavelet, the Haar basis, is equivalent to performing a box‐filter to the rasterized image. Because we evaluate wavelet coefficients through line integrals in 2D, we are able to derive analytic solutions for polygons that have Bézier curve boundaries of any order, and we provide solutions for quadratic and cubic curves. In 3D, we compute the wavelet coefficients through analytic surface integrals over triangle meshes and show how to do so in a computationally efficient manner.     

A Complex View of Barycentric Mappings

Barycentric coordinates are very popular for interpolating data values on polyhedral domains. It has been recently shown that expressing them as complex functions has various advantages when interpolating two‐dimensional data in the plane, and in particular for holomorphic maps. We extend and generalize these results by investigating the complex representation of real‐valued barycentric coordinates, when applied to planar domains. We show how the construction for generating real‐valued barycentric coordinates from a given weight function can be applied to generating complex‐valued coordinates, thus deriving complex expressions for the classical barycentric coordinates: Wachspress, mean value, and discrete harmonic. Furthermore, we show that a complex barycentric map admits the intuitive interpretation as a complex‐weighted combination of edge‐to‐edge similarity transformations, allowing the design of “home‐made” barycentric maps with desirable properties. Thus, using the tools of complex analysis, we provide a methodology for analyzing existing barycentric mappings, as well as designing new ones.     

A Graph‐based Approach to Continuous Line Illustrations with Variable Levels of Detail

This paper introduces a method for automatically generating continuous line illustrations, drawings consisting of a single line, from a given input image. Our approach begins by inferring a graph from a set of edges extracted from the image in question and obtaining a path that traverses through all edges of the said graph. The resulting path is then subjected to a series of post‐processing operations to transform it into a continuous line drawing. Moreover, our approach allows us to manipulate the amount of detail portrayed in our line illustrations, which is particularly useful for simplifying the overall illustration while still retaining its most significant features. We also present several experimental results to demonstrate that our approach can automatically synthesize continuous line illustrations comparable to those of some contemporary artists.     

基于ZigBee的生产线监控系统的设计与实现

根据生产线的实际需要,设计并实现了用于生产线的无线信息传输网络节点,研究了系统结构,完成了系统的软硬件设计,详细分析了ZigBee组网通信、应答机制建立等关键技术。测试结果表明,系统传输距离远、可靠性高,能够满足实际应用需要。     

基于切割点的字符串与框线分离方法

本文针对表格中存在的字符与框线粘连的问题,提出了基于切割点的字符与框线分离方法,能够较好地消除字符与框线粘连给字符识别带来的不利影响。本方法已应用于银行票据识别系统中,取得了较好的效果。实践表明此方法可行、高效和实用。     

Real-time CAM-based Hough transform algorithm and its performance evaluation

Abstract. This paper proposes a highly parallel Hough transform algorithm for real-time straight-line extraction and its hardware implementation on a content-addressable memory (CAM). To achieve high-speed processing, incrementation for voting, which composes the Hough transform, and calculations for coordinate updating are carried out for the every scan line, not every edge pixel, and extracting maxima in Hough space is executed by parallel comparing. Moreover, variously weighted voting achieves more accurate line extraction in spite of the quantization error and noise in the image space. In the implementation, the CAM acts as a PE (processing-element) array that effectively performs highly parallel processing for the Hough transform and also as a memory for two-dimensional Hough space, and both voting and peak extraction are directly executed by the CAM. Evaluations of CAM hardware size, processing time and the accuracy of line extraction show that a real-time and high-resolution Hough transform for a 256256 picture can be achieved using a single CAM chip with current VLSI technology. This CAM-based Hough transform algorithm promises to be an important step towards the realization of a real-time and compact image-understanding system. Received: 15 August 1998 / Accepted: 15 March 2000