9 July 2020 in ACS Applied Materials & Interfaces
28 January 2018 in Electronic Imaging
During recent years, deep learning methods have shown to be effective for image classification, localization and detection. Convolutional Neural Networks (CNN) are used to extract information from images and are the main element of modern machine learning and computer vision methods. CNNs can be used for logo detection and recognition. Logo detection consist on locate and recognize commercial brand logos within an image. These methods are useful in the areas of online brand management or ad placement. The performance of this methods is closely related on the quantity and the quality of the data, typically image/label pairs, used to train the CNNs. Collecting the pair of images and labels, commonly referred as ground truth, can be expensive and time consuming. Multiple techniques try to solve this problem by either transforming the available data using data augmentation methods or by creating new images from scratch or from other images using image synthesis methods. In this paper, we investigate the latter approach. We segment background images, extract depth information and then blend logo images accordingly in order to create new real looking images. This approach allows us to create an indefinite number of images with a minimum manual labeling effort. The synthetic images can later be used to train CNNs for logo detection and recognition.
1 May 2019 in IEEE Transactions on Intelligent Transportation Systems
Pedestrian detection in the embedded system, such as video surveillance equipment, usually involves low-resolution pedestrian samples and requires a low computational cost. Many pedestrian detectors rely on a large feature pool and suffer in their efficiency and performance for real-time monitoring. In this paper, a set of light-weight features is proposed to enhance the pedestrian detection performance when a small-medium scale of training data with low-resolution images is available. To address this issue, a difference matrix projection (DMP) is developed to compute aggregated multi-oriented pixel differences using global matrix operations. Both the pixel differences and aggregation are computed using global matrix projection to avoid the laborious iterative operations. We tested our method on the INRIA, Daimler Chrysler classification (Daimler-CB), NICTA, and Caltech Pedestrian datasets. The experiments on these benchmark data sets show encouraging results in terms of detection performance, particularly for image datasets with low-resolution pedestrians.
13 March 2014 in IEEE Transactions on Image Processing
Many imaging applications require the implementation of space-varying convolution for accurate restoration and reconstruction of images. Here, we use the term space-varying convolution to refer to linear operators whose impulse response has slow spatial variation. In addition, these space-varying convolution operators are often dense, so direct implementation of the convolution operator is typically computationally impractical. One such example is the problem of stray light reduction in digital cameras, which requires the implementation of a dense space-varying deconvolution operator. However, other inverse problems, such as iterative tomographic reconstruction, can also depend on the implementation of dense space-varying convolution. While space-invariant convolution can be efficiently implemented with the fast Fourier transform, this approach does not work for space-varying operators. So direct convolution is often the only option for implementing space-varying convolution. In this paper, we develop a general approach to the efficient implementation of space-varying convolution, and demonstrate its use in the application of stray light reduction. Our approach, which we call matrix source coding, is based on lossy source coding of the dense space-varying convolution matrix. Importantly, by coding the transformation matrix, we not only reduce the memory required to store it; we also dramatically reduce the computation required to implement matrix-vector products. Our algorithm is able to reduce computation by approximately factoring the dense space-varying convolution operator into a product of sparse transforms. Experimental results show that our method can dramatically reduce the computation required for stray light reduction while maintaining high accuracy.