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.     

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.     

Food recognition using neural network classifier and multiple hypotheses image segmentation

ABSTRACT

This paper proposes the multiple-hypotheses image segmentation and feed-forward neural network classifier for food recognition to improve the performance. Initially, the food or meal image is given as input. Then, the segmentation is applied to identify the regions, where a particular food item is located using salient region detection, multi-scale segmentation, and fast rejection. Then, the features of every food item are extracted by the global feature and local feature extraction. After the features are obtained, the classification is performed for each segmented region using a feed-forward neural network model. Finally, the calorie value is computed with the aid of (i) food volume and (ii) calorie and nutrition measure based on mass value. The experimental results and performance evaluation are validated. The outcome of the proposed method attains 0.947 for Macro Average Accuracy (MAA) and 0.959 for Standard Accuracy (SA), which provides better classification performance.     

高分辨率合成孔径雷达图像舰船检测方法

寻找针对高分辨率SAR图像的舰船目标检测算法。利用KSW双阈值分割技术，其效果比传统检测方法好，有利于进一步的目标分类和识别。且必须根据SAR图像分辨率来选择舰船检测算法。     

Cluster analysis in industrial market segmentation through artificial neural network

Market segmentation has commonly applied cluster analysis. This study intends to make the comparison of conventional two-stage method with proposed two-stage method through the simulated data. The proposed two-stage method is the combination of self-organizing feature maps and K-means method. The simulation results show that the proposed scheme is better than the conventional two-stage method based on the rate of misclassification.     

浅谈程序设计中一题多解的教学方法

中等职业学校一般开设VB、VC及数据库等涉及程序设计的计算机课程。本文拟就程序设计中一题多解的教学方法进行探讨。     

A Novel Segmentation and Feedback Model for Resolving Contention in Optical Burst Switching

A novel segmentation and feedback model (SFM) applied to resolve contention is proposed. Simulation and performance analyses show that the SFM effectively avoids contentions in optical burst switching (OBS). The long delay time of deflection routing and the immature technology of wavelength converters and optical buffers are not deployed in the SFM. The SFM does not only realize fast switching but also allows preemption by higher priority bursts.     

Learning-based dynamic coupling of discrete and continuous trackers

We present a data-driven dynamic coupling between discrete and continuous methods for tracking objects of high dofs, which overcomes the limitations of previous techniques. In our approach, two trackers work in parallel, and the coupling between them is based on the tracking error. We use a model-based continuous method to achieve accurate results and, in cases of failure, we re-initialize the model using our discrete tracker. This method maintains the accuracy of a more tightly coupled system, while increasing its efficiency. At any given frame, our discrete tracker uses the current and several previous frames to search into a database for the best matching solution. For improved robustness, object configuration sequences, rather than single configurations, are stored in the database. We apply our framework to the problem of 3D hand tracking from image sequences and the discrimination between fingerspelling and continuous signs in American Sign Language.     

Pedestrian detection and tracking in infrared imagery using shape and appearance

In this paper, we present an approach toward pedestrian detection and tracking from infrared imagery using joint shape and appearance cues. A layered representation is first introduced and a generalized expectation-maximization (EM) algorithm is developed to separate infrared images into background (still) and foreground (moving) layers regardless of camera panning. In the two-pass scheme of detecting pedestrians from the foreground layer: shape cue is first used to eliminate non-pedestrian moving objects and then appearance cue helps to locate the exact position of pedestrians. Templates with varying sizes are sequentially applied to detect pedestrians at multiple scales to accommodate different camera distances. To facilitate the task of pedestrian tracking, we formulate the problem of shot segmentation and present a graph matching-based tracking algorithm that jointly exploits the shape, appearance and distance information. Experimental results with both OSU Infrared Image Database and WVU Infrared Video Database are reported to demonstrate the accuracy and robustness of our algorithm.     

An improved watershed algorithm based on efficient computation of shortest paths

The present paper describes a new algorithm to calculate the watershed transform through rain simulation of greyscale digital images by means of pixel arrowing. The efficiency of this method is based on limiting the necessary neighbouring operations to compute the transform to the outmost, and in the total number of scannings performed over the whole image. The experiments demonstrate that the proposed algorithm is able to significantly reduce the running time of the fastest known algorithm without involving any loss of efficiency.