نتایج جستجو برای: potential pixels matrix

تعداد نتایج: 1414051  

1993
Peter G. Anderson

We investigate a method of ordering pixels (the elements of a rectangular matrix) based on an arithmetic progression with wrap-around (modular arithmetic). For appropriate choices of the progression's parameters based on a generalization of Fibonacci numbers and the golden mean, we nd equidis-tributed collections of pixels formed by subin-tervals of the pixel progression or \shuue." We illustra...

2002
Sam Danziger

This project extends on the work done Drs. Anderson and Gaborski’ in Optical Character Recognition (OCR) of handwritten digits done back in the 1990s. Their work involved using the polynomial discriminant method, iterative training, and genetic algorithms to optimize the feature selection. This project involves several variations in technique over previous work. The first is the use of the matr...

Journal: :تحقیقات جغرافیایی 0
بختیار محمدی دانشگاه کردستان

abstract: identification of spatial-temporal anomalies sea level pressure in part of northern hemisphere was the main aim in this research. for this purpose six hourly data used from the to eastern longitude and to northern latitude. in this location, there are 825 pixels to geographical degree. therefore, database extent created. in this matrix, 825 are number of the pixels at that location an...

1997
Paulo Jorge S. G. Ferreira José M. N. Vieira

Most image interpolation or extrapolation algorithms assume that the locations of the unknown pixels are known. In this paper we attempt to remove this restriction. More precisely, we propose an algorithm for locating the incorrect pixels of an image, assuming only partial knowledge of its Fourier transform. Note that this is a nonlinear problem: the unknown quantities are the positions and val...

Journal: :Monthly Notices of the Royal Astronomical Society 2012

Journal: :Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention 2009
Germán González François Aguet François Fleuret Michael Unser Pascal Fua

Most state-of-the-art algorithms for filament detection in 3-D image-stacks rely on computing the Hessian matrix around individual pixels and labeling these pixels according to its eigenvalues. This approach, while very effective for clean data in which linear structures are nearly cylindrical, loses its effectiveness in the presence of noisy data and irregular structures. In this paper, we sho...

2011
Lysandre-Edouard Bonjour Thomas Baechler Maher Kayal

Using a standard 0.18um CMOS process with a buried photodiode (BPD) option, test pixels with a single transfer gate were characterized. The test pixels enabled finding an optimized BPD layout that minimizes the potential barriers hindering the charge transfer. Demodulation pixels having a 6.3um pitch or less were then developed and demonstrated to demodulate light signals up to at least 50MHz. ...

2013
J. H. Wen

Locally preserving projection (LPP) does not take advantage of the spatial correlation of pixels in the image, and the pixels are considered as independent pieces of information. In this paper, a kernel based manifold learning feature extraction method which considers spatial relationship of neighboring pixels, called supervised composite kernel locality preserving projection (SCKLPP), is propo...

2015
Savita Deshmukh Vibha Tiwari

In this paper, the colorization-based coding problem has been solved using smooth L0 (SL0) and L1 norm (OMP) minimization sparse recovery algorithms. In colorization-based coding method at the encoder, only few representative pixels (RP) for the chrominance values are sent along with luminance part of image to the decoder where the chrominance values for all the pixels are reconstructed by colo...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید