Search results for "binary"
showing 10 items of 833 documents
Nonlinear radial-harmonic correlation using binary decomposition for scale-invariant pattern recognition
2003
We introduce a new scale-invariant pattern-recognition method that uses nonlinear correlation. We applied several common linear correlations to images decomposed into disjoint binary images, which is very discriminant even when the target is embedded in strong noise. We combine our sliced orthogonal nonlinear generalized correlation method and the radial-harmonic expansion in order to achieve scale-invariant pattern recognition. The information from a radial harmonic for each binary slice of the reference object is combined with binary slices of the target. The method avoids the time-consuming process of finding expansion centers for the radial harmonics. The stability of the correlation pe…
Fuzzy temporal random sets with an application to cell biology
2007
Total Internal Reflection Fluorescence Microscopy (TIRFM) greatly facilitates to imaging the first steps of endocytosis, a process whereby cells traffic cargo from the cell surface to endosomes. Using TIRFM, fluorescent-tagged endocytic proteins are observed as overlapped areas forming random clumps of different sizes, shapes and durations. A common procedure to segment these objects consists of thresholding the original gray-level images to produce binary sequences in which a pixel is covered or not by a given fluorescent-tagged protein. This binary logic is not appropriate because it leaves a free tuning parameter to be set by the user which can influence on the conclusions of the statist…
Parallel distance transforms on pyramid machines: Theory and implementation
1990
Abstract A distance transform of a binary image is an array each of whose elements gives the distance from the corresponding pixel to the closest ‘1’ in the binary image. Distance transforms have uses in image matching and shape analysis, among other applications. We present a parallel algorithm for weighted distance transforms that runs particularly efficiently on hierarchical cellular-logic machines, a subclass of the architectures known as pyramid machines. The algorithm computes the 3–4 distance transform; however it can be readily adapted to the city-block (‘Manhattan’) and chessboard distance measures. The algorithm runs in O(M) time, for an M × M image. Since it avoids using arithmet…
Improved rotation invariant pattern recognition using circular harmonics of binary gray level slices
2000
We introduce a new rotation invariant pattern recognition method based on nonlinear correlation. The images are decomposed into disjoint binary slices and then correlated using the common linear correlation. This operation is very discriminant even when the target is embedded in strong noise. We extend our sliced orthogonal nonlinear generalized correlation method to rotation invariant pattern recognition by combining the information of a circular harmonic (CH) of each binary slice of the reference object with binary slices of the target. In addition to improved discrimination capability, the method avoids the time-consuming process of finding proper centers for the CHs. Results are present…
Psychophysical response to electrocutaneous stimulation.
1984
A method is presented to determine a reliable stimulus-sensation relationship particularly suitable for electrocutaneous stimulation. An experimental intensity-discrimination curve was obtained through simple psychophysical comparison tasks, and sensory response was inferred from integration of a JND's density function. The psychophysical response resembles a power law, although departures cannot be described in terms of a unique exponent. An estimate of binary information capacity per electrode is also given as a feature of a stimulation procedure that preserves a low value of the size-intensity product.
Lau Effect And Binary Logic
1989
The Lau effect is applied to implement the whole set of binary logic operations optically. Our technique works with spatially incoherent light and does not require lenses or any other optical accessory.
Binarization of a super-resolving graytone pupil filter by digital halftoning
1995
— Six digital-halftoning procedures, including one algorithm proposed by us, are compared to determine which one is best suited to binarization of a parabolic super-resolving pupil filter. The procedures we deal with include iterative, error-diffusion, error-convergence, and 1-pixel algorithms. We carry out a numerically simulated experiment in which an object that consists of either one point source or two coherent point sources is imaged in a 4f imaging system with either a continuous super-resolving parabolic filter or one of its six different binary versions. The performance of binary filters is examined in terms of two parameters: the resemblance of their amplitude impulse response (AI…
Detection of Duplicated Regions in Tampered Digital Images by Bit-Plane Analysis
2009
In this paper we present a new method for searching duplicated areas in a digital image. The goal is to detect if an image has been tampered by a copy-move process. Our method works within a convenient domain. The image to be analyzed is decomposed in its bit-plane representation. Then, for each bitplane, block of bits are encoded with an ASCII code, and a sequence of strings is analyzed rather than the original bit-plane. The sequence is lexicographically sorted and similar groups of bits are extracted as candidate areas, and passed to the following plane to be processed. Output of the last planes indicates if, and where, the image has been altered.
Interlacing multiplexing techniques for optical morphological correlation
2006
We propose a novel approach to implement nonlinear morphological correlation. Previous implementation was based on a time sequential approach that consists on displaying different binary image decomposition in a joint transform correlator adding each joint power spectra sequentially. A second Fourier transformation of the sum of joint power spectra gives the correlation output. In this paper, we propose to interlace the different binary images into one single distribution. Then, we introduce the distribution in a conventional joint transform correlator. The correlation output gives the morphological correlation at a specific location. The advantage is important considering that no sequentia…
Towards General Purpose Object Detection: Deep Dense Grid Based Object Detection
2020
Object detection is one of the most challenging and very important branch of computer vision. Some of the challenging aspect of a detection network is the fact that an object can appear anywhere in the image, be partially occluded by another object, might appear in crowd or have greatly varying scales. Consequently, we propose a fine grained and equally spaced dense grid cells throughout an input image be responsible of detecting an object. We re-purpose an already existing deep state-of-the-art detector or classifier into deep and dense detector. Our dense object detector uses binary class encoding and hence suitable for very large multi-class object detector. We also propose a more flexib…