LabVIEW应用于实时图像采集及处理系统

本文在LabVIEW和NI-IMAQ Vision软件平台下,利用通用图像采集卡开发一种图像实时采集处理虚拟仪器系统。通过调用动态链接库驱动通用图像采集卡完成图像采集,采集图像的帧速率达到25帧每秒。利用NI-IMAQ Vision视频处理模块,进行图像处理,以完成光电探测器的标定。该系统具有灵活性强、可靠性高、性价比高等优点。     

基于labview的触摸式显示板自动检测系统的设计与实现

该文设计的自动检测系统,用来检测家电产品中广泛使用的触摸式显示板。它采用了Labview作为开发平台,配合NIPCI-6519数据采集卡和通讯卡等硬件设备,实现触摸式显示板的功能测试。系统中对图像的检测用到了IMAQ Vision图像处理模块,利用模板匹配函数匹配特征量,来判断图像是否有缺陷;声音检测是实现了一种基于模板匹配的语音识别算法,提取出声音的特征量,然后与模板作比较。该系统运行效果良好,工作稳定,出错率较低。     

基于多尺度残差神经网络的葡萄叶片病害识别

葡萄叶片不同程度的病害具有一定的相似性,目前对于葡萄叶片病害的识别多为病害种类识别,对不同程度病害识别的研究较少,且传统识别方法对于不同程度病害识别准确率较低。提出一种基于多尺度残差神经网络（Multi-Scale ResNet）的葡萄叶片病害识别方法。对葡萄叶片病害图像进行数据增强与叶片区域标注后,使用Mask R-CNN提取葡萄叶片部位,通过引入多尺度卷积以改变ResNet底层对不同尺度特征的响应,利用加入的SENet提升网络的特征提取能力,并将图像输入Multi-Scale ResNet中进行识别。实验结果表明,该方法的平均识别准确率达到90.83%,相比ResNet18提高了2.87个百分点。     

基于虚拟仪器的光学引伸计

在LabVIEW和NI-IMAQ Vision的软件平台下,利用通用图像采集设备开发了一种新型视频引伸计系统。通过调用动态链接库驱动图像采集设备DH-HV-1303UM进行图像采集,并通过NI-IMAQ Vision完成了图像处理及基于灰度重心的视频引伸计的开发。该系统具有灵活性强、可靠性高、性价比高等优点。     

基于LabVIEW和IMAQ Vision的目标统计系统

为了提高目标统计的速度和准确度,提出了一个基于LabVIEW（laboratory virtual instrument engineering workbench）和IMAQ（image acquisition）Vision软件包的目标统计系统。其基本思想是首先对采集到的目标图像二值化,然后依次利用移除小目标、腐蚀以及分离目标模块将图像中的粘连目标分离,并尽可能保留残缺目标细节,最后通过统计模块实现目标数量统计。实验结果表明该目标数量统计系统具有较好的实时性和准确性。     

基于LabVIEW的机器视觉在玻璃缺陷检测中的运用

针对近年来玻璃质量要求的不断提高,以机器视觉技术为基础,建立了基于机器视觉的玻璃缺陷检测系统,通过LabVIEW的Vision and Motion模块获取玻璃图像并进行图像处理,实现了对图像中玻璃缺陷的提取和分析,实时性显著,可视化效果好。     

LKJ-15C主机软件半实物自动化测试系统设计

为克服LKJ-15C型列车运行监控系统(简称"LKJ-15C")主机软件人工测试中存在的工作量大、效率低和测试过程不易复现的问题,文章提出了一套基于半实物仿真技术和测试脚本技术的自动化测试系统.该自动化测试系统由PXI主机模块、信号调理模块、以太网交换机、电源模块及计算机操作模块构成;系统软件包括测试脚本开发模块、测试...     

基于机器视觉技术的压缩机编码识别系统设计

应用IMAQ Vision工具包和LabVIEW开发了压缩机编码识别机器视觉系统.介绍了系统的结构,讨论了编码图像处理和OCR的方法.测试结果表明,系统具有良好的性能.     

基于HOG的酿酒葡萄叶检测

在酿酒葡萄生长状态与病虫害自动监测中,需要在图像中检测出葡萄叶片,通过提取葡萄叶片图像的方向梯度直方图（HOG）特征投入到支持向量机（SVM）分类器中以实现对葡萄叶片的识别;结合多尺度目标定位和均值漂移算法还可以自动确定图像中葡萄叶片的位置。实验结果表明,使用线性核函数训练后的分类器对葡萄叶片和四种常见杂草的识别率达95.5%。该方法对光照和环境变化有较好的鲁棒性,自然条件下成像的叶片图像的葡萄叶片检出率达到了80%以上。     

