基于形态学的遮挡目标提取的区域生长法研究

采用改进的区域生长法进行红外热图中遮挡目标的提取.首先利用阈值化方法提取出一个包含全部目标信息的矩形子区域,后续处理仅针对该矩形区域进行处理.然后证明了数学形态学的膨胀梯度定理(dilation gradient theorem,DGT)及其逆定理,并利用DGT逆定理查找图像的局部极大值点,将灰度值不为0的局部极大值点作为区域生长法的种子点.接着采用阈值条件与区域灰度差相结合的生长准则,分别在各种子点八个方向进行生长.最后采用二值形态学开运算进行去毛刺处理.理论与仿真结果表明,该算法适合于红外图中遮挡目标的提取.     

遥感视频实时云检测的FPGA高效实现方法

针对目前遥感图像云检测算法及算法运行所需硬件平台复杂度高,无法进行在轨实时检测的问题,提出了一种基于FPGA的面向卫星在轨实时运行的遥感视频云检测方法.首先根据不同的遥感视频输入格式对其自适应降采样处理;其次对顺序流入的图像自适应阈值分割,然后对分割后的图像进行聚类获取云区域,进而提取每一块云区域的特征向量;最后计算整幅图像的云覆盖率和可用度,以此判断是否将图像下传.实验结果表明,在60 MHz的时钟下,且Camera Link接口每个时钟周期同时输入两个像素时,822×1096大小的遥感视频云检测速度可达132 fps,相对于传统的嵌入式双核CPU,速度提升了6～7倍.该方法可实现卫星在轨实时云检测,极大地缓解了有限的星地数传带宽和巨大的遥感数据量之间的矛盾,大幅提升遥感卫星系统应用效能,具有很强的实用价值.     

Detecting changes in high-resolution satellite coastal imagery using an image object detection approach

This article presents a spatial contrast-enhanced image object-based change detection approach (SICA) to identify changed areas using shape differences between bi-temporal high-resolution satellite images. Each image was segmented and intrinsic image objects were extracted from their hierarchic candidates by the proposed image object detection approach (IODA). Then, the dominant image object (DIO) presentation was labelled from the results of optimal segmentation. Comparing the form and the distribution of bi-temporal DIOs by using the raster overlay function, ground objects were recognized as being spatially changed where the corresponding image objects were detected as merged or split into geometric shapes. The result of typical spectrum-based change detection between two images was enhanced by using changed spatial information of image objects. The result showed that the change detection accuracies of the pixels with both attribute and shape changes were improved from 84% to 94% for the strong attribute pixel, and from 36% to 81% for the weak attribute pixel in study area. The proposed approach worked well on high-resolution satellite coastal images.     

Bresenham画圆法提取图像信息

在图像处理中, 若操作图像某区域中的像素, 必须先提取这些待处理的像素。待处理的像素区域可以是规则的, 也可能是不规则的。对于规则区域, 可采用经典的图形学算法完成选取; 对于不规则区域, 可通过适当方法将其转换为规则区域来完成选取。讨论了24位真彩色图像文件的结构、位图数据阵列中的像素与其在屏幕上显示的像素间的关系; 采用Bresenham画圆法提取图像圆形区域中的像素并将其可视化等问题。     

Sub-pixel land cover mapping for per-field classification

A method was developed to transform a soft land cover classification into hard land cover classes at the sub-pixel scale for subsequent per-field classification. First, image pixels were segmented using vector boundaries. Second, the pixel segments (ranked by area) were labelled with a land cover class (ranked by class typicality). Third, a hard per-field classification was generated by examining each polygon (representing a land cover parcel, or field) in its entirety (by grouping the fragments of the polygon contained within different image pixels) and assigning to it the modal land cover class. The accuracy of this technique was considerably higher than that of both a corresponding hard per-pixel classification and a perfield classification based on hard per-pixel classified imagery.     

一种光栅图像SVG矢量化表示的方法

