Conformal transplantation of lightness to varying resolution sensors

Many standard computer vision algorithms for shape from shading, optical flow, color constancy or surface reconstruction depend upon the solution of Poisson equations. Using retinex lightness computation as an example, it is shown how these algorithms can be dramatically sped up using a varying resolution sensor, so long as the sensor architecture is based on a conformal mapping. The varying resolution lightness algorithm is developed by the technique of using a conformal transplant. In the final analysis, very little of the algorithm needs to be changed, but a speed up in running time of roughly 50 times is obtained, even though the total amount of data is reduced by only a factor of 28. The speed increases at the expense of peripheral resolution.<<ETX>>

[1]  Andrew Blake,et al.  Boundary conditions for lightness computation in Mondrian World , 1985, Comput. Vis. Graph. Image Process..

[2]  E. Land,et al.  Lightness and retinex theory. , 1971, Journal of the Optical Society of America.

[3]  Giulio Sandini,et al.  A Foveated Retina-Like Sensor Using CCD Technology , 1989, Analog VLSI Implementation of Neural Systems.

[4]  Rodney M. Goodman,et al.  A real-time neural system for color constancy , 1991, IEEE Trans. Neural Networks.

[5]  Y. J. Tejwani,et al.  Robot vision , 1989, IEEE International Symposium on Circuits and Systems,.

[6]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Eric L. Schwartz,et al.  Computational anatomy and functional architecture of striate cortex: A spatial mapping approach to perceptual coding , 1980, Vision Research.

[8]  Michael J. Swain,et al.  Low resolution cues for guiding saccadic eye movements , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[9]  Giulio Sandini,et al.  An anthropomorphic retina-like structure for scene analysis , 1980 .

[10]  Rama Chellappa,et al.  Direct Analytical Methods for Solving Poisson Equations in Computer Vision Problems , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Andrew Blake,et al.  Computing lightness , 1987, Pattern Recognit. Lett..

[12]  P. Swarztrauber.  THE METHODS OF CYCLIC REDUCTION, FOURIER ANALYSIS AND THE FACR ALGORITHM FOR THE DISCRETE SOLUTION OF POISSON'S EQUATION ON A RECTANGLE* , 1977 .

[13]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[14]  Carl F. R. Weiman,et al.  Logarithmic spiral grids for image-processing and display , 1979 .