Contour detection via stacking random forest learning

Contour detection has been extensively investigated as a fundamental problem in computer vision. In this study, a biologically-inspired candidate weighting framework is proposed for the challenging task of detecting meaningful contours. In contrast to previous models that detect contours from pixels, a modified superpixel generation processing is proposed to generate a contour candidate set and then weigh the candidates by extracting hierarchical visual cues. We extract the low-level visual local cues to weigh the contour intrinsic property and mid-level visual cues on the basis of Gestalt principles for weighting the contour grouping constraint. Experimental results tested on the BSDS benchmark show that the proposed framework exhibits promising performances to capture meaningful contours in complex scenes.

This paper investigates two fundamental problems in computer vision: contour detection and image segmentation. We present state-of-the-art algorithms for both of these tasks. Our contour detector combines multiple local cues into a globalization framework based on spectral clustering. Our segmentation algorithm consists of generic machinery for transforming the output of any contour detector into a hierarchical region tree. In this manner, we reduce the problem of image segmentation to that of contour detection. Extensive experimental evaluation demonstrates that both our contour detection and segmentation methods significantly outperform competing algorithms. The automatically generated hierarchical segmentations can be interactively refined by user-specified annotations. Computation at multiple image resolutions provides a means of coupling our system to recognition applications.

Image denoising is a fundamental problem in computer vision and image processing that holds considerable practical importance for real-world applications. The traditional patch-based and sparse coding-driven image denoising methods convert 2D image patches into 1D vectors for further processing. Thus, these methods inevitably break down the inherent 2D geometric structure of natural images. To overcome this limitation pertaining to the previous image denoising methods, we propose a 2D image denoising model, namely, the dictionary pair learning (DPL) model, and we design a corresponding algorithm called the DPL on the Grassmann-manifold (DPLG) algorithm. The DPLG algorithm first learns an initial dictionary pair (i.e., the left and right dictionaries) by employing a subspace partition technique on the Grassmann manifold, wherein the refined dictionary pair is obtained through a sub-dictionary pair merging. The DPLG obtains a sparse representation by encoding each image patch only with the selected sub-dictionary pair. The non-zero elements of the sparse representation are further smoothed by the graph Laplacian operator to remove the noise. Consequently, the DPLG algorithm not only preserves the inherent 2D geometric structure of natural images but also performs manifold smoothing in the 2D sparse coding space. We demonstrate that the DPLG algorithm also improves the structural SIMilarity values of the perceptual visual quality for denoised images using the experimental evaluations on the benchmark images and Berkeley segmentation data sets. Moreover, the DPLG also produces the competitive peak signal-to-noise ratio values from popular image denoising algorithms.

The object contour detection in natural scenes is an important research problem in computer vision. The difficulty is that the integrity of contour extracted is interfered with a large number of texture edges in the background seriously. In recent years, some researchers have introduced image contour detection method with biological visual features and achieved preferable results. Such as, based on the fact of visual outer region suppression, they can suppress a certain amount of texture edge while extracting the contour of the object, and obtain the proper contour edge. However, when this method is used for contour detection in some image which the texture is similar to the contour, the texture edge still cannot be removed well, and the result is unsatisfactory. In consideration of the merit and demerit of the feature suppressed method, we propose an improved algorithm for object contour detection in natural scene based on image saliency. Firstly, the initial contour is obtained by using the suppression effect of non-classical receptive field, and the saliency map is obtained by using the hyper-complex Fourier transform image saliency detection method, and then the initial contour and the saliency map are integrated into the final contour. Compared with the traditional contour detection method, the contour extraction algorithm based on image saliency can remove more background information and improve the accuracy and integrity of object contour extracted in natural scenes.

Contour detection is a fundamental problem in computer vision. However, there is still a considerable disparity between detection results and actual contours. To detect object-level contours on the basis of comprehensive analysis of potential edges, we present a deep-learning-based approach with a conditional random fields (CRF) model. We obtain the initial edgemap with a VGGNet-based model, and establish a contour correlation graph (CCG) to describe the potential edges and their relationships. Then a CRF model is adopted to fulfill the optimization on the basis of the analysis of object-level contour characteristics and to predict the validity of candidate contours. The experiment results on various datasets demonstrate that the proposed method outperforms the existing methods by a noticeable margin.

Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing structures in the scene. Rather than viewing the problem as one of pure image processing, our approach employs cues from an estimated surface layout and applies Gestalt grouping principles using a conditional random field (CRF) model. We propose a hierarchical segmentation process, based on agglomerative merging, that re-estimates boundary strength as the segmentation progresses. Our experiments on the Geometric Context dataset validate our choices for features, our iterative refinement of classifiers, and our CRF model. In experiments on the Berkeley Segmentation Dataset, PASCAL VOC 2008, and LabelMe, we also show that the trained algorithm generalizes to other datasets and can be used as an object boundary predictor with figure/ground labels.

Face and kinship verification using facial images is a novel and challenging problem in computer vision. In this paper, we propose a new system that uses discriminative information, which is based on the exponential discriminant analysis (DIEDA) combined with multiple scale descriptors. The histograms of different patches are concatenated to form a high dimensional feature vector, which represents a specific descriptor at a given scale. The projected histograms for each zone use the cosine similarity metric to reduce the feature vector dimensionality. Lastly, zone scores corresponding to various descriptors at different scales are fused and verified by using a classifier. This paper exploits discriminative side information for face and kinship verification in the wild (image pairs are from the same person or not). To tackle this problem, we take examples of the face samples with unlabeled kin relations from the labeled face in the wild dataset as the reference set. We create an optimized function by minimizing the interclass samples (with a kin relation) and maximizing the neighboring interclass samples (without a kinship relation) with the DIEDA approach. Experimental results on three publicly available face and kinship datasets show the superior performance of the proposed system over other state-of-the-art techniques.