基于叶片形态特征的葡萄品种自动识别

葡萄在全世界种植范围较广,葡萄品种识别对葡萄资源统计、新品种鉴定及遗传资源保护都有重要意义。以成熟叶片为基本材料,不变矩、面积、周长、主叶脉长度和叶柄长度等11维特征向量为基础数据,采用叶片特征选择、图像处理、特征值提取、建立分类模型等方法,运用国际葡萄与葡萄酒组织形态分类方法和改进的欧式距离等技术开发一个基于葡萄叶片数字图像的葡萄品种自动识别软件。共测试17种酿酒和3种野生葡萄,识别率达87%。该方法具有自动化、识别速度快、花费低、省时省力等特点,可应用于葡萄病虫害的识别、杂交新品种双亲的判定等。     

A technique for monitoring SO2 in combustion exhausts: Use of a non-Nernstian sensing element in combination with an upstream catalytic filter

Detection of sulfur dioxide (SO₂) at high temperature (600–750 °C) in the presence of some interferents found in combustion exhausts (NO₂, NO, CO₂, CO, and hydrocarbon (C₃H₆)) is described. The detection scheme involves use of a catalytic filter in front of a non-Nernstian (mixed-potential) sensing element. The catalytic filter was a Ni:Cr powder bed operating at 850 °C, and the sensing elements were pairs of platinum (Pt) and oxide (Ba-promoted copper chromite ((Ba,Cu)_xCr_yO_z) or Sr-modified lanthanum ferrite (LSF)) electrodes on yttria-stabilized zirconia. The Ni:Cr powder bed was capable of reducing the sensing element response to NO₂, NO, CO, and C₃H₆, but the presence of NO₂ or NO (“NO_x”, at 100 ppm by volume) still interfered with the SO₂ response of the Pt–(Ba,Cu)_xCr_yO_z sensing element at 600 °C, causing approximately a 7 mV (20%) reduction in the response to 120 ppm SO₂ and a response equivalent to about 20 ppm SO₂ in the absence of SO₂. The Pt–LSF sensing element, operated at 750 °C, did not suffer from this NO_x interference but at the cost of a reduced SO₂ response magnitude (120 ppm SO₂ yielded 10 mV, in contrast to 30 mV for the Pt-(Ba,Cu)_xCr_yO_z sensing element). The powder bed and Pt–LSF sensing element were operated continuously over approximately 350 h, and the response to SO₂ drifted downward by about 7%, with most of this change occurring during the initial 100 h of operation.     

Influence of doping BiYO3 and Nb2O5 on PTCR characteristics of BaTiO3 thermistor ceramics

Nb₂O₅-doped (1 − x)Ba_0.96Ca_0.04TiO₃-xBiYO₃ (where x = 0.01, 0.02, 0.03 and 0.04) lead-free PTC thermistor ceramics were prepared by a conventional solid state reaction method. X-ray diffraction, scanning electron microscope, Agilent E4980A and resistivity-temperature measurement instrument, were used to characteristic the lattice distortion, microstructure, temperature dependence of permittivity and resitivity-temperature dependence. It was revealed that the tetragonality c/a of the perovskite lattice, the microstructure and the Curie temperature changed with the BiYO₃ content. In order to decrease the room temperature resistivity, the effect of Nb₂O₅ on the room temperature resistivity was also studied, and its optimal doping content was finally chosen as 0.2 mol%. The 0.97Ba_0.96Ca_0.04TiO₃-0.03BiYO₃-0.002Nb₂O₅ thermistor ceramic exhibited a low ρ_RT of 3.98 × 10³ Ω cm, a typical PTCR effect of ρ_max/ρ_min > 10³ and a T_c of 153 °C.     

UNIQUENESS CONDITIONS OF CL-STRUCTURES IN GL-STRUCTURE EQUIVALENCE CLASSES OF SYSTEM RECONSTRUCTABILITY ANALYSIS

