<?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; NSF</title>
	<atom:link href="http://prof.irfanessa.com/tag/nsf/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>Paper (2009): ICASSP &#8220;Learning Basic Units in American Sign Language using Discriminative Segmental Feature Selection&#8221;</title>
		<link>http://prof.irfanessa.com/2009/02/04/paper-2009-icassp-learning-basic-units-in-american-sign-language-using-discriminative-segmental-feature-selection/</link>
		<comments>http://prof.irfanessa.com/2009/02/04/paper-2009-icassp-learning-basic-units-in-american-sign-language-using-discriminative-segmental-feature-selection/#comments</comments>
		<pubDate>Wed, 04 Feb 2009 13:21:47 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Face and Gesture]]></category>
		<category><![CDATA[Funding]]></category>
		<category><![CDATA[ICASSP]]></category>
		<category><![CDATA[James Rehg]]></category>
		<category><![CDATA[NSF (0205507)]]></category>
		<category><![CDATA[Numerical Machine Learning]]></category>
		<category><![CDATA[Pei Yin]]></category>
		<category><![CDATA[Thad Starner]]></category>
		<category><![CDATA[2009]]></category>
		<category><![CDATA[Gesture]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/?p=464</guid>
		<description><![CDATA[Pei Yin, Thad Starner, Harley Hamilton, Irfan Essa, James M. Rehg (2009), &#8221;Learning Basic Units in American Sign Language using Discriminative Segmental Feature Selection&#8221; in IEEE Conference on Acoustics, Speech, and Signal Processing 2009 (ICASSP 2009). Session: Spoken Language Understanding I, Tuesday, April 21, 11:00 &#8211; 13:00, Taipei, Taiwan. ABSTRACT The natural language for most deaf signers in [...]]]></description>
			<content:encoded><![CDATA[<p>Pei Yin, Thad Starner, Harley Hamilton, Irfan Essa, James M. Rehg (2009), &#8221;Learning Basic Units in American Sign Language using Discriminative Segmental Feature Selection&#8221; in <em>IEEE Conference on Acoustics, Speech, and Signal Processing 2009 (</em><a href="http://www.icassp09.com/default.asp" target="_blank"><em>ICASSP 2009</em></a><em>)</em>. Session: Spoken Language Understanding I, Tuesday, April 21, 11:00 &#8211; 13:00, Taipei, Taiwan.</p>
<p style="text-align: center;"><strong>ABSTRACT</strong></p>
<p style="text-align: justify;">The natural language for most deaf signers in the United States is American Sign Language (ASL). ASL has internal structure like spoken languages, and ASL linguists have introduced several phonemic models. The study of ASL phonemes is not only interesting to linguists, but also useful for scalability in recognition by machines. Since machine perception is different than human perception, this paper learns the basic units for ASL directly from data. Comparing with previous studies, our approach computes a set of data-driven units (fenemes) discriminatively from the results of segmental feature selection. The learning iterates the following two steps: first apply discriminative feature selection segmentally to the signs, and then tie the most similar temporal segments to re-train. Intuitively, the sign parts indistinguishable to machines are merged to form basic units, which we call ASL fenemes. Experiments on publicly available ASL recognition data show that the extracted data-driven fenemes are meaningful, and recognition using those fenemes achieves improved accuracy at reduced model complexity</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2009/02/04/paper-2009-icassp-learning-basic-units-in-american-sign-language-using-discriminative-segmental-feature-selection/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Funding (2007): NSF &#8220;Web on Demand &#8211; Bridging the Gap Between Social Networks and Ad Hoc Networking&#8221;</title>
		<link>http://prof.irfanessa.com/2008/09/01/funding-2007-nsf-web-on-demand-bridging-the-gap-between-social-networks-and-ad-hoc-networking/</link>
		<comments>http://prof.irfanessa.com/2008/09/01/funding-2007-nsf-web-on-demand-bridging-the-gap-between-social-networks-and-ad-hoc-networking/#comments</comments>
		<pubDate>Mon, 01 Sep 2008 13:04:55 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Computational Journalism]]></category>
		<category><![CDATA[Kishore Ramachandran]]></category>
		<category><![CDATA[Mobile Computing]]></category>
		<category><![CDATA[2008]]></category>
		<category><![CDATA[CnJ]]></category>
		<category><![CDATA[Crowdsourcing]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/?p=462</guid>
		<description><![CDATA[Award#0834545 &#8211; CSR-DMSS, SM: Web on Demand &#8211; Bridging the Gap Between Social Networks and Ad Hoc Networking Investigator(s): Umakishore Ramachandran, (Principal Investigator), Irfan Essa (Co-Principal Investigator) Dates: September 1, 2008 &#8211; August 31, 2009 (Estimated) Abstract From the western world to the third world, the use of handheld devices (cellphones, PDAs) has proliferated. The [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://nsf.gov/awardsearch/showAward.do?AwardNumber=0834545">Award#0834545 &#8211; CSR-DMSS, SM:   Web on Demand &#8211; Bridging the Gap Between Social Networks and Ad Hoc Networking</a></p>
<p>Investigator(s): Umakishore Ramachandran, (Principal Investigator), Irfan Essa (Co-Principal Investigator)</p>
<p>Dates:	 September 1, 2008 &#8211; August 31, 2009 (Estimated)</p>
<p style="text-align: center;"><strong>Abstract</strong></p>
<p style="text-align: justify;">From the western world to the third world, the use of handheld devices (cellphones, PDAs) has proliferated. The world of users is becoming both wireless and mobile. Web 2.0 has ushered in an age wherein the web is viewed as a provider of services and not just a repository of documents and/or information. Despite this advance, the web remains just that, a single web with an inherent assumption that a powerful computing and communication infrastructure supports it. Couldn&#8217;t mobile wireless devices in close proximity form a web of their own? This is the vision behind this project, the Web on Demand (WoD). WoD aims at bridging the gap between social networks and ad hoc networking. In other words, it aims to rethink the system software stack all the way from application to networking that would allow the creation and management of social networks without any assumption of infrastructure support. The core of the research is to develop software technologies for mobile devices that would allow the dynamic creation of thematic ad hoc overlay networks empowering (a) mobile people with similar interests (e.g., weather forecast), (b) friends and family (e.g., in a theme park), and (c) participants in mission critical applications (e.g., search and rescue), stay connected. WoD complements the World Wide Web (WWW) and leverages it when it is available, such as exploiting the ambient computing infrastructure to enhance user experience, and managing the dynamic creation of User Generated Content (UGC) by mobile users. The vision behind this project is to democratize access to services that are currently offered through WWW. In this sense, the results from this research can have far-reaching technological and societal consequences. Most importantly, the research will help breed a new class of computer scientists who are connected with societal causes in addition to advancing technology.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2008/09/01/funding-2007-nsf-web-on-demand-bridging-the-gap-between-social-networks-and-ad-hoc-networking/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Paper: ICASSP (2008) &#8220;Discriminative Feature Selection for Hidden Markov Models using Segmental Boosting&#8221;</title>
		<link>http://prof.irfanessa.com/2008/04/03/paper-icassp-2008-discriminative-feature-selection-for-hidden-markov-models-using-segmental-boosting/</link>
		<comments>http://prof.irfanessa.com/2008/04/03/paper-icassp-2008-discriminative-feature-selection-for-hidden-markov-models-using-segmental-boosting/#comments</comments>
		<pubDate>Thu, 03 Apr 2008 20:53:56 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Face and Gesture]]></category>
		<category><![CDATA[Funding]]></category>
		<category><![CDATA[James Rehg]]></category>
		<category><![CDATA[NSF (0205507)]]></category>
		<category><![CDATA[Numerical Machine Learning]]></category>
		<category><![CDATA[PAMI/ICCV/CVPR/ECCV]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Pei Yin]]></category>
		<category><![CDATA[Thad Starner]]></category>
		<category><![CDATA[2008]]></category>
		<category><![CDATA[Gesture]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2008/04/03/paper-icassp-2008-discriminative-feature-selection-for-hidden-markov-models-using-segmental-boosting/</guid>
		<description><![CDATA[Pei Yin, Irfan Essa, James Rehg, Thad Starner (2008) &#8220;Discriminative Feature Selection for Hidden Markov Models using Segmental Boosting&#8221;, ICASSP 2008 &#8211; March 30 &#8211; April 4, 2008 &#8211; Las Vegas, Nevada, U.S.A. (Paper: MLSP-P3.D8, Session: Pattern Recognition and Classification II, Time: Thursday, April 3, 15:30 &#8211; 17:30, Topic: Machine Learning for Signal Processing: Learning [...]]]></description>
			<content:encoded><![CDATA[<p>Pei Yin, Irfan Essa, James Rehg, Thad Starner (2008)  &#8220;Discriminative Feature Selection for Hidden Markov Models using Segmental Boosting&#8221;, <a href="http://www.icassp2008.org/Papers/viewpapers.asp?papernum=1612">ICASSP 2008 &#8211; March 30 &#8211; April 4, 2008 &#8211; Las Vegas, Nevada, U.S.A.</a> (Paper:	MLSP-P3.D8, Session:	Pattern Recognition and Classification II, Time:	Thursday, April 3, 15:30 &#8211; 17:30, Topic: 	Machine Learning for Signal Processing: Learning Theory and Modeling) (<a href="http://www.cc.gatech.edu/~pyin/pdf/SBHMMICASSP08.pdf">PDF</a>|<a href="http://www.cc.gatech.edu/cpl/projects/sbhmm/" target="_blank">Project Site</a>)</p>
<p align="center">ABSTRACT</p>
<p><a title="icassp08" href="http://academics.irfanessa.com/wp-content/uploads/2008/04/sister73.jpg"><img src="http://academics.irfanessa.com/wp-content/uploads/2008/04/sister73.jpg" alt="icassp08" hspace="5" vspace="5" align="left" /></a>We address the feature selection problem for hidden Markov models (HMMs) in sequence classification. Temporal correlation in sequences often causes difficulty in applying feature selection techniques. Inspired by segmental k-means segmentation (SKS), we propose Segmentally Boosted HMMs (SBHMMs), where the state-optimized features are constructed in a segmental and discriminative manner. The contributions are twofold. First, we introduce a novel feature selection algorithm, where the temporal dynamics are decoupled from the static learning procedure by assuming that the sequential data are piecewise independent and identically distributed. Second, we show that the SBHMM consistently improves traditional HMM recognition in various domains. The reduction of error compared to traditional HMMs ranges from 17% to 70% in American Sign Language recognition, human gait identification, lip reading, and speech recognition.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2008/04/03/paper-icassp-2008-discriminative-feature-selection-for-hidden-markov-models-using-segmental-boosting/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Funding: NSF (2008) &#8220;Symposium on Computation and Journalism&#8221;</title>
		<link>http://prof.irfanessa.com/2008/03/08/funding-nsf-2008-symposium-on-computation-and-journalism/</link>
		<comments>http://prof.irfanessa.com/2008/03/08/funding-nsf-2008-symposium-on-computation-and-journalism/#comments</comments>
		<pubDate>Sat, 08 Mar 2008 14:52:29 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Computational Journalism]]></category>
		<category><![CDATA[Funding]]></category>
		<category><![CDATA[2008]]></category>
		<category><![CDATA[CnJ]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2008/03/08/funding-nsf-2008-symposium-on-computation-and-journalism/</guid>
		<description><![CDATA[Award#0813831 &#8211; Symposium on Computation and Journalism ABSTRACT Fundamentally, journalism is aimed at collecting news information and disseminating that information with a layer of contextualization and understanding provided by journalists. Recent advances in computational technology are rapidly affecting how news information is gathered, reported and distributed. Furthermore, new avenues for aggregating, visualizing, summarizing, consuming, and [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://nsf.gov/awardsearch/showAward.do?AwardNumber=0813831">Award#0813831 &#8211; Symposium on Computation and Journalism</a></p>
<p style="text-align: center;"><strong>ABSTRACT</strong></p>
<p style="text-align: justify;">Fundamentally, journalism is aimed at collecting news information and disseminating that information with a layer of contextualization and understanding provided by journalists. Recent advances in computational technology are rapidly affecting how news information is gathered, reported and distributed. Furthermore, new avenues for aggregating, visualizing, summarizing, consuming, and collaborating on news are increasingly becoming popular and challenging traditional practices of Journalism. Following the success of text search, image and video search questions are now poised to make a bigger impact to journalism and other related fields. Computation and Journalism individually share a deep routed interest in Information, and the value it provides to society. The concept of Information Quality, the measure of the value that the information provides to the user of that information, brings these two disciplines together. In computing and information sciences, information quality is used to describe the degree of excellence in communicating knowledge or intelligence and is composed of different facets such as accuracy, reliability, comprehensiveness, currency, and validity. In journalism, where the conveyance of quality information is paramount, principles such as accuracy, fairness, thoroughness, and transparency guide journalists in communicating quality information. Traditionally, journalism has also entailed an ethos of working on the side of the citizenry to provide them with quality information they need to make informed decisions in the process of their daily lives. However, the plethora of un-vetted blogs, podcasts, videos and other online media, generated by users or by corporations with subjective biases have led to significant compromise in information quality. Collaborative knowledge generation (wikipedia), and citizen journalism, are showing new ways of how information and (global) news can be shared. However, as the Web and the Internet continue to grow and as computing technologies pervade through the planet, a thorough study of the process of journalism and the deep computational aspects of such processes need to be undertaken. To this end, the PI&#8217;s research group at Georgia Institute of Technology is interested in understanding how computational advances impact the field of journalism. The long term aim is to make novel contributions by developing computational technologies to better support the goals of journalism. To launch this effort, they are organizing a Symposium on Computation + Journalism at GA Tech, in Atlanta, GA, February 22-23, 2008. The goal of this symposium is to bring together stakeholder from the all aspects of Journalism, Media, and Computation. Participants in panels, presentations and breakout groups will discuss these issues and create a roadmap towards answering these questions that bring together computation and journalism.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2008/03/08/funding-nsf-2008-symposium-on-computation-and-journalism/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Thesis: Mitch Parry PhD (2007), &#8220;Separation and Analysis of Multichannel Signals&#8221;</title>
		<link>http://prof.irfanessa.com/2007/10/09/mitch-parry-phd-thesis-2007-separation-and-analysis-of-multichannel-signals/</link>
		<comments>http://prof.irfanessa.com/2007/10/09/mitch-parry-phd-thesis-2007-separation-and-analysis-of-multichannel-signals/#comments</comments>
		<pubDate>Tue, 09 Oct 2007 14:54:50 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Audio Analysis]]></category>
		<category><![CDATA[Funding]]></category>
		<category><![CDATA[Mitch Parry]]></category>
		<category><![CDATA[NSF (0205507)]]></category>
		<category><![CDATA[PhD]]></category>
		<category><![CDATA[Thesis]]></category>
		<category><![CDATA[2007]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://essa.org/irfan/wp/?p=34</guid>
		<description><![CDATA[Mitch Parry (2007), Separation and Analysis of Multichannel Signals PhD Thesis [PDF], Georgia Institute of Techniology, College of Computing, Atlanta, GA. (Advisor: Irfan Essa) Abstract This thesis examines a large and growing class of digital signals that capture the combined effect of multiple underlying factors. In order to better understand these signals, we would like [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://home.cc.gatech.edu/parry" target="_blank">Mitch Parry</a> (2007), <a href="http://etd.gatech.edu/theses/available/etd-10052007-144600/">Separation and Analysis of Multichannel Signals</a> PhD Thesis [<a href="http://www.cc.gatech.edu/~parry/thesis/parry-thesis.pdf" target="_blank">PDF</a>], Georgia Institute of Techniology, College of Computing, Atlanta, GA. (Advisor: <a href="http://www.cc.gatech.edu/~irfan">Irfan Essa</a>)</p>
<p><strong>Abstract</strong></p>
<p><a href="http://home.cc.gatech.edu/parry" target="_blank"><img src="http://home.cc.gatech.edu/parry/uploads/1/mitch2.jpg" align="right" height="106" width="130" /></a>This thesis examines a large and growing class of digital signals that capture the combined effect of multiple underlying factors. In order to better understand these signals, we would like to separate and analyze the underlying factors independently. Although source separation applies to a wide variety of signals, this thesis focuses on separating individual instruments from a musical recording. In particular, we propose novel algorithms for separating instrument recordings given only their mixture. When the number of source signals does not exceed the number of mixture signals, we focus on a subclass of source separation algorithms based on joint diagonalization. Each approach leverages a different form of source structure. We introduce repetitive structure as an alternative that leverages unique repetition patterns in music and compare its performance against the other techniques.</p>
<p>When the number of source signals exceeds the number of mixtures (i.e., the underdetermined problem), we focus on spectrogram factorization techniques for source separation. We extend single-channel techniques to utilize the additional spatial information in multichannel recordings, and use phase information to improve the estimation of the underlying components.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2007/10/09/mitch-parry-phd-thesis-2007-separation-and-analysis-of-multichannel-signals/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Funding: NSF/SGER (2007) &#8220;Persistent, Adaptive, Collaborative Synthespians&#8221;</title>
		<link>http://prof.irfanessa.com/2007/09/15/funding-nsfsger-2007-persistent-adaptive-collaborative-synthespians/</link>
		<comments>http://prof.irfanessa.com/2007/09/15/funding-nsfsger-2007-persistent-adaptive-collaborative-synthespians/#comments</comments>
		<pubDate>Sat, 15 Sep 2007 15:18:22 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Charles Isbell]]></category>
		<category><![CDATA[Numerical Machine Learning]]></category>
		<category><![CDATA[Funding]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2007/09/15/funding-nsfsger-2007-persistent-adaptive-collaborative-synthespians/</guid>
		<description><![CDATA[Award#0749181 &#8211; SGER Collaborative Research: Persistent, Adaptive, Collaborative Synthespians ABSTRACT This project explores the development of methodologies for populating worlds with persistent, adaptive, collaborative, believable synthetic actors, referred to as Synthespians. These methods are extensions of adaptive models of learning and planning to accommodate the complex, dynamic environments in massive multi-player online games. The intellectual [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://nsf.gov/awardsearch/showAward.do?AwardNumber=0749181">Award#0749181 &#8211; SGER Collaborative Research: Persistent, Adaptive, Collaborative Synthespians</a><br />
ABSTRACT</p>
<p>This project explores the development of methodologies for populating worlds with persistent, adaptive, collaborative, believable synthetic actors, referred to as Synthespians. These methods are extensions of adaptive models of learning and planning to accommodate the complex, dynamic environments in massive multi-player online games. The intellectual merit includes the development and evaluation of: 1. A behavior development language, with discovery, machine learning, and adaptation of behaviors directly integrated into the language, allowing for the rapid development and deployment of Synthespians. 2. A framework for the actors to recognize and discover plans by observing and modeling the activities of the other agents. An expected outcome of this research is the ability to author complex virtual worlds with many participants that support intelligent and effective interaction between people and machines. Broader Impact: A scientific understanding of how we interact with each other and collaborate will benefit from our ability to simulate complex environments with dynamic and evolving individual and group behaviors. In this project, building and modeling such environments and behaviors is done within a gaming context. This work will in the long run effect and change the fields of education and entertainment. In addition, being able to model large collaborative and interactive scenarios will also help us understand and model large social dynamics phenomenon of interest to sociologists and economists.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2007/09/15/funding-nsfsger-2007-persistent-adaptive-collaborative-synthespians/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Paper: IEEE ICASSP (2007) &#8220;Incorporating Phase Information for Source Separation via Spectrogram Factorization&#8221;</title>
		<link>http://prof.irfanessa.com/2007/04/15/paper-ieee-icassp-2007-incorporating-phase-information-for-source-separation-via-spectrogram-factorization/</link>
		<comments>http://prof.irfanessa.com/2007/04/15/paper-ieee-icassp-2007-incorporating-phase-information-for-source-separation-via-spectrogram-factorization/#comments</comments>
		<pubDate>Sun, 15 Apr 2007 15:22:37 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Audio Analysis]]></category>
		<category><![CDATA[Funding]]></category>
		<category><![CDATA[Mitch Parry]]></category>
		<category><![CDATA[NSF (0205507)]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[2007]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2007/04/15/paper-ieee-icassp-2007-incorporating-phase-information-for-source-separation-via-spectrogram-factorization/</guid>
		<description><![CDATA[Parry, R.M. Essa, I. (2007) &#8220;Incorporating Phase Information for Source Separation via Spectrogram Factorization.&#8221; In Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. 15-20 April 2007, Volume: 2, page(s): II-661 &#8211; II-66, Honolulu, HI, ISSN: 1520-6149, ISBN: 1-4244-0728-1, INSPEC Accession Number:9497202, Digital Object Identifier: 10.1109/ICASSP.2007.366322 Abstract Spectrogram factorization methods have been proposed for single channel source separation and audio [...]]]></description>
			<content:encoded><![CDATA[<p>Parry, R.M. Essa, I. (2007) &#8220;<a href="http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=4217495&amp;isnumber=4217319&amp;punumber=4216989&amp;k2dockey=4217495@ieeecnfs&amp;query=%28%28essa%29%3Cin%3Eau+%29&amp;pos=7">Incorporating Phase Information for Source Separation via Spectrogram Factorization</a>.&#8221; In Proceedings of <em>IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007</em>. 15-20 April 2007, Volume: 2, page(s): II-661 &#8211; II-66, Honolulu, HI, ISSN: 1520-6149, ISBN: 1-4244-0728-1, INSPEC Accession Number:9497202, Digital Object Identifier: 10.1109/ICASSP.2007.366322</p>
<p align="center"><strong>Abstract</strong></p>
<p>Spectrogram factorization methods have been proposed for single channel source separation and audio analysis. Typically, the mixture signal is first converted into a time-frequency representation such as the short-time Fourier transform (STFT). The phase information is thrown away and this spectrogram matrix is then factored into the sum of rank-one source spectrograms. This approach incorrectly assumes the mixture spectrogram is the sum of the source spectrograms. In fact, the mixture spectrogram depends on the phase of the source STFTs. We investigate the consequences of this common assumption and introduce an approach that leverages a probabilistic representation of phase to improve the separation results</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2007/04/15/paper-ieee-icassp-2007-incorporating-phase-information-for-source-separation-via-spectrogram-factorization/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<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/</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[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: IEEE ICASSP (2006) &#8220;Source Detection Using Repetitive Structure&#8221;</title>
		<link>http://prof.irfanessa.com/2006/05/14/paper-ieee-icassp-2006-source-detection-using-repetitive-structure/</link>
		<comments>http://prof.irfanessa.com/2006/05/14/paper-ieee-icassp-2006-source-detection-using-repetitive-structure/#comments</comments>
		<pubDate>Sun, 14 May 2006 15:25:18 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Audio Analysis]]></category>
		<category><![CDATA[Funding]]></category>
		<category><![CDATA[Mitch Parry]]></category>
		<category><![CDATA[NSF (0205507)]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Research]]></category>
		<category><![CDATA[2006]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2006/05/14/paper-ieee-icassp-2006-source-detection-using-repetitive-structure/</guid>
		<description><![CDATA[Parry, R.M. Essa, I. (2006) &#8220;Source Detection Using Repetitive Structure (IEEEXplore).&#8221; Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing, 2006. ICASSP 2006, Publication Date: 14-19 May 2006, Volume: 4, page(s): IV &#8211; IV, Location: Toulouse, ISSN: 1520-6149, ISBN: 1-4244-0469-X, INSPEC Accession Number:9154520, Digital Object Identifier: 10.1109/ICASSP.2006.1661163 Abstract Blind source separation algorithms typically require that the number of sources are known in advance. [...]]]></description>
			<content:encoded><![CDATA[<p>Parry, R.M. Essa, I. (2006) &#8220;<a href="http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=1661163&amp;isnumber=34760&amp;punumber=11024&amp;k2dockey=1661163@ieeecnfs&amp;query=%28%28essa%29%3Cin%3Eau+%29&amp;pos=10">Source Detection Using Repetitive Structure (IEEEXplore)</a>.&#8221; Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing, 2006. ICASSP 2006, Publication Date: 14-19 May 2006, Volume: 4, page(s): IV &#8211; IV, Location: Toulouse, ISSN: 1520-6149, ISBN: 1-4244-0469-X, INSPEC Accession Number:9154520, Digital Object Identifier: 10.1109/ICASSP.2006.1661163</p>
<p align="center"><strong>Abstract</strong></p>
<p style="text-align: justify;">Blind source separation algorithms typically require that the number of sources are known in advance. However, it is often the case that the number of sources change over time and that the total number is not known. Existing source separation techniques require source number estimation methods to determine how many sources are active within the mixture signals. These methods typically operate on the covariance matrix of mixture recordings and require fewer active sources than mixtures. When sources do not overlap in the time-frequency domain, more sources than mixtures may be detected and then separated. However, separating more sources than mixtures when sources overlap in time and frequency poses a particularly difficult problem. This paper addresses the issue of source detection when more sources than sensors overlap in time and frequency. We show that repetitive structure in the form of time-time correlation matrices can reveal when each source is active</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2006/05/14/paper-ieee-icassp-2006-source-detection-using-repetitive-structure/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>Funding: NSF/ITR (2002) &#8220;Analysis of Complex Audio-Visual Events Using Spatially Distributed Sensors&#8221;</title>
		<link>http://prof.irfanessa.com/2002/10/01/funding-nsfitr-2002-analysis-of-complex-audio-visual-events-using-spatially-distributed-sensors/</link>
		<comments>http://prof.irfanessa.com/2002/10/01/funding-nsfitr-2002-analysis-of-complex-audio-visual-events-using-spatially-distributed-sensors/#comments</comments>
		<pubDate>Tue, 01 Oct 2002 14:56:34 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Funding]]></category>
		<category><![CDATA[James Rehg]]></category>
		<category><![CDATA[NSF (0205507)]]></category>
		<category><![CDATA[2002]]></category>
		<category><![CDATA[Audio Analysis]]></category>
		<category><![CDATA[Computer Vision]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2002/10/01/funding-nsfitr-2002-analysis-of-complex-audio-visual-events-using-spatially-distributed-sensors/</guid>
		<description><![CDATA[Award#0205507 &#8211; ITR: Analysis of Complex Audio-Visual Events Using Spatially Distributed Sensors ABSTRACT We propose to develop a comprehensive framework for the joint analysis of audio-visual signals obtained from spatially distributed microphones and cameras. We desire solutions to the audio-visual sensing problem that will scale to an arbitrary number of cameras and microphones and can [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://nsf.gov/awardsearch/showAward.do?AwardNumber=0205507">Award#0205507 &#8211; ITR: Analysis of Complex Audio-Visual Events Using Spatially Distributed Sensors</a></p>
<p style="text-align: center;"><strong>ABSTRACT</strong></p>
<p style="text-align: justify;">We propose to develop a comprehensive framework for the joint analysis of audio-visual signals obtained from spatially distributed microphones and cameras. We desire solutions to the audio-visual sensing problem that will scale to an arbitrary number of cameras and microphones and can address challenging environments in which there are multiple speech and nonspeech sound sources and multiple moving people and objects. Recently it has become relatively inexpensive to deploy tens or even hundreds of cameras and microphones in an environment. Many applications could benefit from ability to sense in both modalities. There are two levels at which joint audio-visual analysis can take place. At the signal level, the challenge is to develop representations that capture the rich dependency structure in the joint signal and deal success-fully issues such as variable sampling rates and varying temporal delays between cues. At the spatial level the challenge is to compensate for the distortions introduced by the sensor location and pool information across sensors to recover 3-D information about the spatial environment. For many applications, it is highly desirable if the solution method is self-calibrating, and does not require an extensive manual calibration process every time a new sensor is added or an old sensor is moved or replaced. Removing the burden of manual calibration also makes it possible to exploit ad hoc sensor networks which could arise, for example, from wearable microphones and cameras. We propose to address the following four research topics: 1. Representations and learning methods for signal level fusion. 2. Volumetric techniques for fusing spatially distributed audio-visual data. 3. Self-calibration of distributed microphone-camera systems 4. Applications of audio-visual sensing. For example, this proposal includes considerable work on lip and facial analysis to improve voice communications.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2002/10/01/funding-nsfitr-2002-analysis-of-complex-audio-visual-events-using-spatially-distributed-sensors/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Funding: NSF (2001) ITR/SY &#8220;The Aware Home: Sustaining the Quality of Life for an Aging Population&#8221;</title>
		<link>http://prof.irfanessa.com/2001/10/01/award0121661-itrsy-the-aware-home-sustaining-the-quality-of-life-for-an-aging-population/</link>
		<comments>http://prof.irfanessa.com/2001/10/01/award0121661-itrsy-the-aware-home-sustaining-the-quality-of-life-for-an-aging-population/#comments</comments>
		<pubDate>Mon, 01 Oct 2001 14:59:09 +0000</pubDate>
		<dc:creator>Irfan Essa</dc:creator>
				<category><![CDATA[Aaron Bobick]]></category>
		<category><![CDATA[Aware Home]]></category>
		<category><![CDATA[Beth Mynatt]]></category>
		<category><![CDATA[Funding]]></category>
		<category><![CDATA[Gregory Abowd]]></category>
		<category><![CDATA[Wendy Rogers]]></category>
		<category><![CDATA[2001]]></category>
		<category><![CDATA[NSF]]></category>

		<guid isPermaLink="false">http://academics.irfanessa.com/2001/10/01/funding-nsf-itrsy-2001-the-aware-home-sustaining-the-quality-of-life-for-an-aging-population/</guid>
		<description><![CDATA[Award# 0121661 &#8211; ITR/SY: The Aware Home: Sustaining the Quality of Life for an Aging Population ABSTRACT The focus of this project is on development of a domestic environment that is cognizant of the whereabouts and activities of its occupants and can support them in their everyday life. While the technology is applicable to a [...]]]></description>
			<content:encoded><![CDATA[<p style="text-align: center;"><a href="http://nsf.gov/awardsearch/showAward.do?AwardNumber=0121661">Award# 0121661 &#8211; ITR/SY: The Aware Home: Sustaining the Quality of Life for an Aging Population</a></p>
<p style="text-align: center;"><strong>ABSTRACT</strong></p>
<p style="text-align: justify;">The focus of this project is on development of a domestic environment that is cognizant of the whereabouts and activities of its occupants and can support them in their everyday life. While the technology is applicable to a range of domestic situations, the emphasis in this work will be on support for aging in place; through collaboration with experts in assistive care and cognitive aging, the PI and his team will design, demonstrate, and evaluate a series of domestic services that aim to maintain the quality of life for an aging population, with the goal of increasing the likelihood of a &#8220;stay at home&#8221; alternative to assisted living that satisfies the needs of an aging individual and his/her distributed family. In particular, the PI will explore two areas that are key to sustaining quality of life for an independent senior adult: maintaining familial vigilance, and supporting daily routines. The intention is to serve as an active partner, aiding the senior occupant without taking control. This research will lead to advances in three research areas: human-computer interaction; computational perception; and software engineering. To achieve the desired goals, the PI will conduct the research and experimentation in an authentic domestic setting, a novel research facility called the Residential Laboratory recently completed next to the Georgia Tech campus. Together with experts in theoretical and practical aspects of aging, the PI will establish a pattern of research in which informed design of ubiquitous computing technology can be rapidly deployed, evaluated and evolved in an authentic setting. Special attention will be paid throughout to issues relating to privacy and trust implications. The PI will transition the products of this project to researchers and practitioners interested in performing more large-scale observations of the social and economic impact of Aware Home technologies.</p>
]]></content:encoded>
			<wfw:commentRss>http://prof.irfanessa.com/2001/10/01/award0121661-itrsy-the-aware-home-sustaining-the-quality-of-life-for-an-aging-population/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
