<?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; 2004</title>
	<atom:link href="http://prof.irfanessa.com/tag/2004/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>Talk at USC&#8217;s IRIS (2004): &#8220;Temporal Reasoning from Video to Temporal Synthesis of Video&#8221;</title>
		<link>http://prof.irfanessa.com/2004/10/30/talk-at-uscs-iris-2004/</link>
		<comments>http://prof.irfanessa.com/2004/10/30/talk-at-uscs-iris-2004/#comments</comments>
		<pubDate>Sun, 31 Oct 2004 01:09:39 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Activity Recognition]]></category>
		<category><![CDATA[Aware Home]]></category>
		<category><![CDATA[Computational Photography and Video]]></category>
		<category><![CDATA[Presentations]]></category>
		<category><![CDATA[2004]]></category>
		<category><![CDATA[Computer Vision]]></category>

		<guid isPermaLink="false">http://irfan.essa.org/wp/2004/10/30/talk-at-uscs-iris-2004/</guid>
		<description><![CDATA[Irfan Essa (2004), &#8220;Temporal Reasoning from Video to Temporal Synthesis of Video&#8221; Talk at USC&#8217;s IRIS-Vision Seminars (Fall 2004). Temporal Reasoning from Video to Temporal Synthesis of Video Abstract In this talk, I will present some ongoing work on extracting spatio-temporal cues from video for both synthesis of novel video sequences, and recognition of complex [...]]]></description>
			<content:encoded><![CDATA[<ul>
<li>Irfan Essa (2004), &#8220;Temporal Reasoning from Video to Temporal Synthesis of Video&#8221;<a href="http://iris.usc.edu/Information/seminars/essa.html"> Talk at USC&#8217;s IRIS-Vision Seminars (Fall 2004).</a></li>
</ul>
<p align="center"><strong>Temporal Reasoning from Video to Temporal Synthesis of Video</strong></p>
<p align="center">Abstract</p>
<p style="text-align: justify;">In this talk, I will present some ongoing work on extracting spatio-temporal cues from video for both synthesis of novel video sequences, and recognition of complex activities. I will start off with some of our earlier work on Video Textures, where repeating information is extracted to generate extended sequences of videos. I will then describe some of our extensions to this approach that allow for controlled generation of animations of video sprites. We have developed various learning and optimization techniques that allow for video-based animations of photo-realistic characters. Then I will describe our new approach for image and video synthesis that builds on optimal patch-based copying of samples. I will show how our method allows for iterative refinement and extends to synthesis of both images and video from very limited samples. In the next part of my talk, I will describe how a similar analysis of video can be used to recognize what a person is doing in a scene. Such an analysis of video, aimed at recognition, requires more contextual information about the environment. I will show how we leverage contextual information shared between actions and objects to recognize what is happening in complex environments. I will also show that by adding some form of grammar (we use Stochastic Context Free Grammar) we can recognize very complex, multi-tasked activities.</p>
<p style="text-align: justify;">If time permits, I will describe (very briefly) the Aware Home project at Georgia Tech, which is one primary area of ongoing and future research for me and my group. Further information on my work with videos is available from my webpage at <a href="http://www.cc.gatech.edu/%7Eirfan">http://www.cc.gatech.edu/~irfan</a></p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2004/10/30/talk-at-uscs-iris-2004/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>ESORICS Paper (2004): &#8220;Parameterized Authentication&#8221;</title>
		<link>http://prof.irfanessa.com/2004/09/30/esorics-paper-2004-parameterized-authentication/</link>
		<comments>http://prof.irfanessa.com/2004/09/30/esorics-paper-2004-parameterized-authentication/#comments</comments>
		<pubDate>Fri, 01 Oct 2004 00:43:49 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Aware Home]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Security]]></category>
		<category><![CDATA[2004]]></category>
		<category><![CDATA[Info Security]]></category>

		<guid isPermaLink="false">http://irfan.essa.org/wp/2004/09/30/esorics-paper-2004-parameterized-authentication/</guid>
		<description><![CDATA[Computer Security &#8211; ESORICS 2004]]></description>
			<content:encoded><![CDATA[<p><a href="http://books.google.com/books?id=QiK0bkzVH8sC&amp;pg=PA276&amp;lpg=PA276&amp;dq=irfan+essa&amp;source=web&amp;ots=9fZsHak39-&amp;sig=6EMCy3oIkAiJwnEYnJztYK93gSM">Computer Security &#8211; ESORICS 2004</a><a href="http://books.google.com/books?id=QiK0bkzVH8sC&amp;pg=PA276&amp;lpg=PA276&amp;dq=irfan+essa&amp;source=web&amp;ots=9fZsHak39-&amp;sig=6EMCy3oIkAiJwnEYnJztYK93gSM"> </a></p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2004/09/30/esorics-paper-2004-parameterized-authentication/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>
		<item>
		<title>Paper: IEEE CVPR (2004) &#8220;Propagation networks for recognition of partially ordered sequential action&#8221;</title>
		<link>http://prof.irfanessa.com/2004/06/02/ieeexplore-propagation-networks-for-recognition-of-partially-ordered-sequential-action/</link>
		<comments>http://prof.irfanessa.com/2004/06/02/ieeexplore-propagation-networks-for-recognition-of-partially-ordered-sequential-action/#comments</comments>
		<pubDate>Wed, 02 Jun 2004 22:44:31 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Aaron Bobick]]></category>
		<category><![CDATA[Activity Recognition]]></category>
		<category><![CDATA[Aware Home]]></category>
		<category><![CDATA[David Minnen]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Yan Huang]]></category>
		<category><![CDATA[Yifan Shi]]></category>
		<category><![CDATA[2004]]></category>
		<category><![CDATA[Computer Vision]]></category>
		<category><![CDATA[DVFX]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2004/06/02/ieeexplore-propagation-networks-for-recognition-of-partially-ordered-sequential-action/</guid>
		<description><![CDATA[Yifan Shi, Yan Huang, Minnen, D., Bobick, A., Essa, I. (2004), &#8220;Propagation networks for recognition of partially ordered sequential action&#8221; In Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004 (CVPR 2004). Volume: 2, page(s): II-862 &#8211; II-869 Vol.2, ISSN: 1063-6919, ISBN: 0-7695-2158-4, INSPEC Accession Number:8161557, Digital Object Identifier: [...]]]></description>
			<content:encoded><![CDATA[<p>Yifan Shi, Yan Huang,   Minnen, D.,   Bobick, A.,   Essa, I. (2004), &#8220;Propagation networks for recognition of partially ordered sequential action&#8221; In Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004 (CVPR 2004). Volume: 2, page(s): II-862 &#8211; II-869 Vol.2, ISSN: 1063-6919, ISBN: 0-7695-2158-4, INSPEC Accession Number:8161557, Digital Object Identifier: 10.1109/CVPR.2004.1315255, 27 June-2 July 2004<a href="http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=1315255&amp;isnumber=29134&amp;punumber=9183&amp;k2dockey=1315255@ieeecnfs&amp;query=%28%28essa%29%3Cin%3Eau+%29&amp;pos=21"> (IEEEXplore)</a></p>
<p align="center"><strong>Abstract</strong></p>
<p style="text-align: justify;">We present propagation networks (P-nets), a novel approach for representing and recognizing sequential activities that include parallel streams of action. We represent each activity using partially ordered intervals. Each interval is restricted by both temporal and logical constraints, including information about its duration and its temporal relationship with other intervals. P-nets associate one node with each temporal interval. Each node is triggered according to a probability density function that depends on the state of its parent nodes. Each node also has an associated observation function that characterizes supporting perceptual evidence. To facilitate real-time analysis, we introduce a particle filter framework to explore the conditional state space. We modify the original condensation algorithm to more efficiently sample a discrete state space (D-condensation). Experiments in the domain of blood glucose monitor calibration demonstrate both the representational power of P-nets and the effectiveness of the D-condensation algorithm.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2004/06/02/ieeexplore-propagation-networks-for-recognition-of-partially-ordered-sequential-action/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
