Search results for "feature"
showing 10 items of 4091 documents
Precomputed Real-Time Texture Synthesis with Markovian Generative Adversarial Networks
2016
This paper proposes Markovian Generative Adversarial Networks (MGANs), a method for training generative networks for efficient texture synthesis. While deep neural network approaches have recently demonstrated remarkable results in terms of synthesis quality, they still come at considerable computational costs (minutes of run-time for low-res images). Our paper addresses this efficiency issue. Instead of a numerical deconvolution in previous work, we precompute a feed-forward, strided convolutional network that captures the feature statistics of Markovian patches and is able to directly generate outputs of arbitrary dimensions. Such network can directly decode brown noise to realistic textu…
Real-time low level feature extraction for on-board robot vision systems
2006
Robot vision systems notoriously require large computing capabilities, rarely available on physical devices. Robots have limited embedded hardware, and almost all sensory computation is delegated to remote machines. Emerging gigascale integration technologies offer the opportunity to explore alternative computing architectures that can deliver a significant boost to on-board computing when implemented in embedded, reconfigurable devices. This paper explores the mapping of low level feature extraction on one such architecture, the Georgia Tech SIMD Pixel Processor (SIMPil). The Fast Boundary Web Extraction (fBWE) algorithm is adapted and mapped on SIMPil as a fixed-point, data parallel imple…
Speeding-Up Differential Motion Detection Algorithms Using a Change-Driven Data Flow Processing Strategy
2007
A constraint of real-time implementation of differential motion detection algorithms is the large amount of data to be processed. Full image processing is usually the classical approach for these algorithms: spatial and temporal derivatives are calculated for all pixels in the image despite the fact that the majority of image pixels may not have changed from one frame to the next. By contrast, the data flow model works in a totally different way as instructions are only fired when the data needed for these instructions are available. Here we present a method to speed-up low level motion detection algorithms. This method is based on pixel change instead of full image processing and good spee…
Unsupervised deep feature extraction of hyperspectral images
2014
This paper presents an effective unsupervised sparse feature learning algorithm to train deep convolutional networks on hyperspectral images. Deep convolutional hierarchical representations are learned and then used for pixel classification. Features in lower layers present less abstract representations of data, while higher layers represent more abstract and complex characteristics. We successfully illustrate the performance of the extracted representations in a challenging AVIRIS hyperspectral image classification problem, compared to standard dimensionality reduction methods like principal component analysis (PCA) and its kernel counterpart (kPCA). The proposed method largely outperforms…
A support vector domain method for change detection in multitemporal images
2010
This paper formulates the problem of distinguishing changed from unchanged pixels in multitemporal remote sensing images as a minimum enclosing ball (MEB) problem with changed pixels as target class. The definition of the sphere-shaped decision boundary with minimal volume that embraces changed pixels is approached in the context of the support vector formalism adopting a support vector domain description (SVDD) one-class classifier. SVDD maps the data into a high dimensional feature space where the spherical support of the high dimensional distribution of changed pixels is computed. Unlike the standard SVDD, the proposed formulation of the SVDD uses both target and outlier samples for defi…
A Clustering Approach to texture Classification
1988
In the paper a clustering technique to segment an image in to “homogeneous” regions is studied. The homogeneity of each region is evaluated by means of a “proximity function” computed between the pixels. The main result of such approach is that no-histogramming is required in order to perform segmentation. Possibilistic and probabilistic approaches are, also, combined to evaluate the significativity of the computed regions.
Shape Description for Content-Based Image Retrieval
2000
The present work is focused on a global image characterization based on a description of the 2D displacements of the different shapes present in the image, which can be employed for CBIR applications.To this aim, a recognition system has been developed, that detects automatically image ROIs containing single objects, and classifies them as belonging to a particular class of shapes.In our approach we make use of the eigenvalues of the covariance matrix computed from the pixel rows of a single ROI. These quantities are arranged in a vector form, and are classified using Support Vector Machines (SVMs). The selected feature allows us to recognize shapes in a robust fashion, despite rotations or…
Objective improvement of the visual quality of ion microscope images
2013
The need to operate with low ion beam fluences implies the images obtained using ion microscope (IM) are often grainy and have poor visual quality compared to what can be obtained using e.g. confocal microscopy. This results from the Poissonian distribution of counts in pixels. Here we report work on some different approaches for objectively improving the visual quality of IM images. In this work we present (i) dramatic improvement in the visual image quality of off-axis and direct-scanning transmission ion microscopy (STIM) images by suppression of zero-pixels; (ii) denoising of PIXE images using wavelet filtering and (iii) use of the feature preserving characteristics of wavelet filtering…
A Comparative Study on Feature Selection for Retinal Vessel Segmentation Using FABC
2009
This paper presents a comparative study on five feature selection heuristics applied to a retinal image database called DRIVE. Features are chosen from a feature vector (encoding local information, but as well information from structures and shapes available in the image) constructed for each pixel in the field of view (FOV) of the image. After selecting the most discriminatory features, an AdaBoost classifier is applied for training. The results of classifications are used to compare the effectiveness of the five feature selection methods.
Improving SIFT-based descriptors stability to rotations
2010
Image descriptors are widely adopted structures to match image features. SIFT-based descriptors are collections of gradient orientation histograms computed on different feature regions, commonly divided by using a regular Cartesian grid or a log-polar grid. In order to achieve rotation invariance, feature patches have to be generally rotated in the direction of the dominant gradient orientation. In this paper we present a modification of the GLOH descriptor, a SIFT-based descriptor based on a log-polar grid, which avoids to rotate the feature patch before computing the descriptor since predefined discrete orientations can be easily derived by shifting the descriptor vector. The proposed des…