Similarity-based image organization and browsing using multi-resolution self-organizing map

An algorithm is presented in this paper to facilitate the exploration of large image collections based on visual similarities. Starting with an unordered and unannotated set of images, the algorithm first extracts the salient details into feature vectors using both color and gradient information. The feature vectors are then used to train a self-organizing map which maps high-dimensional feature vectors onto a 2D canvas so that images with similar feature vectors are grouped together. When users browse the image collection, an image collage is generated that selects and displays the most pertinent set of images based on which portion of the 2D canvas is currently in view. Flowing from an overview to details is a seamless operation controlled simply by pan and zoom, with representative images selected in a consistent and predictable way. To make organizing larger image collections practical in interactive time, the organization algorithm is designed to run in parallel on graphics processing units. Overall this paper presents an end-to-end solution that facilitates the surfing of image collections in a fresh way.     

用于半自动视频对象提取的自适应网格图像分割

随着MPEG－4标准的发展和基于内容的视频处理研究,视频对象平面（VOP）的有效产生成为一个关键问题。本文提出一种基于区域的自适应网格彩色图像分割方法,可用于获得半自动视频对象跟踪和提取所需的初始VOP。该方法利用CIE L＊a*b＊色彩空间的特征量,对视频序列的第一帧进行三角形网格的分裂与合并。对MPEG－4标准测试序列的分割实验取得了较好的结果。     

Comparison of image reconstruction by using near‐field and far‐field data for an imperfect conductor

Image reconstruction by using near‐field and far‐field data for an imperfectly conducting cylinder is investigated. A conducting cylinder of unknown shape and conductivity scatters the incident wave in free space and the scattered near and far fields are measured. By using measured fields, the imaging problem is reformulated into an optimization problem and solved by the genetic algorithm. Numerical results show that the convergence speed and final reconstructed results by using near‐field data are better than those obtained by using far‐field data. This work provides both comparative and quantitative information. © 2001 John Wiley & Sons, Inc. Int J RF and Microwave CAE 11: 69–73, 2001.     

An Analysis of Edge Detection by Using the Jensen-Shannon Divergence

This work constitutes a theoretical study of the edge-detection method by means of the Jensen-Shannon divergence, as proposed by the authors. The overall aim is to establish formally the suitability of the procedure of edge detection in digital images, as a step prior to segmentation. In specific, an analysis is made not only of the properties of the divergence used, but also of the method's sensitivity to the spatial variation, as well as the detection-error risk associated with the operating conditions due to the randomness of the spatial configuration of the pixels. Although the paper deals with the procedure based on the Jensen-Shannon divergence, some problems are also related to other methods based on local detection with a sliding window, and part of the study is focused to noisy and textured images.     

医院超声图象管理系统的设计与实现

介绍了医院超声图象管理系统的功能和特点,并阐述了其关键技术。     

基于机器视觉的实时丸药检测系统

丸药是最为常见的药品剂型,最后成品的外观都要求圆整均匀、色泽一致,在丸药检测方面使用机器视觉技术有着良好的应用前景。通过对丸药实时检测方法和途径的分析探讨,提出了完整的工作循环模式。根据此模式,给出了利用Matlab和visual studio开发实时检测系统的完整方案。     

基于模糊理论的SAR图像分割算法研究与实现

SAR图像存在强烈的相干斑噪声,传统方法不能很好对其分割。文章基于模糊理论,通过选择图像特征,构造模糊集,借助最大隶属度原则进行了SAR图像分割算法的设计,并借助SAR图像分别进行了参数调节和窗口选择的实验,获得了满意的分割结果。实验结果表明,该算法对于SAR图像分割可行有效。     

基于信息融合技术的瓦斯传感器故障诊断研究

文章提出了将基于RBF网络的信息融合技术应用于瓦斯传感器故障诊断的思想。该思想的核心是通过对影响测点瓦斯浓度的各种相关信息融合,利用高精度RBF网络逼近器的输出与瓦斯传感器实际的输出之差与设定的阈值比较,实现瓦斯传感器故障的监测诊断。试验表明该技术能对瓦斯传感器进行有效的状态监测和故障诊断。     

Efficient Compositing Methods for the Sort-Last-Sparse Parallel Volume Rendering System on Distributed Memory Multicomputers

In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, one can achieve a very good performance improvement in the rendering phase by increasing the number of processors. This is because each processor can render images locally without communicating with other processors. However, in the compositing phase, a processor has to exchange local images with other processors. When the number of processors exceeds a threshold, the image compositing time becomes a bottleneck. In this paper, we propose three compositing methods to efficiently reduce the compositing time in parallel volume rendering. They are the binary-swap with bounding rectangle (BSBR) method, the binary-swap with run-length encoding and static load-balancing (BSLC) method, and the binary-swap with bounding rectangle and run-length encoding (BSBRC) method. The proposed methods were implemented on an SP2 parallel machine along with the binary-swap compositing method. The experimental results show that the BSBRC method has the best performance among these four methods.