本文借助于多边形图像区域表示,提出了一种将光栅图像转换为SVG表示的矢量图形方法。该方法借鉴种子生长法将光栅图像划分为若干等大小的正方形图像原子块,在原子块中寻找主块,并从主块开始利用块间的邻域关系和种子生长准则,将与主块颜色特征相近的块合并到主块所在的集合,再从这个集合中抽取能覆盖这个集合所有元素的多边形。然后对分割得到的多边形区域提取边界顶点,并对边界顶点进行优化。最后根据多边形区域的形状和颜色使用相应的SVG代码描述光栅图像。该方法采用矢量图形描述光栅图像,具有存储空间比较小、放大无锯齿、不易变形等特点。     

一种新的免疫组化图像分割算法研究

免疫组化图像自动分割在病理切片染色分析中有重要的应用价值。对大鼠肝脏免疫组化彩色图像进行深入研究,提取出新的阳性产物图像特征:所有阳性像素满足r>g>b;每个阳性像素在(r-g)、(g-b)、(r-b)三个色差分量上的均值和方差较大。以这些特征为基础,结合中值滤波,提出一种新的阳性产物自动分割算法。利用82幅图像对算法进行验证,与医生目视鉴别结果一致的约占80%。与现有算法的比较结果表明,该算法更适合低放大倍数的大鼠肝脏免疫组化彩色图像的分割,在免疫组化彩色图像的自动分析方面,做了一次有益的探索和尝试。今后还需进一步与病理专家沟通,提高识别率。     

Extraction of karyocytes and their components from microscopic bone marrow images based on regional color features

Extracting karyocytes and their components from microscopic bone marrow images is prerequisite for computer-aided early diagnosis of hemopathy. Most existing methods assume all pixels belonging to a karyon region or a cytoplasm region have similar colors. Practically, the color of neither a karyon nor a cytoplasm in a microscopic image is homogeneous in the pixel level. Therefore, the regional color features of a region are emphasized in this paper. Based on this observation, we propose a novel method to karyocyte extraction that first identifies a karyon by 4-connected block growing from a karyon feature block, then identifies feature blocks of its cytoplasm based on the extracted karyon, and finally extracts all cytoplasm regions by growing the cytoplasm feature blocks. Combining the karyon region and the corresponding cytoplasm regions can attain a complete karyocyte. Experimental results show that the proposed method is effective and robust.     

Mapping impervious surface expansion using medium-resolution satellite image time series: a case study in the Yangtze River Delta,China

Cities have been expanding rapidly worldwide, especially over the past few decades. Mapping the dynamic expansion of impervious surface in both space and time is essential for an improved understanding of the urbanization process, land-cover and land-use change, and their impacts on the environment. Landsat and other medium-resolution satellites provide the necessary spatial details and temporal frequency for mapping impervious surface expansion over the past four decades. Since the US Geological Survey opened the historical record of the Landsat image archive for free access in 2008, the decades-old bottleneck of data limitation has gone. Remote-sensing scientists are now rich with data, and the challenge is how to make best use of this precious resource. In this article, we develop an efficient algorithm to map the continuous expansion of impervious surface using a time series of four decades of medium-resolution satellite images. The algorithm is based on a supervised classification of the time-series image stack using a decision tree. Each imerpervious class represents urbanization starting in a different image. The algorithm also allows us to remove inconsistent training samples because impervious expansion is not reversible during the study period. The objective is to extract a time series of complete and consistent impervious surface maps from a corresponding times series of images collected from multiple sensors, and with a minimal amount of image preprocessing effort. The approach was tested in the lower Yangtze River Delta region, one of the fastest urban growth areas in China. Results from nearly four decades of medium-resolution satellite data from the Landsat Multispectral Scanner (MSS), Thematic Mapper (TM), Enhanced Thematic Mapper plus (ETM+) and China–Brazil Earth Resources Satellite (CBERS) show a consistent urbanization process that is consistent with economic development plans and policies. The time-series impervious spatial extent maps derived from this study agree well with an existing urban extent polygon data set that was previously developed independently. The overall mapping accuracy was estimated at about 92.5% with 3% commission error and 12% omission error for the impervious type from all images regardless of image quality and initial spatial resolution.     

