article · 1993

Parallel vision algorithms using sparse array presentations

Ravi V. Shankar, Ravi V. Shankar, Ravi V. Shankar, Ra. Vi V Shankar

Cited by 0Abstract and details only

Abstract

Abstract: Sparse arrays are arrays in which the number of non-zero elements is a small fraction of the total number of array elements. This paper presents computer vision algorithms using sparse representations for arrays. The parallel architecture considered is a hypercube. The algorithms can be easily modified for other architectures like the mesh. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit. 1

Cite this paper

APA 7

Shankar, R. V., Shankar, R. V., Shankar, R. V., & Shankar, R. V. V. (1993). Parallel vision algorithms using sparse array presentations.

MLA 9

Shankar, Ravi V., et al. “Parallel vision algorithms using sparse array presentations.” 1993.

Chicago

Shankar, Ravi V., Ravi V. Shankar, Ravi V. Shankar, and Ra. Vi V Shankar. 1993. “Parallel vision algorithms using sparse array presentations.”

Harvard

Shankar, R.V. et al. (1993) ‘Parallel vision algorithms using sparse array presentations’.

BibTeX

@article{shankar1993parallel,
  title = {{Parallel vision algorithms using sparse array presentations}},
  author = {Shankar, Ravi V. and Shankar, Ravi V. and Shankar, Ravi V. and Shankar, Ra. Vi V},
  year = {1993}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.