This paper first introduces the basic notions of overall systems with logical relations, their subsystems, structure representation graphs, sets of H-structures and G-structures with logical relations S _H ^L and S _G ^L, immediate refinement and aggregate with logical relations, structure-graph mappings r_V ^L, r_G ^L, etc., and the notions of inclusiveness with logical relations, upper bounding and lower bounding with logical relations. Then it proves the sufficient conditions under which representation graphs R ^L form a lattice. By defining the least upper bound and largest lower bound of (R^L, ) and recommending a lemma on distributivity, this paper proves the sufficient conditions under which G-structures with logical relations form Boolean lattices. Finally after defining the M-structures and C-structures with logical relations, i.e. M-structures and C-structures, this paper proposes the sufficient conditions for the uniqueness of C-structures in G-structure equivalence classes, and proves that the C ^L-structure is the least refined GL-structure in equivalence class S _G ^L/r _G ^L.     

Fast modular exponentiation of large numbers with large exponents

In many problems, modular exponentiation |x^b|_m is a basic computation, often responsible for the overall time performance, as in some cryptosystems, since its implementation requires a large number of multiplications.It is known that |x^b|_m=|x^|b|_(m)|_m for any x in [1,m−1] if m is prime; in this case the number of multiplications depends on (m) instead of depending on b. It was also stated that previous relation holds in the case m=pq, with p and q prime; this case occurs in the RSA method.In this paper it is proved that such a relation holds in general for any x in [1,m−1] when m is a product of any number n of distinct primes and that it does not hold in the other cases for the whole range [1,m−1].Moreover, a general method is given to compute |x^b|_m without any hypothesis on m, for any x in [1,m−1], with a number of modular multiplications not exceeding those required when m is a product of primes.Next, it is shown that representing x in a residue number system (RNS) with proper moduli m_i allows to compute |x^b|_m by n modular exponentiations |x_i^b|_mi in parallel and, in turn, to replace b by |b|_(mi) in the worst case, thus executing a very low number of multiplications, namely log₂m_i for each residue digit.A general architecture is also proposed and evaluated, as a possible implementation of the proposed method for the modular exponentiation.     

Forest carbon densities and uncertainties from Lidar, QuickBird, and field measurements in California

Greenhouse gas inventories and emissions reduction programs require robust methods to quantify carbon sequestration in forests. We compare forest carbon estimates from Light Detection and Ranging (Lidar) data and QuickBird high-resolution satellite images, calibrated and validated by field measurements of individual trees. We conducted the tests at two sites in California: (1) 59 km² of secondary and old-growth coast redwood (Sequoia sempervirens) forest (Garcia-Mailliard area) and (2) 58 km² of old-growth Sierra Nevada forest (North Yuba area). Regression of aboveground live tree carbon density, calculated from field measurements, against Lidar height metrics and against QuickBird-derived tree crown diameter generated equations of carbon density as a function of the remote sensing parameters. Employing Monte Carlo methods, we quantified uncertainties of forest carbon estimates from uncertainties in field measurements, remote sensing accuracy, biomass regression equations, and spatial autocorrelation. Validation of QuickBird crown diameters against field measurements of the same trees showed significant correlation (r = 0.82, P < 0.05). Comparison of stand-level Lidar height metrics with field-derived Lorey's mean height showed significant correlation (Garcia-Mailliard r = 0.94, P < 0.0001; North Yuba R = 0.89, P < 0.0001). Field measurements of five aboveground carbon pools (live trees, dead trees, shrubs, coarse woody debris, and litter) yielded aboveground carbon densities (mean ± standard error without Monte Carlo) as high as 320 ± 35 Mg ha^− 1 (old-growth coast redwood) and 510 ± 120 Mg ha^− 1 (red fir [Abies magnifica] forest), as great or greater than tropical rainforest. Lidar and QuickBird detected aboveground carbon in live trees, 70-97% of the total. Large sample sizes in the Monte Carlo analyses of remote sensing data generated low estimates of uncertainty. Lidar showed lower uncertainty and higher accuracy than QuickBird, due to high correlation of biomass to height and undercounting of trees by the crown detection algorithm. Lidar achieved uncertainties of < 1%, providing estimates of aboveground live tree carbon density (mean ± 95% confidence interval with Monte Carlo) of 82 ± 0.7 Mg ha^− 1 in Garcia-Mailliard and 140 ± 0.9 Mg ha^− 1 in North Yuba. The method that we tested, combining field measurements, Lidar, and Monte Carlo, can produce robust wall-to-wall spatial data on forest carbon.     

Restricted arc-connectivity of digraphs

