VC下的对位图的压缩程序

photoshop的图形解决方案-graphics solution of photoshop

地质制图系统_GeoMap3.5正式版20080325，是地理信息系统领域和地震地质领域绘等值线等图的有效工具-Geological Mapping System _GeoMap3.5 official version 20080325, is the field of geographic information systems and seismic geological fields, such as contour map drawn an effective tool

视频解码：包括反DCT变换，反量化，VLD，MC等。与国际上的MPEG4 可以一较高下。-video decoder : including anti- DCT, anti-quantified, Variable Length, such as MC. With international MPEG4 can be a higher under.

THis the fundamental part of a Game Computer driver. It contains only the structural layout upon which it is possible to create an object to object interface that would support 2 person game play.-THis is the fundamental part of a Game Computer driver. It contains only the structural layout upon which it is possible to create an object to object interface that would support 2 person game play.

有限元分析软件，造型部分采用opencascade造型内核实现，界面显示采用Java/Java3D ,通过Corba调用opencascade函数进行造型与有限元分析。- Finite element analysis software, the modelling partially uses the opencascade modelling essence realization, the contact surface demonstrated uses Java/Java3D, transfers the opencascade function through Corba to carry on the modelling and the finite element analysis.

自己的算法，图片的定位-own algorithm, the positioning Photo

Windows图形编程源代码 ，这本书讲的比较全面，内容也很详实-Windows graphical programming source code, this book talked about a more comprehensive and its contents are very informative

无格式图像处理，开关门，百叶窗，直方图，二值化，灰度反转，平滑滤波，高斯滤波，最大值滤波，最小值滤波，中值滤波，边缘检测滤波，边缘跟踪，图像交换，图像平移，图像缩放，图像反转

Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the

VC编程实例 -VC programming examples of VC programming examples