The double-density DWT is an improvement upon the critically sampled DWT with important additional properties: (1) It employs one scaling function and two distinct wavelets, which are designed to be offset from one another by one half, (2) The double-density DWT is overcomplete by a factor of two, and (3) It is nearly shift-invariant. In two dimensions, this transform outperforms the standard DWT in terms of denoising however, there is room for improvement because not all of the wavelets are directional. That is, although the double-density DWT utilizes more wavelets, some lack a dominant spatial orientation, which prevents them from being able to isolate those directions.
标签： double-density improvement additional critically
上传时间： 2017-04-03
上传用户：dongbaobao
In computer vision, sets of data acquired by sampling the same scene or object at different times, or from different perspectives, will be in different coordinate systems. Image registration is the process of transforming the different sets of data into one coordinate system. Registration is necessary in order to be able to compare or integrate the data obtained from different measurements. Image registration is the process of transforming the different sets of data into one coordinate system. To be precise it involves finding transformations that relate spatial information conveyed in one image to that in another or in physical space. Image registration is performed on a series of at least two images, where one of these images is the reference image to which all the others will be registered. The other images are referred to as target images.
标签： different computer acquired sampling
上传时间： 2013-12-28
上传用户：来茴
orumThemes.com - Breezet vBulletin Theme www.forumthemes.com ForumThemes.com would like to thank you for purchasing one of our themes. If at anytime you have any problems with installation please visit our forums at www.forumthemes.com/forums. Included - Fluid XML files - Custom Java Script for drop downs (clientscript) (All it does is remove the little white arrows in the drop downs)
标签： com ForumThemes forumthemes orumThemes
上传时间： 2017-04-06
上传用户：q123321
Microsoft Visual Basic developers have long clamored for complete objectoriented language support. Microsoft Visual Basic .NET supports all the features of an objectoriented language. In addition, the entire Microsoft .NET Framework, which includes the development support for Microsoft Windows applications, Web applications, Web services, graphics, and data access, is designed according to object-oriented principles. Developers who have a firm grasp of object-oriented principles will be the strongest .NET developers.
标签： objectoriented developers Microsoft clamored
上传时间： 2014-12-21
上传用户：shizhanincc
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
标签： fault-tolerant algorithms redundant underlyin
上传时间： 2013-12-18
上传用户：jkhjkh1982
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
标签： Multiplicative undirected Shortest measured
上传时间： 2017-04-08
上传用户：邶刖
Using an easy-to-follow format, this book explains the basics of MATLAB up front. You ll find out how to plot functions, solve algebraic equations, and compute integrals. You ll also learn how to solve differential equations, generate numerical solutions of ODEs, and work with special functions. Packed with hundreds of sample equations and explained solutions, and featuring end-of-chapter quizzes and a final exam, this book will teach you MATLAB essentials in no time at all.
标签： easy-to-follow explains MATLAB basics
上传时间： 2017-04-10
上传用户：时代电子小智
This is hands-down the best C++ book for anyone who really wants to use C++, it will take you through all of the features of the language and not only explain what each feature is for, but also why it was included, and the best way to use it.
标签： hands-down anyone really throug
上传时间： 2017-04-10
上传用户：hakim
Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and work in all *nix like systems.
标签： C. Floyd-wharshall algoritm shortest
上传时间： 2017-04-12
上传用户：123456wh
Chinese Remainder theorem implementation. Its done in php. Its implemented with interactive gui.index.php contain all the code.Rest folders contain the css images and js scripts that enhance the gui
标签： implementation implemented interactive Remainder
上传时间： 2017-04-14
上传用户：lanwei
