Search

As one of the most fundamental tasks in computer vision, semantic segmentation assigns per pixel prediction of object categories. Training a robust model for semantic segmentation is challenging since pixel-level annotations are expensive to obtain. To alleviate the burden of annotations, the authors propose a weakly-supervised framework for zero-shot semantic segmentation, which can segment images having target classes without any pixel-level labelled instances. Under the assumption that the accessibility to image-level annotations of target classes does not violate the principle of zero pixel-level label in zero-shot semantic segmentation, we utilised image-level annotations to improve the proposed model's ability to extract pixel-level features. Furthermore, unlike existing zero-shot semantic segmentation methods, which use semantic embeddings as class embeddings to transfer knowledge from source classes to target classes, we use image-level features as their class embeddings to transfer knowledge since the distribution of pixel-level features is more similar to the distribution of image-level features rather than the distribution of semantic embeddings. Experimental results on the PASCAL-VOC data set under different data splits demonstrate that the proposed model achieves promising results. [ABSTRACT FROM AUTHOR]

While promising progress has been achieved in the zero-shot learning (ZSL) task. The existing approaches still suffer from the strong bias problem between the unseen and seen classes. This Letter presents a unified feature generating framework equipped with a boundary decision loss to tackle this issue in ZSL. Specifically, the hybrid semantic and visual classification strategy is proposed, which can effectively align the bidirectional visual-semantic interactions. Furthermore, this Letter introduces a decision loss that optimises the decision boundary of seen and unseen classes to further alleviate the confusion of generated features. Extensive experiments on three popular datasets animals with attributes, Caltech-UCSD-Birds 200-2011, and SUN show that the proposed approach outperforms previous state-of-the-art works under both traditional ZSL and challenging generalised ZSL settings. [ABSTRACT FROM AUTHOR]

This study presents a hierarchical palmprint feature extraction and recognition approach based on multi‐wavelet and complex network (CN) since they can effectively decrease redundant information and enhance key points of main lines and wrinkles. The palmprint is first pre‐filtered and decomposed once using multi‐wavelet. Three components (LL1,2,3) corresponding to the pre‐filter except for diagonal component are extracted as the elementary features. Second, binary images (BLL1,2,3) are obtained by the average window method using different thresholds. Third, three series of dynamic evolution CN models (the 1st, 2nd, 3rd CNs) are constructed from global to local, which is based on the mosaiced images obtained from BLL1,2,3, BLL1 and four equally divided sub‐images of BLL1, respectively. Fourth, statistical features are extracted from complex networks, in which average degree and standard deviation of the degrees are extracted for the 1st CNs and average degrees are extracted for the 2nd and 3rd CNs. Fifth, the fisher feature is extracted using the linear discriminate analysis method. Finally, the nearest neighbourhood classifier is used to recognise palmprint. Based on the CASIA Palmprint Image Database, experimental results show that the proposed method can effectively recognise palmprint with good robustness and overcome the problem of small training samples number. [ABSTRACT FROM AUTHOR]

Vector quantisation (VQ) shows a good performance for image coding with high‐compression ratios. However, there are many difficulties for image coding with VQ, especially the edge degradation and high‐computational complexity. To resolve these two problems, the authors propose a new coding method based on edge orientation patterns (EOPs) by classifying image blocks into nine classes according to their edge orientations. For colour image coding, 27 codebooks (nine for each colour component) are pre‐designed based on a series training images. In the encoding stage, an input colour image is decomposed into Y, Cb, and Cr components, and each component image is divided into non‐overlapping 4 × 4 blocks. For each block, eight edge orientation templates of size 4 × 4 are performed to determine its edge orientation. According to the edge orientation, each block is compressed by using the corresponding codebook. Essentially, the authors' scheme is a kind of classified VC (CVQ). Simulation results show that, their EOP‐based CVQ can largely improve the compression efficiency as well as speeding up the encoding process and it is sufficient to establish effectiveness of the authors' algorithm as compared with the existing techniques. [ABSTRACT FROM AUTHOR]

Recently, a large family of supervised or unsupervised manifold learning algorithms that stem from statistical or geometrical theory has been designed to solve the problem of pattern classification. In this study, consider the fact that the data are usually sampled from a low‐dimensional manifold space which resides in a high‐dimensional Euclidean space, the authors propose a novel two‐graph‐based supervised linear classification algorithm called neighbourhood sensitive preserving embedding (NSPE). Different from local linear embedding (LLE) (or neighbourhood preserving embedding (NPE)) which preserves the local neighbourhood structure with one graph, NSPE can discover both the intrinsic and discriminant structure of the data manifold by constructing two graphs, that is, the within‐class graph and the between‐class graph. Thus, the data are mapped into a subspace where the nearby points with the same label are close to each other, whereas the nearby points with different labels are far apart. As a classification method, besides being defined on training samples, NSPE is also defined on testing samples. Experiments carried on the real‐world face databases demonstrate that the results of all two‐graph‐based spectral methods are comparable and better than that of one‐graph‐based methods. [ABSTRACT FROM AUTHOR]

This Letter presents a new improved zero‐shot learning (ZSL) method based on meta‐learning that automatically adjusts metrics by multi‐layer perceptrons instead of using traditional Euclidean distance, cosine distance and other fixed metrics. In this way, the authors directly train the visual and semantic joint information of the images without adding additional auxiliary, which simply and effectively avoids the error derivation of unseen classes due to improper fixed metrics. Smooth one‐hot encoding rule is used to make the calculation of loss more reasonable. They also discuss the embedding methods to find a suitable low‐noise embedding space and analyse the model performance under the conventional setting and popular generalised ZSL setting. Experimental results show that the proposed automatic metrics method outperforms existing state‐of‐the‐art approaches in some parts of AwA2 and CUB datasets. [ABSTRACT FROM AUTHOR]

A new feature for image retrieval based on edge orientation patterns (EOPs) by classifying image blocks into nine classes according to their EOs. Each input colour image is decomposed into Y, Cb and Cr components, and each component image is divided into non‐overlapping 4 × 4 blocks. For each block, eight EO templates of size 4 × 4 are performed to determine its EO. On the other hand, vector quantisation (VQ) is an efficient clustering and classification technique for high‐dimensional spaces, and thus VQ is also used to extract the texture features. The retrieval simulation results show that the EOP‐histogram‐based features combined with the traditional VQ‐index‐histogram‐based features can largely improve the recall and precision performance. [ABSTRACT FROM AUTHOR]