<?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>prof.irfanessa.com &#187; 2005</title>
	<atom:link href="http://prof.irfanessa.com/tag/2005/feed/" rel="self" type="application/rss+xml" />
	<link>http://prof.irfanessa.com</link>
	<description>Irfan Essa&#039;s Academic Activities</description>
	<lastBuildDate>Wed, 25 Jan 2012 23:42:09 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	
		<item>
		<title>Paper: J. Parallel Distrib. Computing (2005): &#8220;Experiences with optimizing two stream-based applications for cluster execution&#8221;</title>
		<link>http://prof.irfanessa.com/2006/09/30/experiences-with-optimizing-two-stream-based-applications-for-cluster-execution/?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=experiences-with-optimizing-two-stream-based-applications-for-cluster-execution</link>
		<comments>http://prof.irfanessa.com/2006/09/30/experiences-with-optimizing-two-stream-based-applications-for-cluster-execution/#comments</comments>
		<pubDate>Sun, 01 Oct 2006 01:23:01 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Computational Photography and Video]]></category>
		<category><![CDATA[James Rehg]]></category>
		<category><![CDATA[Kishore Ramachandran]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[2005]]></category>
		<category><![CDATA[Computational Photography]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://essa.org/irfan/wp/?p=21</guid>
		<description><![CDATA[Experiences with optimizing two stream-based applications for cluster execution Angelov, Y., Ramachandran, U., Mackenzie, K., Rehg, J. M., and Essa, I. 2005. &#8220;Experiences with optimizing two stream-based applications for cluster execution&#8221;. J. Parallel Distrib. Comput. 65, 6 (Jun. 2005), 678-691. [DOI] Abstract We explore optimization strategies and resulting performance of two stream-based video applications, video [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://portal.acm.org/citation.cfm?id=1090293&amp;dl=GUIDE&amp;coll=GUIDE&amp;CFID=37077616&amp;CFTOKEN=23868565">Experiences with optimizing two stream-based applications for cluster execution</a> Angelov, Y., Ramachandran, U., Mackenzie, K., Rehg, J. M., and Essa, I. 2005. &#8220;Experiences with optimizing two stream-based applications for cluster execution&#8221;. <em>J. Parallel Distrib. Comput.</em> 65, 6 (Jun. 2005), 678-691. [<a href="http://dx.doi.org/10.1016/j.jpdc.2005.02.002" target="_blank">DOI</a>]</p>
<p align="center"><strong>Abstract</strong></p>
<p class="abstract" style="text-align: justify;">We explore optimization strategies and resulting performance of two stream-based video applications, video texture and color tracker, on a cluster of SMPs. The two applications are representative of a class of emerging applications, which we call &#8220;stream-based applications&#8221;, that are sensitive to both latency of individual results and overall throughput. Such applications require non-trivial parallelization techniques in order to improve both latency and throughput, given that the stream data emanates from a limited set of sources (exactly one in the two applications studied) and that the distribution of the data cannot be done a priori.We suggest techniques that address in a coordinated fashion the problems of data distribution and work partitioning. We believe the two problems are related and need to be addressed together. We have parallelized two applications using the Stampede cluster programming system that provides abstractions for implementing time-and throughput-sensitive applications elegantly and efficiently. For the Video Textures application we show that we can achieve a speedup of 24.26 on a 112 processor cluster. For the Color Tracker application, where latency is more crucial, we identify the extent of data parallelism that ensures that the slowest member of the pipeline is no longer the bottleneck for achieving a decent frame rate.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2006/09/30/experiences-with-optimizing-two-stream-based-applications-for-cluster-execution/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Paper: ACM SIGGRAPH (2005) &#8220;Texture optimization for example-based synthesis&#8221;</title>
		<link>http://prof.irfanessa.com/2005/07/25/texture-optimization/?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=texture-optimization</link>
		<comments>http://prof.irfanessa.com/2005/07/25/texture-optimization/#comments</comments>
		<pubDate>Tue, 26 Jul 2005 01:11:49 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Aaron Bobick]]></category>
		<category><![CDATA[ACM SIGGRAPH]]></category>
		<category><![CDATA[Computational Photography and Video]]></category>
		<category><![CDATA[Nipun Kwatra]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[Vivek Kwatra]]></category>
		<category><![CDATA[2005]]></category>
		<category><![CDATA[Computational Photography]]></category>
		<category><![CDATA[Computational Video]]></category>
		<category><![CDATA[Computer Graphics]]></category>
		<category><![CDATA[SIGGRAPH]]></category>
		<category><![CDATA[Texture Synthesis]]></category>
		<category><![CDATA[Video Textures]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2005/07/25/paper-acm-siggraph-2005-texture-optimization-for-example-based-synthesis/</guid>
		<description><![CDATA[Vivek Kwatra, Irfan Essa, Aaron Bobick, and Nipun Kwatra (2005), &#8220;Texture optimization for example-based synthesis&#8221; In ACM Transactions on Graphics (TOG) Volume 24 , Issue 3 (July 2005) Proceedings of ACM SIGGRAPH 2005, Pages: 795 &#8211; 802, ISSN:0730-0301 (DOI&#124;PDF&#124;Project Site&#124;Video&#124;Talk) ABSTRACT We present a novel technique for texture synthesis using optimization. We define a Markov [...]]]></description>
			<content:encoded><![CDATA[<p>Vivek Kwatra, Irfan Essa, Aaron Bobick, and Nipun Kwatra (2005), &#8220;<a href="http://portal.acm.org/citation.cfm?id=1073204.1073263&amp;coll=ACM&amp;dl=ACM&amp;CFID=63156436&amp;CFTOKEN=24591103">Texture optimization for example-based synthesis</a>&#8221; In ACM Transactions on Graphics (TOG)  Volume 24 ,  Issue 3  (July 2005)  Proceedings of ACM SIGGRAPH 2005, Pages: 795 &#8211; 802, ISSN:0730-0301 (<a href="http://doi.acm.org/10.1145/1073204.1073263" target="_blank">DOI</a>|<a href="http://www-static.cc.gatech.edu/gvu/perception/projects/textureoptimization/TO-final.pdf" target="_blank">PDF</a>|<a href="http://www-static.cc.gatech.edu/gvu/perception/projects/textureoptimization/TO-final.pdf" target="_blank">Project Site</a>|<a href="http://www-static.cc.gatech.edu/gvu/perception/projects/textureoptimization/TextureOptimization_DVD.mov" target="_blank">Video</a>|<a href="http://www-static.cc.gatech.edu/gvu/perception/projects/textureoptimization/TO-sig05.ppt" target="_blank">Talk</a>)</p>
<p align="center"><strong>ABSTRACT</strong></p>
<p><img src="http://www-static.cc.gatech.edu/gvu/perception/projects/textureoptimization/KeySmoke_Resized_0delay.gif" alt="TextureOptimization" width="176" height="176" align="right" />We present a novel technique for texture synthesis using optimization. We define a Markov Random Field (MRF)-based similarity metric for measuring the quality of synthesized texture with respect to a given input sample. This allows us to formulate the synthesis problem as minimization of an energy function, which is optimized using an Expectation Maximization (EM)-like algorithm. In contrast to most example-based techniques that do region-growing, ours is a joint optimization approach that progressively refines the entire texture. Additionally, our approach is ideally suited to allow for controllable synthesis of textures. Specifically, we demonstrate controllability by animating image textures using flow fields. We allow for general two-dimensional flow fields that may dynamically change over time. Applications of this technique include dynamic texturing of fluid animations and texture-based flow visualization.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2005/07/25/texture-optimization/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
<enclosure url="http://www-static.cc.gatech.edu/gvu/perception/projects/textureoptimization/TextureOptimization_DVD.mov" length="141769454" type="video/quicktime" />
		</item>
		<item>
		<title>Paper: IEEE CVPR (2005) &#8220;Tracking multiple objects through occlusions&#8221;</title>
		<link>http://prof.irfanessa.com/2005/06/20/paper-ieee-cvpr-2005-tracking-multiple-objects-through-occlusions/?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=paper-ieee-cvpr-2005-tracking-multiple-objects-through-occlusions</link>
		<comments>http://prof.irfanessa.com/2005/06/20/paper-ieee-cvpr-2005-tracking-multiple-objects-through-occlusions/#comments</comments>
		<pubDate>Mon, 20 Jun 2005 17:13:50 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Activity Recognition]]></category>
		<category><![CDATA[Aware Home]]></category>
		<category><![CDATA[PAMI/ICCV/CVPR/ECCV]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Yan Huang]]></category>
		<category><![CDATA[2005]]></category>
		<category><![CDATA[Computer Vision]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2005/06/20/paper-ieee-cvpr-2005-tracking-multiple-objects-through-occlusions/</guid>
		<description><![CDATA[Huang, Y and Essa, I. (2005) &#8220;Tracking multiple objects through occlusions&#8221;,  In Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005 (CVPR 2005), Volume: 2 page(s): 1051 &#8211; 1058 vol. 2, ISSN: 1063-6919, ISBN: 0-7695-2372-2, INSPEC Accession Number:8633324 DOI: 10.1109/CVPR.2005.350, [IEEEXplore#] 20-25 June 2005 ABSTRACT We present an approach for tracking [...]]]></description>
			<content:encoded><![CDATA[<p>Huang, Y and Essa, I. (2005) &#8220;Tracking multiple objects through occlusions&#8221;,  In Proceedings of IEEE Computer Society Conference on <em>Computer Vision and Pattern Recognition</em>, 2005 (CVPR 2005), Volume: 2 page(s): 1051 &#8211; 1058 vol. 2, ISSN: 1063-6919, ISBN: 0-7695-2372-2, INSPEC Accession Number:8633324 DOI: 10.1109/CVPR.2005.350<a href="http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=1467559&amp;isnumber=31473&amp;punumber=9901&amp;k2dockey=1467559@ieeecnfs&amp;query=%28%28essa%29%3Cin%3Eau+%29&amp;pos=18">, [IEEEXplore#]</a> 20-25 June 2005</p>
<p align="center"><strong>ABSTRACT</strong></p>
<p style="text-align: justify;">We present an approach for tracking varying number of objects through both temporally and spatially significant occlusions. Our method builds on the idea of object permanence to reason about occlusions. To this end, tracking is performed at both the region level and the object level. At the region level, a customized genetic algorithm is used to search for optimal region tracks. This limits the scope of object trajectories. At the object level, each object is located based on adaptive appearance models, spatial distributions and inter-occlusion relationships. The proposed architecture is capable of tracking objects even in the presence of long periods of full occlusions. We demonstrate the viability of this approach by experimenting on several videos of a user interacting with a variety of objects on a desktop.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2005/06/20/paper-ieee-cvpr-2005-tracking-multiple-objects-through-occlusions/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Showcase: DVFX 2005 Video Productions</title>
		<link>http://prof.irfanessa.com/2005/04/28/dvfx-2005-video-productions/?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=dvfx-2005-video-productions</link>
		<comments>http://prof.irfanessa.com/2005/04/28/dvfx-2005-video-productions/#comments</comments>
		<pubDate>Thu, 28 Apr 2005 19:00:00 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[DVFX]]></category>
		<category><![CDATA[Teaching]]></category>
		<category><![CDATA[2005]]></category>

		<guid isPermaLink="false">http://essa.org/irfan/wp/?p=18</guid>
		<description><![CDATA[DVFX 2005 Video Productions The Digital Video Special Effects class of Spring 2004 (CS 4480) presented their final productions on April 28, 2005 in CoCB 16 at 2:00p. Students showed and discussed the short video segments (less than 1 minutes each) that they have produced to showcase the technical special effects they have generated during [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://swiki.cc.gatech.edu:8080/dvfx2005/uploads/180/mosaic.jpg"><img style="margin: 0pt 0pt 10px 10px; float: right; cursor: pointer; width: 200px;" src="http://swiki.cc.gatech.edu:8080/dvfx2005/uploads/180/mosaic.jpg" border="0" alt="" /></a><a href="http://www-static.cc.gatech.edu/dvfx/videos/dvfx2005.html">DVFX 2005 Video Productions</a></p>
<p>The Digital Video Special Effects class of Spring 2004 (CS 4480) presented their final productions on <span style="text-decoration: underline;">April 28, 2005 in CoCB 16 at 2:00p</span>. Students showed and discussed the short video segments (less than 1 minutes each) that they have produced to showcase the technical special effects they have generated during the course of the semester.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2005/04/28/dvfx-2005-video-productions/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Served from: prof.irfanessa.com @ 2012-02-05 14:18:21 -->
