In this thesis, we propose a chroma keying system that automatically estimates the alpha map and the reliable intrinsic color of foreground objects in front of solid background. Our system is designed to be capable of distinguishing the transparent foreground from the re flective foreground and shaded background, thereby making the artifacts of the composited image less conspicuous. Speci cally, we assume that the transparent region tends to be with higher saturation and lightness compared with region re ecting background light. With this assumption, a threshold function (TF) on a saturation-lightness plane is de ned according to human visual experiments. The pixels with color mixed with the background light (conventional unknown pixels) are now further categorized into re ective pixels and transparent pixels according to TF. In this case, the re ective and the transparent regions are separated to improve the alpha matte quality. Furthermore, a new color representation model is proposed to estimate the intrinsic color of each pixel according to the global color distribution of the image. The underlying assumption of our proposed model is that all colors in a natural image can be approximated by a limited number of chrominance values (dominant colors). Speci cally, the color statistics are counted by 2D histogram analysis. Then, we approximate the color distribution by the sum of a set of Gaussian mixture functions (GMF), whose centroids are the dominant colors (Dc) of the image. By choosing colors around each Dc, the possible intrinsic colors for each pixel can be comprehensively and e fficiently selected. Considering the fast development of IP-based video broadcasting, we present a data hiding scheme that can protect the chroma keying results when the image/video data is recorded in the JPEG/H.264 format. According to our simulation, the proposed chroma keying system generates high quality composited images that are little a ected by re ecting, background shading, and intrinsic color missing.

International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California / The architecture of the High Rate (600 Mega-bits per second) Digital Demodulator (HRDD) ASIC capable of demodulating BPSK and QPSK modulated data is presented in this paper. The advantages of all-digital processing include increased flexibility and reliability with reduced reproduction costs. Conventional serial digital processing would require high processing rates necessitating a hardware implementation other than CMOS technology such as Gallium Arsenide (GaAs) which has high cost and power requirements. It is more desirable to use CMOS technology with its lower power requirements and higher gate density. However, digital demodulation of high data rates in CMOS requires parallel algorithms to process the sampled data at a rate lower than the data rate. The parallel processing algorithms described here were developed jointly by NASA’s Goddard Space Flight Center (GSFC) and the Jet Propulsion Laboratory (JPL). The resulting all-digital receiver has the capability to demodulate BPSK, QPSK, OQPSK, and DQPSK at data rates in excess of 300 Mega-bits per second (Mbps) per channel. This paper will provide an overview of the parallel architecture and features of the HRDR ASIC. In addition, this paper will provide an overview of the implementation of the hardware architectures used to create flexibility over conventional high rate analog or hybrid receivers. This flexibility includes a wide range of data rates, modulation schemes, and operating environments. In conclusion it will be shown how this high rate digital demodulator can be used with an off-the-shelf A/D and a flexible analog front end, both of which are numerically computer controlled, to produce a very flexible, low cost high rate digital receiver.

International Telemetering Conference Proceedings / October 23-26, 2000 / Town & Country Hotel and Conference Center, San Diego, California / An algorithm for automatic modulation recognition of ASK, PSK and FSK was developed by Azzouz and Nandi. The algorithm has some serious problems at SNR of 10 dB and below. This paper describes a modification to the algorithm that significantly improves the performance for detection of ASK and FSK at moderate and low SNR.

International Telemetering Conference Proceedings / October 25-28, 1999 / Riviera Hotel and Convention Center, Las Vegas, Nevada / We present a novel communications link concept. This system offers the potential of low data rate full-duplex communications between earth and LEO. We will present a detailed link model for this system.

A digital modulation method using Chirp-Slope Keying (CSK) is developed for coherent underwater acoustic communications. Effective signal detection is a critical stage in the implementation of any communications system; we will see that CSK solves some significant challenges to reliable detection. This thesis is primarily based on analyzing the effectiveness of CSK through simulations using Matlab's Simulink for underwater communications. The procedure begins with modulating a chirp's slope by random binary data with a linear-down-slope chirp representing a 0, and a linear-up-slope chirp representing a 1. Each received symbol is demodulated by multiplying it with the exact linear-up-slope chirp and then integrating over a whole period (i.e., integrate and dump). This slope-detection technique reduces the need for the extensive recognition of the magnitude and/or the frequencies of the signal. Simulations demonstrate that CSK offers sturdy performance in the modeled ocean environment, even at very low signal-to-noise ratio (SNR). CSK is first tested using the fundamental communication channel, Additive White Gaussian Noise (AWGN) channel. Simulation results show excellent BER vs. SNR performance, implying CSK is a promising method. Further extensive analysis and simulations are performed to evaluate the quality of CSK in more realistic channels including Rayleigh amplitude fading channel and multipath.

Thesis (M.S.)--Ohio University, June, 2002. / Title from PDF t.p. Includes bibliographical references (leaves 47-48).

Thesis (M.S.)--Ohio University, November, 2004. / Includes bibliographical references (p. 76-77)

Thesis (M.S.)--Ohio University, November, 2004. / Title from PDF t.p. Includes bibliographical references (p. 76-77)

This thesis proposes a novel chroma keying method based on stereo images, which can be applied to post-process the alpha matte generated by any existing matting approach. Given a pair of stereo images, a new matting Laplacian matrix is constructed based on the affinities between matching pixels and their neighbors from two frames. Based on the new matting Laplacian matrix, a new cost function is also formulated to estimate alpha values of the reference image through the propagation between stereo images.

No description available.