Image smoothing and segmentation algorithms are frequently formulatedsas optimization problems. Linear and nonlinear (reciprocal) resistivesnetworks have solutions characterized by an extremum principle. Thus,sappropriately designed networks can automatically solve certainssmoothing and segmentation problems in robot vision. This papersconsiders switched linear resistive networks and nonlinear resistivesnetworks for such tasks. The latter network type is derived from thesformer via an intermediate stochastic formulation, and a new resultsrelating the solution sets of the two is given for the "zerostermperature'' limit. We then present simulation studies of severalscontinuation methods that can be gracefully implemented in analog VLSIsand that seem to give "good'' results for these non-convexsoptimization problems.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/5983 |
| Date | 01 January 1991 |
| Creators | Lumsdaine, A., Wyatt, J.L., Jr., Elfadel, I.M. |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 51 p., 7944553 bytes, 6223200 bytes, application/postscript, application/pdf |
| Relation | AIM-1280 |
Page generated in 0.0013 seconds