On a Real-Time Walsh-Hadamard/Cosine Transform Image Processor

Hein, D. N.; Ahmed, N.

doi:10.1109/temc.1978.303679

Cited by 52 publications

(14 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Other transforms which can be employed for image coding are the discrete Hartley transform (DHT) (Malvar 1987), Walsh-Hadamard transform (WHT) (Hein and Ahmed 1978), slant transform (ST), Haar transform (HT), discrete sine transform (DST), discrete Legendre transform (DLT) (Sahasrabudha et al 1982), Karhunen-Loeve transform (KLT), and hybrid transforms like the Slant-Haar and the HadamardHaar transform (HHT). Some of these transforms allow efficient implementations of the DCT by mapping it to these transforms.…”

Section: Transform Codingmentioning

confidence: 99%

Impact of QOS requirements on video coding for ATM networks

Murthy

Lalgudi

1996

Multimedia Systems

View full text Add to dashboard Cite

The broadband integrated services digital networks (B-ISDN) based on asynchronous transfer mode (ATM) technology can support a wide range of applications such as voice, video, still images, and data. Compression techniques increase the effective bandwidth utilization, but the bursty and asynchronous nature of the traffic can still lead to congestion in the network, and degradation of image quality and quality of service (QOS). Some of the features to provide better coding schemes for ATM networks are layered coding, resynchronization, buffering, interleaved schemes, constrained bit rate due to buffers, encapsulation with the RTP or AAL1 for clock recovery, lapped transforms, motion compensation, and optimal bit allocation for coders based on wavelet transforms. We review various techniques for image and video coding such as transforms, motion compensation, vector quantization, and subband coding. We outline the impact of the cell loss ratio (CLR), delay and cell delay variation (CDV) on video coding: blocking effects, loss of frame synchronization, motion vectors, and vector quantization codewords. The open problems include tuning coding parameters to the available QOS provided by the network.

show abstract

Section: Transform Codingmentioning

confidence: 99%

Impact of QOS requirements on video coding for ATM networks

Murthy

Lalgudi

1996

Multimedia Systems

View full text Add to dashboard Cite

show abstract

“…The chip was tested in a vision system connected to a robot arm that caught ping-pong balls as they were rolled across a table. An image processor used for image coding and video bandwidth compression was reported by Hein and Ahmed (1978). It implemented the Discrete Cosine, or Walsh-Hadamard transform, in real time.…”

Section: Vlsi Image Processing Chipsmentioning

confidence: 99%

<title>Optical range finding from image focus</title>

Weckler¹,

Kranzler²

1990

Sensing and Reconstruction of Three-Dimensional Objects and Scenes

View full text Add to dashboard Cite

“…Since the terms of a convergent series can be grouped in parenthesis in any manner to form new terms without altering the order of the terms and the resulting series has the same sum as the original series [5], equation (I4) can be written as (15) Consider Q(2qn/N)/2, given by…”

Section: Theorem: M6bius Inversion Of the Series Given By Equation (9mentioning

confidence: 99%

“…where/NI is the maximum integer < N. Since two convergent series can be added or subtracted term by term and the resulting series converges to the same value as the sum or difference of the original two series 1"5], and since the inner sums in equations (15) and (16) have a finite number of terms, subtracting (16) from (15) gets rid of all the terms with m even in the original series given by equation (14). Generalizing this process, Q(kqn/N)/k, k = 3, 4, 5 .... is given by (17) …”

Section: Theorem: M6bius Inversion Of the Series Given By Equation (9mentioning

confidence: 99%

“…PM represents RDFT in terms of 2 matrices of factorization. This is similar to the factorization of discrete cosine transform (DCT) or DFT, where the first matrix corresponds to the Walsh-Hadamard transform (WriT) [15], [16]. However, in these cases, the second matrix is not made up of blocks of circular correlation, and there is no simple way to compute them.…”

Section: Representation Of Rdft In Terms Of the New Basis Functionsmentioning

confidence: 99%

See 1 more Smart Citation