Description: iNEDI is an acronym for \"improved New Edge-Directed Interpolation\".
This function implements an improvement of the original NEDI technique
described on:
X. Li et. al., \"new edge-directed interpolation\". IEEE Trans. on
Image Processing, Vol.10, No.10, October 2001, pp.1521-1527
-iNEDI is an acronym for "improved New Edge - Directed Interpolation. " This function imple ments an improvement of the original GaAs techn ique described on : X. Li et. al. , "new edge-directed interpolation." IEEE Tran s. on Image Processing, Vol.10, No.10, 373,890 bytes, pp.1521 - 1527 Platform: |
Size: 28292 |
Author:林志林 |
Hits:
Description: iNEDI is an acronym for "improved New Edge-Directed Interpolation".
This function implements an improvement of the original NEDI technique
described on:
X. Li et. al., "new edge-directed interpolation". IEEE Trans. on
Image Processing, Vol.10, No.10, October 2001, pp.1521-1527
-iNEDI is an acronym for "improved New Edge- Directed Interpolation. " This function imple ments an improvement of the original GaAs techn ique described on : X. Li et. al. , "new edge-directed interpolation." IEEE Tran s. on Image Processing, Vol.10, No.10, 373,890 bytes, pp.1521- 1527 Platform: |
Size: 27648 |
Author:林志林 |
Hits:
Description: new edge-directed interpolation这篇文章所提算法的matlab实现-new edge-directed interpolation algorithm in this article referred to realize matlab Platform: |
Size: 189440 |
Author:孙伟 |
Hits:
Description: 基于图像边缘特征的图像放大增强算法，提高图像的分辨率。-The edge of the characteristics of image-based image enhancement algorithms to enlarge and enhance image resolution Platform: |
Size: 161792 |
Author:feelfree |
Hits:
Description: Description:
采用邻接表表示有向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列，边的输入按照边的顶点序号从小到大的顺序排列，如下图的边的输入顺序为0 1，0 2，0 3，1 2，1 3，2 4，3 4共七条边，邻接表的边结点采用头插法。本输入样例中所用的图如下所示：
Input Format:
第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数
第二行输入各顶点的信息，即输入每个顶点字符
第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行
Output format:
首先输出图的顶点信息，输出完毕换行
接着输出图的邻接表，格式为首先输出第一个顶点，接着输出该顶点的所有的临界点的序号，换行，然后输出下一个顶点及邻接点，以此类推
接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行
最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行
-Description:
Adjacency list using said directed graph to complete the map creation, map of the depth-first traversal, breadth-first graph traversal operations. In which vertex information is character, the graph vertices in order arranged by character number, while the input side of the vertex according to serial number from small to large order, the following graph of the input side of the order of 0 1,0 2,0 3,1 2,1 3,2 4,3 4 a total of seven edge, the edge-node adjacency list using the first interpolation. The input sample used in the diagram are as follows:
Input Format:
The first line of input two values, the first one is the number of graph vertices, the second one is the number of graph edges
Second row, enter information in each vertex, that enter each vertex character
Start typing in the third line of each side, each side in the form of two vertices of the serial number, in the middle separated by a space, enter the End of an edge wrap
Output format:
First, the Platform: |
Size: 2048 |
Author:kernel |
Hits:
Description: novel intra deinterlacing algorithm (NID) based on content adaptive interpolation. The NID consists of three steps: pre-processing, content classification, and content adaptive interpolation. There are also three main interpolation methods in our proposed NID, i.e. modified edge-based line averaging (M-ELA), gradient directed interpolation (GDI), and window matching method (WMM). Platform: |
Size: 8192 |
Author:cho |
Hits:
Description: A New Edge-based Intra-field Interpolation Method for Deinterlacing Using Locally Adaptive-thresholded Binary Image for matlab
Platform: |
Size: 8192 |
Author:cho |
Hits:
Description: 新边缘导向算法，算法的原理介绍以及实现，以及在去马赛克方面的应用-This paper proposes an edge-directed interpolation
algorithm for natural images. The basic idea is to first estimate
local covariance coefficients a low-resolution image and
then use these covariance estimates to adapt the interpolation at
a higher resolution based on the geometric duality between the
low-resolution covariance and the high-resolution covariance. The
edge-directed property of covariance-based adaptation attributes
to its capability of tuning the interpolation coefficients to match
an arbitrarily oriented step edge. A hybrid approach of switching
between bilinear interpolation and covariance-based adaptive
interpolation is proposed to reduce the overall computational
complexity. Two important applications of the new interpolation
algorithm are studied: resolution enhancement of grayscale
images and reconstruction of color images CCD samples.
Simulation results demonstrate that our new interpolation
algorithm substantially improves the subjective quality Platform: |
Size: 251904 |
Author:Cynthia |
Hits:
Description: Floyd算法（Floyd-Warshall algorithm）又称为弗洛伊德算法、插点法，是解决给定的加权图中顶点间的最短路径的一种算法，可以正确处理有向图或负权的最短路径问题(Floyd algorithm (Floyd-Warshall algorithm) also known as the Freud algorithm, interpolation method is an algorithm of the shortest path between the vertex weighted graph to solve a given in, can correctly handle the directed graph problem or negative right) Platform: |
Size: 2048 |
Author:四姑娘
|
Hits:
Search - directed interpolation