@conference {18237,
	title = {Joint uplink and downlink optimization for video conferencing over wireless LAN},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/03//},
	pages = {ii/1101 - ii/1104 Vol. 2 - ii/1101 - ii/1104 Vol. 2},
	abstract = {A real-time video conferencing framework is proposed for multiple conferencing pairs by jointly considering the uplink and downlink conditions within IEEE 802.11 networks. We formulate this system so as to minimize the maximal end-to-end expected distortion received by all users by selecting the PHY modes and transmission time. Compared with the strategy of individually optimizing uplink and downlink, the proposed framework outperforms by 3.67-8.65 dB for the average received PSNR among all users.},
	keywords = {802.11, conferencing, conferencing;, distortion;, end-to-end, expected, IEEE, joint, LAN;, maximal, minimisation;, modes;, multiple, networks;, optimization;, pairs;, PHY, PSNR;, real-time, teleconferencing;, time;, transmission, uplink-downlink, video, wireless},
	doi = {10.1109/ICASSP.2005.1415601},
	author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R}
}
@conference {14025,
	title = {A robust and self-reconfigurable design of spherical microphone array for multi-resolution beamforming},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {4},
	year = {2005},
	month = {2005/03//},
	pages = {iv/1137 - iv/1140 Vol. 4 - iv/1137 - iv/1140 Vol. 4},
	abstract = {We describe a robust and self-reconfigurable design of a spherical microphone array for beamforming. Our approach achieves a multi-resolution spherical beamformer with performance that is either optimal in the approximation of desired beampattern or is optimal in the directivity achieved, both robustly. Our implementation converges to the optimal performance quickly while exactly satisfying the specified frequency response and robustness constraint in each iteration step without accumulated round-off errors. The advantage of this design lies in its robustness and self-reconfiguration in microphone array reorganization, such as microphone failure, which is highly desirable in online maintenance and anti-terrorism. Design examples and simulation results are presented.},
	keywords = {3D, anti-terrorism;, array, array;, arrays;, audio, beam, beamforming;, beampattern, directivity, Frequency, microphone, multiresolution, omnidirectional, optimisation;, optimization;, processing;, reorganization, response;, robustness;, sampling;, self-reconfigurable, signal, soundfield, spherical, steering;},
	doi = {10.1109/ICASSP.2005.1416214},
	author = {Zhiyun Li and Duraiswami, Ramani}
}
@conference {13220,
	title = {Flexible layout and optimal cancellation of the orthonormality error for spherical microphone arrays},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {4},
	year = {2004},
	month = {2004/05//},
	pages = {iv-41 - iv-44 vol.4 - iv-41 - iv-44 vol.4},
	abstract = {This paper describes an approach to achieving a flexible layout of microphones on the surface of a spherical microphone array for beamforming. Our approach achieves orthonormality of spherical harmonics to higher order for relatively distributed layouts. This gives great flexibility in microphone layout on the spherical surface. One direct advantage is that it makes it much easier to build a real world system, such as those with cable outlets and a mounting base, with minimal effects on the performance. Simulation results are presented.},
	keywords = {array, audio, base;, beamforming;, cable, cancellation, correction;, error, flexible, harmonics;, higher, layout;, microphone, microphones;, mounting, optimization;, order, orthonormality, outlets;, processing;, signal, spherical, surface;},
	doi = {10.1109/ICASSP.2004.1326758},
	author = {Zhiyun Li and Duraiswami, Ramani and Grassi,E. and Davis, Larry S.}
}
@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.}
}
@article {14886,
	title = {Lambertian reflectance and linear subspaces},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {25},
	year = {2003},
	month = {2003/02//},
	pages = {218 - 233},
	abstract = {We prove that the set of all Lambertian reflectance functions (the mapping from surface normals to intensities) obtained with arbitrary distant light sources lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a wide variety of lighting conditions can be approximated accurately by a low-dimensional linear subspace, explaining prior empirical results. We also provide a simple analytic characterization of this linear space. We obtain these results by representing lighting using spherical harmonics and describing the effects of Lambertian materials as the analog of a convolution. These results allow us to construct algorithms for object recognition based on linear methods as well as algorithms that use convex optimization to enforce nonnegative lighting functions. We also show a simple way to enforce nonnegative lighting when the images of an object lie near a 4D linear space. We apply these algorithms to perform face recognition by finding the 3D model that best matches a 2D query image.},
	keywords = {2D, 4D, 9D, analog;, analytic, characterization;, convex, convolution, distant, functions;, harmonics;, image, image;, intensities;, Lambertian, light, lighting, linear, methods;, nonnegative, normals;, object, optimization;, programming;, query, recognition;, reflectance;, reflectivity;, set;, sources;, space;, spherical, subspace;, subspaces;, surface},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2003.1177153},
	author = {Basri,R. and Jacobs, David W.}
}
@conference {13514,
	title = {Binarization of low quality text using a Markov random field model},
	booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {160 - 163 vol.3 - 160 - 163 vol.3},
	abstract = {Binarization techniques have been developed in the document analysis community for over 30 years and many algorithms have been used successfully. On the other hand, document analysis tasks are more and more frequently being applied to multimedia documents such as video sequences. Due to low resolution and lossy compression, the binarization of text included in the frames is a non-trivial task. Existing techniques work without a model of the spatial relationships in the image, which makes them less powerful. We introduce a new technique based on a Markov random field model of the document. The model parameters (clique potentials) are learned from training data and the binary image is estimated in a Bayesian framework. The performance is evaluated using commercial OCR software.},
	keywords = {analysis;, annealing;, Bayes, Bayesian, binarization;, computing;, distributions;, document, documents;, field;, Gibbs, image, low, Markov, method;, methods;, multimedia, optimization;, probability;, processes;, processing;, QUALITY, random, simulated, text},
	doi = {10.1109/ICPR.2002.1047819},
	author = {Wolf,C. and David Doermann}
}
