Learn More
The superpixel segmentation algorithm, as a preprocessing technique, should show good performance in fast segmentation speed, accurate boundary adherence and homogeneous regularity. A fast superpixel segmentation algorithm by iterative edge refinement (IER) works well on optical images. However, it may generate poor superpixels for Polarimetric synthetic(More)
This paper presents a robust point-pattern matching (PPM) algorithm, in which the invariant feature and probabilistic relaxation labeling are combined to improve the assignment accuracy and efficiency. A local feature descriptor, namely, point pair local topology (PPLT), is proposed first. The feature descriptor is defined by histogram which is constructed(More)
We address the problem of unsupervised visual domain adaptation for transferring scene category models and scene attribute models from ground view images to overhead view very high-resolution (VHR) remote sensing images. We introduce a discriminative cross-view subspace alignment algorithm where each view is represented by a subspace spanned by(More)
Recent years have witnessed an ever-mounting interest in the research of sparse representation. The framework, Sparse Representation-based Classification (SRC), has been widely applied as a classifier in numerous domains, among which Synthetic Aperture Radar (SAR) target recognition is really challenging because it still is an open problem to interpreting(More)
The simple linear iterative clustering (SLIC) method is a recently proposed popular superpixel algorithm. However, this method may generate bad superpixels for synthetic aperture radar (SAR) images due to effects of speckle and the large dynamic range of pixel intensity. In this paper, an improved SLIC algorithm for SAR images is proposed. This algorithm(More)