基于空间聚类和边缘梯度的图像分割算法

提出一种结合空间聚类和边缘梯度信息的图像自动分割算法.在判断超像素颜色及纹理相似性的同时,进一步给出更加精确的分段边缘梯度计算方法,并采用测地距离来刻画超像素之间的相似性,使得分割结果更好地融合边缘不连续性与区域相似性.大量图像分割实验结果表明,该方法能更准确地找出分割边界,提高图像分割的准确性.     

Characteristics of the 1 km AVHRR data set for North America

The North America portion of a new global 1 km AVHRR time-series dataset was produced recently by the U.S. Geological Survey, EROS Data Center. Characteristics of the dataset were evaluated for scan-angle distribution, image area distortion as the result of map projection, distribution of high solar zenith angle, and cloud presence in image composites produced using maximum values of normalized difference vegetation index (NDVI). The evaluation showed that the compositing procedure exhibits a bias favouring off-nadir pixels, particularly at post-nadir (forward scanning) positions in the winter months. Results for scan angle distribution and image area distortion provide a basis for calculating the data's effective minimum mapping area for various geographical locations. The amount of missing data due to large solar zenith angle effect varies from 42 per cent in January to 1 per cent in July. Cloud contaminated pixels estimated for the thirty-six 10-day composites range from 7·5 per cent in May to 1·6 per cent in November. Recompositing the North America data set from 10-day cycles to monthly cycles can effectively reduce the amount of cloudy pixels in the data.     

遥感图像多尺度分割算法与矢量化算法的集成

在遥感图像处理和分析软件中,图像分割/分类和矢量化是前后独立的过程:先分割/分类,再矢量化整幅图像。由于矢量化后得到的矢量文件未写入图像对象(区域、图斑)的特征信息,只能用于显示而不能用于后续操作。此外,处理复杂图像时还存在矢量文件多边形数目与分割/分类后图像区域数目不一致的问题。为此,将多尺度分割算法与矢量化算法进行一体化集成。对遥感图像进行多尺度分割得到图像对象链表,逐个对图像对象做矢量化处理,同时把特征统计信息写入多边形属性中。集成后不仅可保证矢量多边形数目与图像对象数目完全一致,而且由于特征统计信息已作为多边形区域的属性保存在多边形中,后续的多尺度分割、区域合并、空间关系操作等均可基于矢量多边形进行。     

基于目标特征的植株深度图像修复

针对植株深度图像的像素错误和缺失、常见的滤波方法无法准确修复植株深度图 像的问题,提出一种基于目标特征的植株深度图像修复方法。首先基于颜色和空间信息的图像 分割算法对植株彩色图像进行目标分割,再检索每个目标的外轮廓,并对外轮廓进行多边形拟 合;其次,基于目标区域搜索深度图像中具有正确深度值的像素作为目标区域采样点,并对叶 片区域的图像进行归一化;最后,利用空间拟合法计算各目标区域的方程,修复区域内小面积 错误和缺失的深度值,同时采用支持向量机和空间变换运算对大面积错误和缺失深度值的叶片 区域进行修复。实验结果表明,该方法能够准确地修复植株深度图像中错误、缺失的深度数据, 且能够有效地保护目标区域的边缘信息。     

维吾尔文扫描页的倾斜校正

为了方便维文图像的切分和识别工作, 提出将基于凸多边形的最小面积外接矩形法和基线拟合法相结合的检测和校正图像方法。首先提取边缘像素生成凸多边形, 利用基于凸多边形的最小面积外接矩形法实现初步的倾斜校正, 再根据维文沿基线书写的特点, 将图像细化后采用基线拟合的方法完成维文文本的精确校正。实验结果表明, 该方法能够精确地检测出文本图像的倾斜角并校正, 是行之有效的方法。     

Efficient parallel processing of image contours