Recent advances in small object detection based on deep learning: A review

Graph and hypergraph matching are fundamental problems in computer vision, which have been receiving a steadily growing attention in the last two decades due to the recent modern algorithms and models that are both fast and accurate. Graph and hypergraph matching are successful in tackling many real-world tasks that require 2D and 3D feature matching and alignment. Matching is a general problem in vision and graphs have always been quintessential for modeling information that has both local and longer range connections. Therefore, graph matching will continue to influence computer vision and robotics research, crossing over many different mathematical and computational models, including Bayesian networks, conditional and Markov random fields, spectral graph models, and, more recently, deep neural networks. While graph matching is limited to using pairwise relationships, hypergraph matching permits the use of relationships between sets of features of any order. Consequently, it carries the promise to make matching more robust to changes in scale, deformations, and outliers. In this chapter, we present several key ideas, computational models, and optimization methods that introduced in the literature the possibility to learn graph and hypergraph matching in a semi-supervised or even completely unsupervised fashion. We start by describing two methods for solving graph and hypergraph matching based on spectral matching and integer projected fixed point methods, introduced in Chap. 1. Then, based on the same intuition (also discussed in Chap. 1) that correct assignments form a strong cluster of agreements, we follow up by introducing the main approach to learning as it applies to graph and hypergraph matching, as well as the more general Maximum A Posteriori (MAP) inference problem in probabilistic graphical models (MRFs and CRFs). In the last part of the chapter, we demonstrate experimentally the effectiveness of the algorithms presented and, whenever possible, provide extensive comparisons to other top published methods. Moreover, we show that our learning approach is general and can significantly boost the performance of different state-of-the-art matching algorithms in the literature.

Deep learning based point cloud registration: an overview

In the areas of computer vision and computer graphics, analyzing information about three-dimensional objects from two-dimensional images is essential. Shape from shading is a very fundamental problem in computer vision, which uses features and patterns in images to infer the shape of the object in our viewing direction. The influence of solving this problem is significant. For example, a typical application of shape from shading is in astronomy, in which we can obtain landscape features of a planet by analyzing the information from the image we get.

Contour detection serves as the basis of a variety of computer vision tasks such as image segmentation and object recognition. The mainstream works to address this problem focus on designing engineered gradient features. In this work, we show that contour detection accuracy can be improved by instead making the use of the deep features learned from convolutional neural networks (CNNs). While rather than using the networks as a blackbox feature extractor, we customize the training strategy by partitioning contour (positive) data into subclasses and fitting each subclass by different model parameters. A new loss function, named positive-sharing loss, in which each subclass shares the loss for the whole positive class, is proposed to learn the parameters. Compared to the sofmax loss function, the proposed one, introduces an extra regularizer to emphasizes the losses for the positive and negative classes, which facilitates to explore more discriminative features. Our experimental results demonstrate that learned deep features can achieve top performance on Berkeley Segmentation Dataset and Benchmark (BSDS500) and obtain competitive cross dataset generalization result on the NYUD dataset.

Fine-grained search task such as retrieving subordinate categories of birds, dogs or cars, has been an important but challenging problem in computer vision. Although many effective fine-grained search methods were developed, with the amount of data increasing, previous methods fail to handle the explosive fine-grained data with low storage cost and fast query speed. On the other side, since hashing sheds its light in large-scale image search for dramatically reducing the storage cost and achieving a constant or sub-linear time complexity, we leverage the power of hashing techniques to tackle this valuable yet challenging vision task, termed as fine-grained hashing in this paper. Specifically, our proposed method consists of two crucial modules, i.e., the bilinear feature learning and the binary hash code learning. While the former encodes both local and global discriminative information of a fine-grained image, the latter drives the whole network to learn the final binary hash code to present that fine-grained image. Furthermore, we also introduce a novel multi-task hash training strategy, which can learn hash codes of different lengths simultaneously. It not only accelerates training procedures, but also significantly improves the fine-grained search accuracy. By conducting comprehensive experiments on diverse fine-grained datasets, we validate that the proposed method achieves superior performance over the competing baselines.

Image classification is a fundamental problem in computer vision, which deserves much attention in the past decade. To provide a comprehensive recall for the image classification task based on the deep learning algorithms, this paper first provides a brief history of computer vision and convolutional neural networks. Then, the current state of research and the direction of development of deep learning-based convolutional neural network models for image classification are examined. In addition, the basic model structure, convolution feature extraction, and pooling operations of standard and convolutional neural networks are also introduced. This paper summarizes the development of convolutional neural network models in recent years. In summary, based on the review of the development of image classification algorithms at home and abroad, the current mainstream image classification algorithms and frontier progress are summarized and analyzed, and the existing problems and future development directions of image classification are summarized and prospected. It can be concluded that deep learning-based methods has a great potential in this case.

Colorization of grayscale images is a challenging and fascinating problem in computer vision. This project leverages deep learning techniques, specifically convolutional neural networks (CNNs), to automatically convert grayscale images into colorized versions. Utilizing OpenCV and pre-trained deep learning models such as DeOldify or the Colorful Image Colorization model, we achieve high-quality image colorization with minimal user intervention. The model learns color distributions from large datasets and intelligently predicts realistic colors for grayscale images. This approach finds applications in restoring old photographs, enhancing medical imaging, and improving visual aesthetics in various fields.