登录
首页 » Others » Census及Hamming距离三维立体重建Matlab程序

Census及Hamming距离三维立体重建Matlab程序

于 2021-05-06 发布
0 269
下载积分: 1 下载次数: 3

代码说明:

基于Census变换及Hamming距离的三维立体重建Matlab程序,用于从左右灰度图像得到视差图。结果经Middlebury标准测试集测试。

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 基于时间轴的视频文件检索
    基于时间轴的视频文件检索,本来已经有个程序了,可以进行反编译查看源代码,有些人不会反编译,所以把源代码也放上来了。
    2020-11-29下载
    积分:1
  • 种求解带时间窗车辆路径的混合差分进化算法
    时间窗的车辆路径问题进行研究,建立以最小化车辆数量和行驶路程为目标的多目标数学模型,提出一种结合改进差分进化算法和变邻域下降搜索的基于Pareto支配的混合差分进化算法。首先重新定义了个体的生成方式。其次,结合双种群策略和变邻域下降搜索技术来平衡算法的全局探索能力和局部开发能力,并在搜索过程中用随机个体替代种群中的重复个体,维持种群的多样性。然后引入Pareto支配的概念来评价个体的优劣性,并采用擂台法则构造非支配解集其中,N是种群规模,gem为当前进化代数, gem为最大进化按照这种方法,直到所有的顾客都被服务。这种解码方法可代数。以使解码后的路径和解码前染色体中所对应的路径方案·在进化过程中,采用双种群机制,使算法既能从局部极值致,并且使用车辆的数量可以在解码过程中灵活动态地获得,的邻域跳转到全局最优解的邻域,又能在全局最优解的邻域从而实现对车辆数量的自动寻优。例如染色体串361857内进行精细搜索,在每代进化完后通过子种群重组实现信息294,经过路径解码为:路线1:0→3→-6→0;路线2:0→1→8交流和融合,平衡算法的全局探索能力和局部开发能力→57→0;路线3:0→2→9-4→0随着进化过程的进行,种群中的个体会趋于一致,因此在3.3.2初始种群生成每次执行完变异、交义、选择操作后,采用随机个体替换掉种产生初始种群时,为了保证种群的多样性,其中90%的群中的重复个体,维持种群的多样性,以增强种群的全局探索个体采用N个顾客节点随机排列的方式来产生,应用前向插能力,然后从种群中随机选取若干个个体进行变邻域下降搜启发式算法(PFH)来生成剩下10%的个体。索进一步提高算法的局部开发能力降低算法陷入局部最优3.3.3变异操作的风险。鉴于标准差分进化算法采用实数编码,不能直接应用于3.2算法步骤VRPW问题,由于采用了自然数编码,因此重新设计了变异基丁以上的算法思想描述,混合差分进化算法的具体步操作方式来产生变异个体。由标准DE算法可知,变异个体骤如下是由目标种群中随机选择的3个目标个体相互作用的结果步骤1设置算法的相关参数,生成算法的初始种群设记x=[x,x2,…,x]V=[1,2,进化代数gen=0;[uE,1,t2,…,n]分别为第G代目标种群变异种群和试验步骤2根据 Pareto支配思想对种群中的个体适应值进种群的第z个个体。行评价,利用擂台法则和拥挤距离机制将种群个体分层排序,(1)P1子种群采用“DE/best/1”变异策略,重新定义得到每个个体的非支配层等级和拥挤距离值;v=g(F⑧g(x,Y),X)步骤3按照个体的非支配层等级和拥挤距离,并根据式中,1r2是区间[1,n里互不相等的整数;X是当前目式(12)式(13将种群划分为两个不同大小的子群P1和P2标种群中最好的个体,在本文中从非支配层等级序号最小的步骤4P1子群执行DE/bes1变异策略,P2子群执行非支配层中随机选取;F为缩放因子,且F∈[0,门DE/rand/1变异策略,并根据3.3.4节执行交叉操作;式(14)由两部分组成,第一部分为步骤5将初始种群与子群P1、P2重组为一个混合种△=F⑧g(X°,Y)群g(班,X),rand()
    2020-12-09下载
    积分:1
  • latex 中文论文模板(可以使用xelatex译,双栏)
    我的一门光纤课的大作业,利用latex编写的,双栏的,摘要,reference齐全,包括图片的插入等都有。我自认为是很好的latex中文论文的模板。没有不必要的宏包和乱七八糟的注释。
    2020-12-07下载
    积分:1
  • tracepro光源库.rar
    tracepro官方光源库(官方已不可下)直接解压即可,里面是oml文件
    2021-05-06下载
    积分:1
  • 常用正则化方法matlab代码及说明
    1.discrete ill-posed problems and their regularization2.regularization tools tutorial3.regularization tools reference
    2020-06-21下载
    积分:1
  • VC++局域网聊天室完整版
    VC++写的局域网聊天室完整版,虽说界面不怎么样,但基本功能都有了,包括聊天、注册、截图等,包含服务端和客户端,在VC6下顺利编译,如果你要从事VC++的网络编程的话,那么最好先学习或试着做一个聊天室的东西,相信对你帮助很大,这个简单的聊天室可以作为你的学习资料。
    2020-12-02下载
    积分:1
  • 基于粒子滤波的视频目标跟踪算法matlab源
    这是一个基于粒子滤波的视频目标跟踪的matlab仿真程序,为了方便大家的使用,还特地在文件中附加了一组从视频中提取的仿真图片,需要注意的是,在tracker.m主程序中,读取图片的路径需要改成你存放图片的路径,只要个路径改对了,其他.m文件文件不用修改就可以运行了。
    2020-05-23下载
    积分:1
  • svm相关的资料
    【实例简介】基本上是我以前做svm算法的资料,包括了分析svm算法,对学习svm算法还是挺有用的资料的 svm算法的分析在我的blog里 http://blog.csdn.net/techq/article/details/6171688 辛苦分还得赚点,谢谢各位
    2021-11-18 00:38:50下载
    积分:1
  • Concepts in Programming Languages.pdf
    Concepts in Programming Languages by John Mitchell.一本国外经典教材,看了之后对编程语言更加理解。费了很多劲才找到的。Concepts in Programming LanguagesThis textbook for undergraduate and beginning graduate students explains and examines the central concepts used in modern programminglanguages, such as functions, types, memory management, and controlThe book is unique in its comprehensive presentation and comparisonof major object-oriented programming languages. Separate chapters ex-amine the history of objects, Simula and Smalltalk, and the prominentanguages c++ and JavaThe author presents foundational topics, such as lambda calculus anddenotational semantics, in an easy-to-read, informal style, focusing on themain insights provided by these theories. Advanced topics include concurrency and concurrent object-oriented programming. A chapter on logicprogramming illustrates the importance of specialized programming meth-ods for certain kinds of problemsThis book will give the reader a better understanding of the issuesand trade-offs that arise in programming language design and a betterappreciation of the advantages and pitfalls of the programming languagesthey useJohn C. mitchell is Professor of Computer Science at Stanford University,where he has been a popular teacher for more than a decade. Many of hisformer students are successful in research and private industry. He received his ph D. from mit in 1984 and was a member of technical staff atat&T Bell Laboratories before joining the faculty at Stanford. Over thepast twenty years, Mitchell has been a featured speaker at internationalconferences; has led research projects on a variety of topics, includingprogramming language design and analysis, computer security, and applications of mathematical logic to computer science; and has written morethan 100 research articles. His previous textbook, Foundations for Pro-gramming Languages(MIT Press, 1996), covers lambda calculus, typesystems, logic for program verification, and mathematical semantics ofprogramming languages. Professor Mitchell was a member of the programming language subcommittee of the ACM/ieEE Curriculum 2001standardization effort and the 2002 Program Chair of the aCm principlesof programming languages conferenceCONCEPTS NPROGRAMMINGLANGUAGESJohn c. mitchellStanford UniversityCAMBRIDGEUNIVERSITY PRESSPUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGEThe Pitt Building, Trumpington Street, Cambridge, United KingdomCAMBRIDGE UNIVERSITY PRESSThe Edinburgh Building, Cambridge CB2 2RU, UK40 West 20th Street, New York, NY 10011-4211 USA477 Williamstown Road, Port Melbourne vic 3207, AustraliaRuiz de alarcon 13, 28014 Madrid, spainDock House, The Waterfront, Cape Town 8001, South Africahttp://www.cambridge.orgo Cambridge university press 2004First published in printed format 2002isBN 0-511-03492-X eBook(adobe readerISBN 0-521-78098-5 hardbackContentsPrefacepage IxPart 1 functions and foundations1 Introduction1.1 Programming Languages1.2 Goals1.3 Programming Language History3561.4 Organization: Concepts and Languages2 Computability2. 1 Partial Functions and computability102.2 Chapter SummaryExercises163 Lisp: Functions, Recursion, and Lists3.1 Lisp History183.2 Good Language design203. 3 Brief Language overview223.4 Innovations in the Design of Lisp253.5 Chapter Summary: Contributions of LispExercises404 Fundamentals484.1 Compilers and syntax484.2 Lambda calculus4.3 Denotational semantics4.4 Functional and Imperative Languages4.5 Chapter SummaryExercisesContentsPart 2 Procedures, Types, Memory Management, and Control5 The algol Family and ML5.1 The Algol Family of Programming Languages5.2 The Development of C5.3 The LCF System and ml5.4 The Ml Programming Language1035.5 Chapter summary121Exercises1226 Type Systems and Type Inference1296.1 Types in Programming1296.2 Type Safety and Type Checking1326.3 Type Inference1356.4 Polymorphism and Overloadin1456.5 Type Declarations and Type Equality1516.6 Chapter Summary155Exercises1567 Scope, Functions, and storage Management1627.1 Block-Structured Languages1627.2 In-Line blocks1657.3 Functions and procedures1707.4 Higher-Order functions1827.5 Chapter summary190Exercises1918 Control in Sequential Languages2048.1 Structured control2048.2 Exceptions2078.3 Continuations2188.4 Functions and evaluation order2238.5 Chapter summary227Exercises8Part 3 Modularity, Abstraction, and object-Oriented Programming9 Data Abstraction and Modularity2359.1 Structured Programming2359.2 Language Support for Abstraction2429.3 Modules9.4 Generic Abstractions2599.5 Chapter Summary269Exercises27110 Concepts in Object-Oriented Languages27710.1 Object-Oriented design27710.2 Four Basic concepts in object-Oriented languages278Contents10.3 Program Structure28810.4 Design Patterns29010.5 Chapter summary29210.6 Looking Forward: Simula, SmalltalkC++Java293Exercises29411 History of objects: Simula and smalltalk30011.1 Origin of Objects in Simula30011.2 Objects in Simula30311.3 Subclasses and Subtypes in Simula30811.4 Development of smalltalk31011.5 Smalltalk Language features31211.6 Smalltalk flexibilit31811.7 Relationship between Subtyping andInheritance2211.8 Chapter SummaryExercises32712 objects and Run-Time Efficiency: C++33712.1 Design goals and Constraints33712.2 Overview of c++34012.3 Classes. Inheritance and Virtual functions34612.4 Subtyping35512.5 Multiple inheritance12.6 Chapter summary366Exercises36713 Portability and Safety: Java38413.1 Java language overview38613.2 Java Classes and Inheritance38913.3 Java Types and Subtyping39613.4 Java System architecture40413.5 Security Features41213.6 Java summary417Exercises420Part 4 Concurrency and Logic Programming14 Concurrent and Distributed Programming43114.1 Basic Concepts in Concurrency43314.2 The actor model44114.3 Concurrent ML14.4 Java concurrency45414.5 Chapter Summary466Exercises469Contents15 The Logic Programming Paradigm and Prolog47515. 1 History of logic Programming15.2 Brief Overview of the logic Programming Paradigm4715. 3 Equations solved by Unification as Atomic Actions15.4 Clauses as Parts of procedure declarations48215.5 Prologs Approach to Programming48615.6 Arithmetic in Prolog49215.7 Control, Ambivalent Syntax, and Meta-Variables49615.8 Assessment of Prolog50515.9 Bibliographic remarks50715.10 Chapter Summary507Appendix a Additional Program Examples509A 1 Procedural and Object-Oriented organization509Glossary521Index525
    2020-12-09下载
    积分:1
  • 基于STM32单片机的多路数据采集系统设计
       本文是基于ARM Cortex-M3的STM32系列嵌入式微控制器的应用实践,介绍了基于STM32单片机的数据采集的硬件设计和软件设计,数据采集系统是模拟域与数字域之间必不可少的纽带,它的存在具有着非常重要的作用。本文介绍的重点是数据采集系统,而该系统硬件部分的重心在于单片机。数据采集与通信控制采用了模块化的设计,数据采集与通信控制采用了单片机STM32来实现,硬件部分是以单片机为核心,还包括A/D模数转换模块,显示模块,和串行接口部分。该系统从机负责数据采集并应答主机的命令。输入数据是由现场模拟信号产生器产生,8路被测电压再通过模数转换器ADC0809进行模数转换,实现对采集到的数据进
    2020-12-03下载
    积分:1
  • 696516资源总数
  • 106425会员总数
  • 12今日下载