Since interconnection networks are often modeled by graphs or digraphs, the edge-connectivity of a graph or arc-connectivity of a digraph are important measurements for fault tolerance of networks.The restricted edge-connectivity λ^′(G) of a graph G is the minimum cardinality over all edge-cuts S in a graph G such that there are no isolated vertices in G−S. A connected graph G is called λ^′-connected, if λ^′(G) exists.In 1988, Esfahanian and Hakimi [A.H. Esfahanian, S.L. Hakimi, On computing a conditional edge-connectivity of a graph, Inform. Process. Lett. 27 (1988), 195-199] have shown that each connected graph G of order n?4, except a star, is λ^′-connected and satisfies λ^′(G)?ξ(G), where ξ(G) is the minimum edge-degree of G.If D is a strongly connected digraph, then we call in this paper an arc set S a restricted arc-cut of D if D−S has a non-trivial strong component D₁ such that D−V(D₁) contains an arc. The restricted arc-connectivity λ^′(D) is the minimum cardinality over all restricted arc-cuts S.We observe that the recognition problem, whether λ^′(D) exists for a strongly connected digraph D is solvable in polynomial time. Furthermore, we present some analogous results to the above mentioned theorem of Esfahanian and Hakimi for digraphs, and we show that this theorem follows easily from one of our results.     

d-Dimensional Range Search on Multicomputers

The range tree is a fundamental data structure for multidimensional point sets, and, as such, is central in a wide range of geometric and database applications. In this paper we describe the first nontrivial adaptation of range trees to the parallel distributed memory setting (BSP-like models). Given a set of n points in d -dimensional Cartesian space, we show how to construct on a coarse-grained multicomputer a distributed range tree T in time O( s / p + T _c (s,p)) , where s = n log ^d-1 n is the size of the sequential data structure and T _c (s,p) is the time to perform an h -relation with h=Θ (s/p) . We then show how T can be used to answer a given set Q of m=O(n) range queries in time O((s log m)/p + T _c (s,p)) and O((s log m)/p + T _c (s,p) + k/p) , where k is the number of results to be reported. These parallel construction and search algorithms are both highly efficient, in that their running times are the sequential time divided by the number of processors, plus a constant number of parallel communication rounds. Received June 1, 1997; revised March 10, 1998.     

Thermodynamic description of the Al–Fe–Zr system

The Fe–Zr and Al–Fe–Zr systems were critically assessed by means of the CALPHAD technique. The solution phases, liquid, face-centered cubic, body-centered cubic and hexagonal close-packed, were described by the substitutional solution model. The compounds with homogeneity ranges, hex.- Fe₂Zr, Fe₂Zr, FeZr₂ and FeZr₃ in the Fe–Zr system, were described by the two-sublattice model in formulas such as hex.- Fe₂(Fe,Zr), (Fe,Zr)₂(Fe,Zr), (Fe,Zr)Zr₂ and (Fe,Zr)(Fe,Zr)₃ respectively. The compounds Al_mZr_n except Al₂Zr in the Al–Zr system were treated as line compounds (Al,Fe)_mZr_n in the Al–Fe–Zr system. The compounds FeZr₂ and FeZr₃ in the Fe–Zr system were treated as (Al,Fe,Zr)Zr₂ and (Al,Fe,Zr)(Fe,Zr)₃ in the Al–Fe–Zr system, respectively. All compounds in the Al–Fe system and hex.- Fe₂Zr in the Fe–Zr system have no solubilities of the third components Zr or Al, respectively, in the Al–Fe–Zr system. The ternary compounds _λ1${\lambda }_1$ with C14 structure and _λ2${\lambda }_2$ with C15 structure in the Al–Fe–Zr system were treated as _λ1${\lambda }_1$- (Al,Fe,Zr)₂(Fe,Zr) with Al₂Zr in the Al–Zr system and _λ2${\lambda }_2$- (Al,Fe,Zr)₂(Fe,Zr) with Fe₂Zr in the Fe–Zr system, respectively. And the ternary compounds _τ1${\tau }_1$, _τ2${\tau }_2$ and _τ3${\tau }_3$ in the Al–Fe–Zr system were treated as (Al,Fe)₁₂Zr, Fe(Al,Zr)₂Zr₆ and Fe₇Al₆₇Zr₂₆, respectively. A set of self-consistent thermodynamic parameters of the Al–Fe–Zr system was obtained.