机器视觉油炸鱼豆腐外观缺陷识别与剔除系统

设计了外观缺陷识别与剔除试验系统,利用产品图像的颜色特征和形状特征,可实现油炸鱼豆腐外观质量的在线检测、识别与自动剔除.在产品外观颜色检测中利用RGB颜色空间中的B分量阈值作为特征;在产品外形缺陷检测中采用目标面积和边缘形状矩形度实现特征识别.经排序机构将产品有序排列后,根据各列缺陷识别结果,由单片机控制剔除装置完成相应动作,剔除不合格品.实验表明:该试验系统可有效完成油炸鱼豆腐产品的在线外观检测及残次品的剔除,提升生产线成套装备的技术水平.     

蔬菜穴盘健壮苗识别系统设计与试验

蔬菜工厂化育苗过程中,由于种子质量和育苗环境等条件制约造成的弱质苗问题,本文利用机构学、机器视觉、可编程逻辑控制(PLC)等技术,设计了一种蔬菜穴盘健壮苗识别系统。系统主要由穴盘输送机构、图像采集装置、检测与固定装置钵苗分拣剔除机构、自动控制系统和机架等组成。通过激光传感器获取各部件动作信息,实现各执行部件控制时序。基于机器视觉,利用上位机进行健壮苗判别。结合PLC串口通信技术,指示系统进行健壮苗识别与弱质苗剔除工作。试验结果表明:系统可实现穴盘健壮苗自动识别与弱质苗自动剔除,健壮苗识别成功率达到81.0%以上,弱质苗剔除成功率达到75.0%以上。     

纺纱锭子组合系统动特性研究

对纺纱锭子组合系统的动特性进行研究,采用传递矩阵法及导纳法编制了计算程序,分别对锭子在空锭、带筒管但筒管上无纱线、带筒管且带筒管上有满卷纱线三种状态下的第一阶、二阶临界转速和振型进行了分析计算.     

錠子的臨界速度

錠子临界速度的计算,有其实用上的意义。本文应用庫舒尔方法以计算国产錠子的临界速度。此法能用以計算多支承配有机件的多级軸的任何階临界速度达到一定的准确度,故用以计算錠子的临界速度,甚称适合。此项计算方法为数值计算法,累试进行,故在計算时曾使用半自动式电动計算机,以期间捷。本文首先把理论扼要地加以叙述,继为计算,计算部分中,最初計算空錠杆的第一和第二临界速度,然后计算加有满纱筒管錠杆的第一和第二临界速度,再計算仅加空筒管錠杆的第一和第二临界速度,最后并自考虑筒管的柔性出发,計算錠子的临界速度,作一比较。本文最后,根据計算结果,略加討論,并作相当的结论。     

面向快递分拣的二维码定位与校正方法

为了提高快递分拣系统的效率和自动化程度,提出将二维码技术应用到快递分拣系统中。但由于快递分拣环节中的快件位置随机性和流通环节中的快件表面磨损等因素,影响着二维码识别准确性。为此,提出利用二维码结构特性实现快递单二维码的定位,以加快识别速度,并针对上述问题造成的二维码畸变和磨损情况,提出了一种基于改进Canny算法的二维码畸变校正方法,实现快递单二维码图像的畸变校正以提高快递分拣识别率。实验表明,定位方法定位准确率为92%且计算速度快;畸变校正方法可以改善快递分拣中因二维码畸变导致的识别率低的问题。     

基于自适应颜色快速点特征直方图的托盘识别方法

托盘识别是无人驾驶工业车辆进行货物搬运的关键技术之一.针对现有托盘识别方法低效耗时、鲁棒性差、参数选择随意的缺点，提出了一种基于自适应颜色快速点特征直方图的托盘识别方法.该方法使用Kinect V2传感器采集包含托盘的场景点云数据，点云经离群点剔除后，基于邻域特征熵函数最小准则获取每个点的最优邻域半径.提取点云关键点，计算关键点的颜色特征和自适应邻域快速点特征直方图，融合成自适应颜色快速点特征直方图，进行特征匹配与误匹配点对剔除，从而实现托盘识别.与固定邻域半径为0.012 m的快速点特征直方图对比，实验结果表明：基于自适应颜色快速点特征直方图的托盘识别精度提高了83.74%,特征提取用时减少了35.55%,验证了方法的优越性.     

