A Student's t-based density peaks clustering with superpixel segmentation (tDPCSS) method for image color clustering

Image color clustering is a basic technique in image processing and computer vision, which is often applied in image segmentation, color transfer, contrast enhancement, object detection, skin color capture, and so forth. Various clustering algorithms have been employed for image color clustering in recent years. However, most of the algorithms require a large amount of memory or a predetermined number of clusters. In addition, some of the existing algorithms are sensitive to the parameter configurations. In order to tackle the above problems, we propose an image color clustering method named Student's t-based density peaks clustering with superpixel segmentation (tDPCSS), which can automatically obtain clustering results, without requiring a large amount of memory, and is not dependent on the parameters of the algorithm or the number of clusters. In tDPCSS, superpixels are obtained based on automatic and constrained simple non-iterative clustering, to automatically decrease the image data volume. A Student's t kernel function and a cluster center selection method are adopted to eliminate the dependence of the density peak clustering on parameters and the number of clusters, respectively. The experiments undertaken in this study confirmed that the proposed approach outperforms k-means, fuzzy c-means, mean-shift clustering, and density peak clustering with superpixel segmentation in the accuracy of the cluster centers and the validity of the clustering results.     

An adaptive image steganographic scheme based on Noise Visibility Function and an optimal chaotic based encryption method

Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks.     

超高清电视系统关键技术浅析

本文对国内外的电视技术发展现状进行了充分的研究和分析,并对超高清电视系统的相关图像技术参数进行了分析和介绍。     

结合位图切割和区域合并的彩色图像分割

就经典分水岭图像分割算法中存在的过分割问题，提出一种结合位图切割和区域合并的彩色图像分割算法。对原始彩色图像通过空域梯度算子求其梯度图像，并利用位图切割重建梯度图像；对新梯度图像进行分水岭预分割；对预分割图像基于异质性最小原则进行区域合并，并获得最终分割结果。相比于现有的同类方法，该算法引入位图切割，抑制噪声对分割结果的影响，在边缘模糊处分割准确，得到符合人类视觉的较小分割区域数目，同时在运行效率上提高。     

Sparsity-inspired image reconstruction for electrical capacitance tomography

We present a new image reconstruction method for Electrical Capacitance Tomography (ECT). ECT image reconstruction is generally ill-posed because the number of measurements is small whereas the image dimensions are large. Here, we present a sparsity-inspired approach to achieve better ECT image reconstruction from the small number of measurements. Our approach for ECT image reconstruction is based on Total Variation (TV) regularization. We apply an efficient Split-Bregman Iteration (SBI) approach to solve the problem. We also propose three metrics to evaluate image reconstruction performance, i.e., a joint metric of positive reconstruction rate (PRR) and false reconstruction rate (FRR), correlation coefficient, and a shape and location metric. The results on both synthetic and real data show that the proposed TV-SBI method can better preserve the edges of images and better resolve different objects within reconstructed images, as compared to a representative state-of-the-art ECT image reconstruction algorithm, Projected Landweber Iteration with Linear Back Projection initialization (LBP-PLI).     

A web-based software tool for participatory optimization of conservation practices in watersheds

WRESTORE (Watershed Restoration Using Spatio-Temporal Optimization of Resources) is a web-based, participatory planning tool that can be used to engage with watershed stakeholder communities, and involve them in using science-based, human-guided, interactive simulation–optimization methods for designing potential conservation practices on their landscape. The underlying optimization algorithms, process simulation models, and interfaces allow users to not only spatially optimize the locations and types of new conservation practices based on quantifiable goals estimated by the dynamic simulation models, but also to include their personal subjective and/or unquantifiable criteria in the location and design of these practices. In this paper, we describe the software, interfaces, and architecture of WRESTORE, provide scenarios for implementing the WRESTORE tool in a watershed community's planning process, and discuss considerations for future developments.     

Retinal Vessel Extraction Framework Using Modified Adaboost Extreme Learning Machine

An explicit extraction of the retinal vessel is a standout amongst the most significant errands in the field of medical imaging to analyze both the ophthalmological infections, for example, Glaucoma, Diabetic Retinopathy (DR), Retinopathy of Prematurity (ROP), Age-Related Macular Degeneration (AMD) as well as non retinal sickness such as stroke, hypertension and cardiovascular diseases. The state of the retinal vasculature is a significant indicative element in the field of ophthalmology. Retinal vessel extraction in fundus imaging is a difficult task because of varying size vessels, moderately low distinction, and presence of pathologies such as hemorrhages, microaneurysms etc. Manual vessel extraction is a challenging task due to the complicated nature of the retinal vessel structure, which also needs strong skill set and training. In this paper, a supervised technique for blood vessel extraction in retinal images using Modified Adaboost Extreme Learning Machine (MAD-ELM) is proposed. Firstly, the fundus image preprocessing is done for contrast enhancement and in-homogeneity correction. Then, a set of core features is extracted, and the best features are selected using “minimal Redundancy-maximum Relevance (mRmR).” Later, using MAD-ELM method vessels and non vessels are classified. DRIVE and DR-HAGIS datasets are used for the evaluation of the proposed method. The algorithm’s performance is assessed based on accuracy, sensitivity and specificity. The proposed technique attains accuracy of 0.9619 on the DRIVE database and 0.9519 on DR-HAGIS database, which contains pathological images. Our results show that, in addition to healthy retinal images, the proposed method performs well in extracting blood vessels from pathological images and is therefore comparable with state of the art methods.     

Change detection in synthetic aperture radar images based on unsupervised artificial immune systems

In this paper, we propose a novel change detection method for synthetic aperture radar images based on unsupervised artificial immune systems. After generating the difference image from the multitemporal images, we take each pixel as an antigen and build an immune model to deal with the antigens. By continuously stimulating the immune model, the antigens are classified into two groups, changed and unchanged. Firstly, the proposed method incorporates the local information in order to restrain the impact of speckle noise. Secondly, the proposed method simulates the immune response process in a fuzzy way to get an accurate result by retaining more image details. We introduce a fuzzy membership of the antigen and then update the antibodies and memory cells according to the membership. Compared with the clustering algorithms we have proposed in our previous works, the new method inherits immunological properties from immune systems and is robust to speckle noise due to the use of local information as well as fuzzy strategy. Experiments on real synthetic aperture radar images show that the proposed method performs well on several kinds of difference images and engenders more robust result than the other compared methods.     

ECISER: Efficient Clip-art Image SEgmentation by Re-rasterization

Clip-art image segmentation is widely used as an essential step to solve many vision problems such as colorization and vectorization. Many of these applications not only demand accurate segmentation results, but also have little tolerance for time cost, which leads to the main challenge of this kind of segmentation. However, most existing segmentation techniques are found not sufficient for this purpose due to either their high computation cost or low accuracy. To address such issues, we propose a novel segmentation approach, ECISER, which is well-suited in this context. The basic idea of ECISER is to take advantage of the particular nature of cartoon images and connect image segmentation with aliased rasterization. Based on such relationship, a clip-art image can be quickly segmented into regions by re-rasterization of the original image and several other computationally efficient techniques developed in this paper. Experimental results show that our method achieves dramatic computational speedups over the current state-of-the-art approaches, while preserving almost the same quality of results.