<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Irfan Essa&#039;s Academic Activities &#187; CVPR</title>
	<atom:link href="http://prof.irfanessa.com/tag/cvpr/feed/" rel="self" type="application/rss+xml" />
	<link>http://prof.irfanessa.com</link>
	<description>Academic/Professional Activities</description>
	<lastBuildDate>Thu, 01 Apr 2010 15:31:12 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=abc</generator>
		<item>
		<title>CVPR 2010: Accepted Papers</title>
		<link>http://prof.irfanessa.com/2010/04/01/cvpr-2010-accepted-papers/</link>
		<comments>http://prof.irfanessa.com/2010/04/01/cvpr-2010-accepted-papers/#comments</comments>
		<pubDate>Thu, 01 Apr 2010 15:31:12 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Activity Recognition]]></category>
		<category><![CDATA[Computational Photography and Video]]></category>
		<category><![CDATA[Jessica Hodgins]]></category>
		<category><![CDATA[Kihwan Kim]]></category>
		<category><![CDATA[Matthias Grundmann]]></category>
		<category><![CDATA[PAMI/ICCV/CVPR/ECCV]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Vivek Kwatra]]></category>
		<category><![CDATA[2010]]></category>
		<category><![CDATA[CVPR]]></category>

		<guid isPermaLink="false">http://prof.irfanessa.com/?p=645</guid>
		<description><![CDATA[We have the following 4 papers that have been accepted for publications in IEEE CVPR 2010. More details forthcoming, with links to more details. Matthias Grundmann, Vivek Kwatra, Mei Han, and Irfan Essa (2010) &#8220;Discontinuous Seam-Carving for Video Retargeting&#8221; (a GA Tech, Google Collaboration) Matthias Grundmann, Vivek Kwatra, Mei Han, and Irfan Essa (2010) &#8220;Efficient Hierarchical Graph-Based Video [...]]]></description>
			<content:encoded><![CDATA[<div>We have the following 4 papers that have been accepted for publications in IEEE <a href="http://www.cvpr2010.org" target="_blank">CVPR 2010</a>. More details forthcoming, with links to more details.</div>
<ul>
<li>Matthias Grundmann, Vivek Kwatra, Mei Han, and Irfan Essa (2010) &#8220;Discontinuous Seam-Carving for Video Retargeting&#8221; (a GA Tech, Google Collaboration)</li>
<li>Matthias Grundmann, Vivek Kwatra, Mei Han, and Irfan Essa (2010) &#8220;Efficient Hierarchical Graph-Based Video Segmentation&#8221; (a GA Tech, Google Collaboration)</li>
<li>Kihwan Kim, Matthias Grundmann, Ariel Shamir, Iain Matthews, Jessica Hodgins, and Irfan Essa (2010) &#8220;Motion Fields to Predict Play Evolution in Dynamic Sport Scenes&#8221; (a GA Tech, Disney Collaboration)</li>
<li>Raffay Hamid, Ramkrishan Kumar, Matthias Grundmann, Kihwan Kim, Irfan Essa, and Jessica Hodgins (2010) &#8220;Player Localization Using Multiple Static Cameras for Sports Visualization&#8221; (a GA Tech, Disney Collaboration)</li>
</ul>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2010/04/01/cvpr-2010-accepted-papers/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Paper: IEEE CVPR (2007) &#8220;Tree-based Classifiers for Bilayer Video Segmentation&#8221;</title>
		<link>http://prof.irfanessa.com/2007/06/17/paper-ieee-cvpr-2007-tree-based-classifiers-for-bilayer-video-segmentation/</link>
		<comments>http://prof.irfanessa.com/2007/06/17/paper-ieee-cvpr-2007-tree-based-classifiers-for-bilayer-video-segmentation/#comments</comments>
		<pubDate>Sun, 17 Jun 2007 15:18:24 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Antonio Crimisini]]></category>
		<category><![CDATA[Computational Photography and Video]]></category>
		<category><![CDATA[Funding]]></category>
		<category><![CDATA[John Winn]]></category>
		<category><![CDATA[NSF (0205507)]]></category>
		<category><![CDATA[Numerical Machine Learning]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Pei Yin]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[2007]]></category>
		<category><![CDATA[Computer Vision]]></category>
		<category><![CDATA[CVPR]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2007/06/17/paper-ieee-cvpr-2007-tree-based-classifiers-for-bilayer-video-segmentation/</guid>
		<description><![CDATA[Yin, Pei Criminisi, Antonio Winn, John Essa, Irfan (2007), Tree-based Classifiers for Bilayer Video Segmentation In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2007. CVPR &#8217;07, 17-22 June 2007, page(s): 1 &#8211; 8, Location: Minneapolis, MN, USA, ISBN: 1-4244-1180-7, Digital Object Identifier: 10.1109/CVPR.2007.383008 Abstract This paper presents an algorithm for the automatic segmentation of monocular videos [...]]]></description>
			<content:encoded><![CDATA[<p>Yin, Pei   Criminisi, Antonio   Winn, John   Essa, Irfan (2007), <a href="http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=4270033&amp;isnumber=4269956&amp;punumber=4269955&amp;k2dockey=4270033@ieeecnfs&amp;query=%28%28essa%29%3Cin%3Eau+%29&amp;pos=6">Tree-based Classifiers for Bilayer Video Segmentation</a> In Proceedings of <em>IEEE Conference on Computer Vision and Pattern Recognition, 2007. CVPR &#8217;07</em>, 17-22 June 2007, page(s): 1 &#8211; 8, Location: Minneapolis, MN, USA, ISBN: 1-4244-1180-7, Digital Object Identifier: 10.1109/CVPR.2007.383008</p>
<p align="center"><strong>Abstract</strong></p>
<p style="text-align: justify;">This paper presents an algorithm for the automatic segmentation of monocular videos into foreground and background layers. Correct segmentations are produced even in the presence of large background motion with nearly stationary foreground. There are three key contributions. The first is the introduction of a novel motion representation, &#8220;motons&#8221;, inspired by research in object recognition. Second, we propose learning the segmentation likelihood from the spatial context of motion. The learning is efficiently performed by Random Forests. The third contribution is a general taxonomy of tree-based classifiers, which facilitates theoretical and experimental comparisons of several known classification algorithms, as well as spawning new ones. Diverse visual cues such as motion, motion context, colour, contrast and spatial priors are fused together by means of a Conditional Random Field (CRF) model. Segmentation is then achieved by binary min-cut. Our algorithm requires no initialization. Experiments on many video-chat type sequences demonstrate the effectiveness of our algorithm in a variety of scenes. The segmentation results are comparable to those obtained by stereo systems.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2007/06/17/paper-ieee-cvpr-2007-tree-based-classifiers-for-bilayer-video-segmentation/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Paper: IEEE CVPR (2004) &#8220;Asymmetrically boosted HMM for speech reading&#8221;</title>
		<link>http://prof.irfanessa.com/2004/06/02/ieeexplore-asymmetrically-boosted-hmm-for-speech-reading/</link>
		<comments>http://prof.irfanessa.com/2004/06/02/ieeexplore-asymmetrically-boosted-hmm-for-speech-reading/#comments</comments>
		<pubDate>Wed, 02 Jun 2004 22:46:44 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Funding]]></category>
		<category><![CDATA[James Rehg]]></category>
		<category><![CDATA[NSF (0205507)]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Pei Yin]]></category>
		<category><![CDATA[2004]]></category>
		<category><![CDATA[Computer Vision]]></category>
		<category><![CDATA[CVPR]]></category>
		<category><![CDATA[Faces]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2004/06/02/ieeexplore-asymmetrically-boosted-hmm-for-speech-reading/</guid>
		<description><![CDATA[Pei Yin Essa, I. Rehg, J.M. (2004) &#8220;Asymmetrically boosted HMM for speech reading,&#8221;, In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004 (CVPR 2004). Publication Date: 27 June-2 July 2004, Volume: 2, On page(s): II-755 &#8211; II-761 Vol.2 ISSN: 1063-6919, ISBN: 0-7695-2158-, INSPEC Accession Number:8161546, Digital Object Identifier: 10.1109/CVPR.2004.1315240 [...]]]></description>
			<content:encoded><![CDATA[<p>Pei Yin   Essa, I.   Rehg, J.M. (2004) &#8220;<a href="http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=1315240&amp;isnumber=29134&amp;punumber=9183&amp;k2dockey=1315240@ieeecnfs&amp;query=%28%28essa%29%3Cin%3Eau+%29&amp;pos=22">Asymmetrically boosted HMM for speech reading</a>,&#8221;, In <em>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004 (CVPR 2004)</em>. Publication Date: 27 June-2 July 2004, Volume: 2, On page(s): II-755 &#8211; II-761 Vol.2 ISSN: 1063-6919, ISBN: 0-7695-2158-, INSPEC Accession Number:8161546, Digital Object Identifier: 10.1109/CVPR.2004.1315240</p>
<p align="center"><strong>Abstract</strong></p>
<p style="text-align: justify;">Speech reading, also known as lip reading, is aimed at extracting visual cues of lip and facial movements to aid in recognition of speech. The main hurdle for speech reading is that visual measurements of lip and facial motion lack information-rich features like the Mel frequency cepstral coefficients (MFCC), widely used in acoustic speech recognition. These MFCC are used with hidden Markov models (HMM) in most speech recognition systems at present. Speech reading could greatly benefit from automatic selection and formation of informative features from measurements in the visual domain. These new features can then be used with HMM to capture the dynamics of lip movement and eventual recognition of lip shapes. Towards this end, we use AdaBoost methods for automatic visual feature formation. Specifically, we design an asymmetric variant of AdaBoost M2 algorithm to deal with the ill-posed multi-class sample distribution inherent in our problem. Our experiments show that the boosted HMM approach outperforms conventional AdaBoost and HMM classifiers. Our primary contributions are in the design of (a) boosted HMM and (b) asymmetric multi-class boosting.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2004/06/02/ieeexplore-asymmetrically-boosted-hmm-for-speech-reading/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
