1996 IEEE International Solid-State Circuits Conference. Digest of TEchnical Papers, ISSCC
DOI: 10.1109/isscc.1996.488528
|View full text |Cite
|
Sign up to set email alerts
|

B/W adaptive image grabber with analog motion vector estimator at 0.3 GOPS

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(13 citation statements)
references
References 3 publications
0
13
0
Order By: Relevance
“…Since in finding the best motion vectors most of the processing time is taken loading pixels into memory, it can be shown that the proposed serial-parallel 1 architecture performs at about 70% of the operating speed of fully-parallel architectures [8], [12], [13]. The latter are many more times complicated than necessary for ME, an issue which was overlooked in [8].…”
Section: Architecturementioning
confidence: 99%
See 2 more Smart Citations
“…Since in finding the best motion vectors most of the processing time is taken loading pixels into memory, it can be shown that the proposed serial-parallel 1 architecture performs at about 70% of the operating speed of fully-parallel architectures [8], [12], [13]. The latter are many more times complicated than necessary for ME, an issue which was overlooked in [8].…”
Section: Architecturementioning
confidence: 99%
“…The latter are many more times complicated than necessary for ME, an issue which was overlooked in [8]. Hence, the efficient architecture in this work results in large savings in power consumption and size (see comparison in Section IV).…”
Section: Architecturementioning
confidence: 99%
See 1 more Smart Citation
“…An example of weight regularity which allows implementation on a weight-routed array is interframe block-matching [13,14,15], where the weights on one row are a shifted version of the weights of the row before ( fig. 11).…”
Section: 4: Weight-stored and Weight-routed Arraysmentioning
confidence: 99%
“…Blockmatching is an algorithm for computing relative image frame motion by matching a block of pixels in the current frame to the best location among a finite set of possible locations within a "search window" of the previous frame [13,14]. Our computing array has been implemented with a CMOS camera and analog frame buffers on a powerful analog smart sensor [15], though the discussion here will focus only on the core of the computing array.…”
Section: : Euclidean-squared Computing Arraymentioning
confidence: 99%