<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="Iwith.org RSS feeds - http://www.iwith.org/" -->
<rss version="2.0">
    <channel>
        <title>AIBITS, S.A. :: Artificial Intelligence</title>
        <description>desc</description>
        <link>http://www.aibits.org/news/section/en_US/ai</link>
        <lastBuildDate>Mon, 06 Sep 2010 08:54:51 +0100</lastBuildDate>
        <generator>Iwith.org RSS feeds - http://www.iwith.org/</generator>
        <image>
            <url>http://www.aibits.org//i-images/logo.php?w=150&amp;h=100</url>
            <title>AIBITS, S.A. :: Artificial Intelligence</title>
            <link>http://www.aibits.org/news/section/en_US/ai</link>
            <description>desc</description>
        </image>
        <language>en-US</language>
        <item>
            <title>The Boss Is Robotic, and Rolling Up Behind You</title>
            <link>http://www.aibits.org/news/en_US/2010/09/05/0002/the-boss-is-robotic-and-rolling-up-behind-you</link>
            <description>Mobile robots have been used for years by the military and law enforcement, but with falling costs, the next frontiers are the office, the hospital and the home. SACRAMENTO — Dr. Alan Shatzel’s pager beeped at 9 on a Saturday morning. Dr. Shatzel, a neurologist, hustled not to the emergency room where the patient lay — 260 miles away, in Bakersfield — but to a darkened room at a hospital here. He guided the roughly five-foot-tall machine, which has a large monitor as its “head,” into the patient’s room in Bakersfield. “Computers are beginning to grow wheels and roll around in the environment,” said Jeanne Dietsch, a veteran roboticist and co-founder of MobileRobots Inc ., a robot maker in Amherst, N.H., and a division of Adept Technologies.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/05/0002/the-boss-is-robotic-and-rolling-up-behind-you&quot;&gt;The Boss Is Robotic, and Rolling Up Behind You&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Sat, 04 Sep 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/05/0002/the-boss-is-robotic-and-rolling-up-behind-you</guid>
        </item>
        <item>
            <title>Dropping Jaws and Stopping Conversations in a Test-Drive</title>
            <link>http://www.aibits.org/news/en_US/2010/09/05/0003/dropping-jaws-and-stopping-conversations-in-a-test-drive</link>
            <description>For the past three weeks I have been baby-sitting a robot. It looks like an extra-large lollipop on wheels and using it is a little like owning a puppy. For the past three weeks I have been baby-sitting a robot. It is not your traditional looking robot — if there is such a thing yet — but looks like an extra-large lollipop on wheels. People ask, “Can it do any neat tricks?” The robot I adopted, the Texai, is made by Willow Garage, a technology company based in California, and is designed for telepresence. I wheeled past, said hello over the robot’s speakers and watched through the camera as her head moved slowly with my passing, the spoon still suspended in midair.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/05/0003/dropping-jaws-and-stopping-conversations-in-a-test-drive&quot;&gt;Dropping Jaws and Stopping Conversations in a Test-Drive&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Sat, 04 Sep 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/05/0003/dropping-jaws-and-stopping-conversations-in-a-test-drive</guid>
        </item>
        <item>
            <title>PrePrint: Kernel Optimization in Discriminant Analysis</title>
            <link>http://www.aibits.org/news/en_US/2010/09/03/0005/preprint-kernel-optimization-in-discriminant-analysis</link>
            <description>Kernel mapping is one of the most used approaches to intrinsically derive nonlinear classifiers. The idea is to use a kernel function which maps the original nonlinearly separable problem to a space of intrinsically larger dimensionality where the classes are linearly separable. A major problem in the design of kernel methods is to find the kernel parameters that make the problem linear in the mapped representation. This paper derives the first criterion that specifically aims to find a kernel representation where the Bayes classifier becomes linear. We illustrate how this result can be successfully applied in several kernel discriminant analysis algorithms. Experimental results using a large number of databases and classifiers demonstrate the utility of the proposed approach. The paper also shows (theoretically and experimentally) that a kernel version of Subclass Discriminant Analysis yields the highest recognition rates.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e85ed7822eb9e492f0cac4ae41011759&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=e85ed7822eb9e492f0cac4ae41011759&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e85ed7822eb9e492f0cac4ae41011759&amp;p=64&amp;kw=Kernel&quot;&gt;Kernel&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e85ed7822eb9e492f0cac4ae41011759&amp;p=64&amp;kw=Operating+Systems&quot;&gt;Operating Systems&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e85ed7822eb9e492f0cac4ae41011759&amp;p=64&amp;kw=Linux&quot;&gt;Linux&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e85ed7822eb9e492f0cac4ae41011759&amp;p=64&amp;kw=Function&quot;&gt;Function&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e85ed7822eb9e492f0cac4ae41011759&amp;p=64&amp;kw=Ubuntu&quot;&gt;Ubuntu&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/03/0005/preprint-kernel-optimization-in-discriminant-analysis&quot;&gt;PrePrint: Kernel Optimization in Discriminant Analysis&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Fri, 03 Sep 2010 19:44:25 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/03/0005/preprint-kernel-optimization-in-discriminant-analysis</guid>
        </item>
        <item>
            <title>PrePrint: Multiview Stereo and Silhouette Consistency Via Convex Functionals over Convex Domains</title>
            <link>http://www.aibits.org/news/en_US/2010/09/03/0004/preprint-multiview-stereo-and-silhouette-consistency-via-convex-functionals-over-convex-domains</link>
            <description>We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast as one of minimizing a convex functional where the exact silhouette consistency is imposed as convex constraints that restrict the domain of feasible functions. As a consequence, we can retain the original stereo-weighted surface area as a cost functional without heuristic modifications of this energy by balloon terms or other strategies, yet still obtain meaningful (nonempty) reconstructions which are guaranteed to be silhouette-consistent. We prove that the proposed convex relaxation approach provides solutions that lie within a bound of the optimal solution. Compared to existing alternatives, the proposed method does not depend on initialization and leads to a simpler and more robust numerical scheme for imposing silhouette consistency obtained by projection onto convex sets. We show that this projection can be solved exactly using an efficient algorithm. We propose a parallel implementation of the resulting convex optimization problem on a graphics card. We are able to compute highly accurate and silhouette-consistent reconstructions for challenging real-world data sets. In particular, experimental results demonstrate that the proposed silhouette constraints help to preserve fine-scale details of the reconstructed shape.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1d7188a4b04ccb37bcc75fee6ccc309f&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=1d7188a4b04ccb37bcc75fee6ccc309f&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1d7188a4b04ccb37bcc75fee6ccc309f&amp;p=64&amp;kw=Optimization&quot;&gt;Optimization&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1d7188a4b04ccb37bcc75fee6ccc309f&amp;p=64&amp;kw=Algorithm&quot;&gt;Algorithm&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1d7188a4b04ccb37bcc75fee6ccc309f&amp;p=64&amp;kw=Function&quot;&gt;Function&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1d7188a4b04ccb37bcc75fee6ccc309f&amp;p=64&amp;kw=Programming&quot;&gt;Programming&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1d7188a4b04ccb37bcc75fee6ccc309f&amp;p=64&amp;kw=Languages&quot;&gt;Languages&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/03/0004/preprint-multiview-stereo-and-silhouette-consistency-via-convex-functionals-over-convex-domains&quot;&gt;PrePrint: Multiview Stereo and Silhouette Consistency Via Convex Functionals over Convex Domains&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Fri, 03 Sep 2010 19:44:23 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/03/0004/preprint-multiview-stereo-and-silhouette-consistency-via-convex-functionals-over-convex-domains</guid>
        </item>
        <item>
            <title>'NHL2K11' shoots, but sometimes misses</title>
            <link>http://www.aibits.org/news/en_US/2010/09/05/0004/nhl2k11-shoots-but-sometimes-misses</link>
            <description>(CNN)-- NHL2K11 (2KSports/Visual Concepts) tries to bring realism to sports on the Wii, but falls short because of control issues and a spotty artificial intelligence. When developing their hockey game for the upcoming season, 2KSports decided to put all their eggs in one basket by only making a game for the Nintendo Wii and bypassing the Sony PS3 and Microsoft Xbox 360 consoles. By utilizing the Wii Remote controller and the Wii Motion Plus attachment, 2KSports hoped to introduce a more true-to-life feel in the game play. One-timer shots connect with power, but can sometimes be swing-and-a-miss attempts as well -- not what you'd expect from NHL style players.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/05/0004/nhl2k11-shoots-but-sometimes-misses&quot;&gt;'NHL2K11' shoots, but sometimes misses&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Fri, 03 Sep 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/05/0004/nhl2k11-shoots-but-sometimes-misses</guid>
        </item>
        <item>
            <title>Human unconscious is transferred to virtual characters</title>
            <link>http://www.aibits.org/news/en_US/2010/09/02/0012/human-unconscious-is-transferred-to-virtual-characters</link>
            <description>Virtual characters can behave according to actions carried out unconsciously by humans. Researchers have created a system which measures human physiological parameters, such as respiration or heart rate, and introduces them into computer designed characters in real time.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/02/0012/human-unconscious-is-transferred-to-virtual-characters&quot;&gt;Human unconscious is transferred to virtual characters&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.sciencedaily.com/news/computers_math/artificial_intelligence/ (Science Daily)</author>
            <pubDate>Thu, 02 Sep 2010 04:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/02/0012/human-unconscious-is-transferred-to-virtual-characters</guid>
        </item>
        <item>
            <title>CFP: MIWAI'10 - 2nd CALL FOR PAPERS + STUDENT TRAVEL SCHOLARSHIPS</title>
            <link>http://www.aibits.org/news/en_US/2010/09/02/0006/cfp-miwai-10-2nd-call-for-papers-student-travel-scholarships</link>
            <description>------------------------------ ------------------------------ --------------- &lt;br&gt; Apologies for Multiple Copies Due to Cross Posting &lt;br&gt; ------------------------------ ------------------------------ --------------- &lt;br&gt; ============================== ============== &lt;br&gt; MIWAI'10 - SECOND CALL FOR PAPERS &lt;br&gt; ============================== ==============&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/02/0006/cfp-miwai-10-2nd-call-for-papers-student-travel-scholarships&quot;&gt;CFP: MIWAI'10 - 2nd CALL FOR PAPERS + STUDENT TRAVEL SCHOLARSHIPS&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>   (Richard Booth)</author>
            <pubDate>Thu, 02 Sep 2010 01:50:04 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/02/0006/cfp-miwai-10-2nd-call-for-papers-student-travel-scholarships</guid>
        </item>
        <item>
            <title>PrePrint: Approximately Global Optimization for Robust Alignment of Generalized Shapes</title>
            <link>http://www.aibits.org/news/en_US/2010/09/02/0004/preprint-approximately-global-optimization-for-robust-alignment-of-generalized-shapes</link>
            <description>In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale &quot;images&quot; to represent source shapes, and propose a novel two-component Gaussian Mixture (GM) distance map representation for target shapes. This asymmetric representation is a flexible image-based representation, which is able to represent different kinds of shape data including continuous contours, unstructured sparse point sets, edge maps, and even gray-scale gradient maps. Using this representation, a new energy function based on a novel two-component Gaussian Mixture distance model is proposed. The new energy function was empirically evaluated to be a more robust shape dissimilarity metric that can be computed efficiently. Such high efficiency is essential for global optimization methods. We adopt and modify one of them, the Particle Swarm Optimization (PSO), to effectively estimate the global optimum of the new energy function. Different from the original PSO, several new strategies were employed to make the optimization more robust and prevent it from converging prematurely. The overall performance of the proposed framework as well as the properties of each algorithmic component were evaluated and compared with those of some state-of-the-art methods. Extensive experiments and comparison performed on generalized 2D and 3D shape data demonstrate the robustness and effectiveness of the method.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1cdcc121ab905041e52af4dbc4c37fd8&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=1cdcc121ab905041e52af4dbc4c37fd8&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1cdcc121ab905041e52af4dbc4c37fd8&amp;p=64&amp;kw=Optimization&quot;&gt;Optimization&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1cdcc121ab905041e52af4dbc4c37fd8&amp;p=64&amp;kw=Particle+Swarm+Optimization&quot;&gt;Particle Swarm Optimization&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1cdcc121ab905041e52af4dbc4c37fd8&amp;p=64&amp;kw=Algorithm&quot;&gt;Algorithm&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1cdcc121ab905041e52af4dbc4c37fd8&amp;p=64&amp;kw=Function&quot;&gt;Function&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=1cdcc121ab905041e52af4dbc4c37fd8&amp;p=64&amp;kw=Artificial+Life&quot;&gt;Artificial Life&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/02/0004/preprint-approximately-global-optimization-for-robust-alignment-of-generalized-shapes&quot;&gt;PrePrint: Approximately Global Optimization for Robust Alignment of Generalized Shapes&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Wed, 01 Sep 2010 22:44:22 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/02/0004/preprint-approximately-global-optimization-for-robust-alignment-of-generalized-shapes</guid>
        </item>
        <item>
            <title>PrePrint: Single Image Haze Removal Using Dark Channel Prior</title>
            <link>http://www.aibits.org/news/en_US/2010/09/02/0005/preprint-single-image-haze-removal-using-dark-channel-prior</link>
            <description>In this paper, we propose a simple but effective image prior - dark channel prior to remove haze from a single input image. The dark channel prior is a kind of statistics of outdoor haze-free images. It is based on a key observation - most local patches in outdoor haze-free images contain some pixels whose intensity is very low in at least one color channel. Using this prior with the haze imaging model, we can directly estimate the thickness of the haze and recover a high quality haze-free image. Results on a variety of hazy images demonstrate the power of the proposed prior. Moreover, a high quality depth map can also be obtained as a by-product of haze removal.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e7a529b8bd6334d6277ec82c29a189a4&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=e7a529b8bd6334d6277ec82c29a189a4&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e7a529b8bd6334d6277ec82c29a189a4&amp;p=64&amp;kw=Model&quot;&gt;Model&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e7a529b8bd6334d6277ec82c29a189a4&amp;p=64&amp;kw=Graphics&quot;&gt;Graphics&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e7a529b8bd6334d6277ec82c29a189a4&amp;p=64&amp;kw=Hazing&quot;&gt;Hazing&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e7a529b8bd6334d6277ec82c29a189a4&amp;p=64&amp;kw=High+school&quot;&gt;High school&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e7a529b8bd6334d6277ec82c29a189a4&amp;p=64&amp;kw=St.+Paul+High+School&quot;&gt;St. Paul High School&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/02/0005/preprint-single-image-haze-removal-using-dark-channel-prior&quot;&gt;PrePrint: Single Image Haze Removal Using Dark Channel Prior&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Wed, 01 Sep 2010 22:44:22 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/02/0005/preprint-single-image-haze-removal-using-dark-channel-prior</guid>
        </item>
        <item>
            <title>PrePrint: Direct Method for Video Based Navigation Using a Digital Terrain Map</title>
            <link>http://www.aibits.org/news/en_US/2010/09/02/0002/preprint-direct-method-for-video-based-navigation-using-a-digital-terrain-map</link>
            <description>A novel vision-based navigation algorithm is proposed. The gray levels of two images, together with a Digital Terrain Map (DTM) are directly utilized to define constraints on the navigation parameters. The feasibility of the algorithm is examined both under a simulated environment and using real flight data.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=6fe917409b5f9de1977cfd8de0d48a02&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=6fe917409b5f9de1977cfd8de0d48a02&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=6fe917409b5f9de1977cfd8de0d48a02&amp;p=64&amp;kw=Navigation&quot;&gt;Navigation&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=6fe917409b5f9de1977cfd8de0d48a02&amp;p=64&amp;kw=Algorithm&quot;&gt;Algorithm&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=6fe917409b5f9de1977cfd8de0d48a02&amp;p=64&amp;kw=Data&quot;&gt;Data&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=6fe917409b5f9de1977cfd8de0d48a02&amp;p=64&amp;kw=Geomatics&quot;&gt;Geomatics&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=6fe917409b5f9de1977cfd8de0d48a02&amp;p=64&amp;kw=Earth+Sciences&quot;&gt;Earth Sciences&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/02/0002/preprint-direct-method-for-video-based-navigation-using-a-digital-terrain-map&quot;&gt;PrePrint: Direct Method for Video Based Navigation Using a Digital Terrain Map&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Wed, 01 Sep 2010 22:44:21 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/02/0002/preprint-direct-method-for-video-based-navigation-using-a-digital-terrain-map</guid>
        </item>
        <item>
            <title>PrePrint: The Cues in &quot;Dependent Multiple Cue Integration for Robust Tracking&quot; are ...</title>
            <link>http://www.aibits.org/news/en_US/2010/09/02/0003/preprint-the-cues-in-dependent-multiple-cue-integration-for-robust-tracking-are-independent</link>
            <description>A methodology for integrating multiple cues for tracking was proposed in several papers. These papers claim that, unlike other methodologies, conditional independence of the cues is not assumed. This brief communication 1. refutes this claim and 2. points out other major problems in the methodology.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=b3d04bcf3bd351b88d5105b35b2c632f&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=b3d04bcf3bd351b88d5105b35b2c632f&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=b3d04bcf3bd351b88d5105b35b2c632f&amp;p=64&amp;kw=Methodology&quot;&gt;Methodology&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=b3d04bcf3bd351b88d5105b35b2c632f&amp;p=64&amp;kw=Business&quot;&gt;Business&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=b3d04bcf3bd351b88d5105b35b2c632f&amp;p=64&amp;kw=Research&quot;&gt;Research&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=b3d04bcf3bd351b88d5105b35b2c632f&amp;p=64&amp;kw=Psychology&quot;&gt;Psychology&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=b3d04bcf3bd351b88d5105b35b2c632f&amp;p=64&amp;kw=Health+care&quot;&gt;Health care&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/02/0003/preprint-the-cues-in-dependent-multiple-cue-integration-for-robust-tracking-are-independent&quot;&gt;PrePrint: The Cues in &quot;Dependent Multiple Cue Integration for Robust Tracking&quot; are Independent&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Wed, 01 Sep 2010 22:44:21 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/02/0003/preprint-the-cues-in-dependent-multiple-cue-integration-for-robust-tracking-are-independent</guid>
        </item>
        <item>
            <title>PrePrint: Reliability Fusion of Time-of-Flight Depth and Stereo for High Quality Depth Maps</title>
            <link>http://www.aibits.org/news/en_US/2010/09/02/0001/preprint-reliability-fusion-of-time-of-flight-depth-and-stereo-for-high-quality-depth-maps</link>
            <description>Time-of-flight range sensors have error characteristics which are complementary to passive stereo. They provide real time depth estimates in conditions where passive stereo does not work well, such as on white walls. In contrast, these sensors are noisy and often perform poorly on the textured scenes for which stereo excels. We explore their complementary characteristics and introduce a method for combining the results from both methods that achieve better depth accuracy than either alone. In our fusion framework, the depth probability distribution functions on depth from each of these sensor modalities are computed and then effectively merged. Robust and adaptive fusion is built on a pixel-wise reliability weighting function calculated for each method. In addition, since time-of-flight devices have primarily been used as individual sensors, they are typically poorly calibrated. We introduce a method that substantially improves upon the manufacturer's calibration. We demonstrate that our proposed techniques lead to improved accuracy and robustness on an extensive set of experimental results.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=53092a93927d901887982ec91e37afab&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=53092a93927d901887982ec91e37afab&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=53092a93927d901887982ec91e37afab&amp;p=64&amp;kw=Sensor&quot;&gt;Sensor&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=53092a93927d901887982ec91e37afab&amp;p=64&amp;kw=Fusion+power&quot;&gt;Fusion power&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=53092a93927d901887982ec91e37afab&amp;p=64&amp;kw=Stereophonic+sound&quot;&gt;Stereophonic sound&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=53092a93927d901887982ec91e37afab&amp;p=64&amp;kw=Physics&quot;&gt;Physics&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=53092a93927d901887982ec91e37afab&amp;p=64&amp;kw=Nuclear&quot;&gt;Nuclear&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/02/0001/preprint-reliability-fusion-of-time-of-flight-depth-and-stereo-for-high-quality-depth-maps&quot;&gt;PrePrint: Reliability Fusion of Time-of-Flight Depth and Stereo for High Quality Depth Maps&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Wed, 01 Sep 2010 22:44:20 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/02/0001/preprint-reliability-fusion-of-time-of-flight-depth-and-stereo-for-high-quality-depth-maps</guid>
        </item>
        <item>
            <title>Robotsdeveloped in Plymouth to befriend sick children</title>
            <link>http://www.aibits.org/news/en_US/2010/09/02/0008/robotsdeveloped-in-plymouth-to-befriend-sick-children</link>
            <description>Robots which have memories and can interact with children are being developed by the University of Plymouth as part of a European project. The Now robots are being created as pets to interact and befriend children with long-term illnesses. The University is one of eight institutions across Europe working on the 8.3m Euro project over four years. Dr Tony Belpaeme from the University of Plymouth said: &quot;The original prototypes were going to be rather simple, in the sense that they were going to play simple games with the children.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/02/0008/robotsdeveloped-in-plymouth-to-befriend-sick-children&quot;&gt;Robotsdeveloped in Plymouth to befriend sick children&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Wed, 01 Sep 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/02/0008/robotsdeveloped-in-plymouth-to-befriend-sick-children</guid>
        </item>
        <item>
            <title>What the papers say</title>
            <link>http://www.aibits.org/news/en_US/2010/08/31/0002/what-the-papers-say</link>
            <description>Journalist Fionola Meredith takes a look at what is making the headlines in Tuesday's newspapers. Several papers lead with the accident at Cranfield beach in which a six-year-old boy was seriously injured. The Irish News,The News LetterandThe Mirrorall carry reports on how the child is fighting for his life after being hit by a speedboat while he was being towed on a wake-board near a busy beach. The Irish Timesreports on an opportunity for would-be nuns.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/31/0002/what-the-papers-say&quot;&gt;What the papers say&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Tue, 31 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/31/0002/what-the-papers-say</guid>
        </item>
        <item>
            <title>University of Plymouthrobotfootballers take on world</title>
            <link>http://www.aibits.org/news/en_US/2010/09/01/0001/university-of-plymouthrobotfootballers-take-on-world</link>
            <description>A football team made up of robots developed by the University of Plymouth is aiming to beat the best from around the world. Tony Belpaeme, a lecturer at the university's Centre for Robotics and Neural Systems, is sending a team of 10 robots to the competition in Bangalore, along with about six students. Mr Belpaeme said: &quot;Anything that computers can do well, such as calculations, is hard for humans. &quot;It is going to be fun and exciting,&quot; said Mr Belpaeme.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/01/0001/university-of-plymouthrobotfootballers-take-on-world&quot;&gt;University of Plymouthrobotfootballers take on world&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Tue, 31 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/01/0001/university-of-plymouthrobotfootballers-take-on-world</guid>
        </item>
        <item>
            <title>Skitterbot creeps us out at 1 foot per second</title>
            <link>http://www.aibits.org/news/en_US/2010/09/01/0006/skitterbot-creeps-us-out-at-1-foot-per-second</link>
            <description>Billed as the world's fastest micro-robot, Skitterbot is perfect for scaring friends who loathe insects, especially robotic ones. USB controllable. Skitterbot: Plug 'n crawl If you love freaking out your friends, especially a girlfriend who hates bugs, here's a toy you might dig--Skitterbot is a six-legged robotic insect that can burn rubber at the rate of one foot per second. Maker Desk Pets claimsSkitterbotis the fastest commercially available legged micro-robot. Skitterbots follow a horde of micro-robot toys including theHexbug Crab, which can respond to its environment through sensors. Still, I'd love to see a whole floor crawling with Skitterbots.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/01/0006/skitterbot-creeps-us-out-at-1-foot-per-second&quot;&gt;Skitterbot creeps us out at 1 foot per second&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Tue, 31 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/01/0006/skitterbot-creeps-us-out-at-1-foot-per-second</guid>
        </item>
        <item>
            <title>CFP: A Special Issue on Emerging Synergies of Artificial Intelligence and Software Engineering, ...</title>
            <link>http://www.aibits.org/news/en_US/2010/08/30/0001/cfp-a-special-issue-on-emerging-synergies-of-artificial-intelligence-and-software-engineering-ijseke</link>
            <description>========= Call for Papers ========= &lt;br&gt; A Special Issue on Emerging Synergies of Artificial Intelligence and &lt;br&gt; Software Engineering &lt;br&gt; International Journal of Software Engineering and Knowledge &lt;br&gt; Engineering &lt;br&gt; &lt;a target=&quot;_blank&quot; rel=&quot;nofollow&quot; href=&quot;http://zimmer.csufresno.edu/~shliu/IJSEKE/&quot;&gt;[link]&lt;/a&gt; &lt;br&gt; === Theme === &lt;br&gt; As software engineering is requested to answer dynamic, automated,&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/30/0001/cfp-a-special-issue-on-emerging-synergies-of-artificial-intelligence-and-software-engineering-ijseke&quot;&gt;CFP: A Special Issue on Emerging Synergies of Artificial Intelligence and Software Engineering, IJSEKE&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>   (alexliu)</author>
            <pubDate>Mon, 30 Aug 2010 02:50:42 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/30/0001/cfp-a-special-issue-on-emerging-synergies-of-artificial-intelligence-and-software-engineering-ijseke</guid>
        </item>
        <item>
            <title>EmotionML: Will computers tap into your feelings?</title>
            <link>http://www.aibits.org/news/en_US/2010/08/30/0002/emotionml-will-computers-tap-into-your-feelings</link>
            <description>&quot;Affective computing&quot; standards and technology could help computers grasp human emotion. An intuitive user interface sounds nice, but what about information overshare? For all those who believe the computing industry is populated by people who are out of touch with the world of emotion, it's time to think again. TheWorld Wide Web Consortium (W3C), which standardizes many Web technologies, is working on formalizing emotional states in a way that computers can handle. EmotionML combines the rigor of computer programming with the squishiness of human emotion. &quot; But theMultimodal Interaction Working Groupthat's overseeing creation of the technology really does want to marry the two worlds.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/30/0002/emotionml-will-computers-tap-into-your-feelings&quot;&gt;EmotionML: Will computers tap into your feelings?&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Mon, 30 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/30/0002/emotionml-will-computers-tap-into-your-feelings</guid>
        </item>
        <item>
            <title>In Search of Time</title>
            <link>http://www.aibits.org/news/en_US/2010/08/31/0004/in-search-of-time</link>
            <description>Ever since Einstein, physicists have been telling us that time – this steady tick-tock of the universe – is much weirder than we think. It doesn’t flow in a single, linear direction, or beat like a steady metronome. (Eagleman is also a best-selling novelist –Sumis a brilliant riff on the possibility of an afterlife. “We asked everyone how scary it was, on a scale from 1 to 10,” he reports, “and everyone said 10.” And all of the subjects reported a slow-motion effect while falling: they consistently over-estimated the time it took to fall.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/31/0004/in-search-of-time&quot;&gt;In Search of Time&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Mon, 30 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/31/0004/in-search-of-time</guid>
        </item>
        <item>
            <title>Video: Yale's Grab Lab Demonstrates an Unmanned Helicopter With a Grabbing Hand</title>
            <link>http://www.aibits.org/news/en_US/2010/08/31/0005/video-yale-s-grab-lab-demonstrates-an-unmanned-helicopter-with-a-grabbing-hand</link>
            <description>Researchers at Yale's Grab Lab aren't about to let the nuances of rotary-wing flight restrict what unmanned aerial vehicles can do. A team there has developed a hand-like modular grasping and manipulation platform that can be fitted to the bellies of UAVs to provide them with extra functionality without overly taxing their flight capabilities. Aerial vehicles that could pick up and carry objects for their human handlers are generally of the vertical take-off and landing (VTOL), which means they are generally small rotary-wing aircraft (helicopters). To circumvent these issues, Grab Lab engineers created their manipulator with a single motor that controls all four &quot;fingers&quot; simultaneously.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/31/0005/video-yale-s-grab-lab-demonstrates-an-unmanned-helicopter-with-a-grabbing-hand&quot;&gt;Video: Yale's Grab Lab Demonstrates an Unmanned Helicopter With a Grabbing Hand&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Mon, 30 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/31/0005/video-yale-s-grab-lab-demonstrates-an-unmanned-helicopter-with-a-grabbing-hand</guid>
        </item>
        <item>
            <title>Sweet Talking Your Computer</title>
            <link>http://www.aibits.org/news/en_US/2010/08/28/0003/sweet-talking-your-computer</link>
            <description>Why people treat devices like humans; saying nice things to a machine to protect its &quot;feelings.&quot; When BMW introduced one of the most sophisticated navigation and telematics systems into its 5 Series car in Germany a decade ago, it represented the pinnacle of German engineering excellence, with great advances in accuracy and functionality.  While this might seem like a story of men's weird attachment to cars or gender stereotyping run amok, a growing body of research suggests that there is something much deeper at work: People respond to computers and other technologies using the same social rules and expectations that they use when interacting with other people.  These weren't overly sensitive people: They were graduate students in computer science and electrical engineering, all of whom insisted that they would never be polite to a computer.  One of the most reviled software designs of all time was Clippy, the animated paper clip in Microsoft Office.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/28/0003/sweet-talking-your-computer&quot;&gt;Sweet Talking Your Computer&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Sat, 28 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/28/0003/sweet-talking-your-computer</guid>
        </item>
        <item>
            <title>Kokoro shows off its latest android Actroid F</title>
            <link>http://www.aibits.org/news/en_US/2010/08/29/0001/kokoro-shows-off-its-latest-android-actroid-f</link>
            <description>Tokyo entertainment firm Kokoro shows off its latest fembot, Actroid F, in a PR video. The lifelike android is slated to go on sale to work as a receptionist or hospital worker. Geminoid F, the uncannily lifelike fembot we sawin April, is back in a new PR vid from Kokoro, a Tokyo-based entertainment company that collaborates with Osaka University'sHiroshi Ishiguroin the creation of androids bothfeminineandcreepy.  In the new video, the robot calls itself &quot;Actroid F,&quot; as it has joined the ranks of otherActroidrobots produced by Kokoro.  While Actroid F can move its eyes, mouth, head, and back, it can also act as a telepresence robot.  ATRIntelligent Robotics and Communication Laboratories, backed by the government, companies, and academia, also collaborated in Actroid F's development, one of many robot projects Japan has funded as it tries to develop next-generation machines to meet social needs.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/29/0001/kokoro-shows-off-its-latest-android-actroid-f&quot;&gt;Kokoro shows off its latest android Actroid F&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Sat, 28 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/29/0001/kokoro-shows-off-its-latest-android-actroid-f</guid>
        </item>
        <item>
            <title>Sticky Robot Climbs Up Glass</title>
            <link>http://www.aibits.org/news/en_US/2010/09/02/0009/sticky-robot-climbs-up-glass</link>
            <description>Mimicking a gecko's super sticky toes is no easy feat, but these scientists are pretty close. Their latest generation of a wall-climber, the Stickybot III, was inspired by the gecko lizard, which has phenomenal capabilities for climbing any vertical surface, including glass.  The animal's toe contains hundreds of ridges called lamellae, and on each of those ridges are millions of tiny hairs called setae.  Looking closer, the ends of the setae have even smaller strands called spatulae.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/02/0009/sticky-robot-climbs-up-glass&quot;&gt;Sticky Robot Climbs Up Glass&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Sat, 28 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/02/0009/sticky-robot-climbs-up-glass</guid>
        </item>
        <item>
            <title>Use Microsoft Surface to Control a Swarm of Robots With Your Fingertips</title>
            <link>http://www.aibits.org/news/en_US/2010/08/28/0002/use-microsoft-surface-to-control-a-swarm-of-robots-with-your-fingertips</link>
            <description>A sharp-lookingtabletop touchscreencan be used to command  robots and combine data from various sources, potentially improving military planning, disaster response and search-and-rescue operations.  Mark Micire, a graduate student at the University of Massachusetts-Lowell, proposes using Surface, Microsoft's interactive tabletop, to unite various types of data, robots and other smart technologies around a common goal.  Indefending his graduate thesisearlier this week, Micire showed off a demo of his swarm-control interface, which you can watch below.  To test his system, Micire steered a four-wheeled vehicle through a plywood maze.Control This Robot With a Touchscreen: Mark Micire/UMass Lowell Robotics Lab The system can integrate a variety of data sets, like city maps, building blueprints and more.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/28/0002/use-microsoft-surface-to-control-a-swarm-of-robots-with-your-fingertips&quot;&gt;Use Microsoft Surface to Control a Swarm of Robots With Your Fingertips&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Fri, 27 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/28/0002/use-microsoft-surface-to-control-a-swarm-of-robots-with-your-fingertips</guid>
        </item>
        <item>
            <title>UsingRobotsTo Clean Up Oil Spills</title>
            <link>http://www.aibits.org/news/en_US/2010/09/01/0002/usingrobotsto-clean-up-oil-spills</link>
            <description>An MIT lab proposes a quicker, more efficient cleanup system. We may not have figured out how to stop oil spills from happening, but the folks at SENSEable City Laboratory at MIT are one step closer to a solution to cleaning up the aftermath.  Their newest project, a swarm of robots called SeaSwarm, proposes to skim the ocean surface and remove oil.  The first prototype was successfully tested in Boston's Charles River in August, and it responded well to the water's changing surface.  Another perk of SeaSwarm is that using the flock of robots eliminates the need for human and equipment coordination in a large-scale cleanup effort.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/01/0002/usingrobotsto-clean-up-oil-spills&quot;&gt;UsingRobotsTo Clean Up Oil Spills&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Fri, 27 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/01/0002/usingrobotsto-clean-up-oil-spills</guid>
        </item>
        <item>
            <title>EEG Monitoring Headband Could Track and Catalog Your Emotional Response to Movies</title>
            <link>http://www.aibits.org/news/en_US/2010/09/01/0007/eeg-monitoring-headband-could-track-and-catalog-your-emotional-response-to-movies</link>
            <description>Plenty of human-gadget interfaces can let you control a robot or a computer with your mind.  An EEG-based affective computing system allows you tocommunicate your emotions, adding a new layer to human-computer interactions.  In the video below, Robert Oschler of Android Review demonstrates EmoRate, a software program that catalogs his emotions.  The computer tracks four primary emotions --  happiness, sadness, anger and fear -- and catalogs when they occur.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/01/0007/eeg-monitoring-headband-could-track-and-catalog-your-emotional-response-to-movies&quot;&gt;EEG Monitoring Headband Could Track and Catalog Your Emotional Response to Movies&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Fri, 27 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/01/0007/eeg-monitoring-headband-could-track-and-catalog-your-emotional-response-to-movies</guid>
        </item>
        <item>
            <title>This Week in the Future, August 23-27, 2010</title>
            <link>http://www.aibits.org/news/en_US/2010/09/01/0008/this-week-in-the-future-august-23-27-2010</link>
            <description>Our beverage-powered alien robot overlords discipline us with pain rays. Welcome to the future. This week in the future onPopSci: Leave a comment (any comment) to put your name in the pile; we'll randomly choose and announce our winner right here. And, if you just can't wait that long, you can buy the shirt for yourselfhere.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/01/0008/this-week-in-the-future-august-23-27-2010&quot;&gt;This Week in the Future, August 23-27, 2010&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Fri, 27 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/01/0008/this-week-in-the-future-august-23-27-2010</guid>
        </item>
        <item>
            <title>Surgical robot could be used for long-distance regional anesthesia</title>
            <link>http://www.aibits.org/news/en_US/2010/08/27/0002/surgical-robot-could-be-used-for-long-distance-regional-anesthesia</link>
            <description>An existing surgical robot could be used to perform complex regional anesthesia procedures -- in theory, allowing expert anesthesiologists to perform robot-assisted procedures from remote locations, according to a new study.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/27/0002/surgical-robot-could-be-used-for-long-distance-regional-anesthesia&quot;&gt;Surgical robot could be used for long-distance regional anesthesia&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.sciencedaily.com/news/computers_math/artificial_intelligence/ (Science Daily)</author>
            <pubDate>Thu, 26 Aug 2010 04:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/27/0002/surgical-robot-could-be-used-for-long-distance-regional-anesthesia</guid>
        </item>
        <item>
            <title>Is music going back to its roots?</title>
            <link>http://www.aibits.org/news/en_US/2010/08/31/0003/is-music-going-back-to-its-roots</link>
            <description>Technology has paved the way for almost anyone to hit the right notes are some people pining for a more authentic sound? Its 21st century equivalent is arguably the smartphone and instead of &quot;pressing down a special key&quot; to &quot;play a little melody&quot; you can launch an app to compose an orchestral concerto. This is the last of our five-part series exploring the intersection between technology and culture There is no doubt that technology has transformed the world of music makers, but has it taken away the craft? &quot;All technology has a place, and if it's used for artistry, if the sound is beautiful, I'm all for it,&quot; he said.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/31/0003/is-music-going-back-to-its-roots&quot;&gt;Is music going back to its roots?&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Thu, 26 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/31/0003/is-music-going-back-to-its-roots</guid>
        </item>
        <item>
            <title>Researchers Create Ultra-Sensitive Robotic Nose Using Frog Eggs as an Olfactory Sensor</title>
            <link>http://www.aibits.org/news/en_US/2010/09/01/0004/researchers-create-ultra-sensitive-robotic-nose-using-frog-eggs-as-an-olfactory-sensor</link>
            <description>Researchers at the University of Tokyo are using frog eggs to enhance what might seem like an unlikely element of robotics:olfactory sensing.  By injecting the eggs with the DNA from various insects known for expressing keen senses of smell, the team was able to create a robotic nose that can detect molecules at levels as low as a few parts per billion.  By injecting the eggs with DNA from fruit flies, silk moths, and diamond back moths, the bioengineers were able to coax the immature eggs into producing the olfactory sensors of those insects, which are known for their ability to detect specific gases and pheromones.  The eggs were then fitted between two electrodes, creating a sensor system that measured the current generated when certain molecules came in contact with the detector.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/01/0004/researchers-create-ultra-sensitive-robotic-nose-using-frog-eggs-as-an-olfactory-sensor&quot;&gt;Researchers Create Ultra-Sensitive Robotic Nose Using Frog Eggs as an Olfactory Sensor&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Thu, 26 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/01/0004/researchers-create-ultra-sensitive-robotic-nose-using-frog-eggs-as-an-olfactory-sensor</guid>
        </item>
        <item>
            <title>MIT unveils swimming, oil-cleaning robots</title>
            <link>http://www.aibits.org/news/en_US/2010/09/05/0005/mit-unveils-swimming-oil-cleaning-robots</link>
            <description>(CNN)-- Here's a new way of looking at oil spill clean-up: Forget the big ships, massive work crews and hefty price tags.  Instead, just deploy an army of autonomous, oil-scrubbing robots.  The $20,000 robots will be unveiled officially to the public on Saturday at an event in Venice, Italy, and will be ready to deal with oil spills in about a year, said Assaf Biderman, who oversaw MIT's research team on the project.  &quot;You can imagine it like a carpet rolling on the surface of the water,&quot; said Biderman, who also is associate director of theSENSEable City Lab.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/05/0005/mit-unveils-swimming-oil-cleaning-robots&quot;&gt;MIT unveils swimming, oil-cleaning robots&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Thu, 26 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/05/0005/mit-unveils-swimming-oil-cleaning-robots</guid>
        </item>
        <item>
            <title>Kaspar the friendly robot helps autistic kids</title>
            <link>http://www.aibits.org/news/en_US/2010/08/26/0001/kaspar-the-friendly-robot-helps-autistic-kids</link>
            <description>A child-size humanoid bot with a face inspired by comics is being used to teach interaction skills to kids who may lack an instinctive understanding of social cues. A toy tambourine in Kaspar's lap adds to its perceived playfulness.  A playful child-size humanoid robot with a face inspired by comics and Japanese Noh theater is being used to help teach autistic children social skills.  They built the robot for $2,500 using a child-shaped mannequin for the body's base, off-the-shelf parts, and silicone-rubberRoboSkinwith embedded tactile sensors that detect different kinds of touch.  Kaspar is part of theAurora Project, which is aimed at investigating the possible use of robotic systems as therapeutic or educational tools for autistic children.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/26/0001/kaspar-the-friendly-robot-helps-autistic-kids&quot;&gt;Kaspar the friendly robot helps autistic kids&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Wed, 25 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/26/0001/kaspar-the-friendly-robot-helps-autistic-kids</guid>
        </item>
        <item>
            <title>SIAI Newsletter June-July 2010</title>
            <link>http://www.aibits.org/news/en_US/2010/08/24/0001/siai-newsletter-june-july-2010</link>
            <description>&lt;p&gt;&lt;strong&gt;Where to Find Us&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;The Singularity Institute has been extending its web and outreach presence these past two months. As always, you can find us at the &lt;a href=&quot;http://singinst.org&quot;&gt;SIAI homepage&lt;/a&gt; and at the &lt;a href=&quot;http://singinst.org/blog&quot;&gt;SIAI blog&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;Hip readers may want to follow us via Twitter (&lt;a href=&quot;http://twitter.com/singinst&quot;&gt;@singinst&lt;/a&gt;) or &lt;a href=&quot;http://www.causes.com/singularity&quot;&gt;Facebook Causes&lt;/a&gt;.  Recently, we have set up a &lt;a href=&quot;http://www.crowdrise.com/calkinsin&quot;&gt;Crowdrise&lt;/a&gt; crowdsourcing and crowdfunding account for volunteers and fellows and a &lt;a href=&quot;http://www.youtube.com/user/SingularityInstitute&quot;&gt;YouTube channel&lt;/a&gt; to host our collection of videos – with a few future surprises.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;New Leadership in the Visiting Fellows Program&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;The Institute’s team of Visiting Fellows is under new management. Former Visiting Fellow Jasen Murray replaced Anna Salamon as Program Manager of the Visiting Fellows Program, with Louie Helm serving as his Deputy Program Manager.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Anna Salamon&lt;/strong&gt; spent the past year managing the expanding Visiting Fellows Program. Freed from logistics and management, she aims to spend more time on her duties as a Research Fellow, writing research papers and engaging Visiting Fellows and other visiting academics in relevant research. She is also helping Visiting Fellows develop their rationality and their understanding of the existential risks landscape through individual tutoring and group workshops.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Jasen Murray&lt;/strong&gt; founded the New York Less Wrong meet-up group and spent two years researching gene therapy and personalized medicine before joining the Visiting Fellows Program. His focus as program manager is on identifying individuals’ unique strengths, and on creating the institutions and skills that can let Fellows coordinate well, build effective teams, and get their strengths in contact with academic research, IA projects, and other action toward a positive Singularity.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Louie Helm&lt;/strong&gt; is the founder of the Seventeen or Bust distributed computing project and an internet entrepreneur. As Deputy Program Manager, he manages programming projects, outreach projects, grant writing, and team-building for the Visiting Fellows. Louie also manages the SIAI volunteer program and is always looking for more online volunteers to assist SIAI in its various projects: reach him at &lt;a href=&quot;mailto:louie.helm@singinst.org&quot;&gt;louie.helm@singinst.org&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;FQXi Grant Proposals Submitted&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;SIAI submitted three grant proposals for a total of $183,000 to the &lt;a href=&quot;http://www.fqxi.org/&quot;&gt;Foundational Questions Institute&lt;/a&gt; (FQXi). FQXi allocates grants to research projects that it believes will tackle “questions at the foundations of physics and cosmology, particularly new frontiers and innovative ideas integral to a deep understanding of reality but unlikely to be supported by conventional funding sources.” &lt;/p&gt;
&lt;p&gt;These grants, if awarded, would allow SIAI to fund research in several topics of longstanding interest. Among these topics are a developed timeless decision theory (TDT) that can be viewed as a proper alternative to causal decision theory (CDT), an exploration of fundamental priors and the mechanics of the Universal Distribution with Absolute Self-Sampling Assumption (UDASSA), and the implications of the simulation hypothesis on cosmology and fundamental physics.&lt;/p&gt;
&lt;p&gt;New Program Manager Jasen Murray has promised that the institution’s grant-writing project will be the first of many whole-team projects within the Visiting Fellows program. Discussed possibilities for the future are an electroencephalograph-building (EEG) project, a book planning project, and various IA experiments.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Research: ECAP Papers and Presentations&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;SIAI continues to contribute to the field of AI safety and to exchange dialogue, via published papers and presentations, with other scholars and students in the field. These past two months have been particularly busy with academic work.&lt;/p&gt;
&lt;p&gt;Carl Shulman (currently in Australia) gave two academic presentations on what the evolution of intelligence implies about the feasibility of AI, with special attention devoted towards anthropic arguments. The first was an hour-long talk at the Australian National University; the second was a conference talk at the Association of Australian Philosophers.&lt;/p&gt;
&lt;p&gt;The European Conference on Computing and Philosophy (ECAP) accepted Anna Salamon’s newest conference paper, written in conjunction with Research Fellow Steve Rayhawk and Visiting Fellow Janos Kramar, “How Intelligible is Intelligence? Implications for AI Development Trajectories.” In this paper, they propose that one factor that can usefully constrain models of AI development and takeoff trajectories is the “intelligibility of intelligence”—the extent to which efficient algorithms for general intelligence follow from simple general principles, as in physics, rather than being necessarily a conglomerate of special case solutions.&lt;/p&gt;
&lt;p&gt;Visiting fellow Kaj Sotala also had his conference paper, “From Mostly Harmless to Civilization-Threatening: Pathways to Dangerous Artificial Intelligences,” accepted by ECAP. Kaj’s paper discusses the threat level of three possible pathways for AI development: through advanced hardware capabilities, through the capability of software self-improvement, and through multiple copies of a digital AI. He will be editing his completed paper the following month in his native Finland.&lt;/p&gt;
&lt;p&gt;Three additional SIAI-affiliated papers have been accepted by ECAP: Anders Sandberg and Carl Shulman’s “Implications of a Software-Limited Singularity”; Steven Kaas, Peter Salamon, and Steve Rayhawk’s “Economic Implications of Software Minds”; and Joshua Fox and Carl Shulman’s “Superintelligence Favors Cooperation, but not Benevolence.” Steven Kaas is an alumnus of the summer 2009 Visiting Fellows program, Carl Shulman continues to work on SIAI research and projects in Australia, and Joshua Fox is a long-time supporter of SIAI and of efforts to create a positive Singularity.&lt;/p&gt;
&lt;p&gt;Michael Anissimov’s presentation proposal “Public Scholarship for Global Catastrophic Risks” was accepted by the Society for Risk Analysis conference, to be held in Salt Lake City in December.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;The Visiting Fellows Program: Bigger, Faster, Better!&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;The SIAI Visiting Fellows Program has grown over the past two months. Since the beginning of June, seven new Visiting Fellows have entered through the doors of the program: Peter de Blanc, Dennis Fan, Shaneal Manek, Frank Adamek, Abraham Wolk, Tim Czech, and Stanislas Sochacki. We expect to welcome eight more fellows over the course of the summer.&lt;/p&gt;
&lt;p&gt;Currently, the new fellows are filming a Less Wrong lecture series, assisting in SIAI outreach efforts, and spending time learning from the Visiting Fellows curriculum. For more information on each individual fellow and his/her interests, visit the &lt;a href=&quot;http://www.singinst.org/aboutus/visitingfellows&quot;&gt;Visiting Fellows page&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Next time…&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Look forward to more exciting developments from SIAI in the following newsletter… a Less Wrong YouTube lecture series is in the works by Visiting Fellows Peter de Blanc, Dennis Fan, and Frank Adamek… and even more Visiting Fellows will be trickling in.&lt;/p&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/24/0001/siai-newsletter-june-july-2010&quot;&gt;SIAI Newsletter June-July 2010&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author> (Michael Anissimov)</author>
            <pubDate>Tue, 24 Aug 2010 00:07:26 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/24/0001/siai-newsletter-june-july-2010</guid>
        </item>
        <item>
            <title>Babies Take the Wheel of DrivingRobots</title>
            <link>http://www.aibits.org/news/en_US/2010/08/26/0003/babies-take-the-wheel-of-drivingrobots</link>
            <description>Giving disabled babies the power of movement could improves their development. But it's the control mechanism on this particular baby robo-chair that's the real genius: by sticking the baby into a seat strapped onto a Wii Fit Balance Board perched atop a Pioneer 3 robot platform, researchers from Ithaca College created a robot that travels in whatever direction a baby leans.  From the paper : The balance board has responsive pressure sensors in each of its four corners and built in Bluetooth capabilities.  C++ library (ti) to access balance board data within our robotics software.  Our software compares the values of the four pressure sensors to determine which, if any, direction the infant is leaning.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/26/0003/babies-take-the-wheel-of-drivingrobots&quot;&gt;Babies Take the Wheel of DrivingRobots&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Tue, 24 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/26/0003/babies-take-the-wheel-of-drivingrobots</guid>
        </item>
        <item>
            <title>Willow Garage's PR2 Robot Achieves Another Laundry Landmark, This Time Cleverly Pairing Your Socks</title>
            <link>http://www.aibits.org/news/en_US/2010/09/01/0003/willow-garage-s-pr2-robot-achieves-another-laundry-landmark-this-time-cleverly-pairing-your-socks</link>
            <description>The guys over at Willow Garage have already proved their PR2 to be a worthy weekend companion, teaching it toplay billiards,fetch beer, and even to clean up after a party.  A team of UC Berkeley researchers more interested in domestic applications for robotics has also shown that PR2 can be a handy household companion during the slower parts of the week, namelylaundry day.  Now, they've shown that if you give PR2 a sock it can employ its keen ability for repetitive hand motions to that other regularly recurring chore:pairing socks!  Presented with two socks, PR2 must first determine if each one is correctly oriented or if one or both are inside out.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/01/0003/willow-garage-s-pr2-robot-achieves-another-laundry-landmark-this-time-cleverly-pairing-your-socks&quot;&gt;Willow Garage's PR2 Robot Achieves Another Laundry Landmark, This Time Cleverly Pairing Your Socks&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Tue, 24 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/01/0003/willow-garage-s-pr2-robot-achieves-another-laundry-landmark-this-time-cleverly-pairing-your-socks</guid>
        </item>
        <item>
            <title>Five must-have video games for fall</title>
            <link>http://www.aibits.org/news/en_US/2010/09/03/0002/five-must-have-video-games-for-fall</link>
            <description>Editor's note:Scott Steinberg is the head of technology and video game consulting firm TechSavvy Global as well as the founder of GameExec magazine and Game Industry TV.  (CNN)-- From downloadable titles like haunting puzzle-action hybrid &quot;Limbo&quot; for Xbox 360 to the long-awaited release of PC sci-fi strategy juggernaut &quot;StarCraft II,&quot; summer's been good to gaming fans.  These games should soon prove there's little reason to make the upgrade yet, with so much life left in your PC and favorite console.  Here are five upcoming titles that top my personal wish list: &quot;Halo: Reach&quot;(September 14; Microsoft, Xbox 360): This sequel builds upon the same futuristic run-'n'-gun thrills players know and love by adding special powers (invulnerability, temporary flight, etc.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/03/0002/five-must-have-video-games-for-fall&quot;&gt;Five must-have video games for fall&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Tue, 24 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/03/0002/five-must-have-video-games-for-fall</guid>
        </item>
        <item>
            <title>Personalized Life Extension Conference, October 9-10, SFO Marriott</title>
            <link>http://www.aibits.org/news/en_US/2010/08/24/0002/personalized-life-extension-conference-october-9-10-sfo-marriott</link>
            <description>&lt;p&gt;Chris Peterson, a friend and advisor of SIAI, is holding a &lt;a href=&quot;http://lifeextensionconference.com/&quot;&gt;personalized life extension conference&lt;/a&gt; on October 9-10 at the San Francisco Airport Marriott.  Readers of SIAI blog can get &lt;a href=&quot;http://lifeextensionconference.com/registration/&quot;&gt;$100 off on registration&lt;/a&gt; by using the registration code “SIAI”.  Here’s the short summary of the purpose of the conference:&lt;/p&gt;
&lt;blockquote&gt;&lt;p&gt;&lt;em&gt;Advances are being made daily on what each of us can do NOW to slow the aging process to a minimum, and to delay or prevent the diseases of aging.&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;em&gt;Life extension news comes out faster than any one of us can evaluate it on our own.  Let’s get together and determine how to take personal action.&lt;/em&gt;&lt;/p&gt;&lt;/blockquote&gt;
&lt;p&gt;Speakers include Esther Dyson, Peter Thiel, Terry Grossman, Bruce Ames, Gregory Benford, Patri Friedman, Sonia Arrison, Greg Fahy, and &lt;a href=&quot;http://lifeextensionconference.com/speakers/&quot;&gt;many more&lt;/a&gt;.  &lt;/p&gt;
&lt;p&gt;Register now if you’re interested, and get psyched up for what is certain to be a &lt;em&gt;life-affirming&lt;/em&gt; conference…&lt;/p&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/24/0002/personalized-life-extension-conference-october-9-10-sfo-marriott&quot;&gt;Personalized Life Extension Conference, October 9-10, SFO Marriott&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author> (Michael Anissimov)</author>
            <pubDate>Mon, 23 Aug 2010 23:57:39 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/24/0002/personalized-life-extension-conference-october-9-10-sfo-marriott</guid>
        </item>
        <item>
            <title>Singularity Summit Australia- Sept. 7, 11, 12, Melbourne</title>
            <link>http://www.aibits.org/news/en_US/2010/08/23/0001/singularity-summit-australia-sept-7-11-12-melbourne</link>
            <description>&lt;p&gt;The first ever Singularity Summit Australia will be held on September 7th, 11th, and 12th at Casey Plaza at RMIT, Melbourne. Here’s the news release:&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Singularity Summit 2010 in Melbourne Victoria to explore emerging technological trends&lt;br /&gt;
Speakers include AI Architect Hugo deGaris, Futurist Peter Ellyard&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Melbourne Victoria 2010 — Will it be one day become possible to boost human intelligence using brain implants, or create an artificial intelligence smarter than Einstein? In a 1993 paper presented to NASA, science fiction author and mathematician Vernor Vinge called such a hypothetical event a “Singularity”, saying “From the human point of view this change will be a throwing away of all the previous rules, perhaps in the blink of an eye”. Vinge pointed out that intelligence enhancement could lead to “closing the loop” between intelligence and technology, creating a positive feedback effect.&lt;/p&gt;
&lt;p&gt;This September 7th, 10-12th, hundreds of AI researchers, robotics experts, philosophers, entrepreneurs, scientists, and interested laypeople will converge in Melbourne to address the Singularity and related issues at the only conference on the topic in Australia, the Singularity Summit. Experts in fields including artificial intelligence, bio-ethics, tissue regeneration, medical ethics, computational neurobiology, cryonics, futurism, and more will share their latest research, brightest ideas, and explore their implications for the future of humanity.&lt;/p&gt;
&lt;p&gt;“This is the first Singularity Summit outside the US, and will be a great event,” said Adam Ford, coordinator of the Singularity Institute Australia, which is hosting the event.&lt;/p&gt;
&lt;p&gt;Russell Blackford, editor of “50 Voices of Disbelief” who is a contributor to IEET, will explore the ethical and practical implications of key emerging technological trends. Futurist Peter Ellyard will discuss opportunities that innovation and technology can provide and his book ‘Designing 2050′.&lt;/p&gt;
&lt;p&gt;Interested readers can watch videos from past summits and register at http://summit.singinst.org.au.&lt;/p&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/23/0001/singularity-summit-australia-sept-7-11-12-melbourne&quot;&gt;Singularity Summit Australia- Sept. 7, 11, 12, Melbourne&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author> (Tom McCabe)</author>
            <pubDate>Mon, 23 Aug 2010 04:44:12 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/23/0001/singularity-summit-australia-sept-7-11-12-melbourne</guid>
        </item>
        <item>
            <title>X Factor admits tweaking vocals</title>
            <link>http://www.aibits.org/news/en_US/2010/09/02/0010/x-factor-admits-tweaking-vocals</link>
            <description>X Factor contestants Gamu Nhengu, G&amp;S and Shirleena Johnson audition X Factor bosses have admitted using vocal enhancement processes on the ITV talent show.  Fans had claimed after the opening show that &quot;autotuning&quot; had been used to improve some contestants' voices.  An X Factor spokesman said post-production work was necessary on the show due to the number of microphones used during filming.  Somebody took the time to go, &quot;I'm going to leave this bit dry, and then I'm going to fix that bit&quot;.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/09/02/0010/x-factor-admits-tweaking-vocals&quot;&gt;X Factor admits tweaking vocals&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Mon, 23 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/09/02/0010/x-factor-admits-tweaking-vocals</guid>
        </item>
        <item>
            <title>PrePrint: Canonical Correlation Analysis for Multi-label Classification: A Least Squares ...</title>
            <link>http://www.aibits.org/news/en_US/2010/08/20/0009/preprint-canonical-correlation-analysis-for-multi-label-classification-a-least-squares-formulation-extensions-and-analysis</link>
            <description>Canonical Correlation Analysis (CCA) is a well-known technique for finding the correlations between two sets of multi-dimensional variables. It projects both sets of variables onto a lower-dimensional space in which they are maximally correlated. It is well-known that CCA can be formulated as a least squares problem in the binary-class case. However, the extension to the more general setting remains unclear. In this paper, we show that under a mild condition CCA in the multi-label case can be formulated as a least squares problem. Based on this equivalence relationship, efficient algorithms for solving least squares problems can be applied to scale CCA to very large data sets. In addition, we propose several CCA extensions including the sparse CCA formulation based on the 1-norm regularization. We further extend the least squares formulation to partial least squares. In addition, we show that the CCA projection for one set of variables is independent of the regularization on the other set of multi-dimensional variables, providing new insights on the effect of regularization on CCA. We have conducted experiments using benchmark data sets. Experiments on multi-label data sets confirm the established equivalence relationships. Results also demonstrate the effectiveness and efficiency of the proposed CCA extensions.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=67c4b1aa3cac4b3ee0dec8a5cf3b2239&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=67c4b1aa3cac4b3ee0dec8a5cf3b2239&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=67c4b1aa3cac4b3ee0dec8a5cf3b2239&amp;p=64&amp;kw=Canonical+Correlation+Analysis&quot;&gt;Canonical Correlation Analysis&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=67c4b1aa3cac4b3ee0dec8a5cf3b2239&amp;p=64&amp;kw=CCA&quot;&gt;CCA&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=67c4b1aa3cac4b3ee0dec8a5cf3b2239&amp;p=64&amp;kw=Dimension&quot;&gt;Dimension&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=67c4b1aa3cac4b3ee0dec8a5cf3b2239&amp;p=64&amp;kw=Data&quot;&gt;Data&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=67c4b1aa3cac4b3ee0dec8a5cf3b2239&amp;p=64&amp;kw=Databases&quot;&gt;Databases&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/20/0009/preprint-canonical-correlation-analysis-for-multi-label-classification-a-least-squares-formulation-extensions-and-analysis&quot;&gt;PrePrint: Canonical Correlation Analysis for Multi-label Classification: A Least Squares Formulation, Extensions and Analysis&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Fri, 20 Aug 2010 17:44:34 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/20/0009/preprint-canonical-correlation-analysis-for-multi-label-classification-a-least-squares-formulation-extensions-and-analysis</guid>
        </item>
        <item>
            <title>PrePrint: Equidistant Fish-Eye Calibration and Rectification by Vanishing Point Extraction</title>
            <link>http://www.aibits.org/news/en_US/2010/08/20/0010/preprint-equidistant-fish-eye-calibration-and-rectification-by-vanishing-point-extraction</link>
            <description>In this paper we describe a method to photogrammetrically estimate the intrinsic and extrinsic parameters of fish-eye cameras using the properties of equidistance perspective, particularly vanishing point estimation, with the aim of providing a rectified image. The estimated intrinsic parameters are the optical center and the fish-eye lensing parameter, and the extrinsic parameters are the rotations about the world axes relative to the checkerboard calibration diagram.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=96a46520290943881f8c9f03938367f2&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=96a46520290943881f8c9f03938367f2&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=96a46520290943881f8c9f03938367f2&amp;p=64&amp;kw=Perspective&quot;&gt;Perspective&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=96a46520290943881f8c9f03938367f2&amp;p=64&amp;kw=Vanishing+point&quot;&gt;Vanishing point&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=96a46520290943881f8c9f03938367f2&amp;p=64&amp;kw=Estimation&quot;&gt;Estimation&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=96a46520290943881f8c9f03938367f2&amp;p=64&amp;kw=Medicine&quot;&gt;Medicine&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=96a46520290943881f8c9f03938367f2&amp;p=64&amp;kw=Health&quot;&gt;Health&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/20/0010/preprint-equidistant-fish-eye-calibration-and-rectification-by-vanishing-point-extraction&quot;&gt;PrePrint: Equidistant Fish-Eye Calibration and Rectification by Vanishing Point Extraction&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Fri, 20 Aug 2010 17:44:34 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/20/0010/preprint-equidistant-fish-eye-calibration-and-rectification-by-vanishing-point-extraction</guid>
        </item>
        <item>
            <title>PrePrint: A Fast Bilinear Structure from Motion Algorithm Using a Video Sequence and Inertial ...</title>
            <link>http://www.aibits.org/news/en_US/2010/08/20/0007/preprint-a-fast-bilinear-structure-from-motion-algorithm-using-a-video-sequence-and-inertial-sensors</link>
            <description>In this paper, we study the benefits of the availability of a specific form of additional information - the vertical direction (gravity) and the height of the camera both of which can be conveniently measured using inertial sensors, and a monocular video sequence for 3D urban modeling. We show that in the presence of this information, the SfM equations can be rewritten in a bilinear form. This allows us to derive a fast, robust, and scalable SfM algorithm for large scale applications. The SfM algorithm developed in this paper is experimentally demonstrated to have favorable properties compared to the sparse bundle adjustment algorithm. We provide experimental evidence indicating that the proposed algorithm converges in many cases to solutions with lower error than state-of-art implementations of bundle adjustment. We also demonstrate that for the case of large reconstruction problems, the proposed algorithm takes lesser time to reach its solution compared to bundle adjustment. We also present SfM results using our algorithm on the Google StreetView research dataset.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d7fbc1055f0081e26847dc2b44db4f22&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=d7fbc1055f0081e26847dc2b44db4f22&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d7fbc1055f0081e26847dc2b44db4f22&amp;p=64&amp;kw=Algorithm&quot;&gt;Algorithm&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d7fbc1055f0081e26847dc2b44db4f22&amp;p=64&amp;kw=Google+StreetView&quot;&gt;Google StreetView&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d7fbc1055f0081e26847dc2b44db4f22&amp;p=64&amp;kw=Google&quot;&gt;Google&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d7fbc1055f0081e26847dc2b44db4f22&amp;p=64&amp;kw=Gravitation&quot;&gt;Gravitation&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d7fbc1055f0081e26847dc2b44db4f22&amp;p=64&amp;kw=Research&quot;&gt;Research&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/20/0007/preprint-a-fast-bilinear-structure-from-motion-algorithm-using-a-video-sequence-and-inertial-sensors&quot;&gt;PrePrint: A Fast Bilinear Structure from Motion Algorithm Using a Video Sequence and Inertial Sensors&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Fri, 20 Aug 2010 17:44:33 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/20/0007/preprint-a-fast-bilinear-structure-from-motion-algorithm-using-a-video-sequence-and-inertial-sensors</guid>
        </item>
        <item>
            <title>PrePrint: A Non-Rigid Kernel Based Framework for 2D3D Pose Estimation and 2D Image Segmentation</title>
            <link>http://www.aibits.org/news/en_US/2010/08/20/0008/preprint-a-non-rigid-kernel-based-framework-for-2d3d-pose-estimation-and-2d-image-segmentation</link>
            <description>In this work, we present a non-rigid approach to jointly solve the tasks of 2D-3D pose estimation and 2D image segmentation. In general, most frameworks that couple both pose estimation and segmentation assume that one has the exact knowledge of the 3D object. However, this assumption may be violated if only a general class to which a given shape belongs is given (e.g., cars, boats, or planes). Thus, we propose to solve the 2D-3D pose estimation and 2D image segmentation via nonlinear manifold learning of 3D embedded shapes for a class of objects for which one may not be able to associate a skeleton model. Thus, the novelty of our method is threefold: Firstly, we derive a generalized gradient flow for the task of non-rigid pose estimation and segmentation. Secondly, due to possible nonlinear structures in one's training set, we evolve the pre-image obtained through kernel PCA for the task of shape analysis. Thirdly, we show that the derivation for shape weights is general. This allows us to use various kernels with only minimal changes needed to be made to the overall evolution scheme. We provide experimental results that highlight the algorithm's robustness on challenging pose estimation and segmentation scenarios.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=44fc6662e58254fdaf17bc53a9bab1b4&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=44fc6662e58254fdaf17bc53a9bab1b4&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=44fc6662e58254fdaf17bc53a9bab1b4&amp;p=64&amp;kw=Linux&quot;&gt;Linux&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=44fc6662e58254fdaf17bc53a9bab1b4&amp;p=64&amp;kw=Operating+Systems&quot;&gt;Operating Systems&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=44fc6662e58254fdaf17bc53a9bab1b4&amp;p=64&amp;kw=Kernel&quot;&gt;Kernel&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=44fc6662e58254fdaf17bc53a9bab1b4&amp;p=64&amp;kw=OpenSUSE&quot;&gt;OpenSUSE&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=44fc6662e58254fdaf17bc53a9bab1b4&amp;p=64&amp;kw=Linux+kernel&quot;&gt;Linux kernel&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/20/0008/preprint-a-non-rigid-kernel-based-framework-for-2d3d-pose-estimation-and-2d-image-segmentation&quot;&gt;PrePrint: A Non-Rigid Kernel Based Framework for 2D3D Pose Estimation and 2D Image Segmentation&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Fri, 20 Aug 2010 17:44:33 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/20/0008/preprint-a-non-rigid-kernel-based-framework-for-2d3d-pose-estimation-and-2d-image-segmentation</guid>
        </item>
        <item>
            <title>PrePrint: Applying Property Testing to an Image Partitioning Problem</title>
            <link>http://www.aibits.org/news/en_US/2010/08/20/0005/preprint-applying-property-testing-to-an-image-partitioning-problem</link>
            <description>Property testing is a rapidly growing field of research. Typically, a property testing algorithm proceeds by quickly determining whether an input can satisfy some condition, under the assumption that most inputs do not satisfy it. If the input is &quot;far&quot; from satisfying the condition, the algorithm is guaranteed to reject it with high probability. Applying this paradigm to image detection is desirable, since images are large objects, and a lot of time can be saved by quickly rejecting images which are &quot;far&quot; from satisfying a certain condition the user is interested in. Further, typically most inputs are indeed &quot;far&quot; from the sought images. We demonstrate this by analyzing the problem of deciding whether a binary image can be partitioned according to a template represented by a rectangular grid, and introduce a quick &quot;rejector&quot; which tests an image extracted from the input image, but whose size, as well as the time required to construct it, are constants which are independent of the input image size. With high probability, the rejector dismisses the inputs which are &quot;far&quot; from the template.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=f271350d1e2c597e4283bf6699692716&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=f271350d1e2c597e4283bf6699692716&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=f271350d1e2c597e4283bf6699692716&amp;p=64&amp;kw=Probability&quot;&gt;Probability&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=f271350d1e2c597e4283bf6699692716&amp;p=64&amp;kw=Algorithm&quot;&gt;Algorithm&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=f271350d1e2c597e4283bf6699692716&amp;p=64&amp;kw=Research&quot;&gt;Research&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=f271350d1e2c597e4283bf6699692716&amp;p=64&amp;kw=Business&quot;&gt;Business&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=f271350d1e2c597e4283bf6699692716&amp;p=64&amp;kw=Image+Consultants&quot;&gt;Image Consultants&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/20/0005/preprint-applying-property-testing-to-an-image-partitioning-problem&quot;&gt;PrePrint: Applying Property Testing to an Image Partitioning Problem&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Fri, 20 Aug 2010 17:44:32 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/20/0005/preprint-applying-property-testing-to-an-image-partitioning-problem</guid>
        </item>
        <item>
            <title>PrePrint: Multi-Feature Based High-Resolution Palmprint Recognition</title>
            <link>http://www.aibits.org/news/en_US/2010/08/20/0006/preprint-multi-feature-based-high-resolution-palmprint-recognition</link>
            <description>Palmprint is promising biometric feature for use in access control and forensic applications. Previous research on palmprint recognition mainly concentrates on low resolution (about 100 ppi) palmprints. But for high-security applications (e.g. forensic usage), high resolution palmprints (500 ppi or higher) are required from which more useful information can be extracted. In this paper, we propose a novel recognition algorithm for high-resolution palmprint. The main contributions of the proposed algorithm include: (1) Use of multiple features, namely minutiae, density, orientation and principal lines for palmprint recognition to significantly improve the matching performance of the conventional algorithm. (2) Design of a quality based and adaptive orientation field estimation algorithm, which performs better than the existing algorithm in case of regions with large number of creases. (3) Use of a novel fusion scheme for identification application which performs better than conventional fusion methods, e.g. weighted sum rule, SVMs or Neyman-Pearson rule. Besides, we analyze the discriminative power of different feature combinations and find that density is very useful for palmprint recognition. Experimental results on the database containing 14,576 full palmprints show that the proposed algorithm has achieved a good performance.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=9771f08b1033c753ed71dd03bdc2b40b&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=9771f08b1033c753ed71dd03bdc2b40b&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=9771f08b1033c753ed71dd03bdc2b40b&amp;p=64&amp;kw=Biometrics&quot;&gt;Biometrics&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=9771f08b1033c753ed71dd03bdc2b40b&amp;p=64&amp;kw=Security&quot;&gt;Security&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=9771f08b1033c753ed71dd03bdc2b40b&amp;p=64&amp;kw=Access+control&quot;&gt;Access control&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=9771f08b1033c753ed71dd03bdc2b40b&amp;p=64&amp;kw=Research&quot;&gt;Research&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=9771f08b1033c753ed71dd03bdc2b40b&amp;p=64&amp;kw=Business&quot;&gt;Business&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/20/0006/preprint-multi-feature-based-high-resolution-palmprint-recognition&quot;&gt;PrePrint: Multi-Feature Based High-Resolution Palmprint Recognition&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Fri, 20 Aug 2010 17:44:32 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/20/0006/preprint-multi-feature-based-high-resolution-palmprint-recognition</guid>
        </item>
        <item>
            <title>PrePrint: A Laplacian Approach to Multi-Oriented Text Detection in Video</title>
            <link>http://www.aibits.org/news/en_US/2010/08/20/0004/preprint-a-laplacian-approach-to-multi-oriented-text-detection-in-video</link>
            <description>In this paper, we propose a method based on the Laplacian in the frequency domain for video text detection. Unlike many other approaches which assume that text is horizontally-oriented, our method is able to handle text of arbitrary orientation. The input image is first filtered with Fourier-Laplacian. K-means clustering is then used to identify candidate text regions based on the maximum difference. The skeleton of each connected component helps to separate the different text strings from each other. Finally, text string straightness and edge density are used for false positive elimination. Experimental results show that the proposed method is able to handle graphics text and scene text of both horizontal and non-horizontal orientation.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d10be45ead7bc36c36343a2edf074706&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=d10be45ead7bc36c36343a2edf074706&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d10be45ead7bc36c36343a2edf074706&amp;p=64&amp;kw=String&quot;&gt;String&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d10be45ead7bc36c36343a2edf074706&amp;p=64&amp;kw=Laplace+operator&quot;&gt;Laplace operator&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d10be45ead7bc36c36343a2edf074706&amp;p=64&amp;kw=Image&quot;&gt;Image&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d10be45ead7bc36c36343a2edf074706&amp;p=64&amp;kw=Paper&quot;&gt;Paper&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=d10be45ead7bc36c36343a2edf074706&amp;p=64&amp;kw=Text&quot;&gt;Text&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/20/0004/preprint-a-laplacian-approach-to-multi-oriented-text-detection-in-video&quot;&gt;PrePrint: A Laplacian Approach to Multi-Oriented Text Detection in Video&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Fri, 20 Aug 2010 17:44:31 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/20/0004/preprint-a-laplacian-approach-to-multi-oriented-text-detection-in-video</guid>
        </item>
        <item>
            <title>PrePrint: Space-time Super-Resolution Using Graph-cut Optimization</title>
            <link>http://www.aibits.org/news/en_US/2010/08/20/0003/preprint-space-time-super-resolution-using-graph-cut-optimization</link>
            <description>We address the problem of super-resolution -- obtaining high-resolution images and videos from multiple low resolution inputs. The increased resolution can be in spatial or temporal dimensions, or even in both.We present a unified framework which uses a generative model of the imaging process and can address spatial super-resolution, space-time super-resolution, image deconvolution, single image expansion, removal of noise and image restoration. We model a high resolution image or video as a Markov random field and use maximum a posteriori estimate as the final solution using graph-cut optimization technique. We derive insights in to what super-resolution magnification factors are possible and the conditions necessary for super-resolution. We demonstrate spatial super-resolution reconstruction results with magnifications higher than predicted limits of magnification. We also formulate a scheme for selective super-resolution reconstruction of videos to obtain simultaneous increase of resolutions in both spatial and temporal directions. We show that it is possible to achieve space-time magnification factors beyond what has been suggested in the literature by selectively applying super-resolution constraints. We present results on both synthetic and real input sequences.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=11eb0fb81acef4f14e958a70c343589a&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=11eb0fb81acef4f14e958a70c343589a&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=11eb0fb81acef4f14e958a70c343589a&amp;p=64&amp;kw=Image+resolution&quot;&gt;Image resolution&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=11eb0fb81acef4f14e958a70c343589a&amp;p=64&amp;kw=Image+processing&quot;&gt;Image processing&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=11eb0fb81acef4f14e958a70c343589a&amp;p=64&amp;kw=Image&quot;&gt;Image&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=11eb0fb81acef4f14e958a70c343589a&amp;p=64&amp;kw=Video&quot;&gt;Video&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=11eb0fb81acef4f14e958a70c343589a&amp;p=64&amp;kw=Magnification&quot;&gt;Magnification&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/20/0003/preprint-space-time-super-resolution-using-graph-cut-optimization&quot;&gt;PrePrint: Space-time Super-Resolution Using Graph-cut Optimization&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Fri, 20 Aug 2010 17:44:30 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/20/0003/preprint-space-time-super-resolution-using-graph-cut-optimization</guid>
        </item>
        <item>
            <title>PrePrint: Contour Detection and Hierarchical Image Segmentation</title>
            <link>http://www.aibits.org/news/en_US/2010/08/20/0002/preprint-contour-detection-and-hierarchical-image-segmentation</link>
            <description>This paper investigates two fundamental problems in computer vision: contour detection and image segmentation. We present state-of-the-art algorithms for both of these tasks. Our contour detector combines multiple local cues into a globalization framework based on spectral clustering. Our segmentation algorithm consists of generic machinery for transforming the output of any contour detector into a hierarchical region tree. In this manner, we reduce the problem of image segmentation to that of contour detection. Extensive experimental evaluation demonstrates that both our contour detection and segmentation methods significantly outperform competing algorithms. The automatically generated hierarchical segmentations can be interactively refined by user specified annotations. Computation at multiple image resolutions provides a means of coupling our system to recognition applications.&lt;br clear=&quot;both&quot;/&gt;
&lt;br clear=&quot;both&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=3f75b8813e0a80ad48358e67efd02d4d&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=3f75b8813e0a80ad48358e67efd02d4d&amp;p=1&quot; /&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://segment-pixel.invitemedia.com/pixel?code=TechBiz
&amp;partnerID=167&amp;key=segment&quot; /&gt;&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; src=&quot;http://pixel.quantserve.com/pixel/p-8bUhLiluj0fAw.gif?labels=pub.27591.rss.TechBiz
.5155,cat.TechBiz
.rss&quot; /&gt;&lt;br clear=&quot;all&quot;/&gt;
&lt;img src=&quot;http://ads.pheedo.com/img.phdo?kw=&quot; align=&quot;absmiddle&quot; /&gt; 
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=3f75b8813e0a80ad48358e67efd02d4d&amp;p=64&amp;kw=Algorithm&quot;&gt;Algorithm&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=3f75b8813e0a80ad48358e67efd02d4d&amp;p=64&amp;kw=Computer+vision&quot;&gt;Computer vision&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=3f75b8813e0a80ad48358e67efd02d4d&amp;p=64&amp;kw=Cluster+analysis&quot;&gt;Cluster analysis&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=3f75b8813e0a80ad48358e67efd02d4d&amp;p=64&amp;kw=Segmentation&quot;&gt;Segmentation&lt;/a&gt; - &lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=3f75b8813e0a80ad48358e67efd02d4d&amp;p=64&amp;kw=Paper&quot;&gt;Paper&lt;/a&gt;&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/20/0002/preprint-contour-detection-and-hierarchical-image-segmentation&quot;&gt;PrePrint: Contour Detection and Hierarchical Image Segmentation&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.computer.org/tpami (IEEE transactions)</author>
            <pubDate>Fri, 20 Aug 2010 17:44:29 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/20/0002/preprint-contour-detection-and-hierarchical-image-segmentation</guid>
        </item>
        <item>
            <title>What if 'English Only' Isn't Wrong?</title>
            <link>http://www.aibits.org/news/en_US/2010/08/22/0003/what-if-english-only-isn-t-wrong</link>
            <description>Foreigners learn our language; we don't learn theirs. On the campaign trail in 2008, Barack Obama was asked about foreign-language education.  Being able to speak a foreign language makes you &quot;so much more employable,&quot; he said.  &quot; I recently telephoned Dennis Baron, professor of English and linguistics at the University of Illinois at Urbana-Champaign, and read him that quote.  Americans are still stubbornly—even proudly—monolingual, more concerned with protecting English than with learning another tongue.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/22/0003/what-if-english-only-isn-t-wrong&quot;&gt;What if 'English Only' Isn't Wrong?&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Fri, 20 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/22/0003/what-if-english-only-isn-t-wrong</guid>
        </item>
        <item>
            <title>Floor fight: Cleaning robot Mint versus Scooba</title>
            <link>http://www.aibits.org/news/en_US/2010/08/22/0012/floor-fight-cleaning-robot-mint-versus-scooba</link>
            <description>Mint is a new floor-cleaning robot that can wipe down hard surfaces with dust cloths. How does it stack up to iRobot's Scooba?  Newcomer Mint, at right, is smaller and lighter than iRobot's Scooba.  But can it clean floors as well?  But Evolution Robotics'Mintis one of a number of floor-cleaning robots designed to lighten the housework load.  Mint is somewhat comparable to low-cost dusting robots like the $50RoboMop, but at $249 it's almost in the same league as more sophisticated floor-washing machines like iRobot'sScooba.&lt;div&gt;&lt;br&gt;&lt;br&gt;Continue reading &lt;a href=&quot;http://www.aibits.org/news/en_US/2010/08/22/0012/floor-fight-cleaning-robot-mint-versus-scooba&quot;&gt;Floor fight: Cleaning robot Mint versus Scooba&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;</description>
            <author>http://www.aaai.org/aitopics/html/current.html (AAAI)</author>
            <pubDate>Fri, 20 Aug 2010 00:00:00 +0100</pubDate>
            <guid>http://www.aibits.org/news/en_US/2010/08/22/0012/floor-fight-cleaning-robot-mint-versus-scooba</guid>
        </item>
    </channel>
</rss>