基于视觉的并联机器人智能分拣系统设计与实现

针对传统工业机器人无法满足复杂分拣环境下作业要求的问题,设计基于视觉的并联机器人智能分拣系统.以Delta并联机器人、CMOS相机为硬件基础,运用固定阈值和轮廓提取等方法对图像进行预处理,求解出所观察目标的空间位姿,通过Hu矩匹配法对工件进行识别匹配,提高并联机器人对环境的认知能力和智能性.系统测试结果表明,该控制系统运行可靠,搭建的智能分拣系统能够快速识别分拣工件种类,且抓取准确率高、速度快,拓宽了并联机器人的应用领域.     

基于正则表达式融合语义的农产品自动识别方法

针对同一条传送带上不同类别农产品自动分拣识别率低的问题,根据应用场景下轮廓、颜色和空间相对位置等物理特征不变,以及不同农产品会产生不同振动波的特征,通过建立基于颜色、线条、位置、振动等信息的特征元素库,利用正则表达式的语义规则,对基础特征元素进行先验知识的有序组织,赋予它们描述不同农产品匹配特征的能力,从而快速构建出不同农产品的匹配模型,缩短分拣过程中农产品目标模型生成时间,同时由于融合了振动特征,使得外形相似农产品的识别准确率得到较大提升.试验结果表明:基于正则表达式融合语义特征提取的农产品识别方法能够快速、准确识别各类农产品,从而实现自动分拣的目的,在固定视角下其识别率为92.5%,平均识别时间为50.3 ms,相较传统的尺度不变特征变换(SIFT)和加速鲁莽特征(SURF)算法,本算法在固定视角下的分拣精度和分拣效率均有所提高.     

基于YOLO v3的自动餐具分拣检测

当今餐饮行业中餐具的使用愈发频繁,而现有的人工餐具分拣方法效率低、安全性差且成本过高.为此,设计了一套基于YOLO v3的自动餐具分拣系统,包括硬件数据采集、图像识别及分拣执行三部分.其中,基于机器视觉的采集系统利用摄像头将餐具图像传入计算机,并在摄像头背面配上小夜视灯以实现补光.再引入Gamma校正进行图像预处理,同时基于YOLO v3实现对餐具的识别与定位.最后通过串口传递信息以控制机械臂实现分拣.实验结果表明,利用YOLO v3能够达到较好的餐具检测效果.     

基于点对特征的无序散乱堆叠工件位姿估计算法

针对无序分拣场景中物体相互堆叠遮挡导致的位姿估计误差大的问题,本文提出了一种基于点对特征(point pair feature, PPF)的杂乱堆叠工件位姿估计算法。离线训练阶段,使用更优的点云降采样方案和更为细致的点云法线计算方式,以保留更多具有区分性的点对,实现模型更为精确的全局描述;在线匹配阶段,通过快速投票方案获得杂乱堆叠场景中目标的候选位姿,并提出了一种基于体素索引和位姿交并比的聚类策略完成位姿聚类和误匹配位姿的剔除,实现目标位姿的粗估计,最后采用ICP (iterative closest points)算法完成目标位姿的优化,获得目标的精确的6D位姿。分别进行了仿真场景实验和机械臂分拣实验,结果表明,提出的算法在杂乱场景中对3种类型工件的平均识别率为98.4%,单个工件识别时间均小于0.86s,且位姿估计精度较原始PPF算法有明显提升;在实际分拣实验中识别成功率达96.7%,分拣成功率达95.3%,验证了算法在实际应用中对于噪声和杂乱遮挡的鲁棒性较强。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.