A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.     

针对不同地质目标的叠前时间偏移成像解释评价

随着计算机硬件和地震勘探成像技术的发展，叠前时间偏移正逐步替代常规的NMO加DMO加叠后时间偏移成为地震数据成像处理方法的主流。但对于不同的地质目标，叠前时间偏移的成像效果是否优于常规NMO加DMO加叠后时间偏移的成像效果呢？为此，从地震数据成像处理方法、处理流程和处理参数等方面进行了讨论，并基于某地区三维数据常规处理结果和叠前时间偏移处理结果，针对不同地质目标进行了剖析与评价。认为：叠前时间偏移成像的垂向分辨率较常规处理明显降低，但对于空间波阻抗变化明显的河流和断层，叠前时间偏移成像的空间分辨率要高于常规处理；对于小于1／4波长的叠置薄储层，叠前时间偏移成像的垂向和空间分辨率低于常规处理结果。     

VFP环境下报表设计研究

Visual FoxPro是小型数据库应用系统开发工具,而报表设计是数据库应用系统开发的一个重要组成部分,直接决定系统的输出是否能够满足用户的需要。为此详细研究了报表设计方法,结合Microsoft的OLE技术,引入面向对象方法,提出了一种新的报表设计方法。实践应用证明,该方法非常适合设计复杂的报表。     

某雷达数据处理有关问题分析

对某雷达数据处理应用中存在的一些特殊问题进行讨论分析,并就具体问题提出了解决的方法.     

An object replication algorithm for real-time distributed databases

A real-time distributed database system (RTDDBS) must maintain the consistency constraints of objects and must also guarantee the time constraints imposed by each request arriving at the system. Such a time constraint of a request is usually defined as a deadline period, which means that the request must be serviced on or before its time constraint. Servicing these requests may incur I/O costs, control-message transferring costs or data-message transferring costs. As a result, in our work, we first present a mathematical model that considers all these costs. Using this cost model, our objective is to service all the requests on or before their respective deadline periods and minimize the total servicing cost. To this end, from theoretical standpoint, we design a dynamic object replication algorithm, referred to as Real-time distributed dynamic Window Mechanism (RDDWM), that adapts to the random patterns of read-write requests. Using competitive analysis, from practical perspective, we study the performance of RDDWM algorithm under two different extreme conditions, i.e., when the deadline period of each request is sufficiently long and when the deadline period of each request is very short. Several illustrative examples are provided for the ease of understanding. Recommended by: Ashfaq Khokhar     

基于USB总线的虚拟频谱分析仪设计

文章详细介绍了基于USB总线的虚拟频谱分析仪的设计过程。该仪器使用嵌入式混合处理器MC56F8323来实现动态信号的实时采集、频谱分析和数字滤波等功能。处理结果由USB2．0接口芯片CY7C68013上传至PC机．以完成数据显示、存储、绘制图形等功能。其中，CY7C68013工作于Slave FIFO模式，以实现与MC56F8323间的数据传输。该系统可同时对两路动态信号进行实时谱分析，每路采样频率高选500kHz。     

用DSP实现多目标实时跟踪

介绍了在 TMS3 2 0 C62 0 3上实现 4个目标的快速跟踪技术。为了提高实时性和精确度 ,采用线性汇编优化实现。1个 3 2 0× 160主窗口的 DSP平均处理时间为 2 m s,3个 60× 60副窗口的 DSP平均处理时间各为 0 .4ms,实现了复杂背景下低对比度目标的快速跟踪。实验结果证明跟踪效果良好 ,解决了以前窗口开不大、跟踪速度慢的问题     

Estimating crystallinity in high density polyethylene fibers using online Raman spectroscopy

Online Raman spectra, obtained at different points along the spin line during pilot‐scale nonisothermal melt spinning of high density polyethylene (HDPE) fibers, are presented for the first time. The fraction of the crystalline phase corresponding to each spectrum was determined from the normalized integrated intensity of the 1418 cm^?1 Raman band. It is well established that this band represents the orthorhombic crystalline phase in polyethylene. The estimates of percent crystallinity obtained from decomposition of the Raman spectrum were compared with the percent crystallinity from differential scanning calorimetry (DSC) measurements. It is concluded that online Raman spectroscopy can be successfully used to monitor the development of crystallinity in HDPE fibers as a function of distance from the spinneret. © 2003 Wiley Periodicals, Inc. J Appl Polym Sci 88: 545–549, 2003     

信息处理过程中的分类技术

文章主要叙述了信息处理过程中的分类技术，该技术在石油化工生产过程的优化控制中，为信息的正确识别和处理起了相当关键的作用。     

基于TS101的PCI接口高速数据采集系统的设计

给出了基于TS101和PCI的双通道数据采集处理系统的设计方案。首先介绍了ADI公司新型数字信号处理(DSP)微处理器TS101和FLYBY数据传输模式,阐述了系统结构和工作原理,最后对如何利用TS101的FLYBY接口提高数据采集、存取效率和数据系统的逻辑控制进行了详细的论述。