Search results for "GEP"
showing 10 items of 1017 documents
Selective Change-Driven Image Processing: A Speeding-Up Strategy
2009
Biologically inspired schemes are a source for the improvement of visual systems. Real-time implementation of image processing algorithms is constrained by the large amount of data to be processed. Full image processing is many times unnecessary since there are many pixels that suffer a small change or not suffer any change at all. A strategy based on delivering and processing pixels, instead of processing the complete frame, is presented. The pixels that have suffered higher changes in each frame, ordered by the absolute value of its change, are read-out and processed. Two examples are shown: a morphological motion detection algorithm and the Horn and Schunck optical flow algorithm. Result…
Texture Discrimination Using Hierarchical Complex Networks
2008
Texture analysis represents one of the main areas in image processing and computer vision. The current article describes how complex networks have been used in order to represent and characterized textures. More speci?cally, networks are derived from the texture images by expressing pixels as network nodes and similarities between pixels as network edges. Then, measurements such as the node degree, strengths and clustering coe?cient are used in order to quantify properties of the connectivity and topology of the analyzed networks. Because such properties are directly related to the structure of the respective texture images, they can be used as features for characterizing and classifying te…
Affine camera calibration from homographies of parallel planes
2010
This paper deals with the problem of retrieving the affine structure of a scene from two or more images of parallel planes. We propose a new approach that is solely based on plane homographies, calculated from point correspondences, and that does not require the recovery of the 3D structure of the scene. Neither vanishing points nor lines need to be extracted from the images. The case of a moving camera with constant intrinsic parameters and the one of cameras with possibly different parameters are both addressed. Extensive experiments with both synthetic and real images have validated our approach.
Image Compression by 2D Motif Basis
2011
Approaches to image compression and indexing based on extensions to 2D of some of the Lempel-Ziv incremental parsing techniques have been proposed in the recent past. In these approaches, an image is decomposed into a number of patches, consisting each of a square or rectangular solid block. This paper proposes image compression techniques based on patches that are not necessarily solid blocks, but are affected instead by a controlled number of undetermined or don't care pixels. Such patches are chosen from a set of candidate motifs that are extracted in turn from the image 2D motif basis, the latter consisting of a compact set of patterns that result from the autocorrelation of the image w…
Electron Holography for Electric and Magnetic Field Measurements and Its Application for Nanophysics
2011
Abstract Texture constitutes one of the fundamental properties of objects besides color and shape. In several image analysis applications, it is often the only exploitable quality of objects. As such, it has been studied, described, segmented, synthesized, or in short, analyzed extensively. Among the plethora of texture description methods, mathematical morphology deserves special attention as it excels at the exploitation of spatial relationships among pixels, rendering it inherently suitable for texture description. In this chapter, we focus on morphological texture description methods for grey-scale and color images in an effort to spread the advantages of this framework in the context o…
Smartphone determination of fat in cured meat products
2017
Abstract A method has been developed to determine the fat content in different cold meat products by image processing using the camera of a mobile phone. Salchichon , chorizo , salami and cured ham pictures were taken with a Meizu M2 Mini mobile phone camera under fixed lighting conditions of the light emitting diode flash of the mobile phone. Images were treated with Matlab to obtain the mean pixels of average red, green and blue camera values colours (RGB) of the pixels and different data pretreatments were taken into account to correlate colour parameters with fat content values determined in a series of commercially available samples by the Soxhlet method. RGB values were used as input …
Architectural Scenes Reconstruction from Uncalibrated Photos and Map Based Model Knowledge
2001
In this paper we consider the problem of reconstructing architectural scenes from multiple photographs taken from arbitrarily viewpoints. The original contribution of this work is the use of a map as a source of a priori knowledge and geometric constraints in order to obtain in a fast and simple way a detailed model of a scene. We suppose images are uncalibrated and have at least one planar structure as a facade for exploiting the planar homography induced between world plane and image to calculate a first estimation of the projection matrix. Estimations are improved by using correspondences between images and map. We show how these simple constraints can be used to calibrate the cameras, t…
Replication Data for: Automatic Calibration of an Industrial RGB-D Camera Network using Retroreflective Fiducial Markers.
2019
Replication Data in the form of a Robot Operating System (ROS) recording (ROS-bag) to replicate the results of the paper "Automatic Calibration of an Industrial RGB-D Camera Network using Retroreflective Fiducial Markers." The contents of the dataset are timestamped images and point clouds recorded from six different sensor nodes.
Superresolved imaging of remote moving targets.
2006
We present a superresolving approach that allows one to exceed the diffraction limit and recover highly resolved contours of moving targets from a sequence of low-resolution images. The presented approach is suitable for remote sensing applications. The resolution decoding algorithm that is used to recover the high-resolution features of the target can be run partially via optical means and that way can be used to reduce the required computational complexity.
One-dimensional iterative algorithm for three-dimensional point-spread function engineering.
2001
We present a new method with which to binarize pupil filters designed to control the three-dimensional irradiance distribution in the focal volume of an optical system. The method is based on a one-dimensional iterative algorithm, which results in efficient use of computation time and in simple, easy to fabricate binary filters. An acceptable degree of resemblance between the point-spread function of the annular binary filter and that of its gray-tone counterpart is obtained.