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

<channel>
	<title>一種基於二次規劃的集群對應投影算法 Archives &#8212; MATLAB Number ONE</title>
	<atom:link href="https://matlab1.com/product-tag/%e4%b8%80%e7%a8%ae%e5%9f%ba%e6%96%bc%e4%ba%8c%e6%ac%a1%e8%a6%8f%e5%8a%83%e7%9a%84%e9%9b%86%e7%be%a4%e5%b0%8d%e6%87%89%e6%8a%95%e5%bd%b1%e7%ae%97%e6%b3%95/feed/" rel="self" type="application/rss+xml" />
	<link>https://matlab1.com/product-tag/一種基於二次規劃的集群對應投影算法/</link>
	<description>MATLAB Simulink &#124; Tutorial &#124; Code &#124; Project</description>
	<lastBuildDate>Mon, 30 May 2022 12:16:07 +0000</lastBuildDate>
	<language>en-GB</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	

<image>
	<url>https://matlab1.com/wp-content/uploads/2018/08/icon1-100x100.png</url>
	<title>一種基於二次規劃的集群對應投影算法 Archives &#8212; MATLAB Number ONE</title>
	<link>https://matlab1.com/product-tag/一種基於二次規劃的集群對應投影算法/</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>A Quadratic Programming based Cluster Correspondence Projection Algorithm for Fast Point Matching</title>
		<link>https://matlab1.com/shop/matlab-code/a-quadratic-programming-based-cluster-correspondence-projection-algorithm-for-fast-point-matching/</link>
					<comments>https://matlab1.com/shop/matlab-code/a-quadratic-programming-based-cluster-correspondence-projection-algorithm-for-fast-point-matching/#respond</comments>
		
		<dc:creator><![CDATA[global MATLAB]]></dc:creator>
		<pubDate>Mon, 07 May 2018 14:09:15 +0000</pubDate>
				<guid isPermaLink="false">https://matlab1.com/?post_type=product&#038;p=5116</guid>

					<description><![CDATA[<p>In this project , a gradient descent based point matching algorithm, where the possible optimal correspondence are searched via gradient descent and the constraints on the correspondence are satisfied by constrained projection. The problem of projection was solved by using quadratic programming, and to reduce the computational cost, a cluster projection technique was introduced. Compared with the POCS based method, the [&#8230;]</p>
<p>The post <a href="https://matlab1.com/shop/matlab-code/a-quadratic-programming-based-cluster-correspondence-projection-algorithm-for-fast-point-matching/">A Quadratic Programming based Cluster Correspondence Projection Algorithm for Fast Point Matching</a> appeared first on <a href="https://matlab1.com">MATLAB Number ONE</a>.</p>
]]></description>
		
					<wfw:commentRss>https://matlab1.com/shop/matlab-code/a-quadratic-programming-based-cluster-correspondence-projection-algorithm-for-fast-point-matching/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
