Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1990-1994  (2)
  • 1990  (2)
Material
Years
  • 1990-1994  (2)
Year
  • 1
    ISSN: 1520-5835
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology , Physics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract In short, the model consists of a two-dimensional set of edge detecting units, modelled according to the zero-crossing detectors introduced first by Marr and Ullman (1981). These detectors are located peripherally in our synthetic vision system and are the input elements for an intelligent recurrent network. The purpose of that network is to recognize and categorize the previously detected contrast changes in a multi-resolution representation of the original image in such a manner that the original information will be decomposed into a relatively small numberN of well-defined edge primitives. The advantage of such a construction is that time-consuming pattern recognition has no longer to be done on the originally complex motion-blurred images of moving objects, but on a limited number of categorized forms. Based on a numberM of elementary feature attributes for each individual edge primitive, the model is then able to decompose each edge pattern into certain features. In this way anM-dimensional vector can be constructed for each edge. For each sequence of two successive frames a tensor can be calculated containing the distances (measured inM-dimensional feature space) between all features in both images. This procedure yields a set ofK—1 tensors for a sequence ofK images. After cross-correlation of allN ×M feature attributes from image (i) with those from image (i+1), wherei = 1, ...,K - 1, probability distributions can be computed. The final step is to search for maxima in these probability functions and then to construct from these extremes an optimal motion field. A number of simulation examples will be presented.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...