@conference {12650,
	title = {An algebraic approach to surface reconstruction from gradient fields},
	booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on},
	volume = {1},
	year = {2005},
	month = {2005/10//},
	pages = {174 - 181 Vol. 1 - 174 - 181 Vol. 1},
	abstract = {Several important problems in computer vision such as shape from shading (SFS) and photometric stereo (PS) require reconstructing a surface from an estimated gradient field, which is usually non-integrable, i.e. have non-zero curl. We propose a purely algebraic approach to enforce integrability in discrete domain. We first show that enforcing integrability can be formulated as solving a single linear system Ax =b over the image. In general, this system is under-determined. We show conditions under which the system can be solved and a method to get to those conditions based on graph theory. The proposed approach is non-iterative, has the important property of local error confinement and can be applied to several problems. Results on SFS and PS demonstrate the applicability of our method.},
	keywords = {algebra;, algebraic, approach;, Computer, confinement;, discrete, domain, error, field;, from, gradient, graph, image, integrability;, linear, local, methods;, photometric, reconstruction;, shading;, SHAPE, stereo;, surface, system;, theory;, vision;},
	doi = {10.1109/ICCV.2005.31},
	author = {Agrawal,A. and Chellapa, Rama and Raskar, R.}
}
@article {18163,
	title = {An interactive and team approach to multimedia design curriculum},
	journal = {Signal Processing Magazine, IEEE},
	volume = {22},
	year = {2005},
	month = {2005/11//},
	pages = {14 - 19},
	abstract = {Over the past decade, increasingly powerful technologies have made it easier to compress, distribute, and store multimedia content. The merger of computing and communications has created a ubiquitous infrastructure that brings digital multimedia closer to the users and opens up tremendous educational and commercial opportunities in multimedia content creation, delivery, rendering, and archiving for millions of users worldwide. Multimedia has become a basic skill demanded by an increasing number of potential jobs for electrical engineering/computer science graduates. In this article, the authors intend to share their experiences and new ways of thinking about curriculum development. It is beneficial for colleagues in the multimedia signal processing areas for use in developing or revising the curriculum to fit the needs and resources of their own programs.},
	keywords = {approach;, communication;, courses;, curriculum, curriculum;, design, development;, digital, education;, educational, interactive, learning;, multimedia, multimedia;, processing;, signal, team},
	isbn = {1053-5888},
	doi = {10.1109/MSP.2005.1550186},
	author = {M. Wu and Liu,K. J.R}
}
@conference {13198,
	title = {Kernel-based Bayesian filtering for object tracking},
	booktitle = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on},
	volume = {1},
	year = {2005},
	month = {2005/06//},
	pages = {227 - 234 vol. 1 - 227 - 234 vol. 1},
	abstract = {Particle filtering provides a general framework for propagating probability density functions in nonlinear and non-Gaussian systems. However, the algorithm is based on a Monte Carlo approach and sampling is a problematic issue, especially for high dimensional problems. This paper presents a new kernel-based Bayesian filtering framework, which adopts an analytic approach to better approximate and propagate density functions. In this framework, the techniques of density interpolation and density approximation are introduced to represent the likelihood and the posterior densities by Gaussian mixtures, where all parameters such as the number of mixands, their weight, mean, and covariance are automatically determined. The proposed analytic approach is shown to perform sampling more efficiently in high dimensional space. We apply our algorithm to real-time tracking problems, and demonstrate its performance on real video sequences as well as synthetic examples.},
	keywords = {approach;, approximation;, Bayes, Bayesian, Carlo, density, detection;, filtering;, functions;, Gaussian, interpolation;, kernel-based, methods;, mixtures;, Monte, nonGaussian, nonlinear, object, particle, probability, probability;, processes;, recognition;, sampling, sampling;, sequences;, system;, tracking;, video},
	doi = {10.1109/CVPR.2005.199},
	author = {Han,Bohyung and Zhu,Ying and Comaniciu, D. and Davis, Larry S.}
}
@conference {18207,
	title = {Efficient bandwidth resource allocation for low-delay multiuser MPEG-4 video transmission},
	booktitle = {Communications, 2004 IEEE International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/06//},
	pages = {1308 - 1312 Vol.3 - 1308 - 1312 Vol.3},
	abstract = {An efficient bandwidth resource allocation algorithm with low delay and low fluctuation of quality to transmit multiple MPEG-4 fine granularity scalability (FGS) video programs to multiple users is proposed in this paper. By exploring the variation in the scene complexity of each video program and jointly redistributing available system resources among users, our proposed algorithm provides low fluctuation of quality for each user and consistent quality among all users. Experimental results show that compared to a traditional look-ahead sliding-window approach, our scheme can achieve comparable perceptual quality and channel utilization at a much lower cost of delay, computation, and storage.},
	keywords = {algorithm;, allocation, allocation;, approach;, Bandwidth, broadband, channel, channels;, coding;, delays;, expert, FGS;, fine, granularity, group;, look-ahead, moving, MPEG-4, multiuser, networks;, of, picture, program;, QUALITY, resource, scalability;, service;, sliding-window, transmission;, utilization;, video},
	doi = {10.1109/ICC.2004.1312724},
	author = {Su,Guan-Ming and M. Wu}
}
@article {18437,
	title = {Susceptibility matrix: a new aid to software auditing},
	journal = {Security Privacy, IEEE},
	volume = {2},
	year = {2004},
	month = {2004/04//mar},
	pages = {16 - 21},
	abstract = {Testing for security is lengthy, complex, and costly, so focusing test efforts in areas that have the greatest number of security vulnerabilities is essential. This article describes a taxonomy-based approach that gives an insight into the distribution of vulnerabilities in a system.},
	keywords = {approach;, auditing;, data;, matrix;, of, program, Security, software, susceptibility, taxonomy-based, testing;, vulnerabilities;},
	isbn = {1540-7993},
	doi = {10.1109/MSECP.2004.1281240},
	author = {Jiwnani,K. and Zelkowitz, Marvin V}
}
@conference {13217,
	title = {Window-based, discontinuity preserving stereo},
	booktitle = {Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on},
	volume = {1},
	year = {2004},
	month = {2004/07/02/june},
	pages = {I-66 - I-73 Vol.1 - I-66 - I-73 Vol.1},
	abstract = {Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper we present an algorithm which combines window-based local matching into a global optimization framework. Our local matching algorithm assumes that local windows can have at most two disparities. Under this assumption, the local matching can be performed very efficiently using graph cuts. The global matching is formulated as minimization of an energy term that takes into account the matching constraints induced by the local stereo algorithm. Fast, approximate minimization of this energy is achieved through graph cuts. The key feature of our algorithm is that it preserves discontinuities both during the local as well as global matching phase.},
	keywords = {algorithm;, approach;, based, cuts;, dense, discontinuity, global, graph, image, local, MATCHING, matching;, minimisation;, optimization;, Pixel, preserving, processing;, stereo, theory;, window},
	doi = {10.1109/CVPR.2004.1315015},
	author = {Agrawal,M. and Davis, Larry S.}
}
@conference {12718,
	title = {Rank constrained recognition under unknown illuminations},
	booktitle = {Analysis and Modeling of Faces and Gestures, 2003. AMFG 2003. IEEE International Workshop on},
	year = {2003},
	month = {2003/10//},
	pages = {11 - 18},
	abstract = {Recognition under illumination variations is a challenging problem. The key is to successfully separate the illumination source from the observed appearance. Once separated, what remains is invariant to illuminant and appropriate for recognition. Most current efforts employ a Lambertian reflectance model with varying albedo field ignoring both attached and cast shadows, but restrict themselves by using object-specific samples, which undesirably deprives them of recognizing new objects not in the training samples. Using rank constraints on the albedo and the surface normal, we accomplish illumination separation in a more general setting, e.g., with class-specific samples via a factorization approach. In addition, we handle shadows (both attached and cast ones) by treating them as missing values, and resolve the ambiguities in the factorization method by enforcing integrability. As far as recognition is concerned, a bootstrap set which is just a collection of two-dimensional image observations can be utilized to avoid the explicit requirement that three-dimensional information be available. Our approaches produce good recognition results as shown in our experiments using the PIE database.},
	keywords = {albedo, approach;, constrained, database;, databases;, decomposition;, factorization, field;, illumination, image;, information;, Lambertian, lighting;, model;, object, object-specific, PIE, rank, recognition;, reflectance, samples;, singular, three-dimensional, two-dimensional, value, variations;, visual},
	doi = {10.1109/AMFG.2003.1240818},
	author = {Zhou, S. and Chellapa, Rama}
}
@conference {18266,
	title = {Resistance of orthogonal Gaussian fingerprints to collusion attacks},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {1},
	year = {2003},
	month = {2003/07//},
	pages = {I - 617-20 vol.1 - I - 617-20 vol.1},
	abstract = {Digital fingerprinting is a means to offer protection to digital data by which fingerprints embedded in the multimedia are capable of identifying unauthorized use of digital content. A powerful attack that can be employed to reduce this tracing capability is collusion. In this paper, we study the collusion resistance of a fingerprinting system employing Gaussian distributed fingerprints and orthogonal modulation. We propose a likelihood-based approach to estimate the number of colluders, and introduce the thresholding detector for colluder identification. We first analyze the collusion resistance of a system to the average attack by considering the probability of a false negative and the probability of a false positive when identifying colluders. Lower and upper bounds for the maximum number of colluders K<sub>max</sub> are derived. We then show that the detectors are robust to different attacks. We further study different sets of performance criteria.},
	keywords = {approach;, attacks;, capability;, collusion, data, data;, digital, distributed, embedded, fingerprinting;, fingerprints;, Gaussian, likelihood-based, modulation;, multimedia, of, orthogonal, probability;, processes;, protection;, Security, systems;, tracing},
	doi = {10.1109/ICME.2003.1220993},
	author = {Wang,Z.J. and M. Wu and Zhao,Hong and Liu,K. J.R and Trappe,W.}
}
@conference {12735,
	title = {Video synthesis of arbitrary views for approximately planar scenes},
	booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on},
	volume = {3},
	year = {2003},
	month = {2003/04//},
	pages = {III - 497-500 vol.3 - III - 497-500 vol.3},
	abstract = {In this paper, we propose a method to synthesize arbitrary views of a planar scene, given a monocular video sequence. The method is based on the availability of knowledge of the angle between the original and synthesized views. Such a method has many important applications, one of them being gait recognition. Gait recognition algorithms rely on the availability of an approximate side-view of the person. From a realistic viewpoint, such an assumption is impractical in surveillance applications and it is of interest to develop methods to synthesize a side view of the person, given an arbitrary view. For large distances from the camera, a planar approximation for the individual can be assumed. In this paper, we propose a perspective projection approach for recovering the direction of motion of the person purely from the video data, followed by synthesis of a new video sequence at a different angle. The algorithm works purely in the image and video domain, though 3D structure plays an implicit role in its theoretical justification. Examples of synthesized views using our method and performance evaluation are presented.},
	keywords = {(access, 3D, applications;, approach;, approximately, approximation;, arbitrary, Biometrics, control);, data;, direction, estimation;, evaluation;, Gait, image, monocular, MOTION, performance, perspective, planar, processing;, projection, recognition;, recovery;, scenes;, sequence;, sequences;, side, signal, structure;, Surveillance, surveillance;, synthesis;, synthesized, video, view, views;},
	doi = {10.1109/ICASSP.2003.1199520},
	author = {Chowdhury, A.K.R. and Kale, A. and Chellapa, Rama}
}
@article {12752,
	title = {A generic approach to simultaneous tracking and verification in video},
	journal = {Image Processing, IEEE Transactions on},
	volume = {11},
	year = {2002},
	month = {2002/05//},
	pages = {530 - 544},
	abstract = {A generic approach to simultaneous tracking and verification in video data is presented. The approach is based on posterior density estimation using sequential Monte Carlo methods. Visual tracking, which is in essence a temporal correspondence problem, is solved through probability density propagation, with the density being defined over a proper state space characterizing the object configuration. Verification is realized through hypothesis testing using the estimated posterior density. In its most basic form, verification can be performed as follows. Given a measurement vector Z and two hypotheses H<sub>1</sub> and H0, we first estimate posterior probabilities P(H<sub>0</sub>|Z) and P(H<sub>1</sub>|Z), and then choose the one with the larger posterior probability as the true hypothesis. Several applications of the approach are illustrated by experiments devised to evaluate its performance. The idea is first tested on synthetic data, and then experiments with real video sequences are presented, illustrating vehicle tracking and verification, human (face) tracking and verification, facial feature tracking, and image sequence stabilization.},
	keywords = {approach;, Carlo, configuration;, correspondence, data;, density, density;, estimated, estimation;, evaluation;, extraction;, Face, facial, feature, generic, human, hypothesis, image, measurement, methods;, Monte, object, performance, posterior, probability, probability;, problem;, processing;, propagation;, recognition;, road, sequence, sequences;, sequential, signal, space;, stabilization;, state, synthetic, temporal, testing;, tracking;, vector;, vehicle, vehicles;, verification;, video, visual},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2002.1006400},
	author = {Li,Baoxin and Chellapa, Rama}
}
@article {15402,
	title = {RF scattering and radiation by using a decoupled Helmholtz equation approach},
	journal = {Magnetics, IEEE Transactions on},
	volume = {29},
	year = {1993},
	month = {1993/03//},
	pages = {2040 - 2042},
	abstract = {A novel finite-element formulation for the solution of 3-D RF scattering and radiation problems is presented. This formulation is based on the solution of a set of decoupled Helmholtz equations for the Cartesian components of the field vectors. This results in a robust, computer-efficient method that eliminates previous difficulties associated with {\textquoteleft}curl-curl{\textquoteright} type partial differential equations. Although it is presented in the frequency domain, the method is easily extendible to the time domain},
	keywords = {3D, analysis;, approach;, computer-efficient, computing;, decoupled, domain;, electrical, electromagnetic, element, engineering, equation, finite, finite-element, formulation;, Frequency, frequency-domain, Helmholtz, method;, Physics, problems;, propagation;, radiation, radiowave, RF, scattering;, wave},
	isbn = {0018-9464},
	doi = {10.1109/20.250811},
	author = {D{\textquoteright}Angelo,J. and Mayergoyz, Issak D}
}