Describes two parallel algorithms for ranking the pixels on a curve in O (log N) time using either an EREW or CREW PRAM model. The algorithms accomplish this with N processors for a √N×√N image. After applying such an algorithm to an image, it is possible to move the pixels from a curve into processors having consecutive addresses. This is important because one can subsequently apply many algorithms to the curve (such as piecewise linear approximation algorithms or point in polygon tests) using segmented scan operations (i.e. parallel prefix operations). Scan operations can be executed in logarithmic time on many interconnection networks, such as hypercube, tree, butterfly, and shuffle exchange machines as well as on the EREW PRAM. The algorithms were implemented on the hypercube structured Connection Machine, and various performance tests were conducted     

基于近似最小距离场的二维图像骨架提取方法

提出了基于近似最小距离场提取二值图像的8-连通骨架的算法。该算法对图像中的每个像素根据其与边界的相对距离进行整数编码,形成近似最小距离场,将该距离场中的几何邻接的、具有局部最大值的像素形成聚类,对聚类进行细化,用最短路径将不同的细化后的聚类连接起来。该算法简单,将其在实验数据集上进行实验,结果证明算法具有很高的效率。     

Feature pruning by upstream drainage area to support automated generalization of the United States National Hydrography Dataset

The United States Geological Survey has been researching generalization approaches to enable multiple-scale display and delivery of geographic data. This paper presents automated methods to prune network and polygon features of the United States high-resolution National Hydrography Dataset (NHD) to lower resolutions. Feature-pruning rules, data enrichment, and partitioning are derived from knowledge of surface water, the NHD model, and associated feature specification standards. Relative prominence of network features is estimated from upstream drainage area (UDA). Network and polygon features are pruned by UDA and NHD reach code to achieve a drainage density appropriate for any less detailed map scale. Data partitioning maintains local drainage density variations that characterize the terrain. For demonstration, a 48 subbasin area of 1:24 000-scale NHD was pruned to 1:100 000-scale (100 K) and compared to a benchmark, the 100 K NHD. The coefficient of line correspondence (CLC) is used to evaluate how well pruned network features match the benchmark network. CLC values of 0.82 and 0.77 result from pruning with and without partitioning, respectively. The number of polygons that remain after pruning is about seven times that of the benchmark, but the area covered by the polygons that remain after pruning is only about 10% greater than the area covered by benchmark polygons.     

基于标记的分水岭图像分割算法研究

本文针对分水岭算法的过分割问题,设计了一种结合形态学运算的基于标记的分水岭算法.算法首先对梯度图像进行形态学开重建运算和形态学闭重建运算滤波平滑;然后去掉图像中像素个数小于20的局部极小值区域,提取前景标记;用Otsu法求阈值,对二值图像进行距离变换,分水岭分割,得到的分水线图像作为背景标记;最后用强制最小技术修改梯度图像,进行分水岭分割.实验结果表明,此方法能有效抑制过分割,得到与人工标注的分割目标更接近的结果.     

Linear quadtrees: A blocking technique for contour filling

Given a linear quadtree forming a region's contour, an algorithm is presented to determine all the pixels 4-connected to the border's elements. The procedure, based on a connectivity technique, associates a two-valued state (“blocked” or “unblocked”) with each node and fills increasingly larger quadrants with black nodes whose state is known to be unblocked. Advantages of the proposed procedure over existing ones are: (i) multiply connected regions can be reconstructed; (ii) the border can be given as a set of either 4- or 8-connected pixels.     

基于颜色直方图和空间信息融合的图像分割算法

论文提出了一种基于颜色直方图和空间信息相结合的彩色图像分割算法。首先将图像转化为HSI模式,利用高斯滤波器对色度信息进行平滑后获得了合适的色度直方图。基于色度直方图对图像进行了分割,其次,将像素相似性和空间连通性相结合形成了初始分割区域。在此基础上,定义了区域距离函数,实现了图像区域合并操作。再者,从图像合并过程中信息损失和应保留的区域数量之间的关系出发,给出了合并终止规则。最后,针对所提算法进行了仿真研究。