图像平面 meaning in English
image plane
picture plane
plane of delineation
Examples
- However , the feature jacobian is the function of the distance from the camera focal center to the point being imaged . for an eye - in - hand system , determining the distance is very difficult
但是，图像雅可比矩阵通常与机械手到图像平面的垂直距离(也称为深度)有关，对于单目视觉伺服系统，深度信息的精确估计是比较困难的。 - Second , a parallel adaptive ray - casting algorithm for graphic rendering of cfi is developed . in the computational model of cfi , the line - of - sight integration is difficult to obtain for 3d complicated flow field , because curvilinear grids , multizone curvilinear grids , and other irregular grids that are commonly used in computational fluid dynamics ( cfd ) present interesting challenges , such as the complex shapes of cell regions defined by grid points ; the wide variation in the sizes of cells in different regions of the grid ; and the intersecting or overlapping nature of multi - grids . the parallel adaptive ray - casting algorithm is extremely efficient to solve these problems
并行自适应光线投射法继承了光线投射法适合于任何形式网格的优点；光线与计算网格的交点自适应地反映了原来网格点物理量的分布，能够与数值计算的精度保持一致；图像平面的自适应算法使我们不必从每一个像素发出射线，既提高了光线投射法的计算效率，同时又保证重采样后激波这样的高频信息不会损失；将并行处理技术引入计算光学流动图像生成过程，解决了大规模数值模拟结果的处理对计算速度和内存容量的需求。 - Thus the areas of the overlapping regions are compensated efficiently and the accuracy of measurement is highly improved . the volume of the bubbles can be estimated on the bubbles " area information , and a genetic algorithm ( ga ) based method is used to match and track bubbles in the image sequences , which solve tracking problem under complex conditions efficiently , such as some bubbles may have kinetic occlusion and crossover , some newly generated bubbles may entered into flow field and run away . a smooth kinetic locus is obtained by fitting the discrete centroids with a cubic spline function and at the same time the visual measurement is realized
根据气泡在图像平面中的面积估计气泡的体积，并对流场中的所有气泡采用遗传算法进行最佳的匹配跟踪，有效地解决了气泡群在流场中出现如遮挡、交又、新它‘出现、逃逸等复杂情况下的准确跟踪，并采用三次样条插值方法对离散的质心点轨迹进行拟合，得到气泡在流场中平滑的运动轨迹，从而实现了掺气水流特性的可视化测童。 - ( 2 ) the relation of each image feature point and the most evident curve membership is discovered , such relation can be used to reduce redundancy of parameter space , depresses computational effort and suppresses the false accumulator cells etc . the most evident curve membership is then fed to the original image space , the information of image pixels can be recovered , the shorter line can be found , the bad line can also be repaired and the pr ecision of beeline detection can be improved
( 2 )提出图像特征点与参数点一一对应的可能性，实现了图像特征点对应于参数空间某一最优参数点，减少了参数空间的冗余量，降低了计算量，压缩了伪累积点；并将最优参数点反馈回图像平面，恢复图像特征点信息，可以检测出较短线段，修补破损直线，提高了直线检测的精度。 - In this paper , i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching , which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes , i n which we induced the index list to every points on the surface of object , and connected the related points to get sub polygons on surface and in turn get the mesh model , we replace triangulation process of disordered points cloud by edge - pool searching . ; ( 2 ) reconstruction based on degenerated - polygon - intersection , which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face , which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons , which is consistent between the continuous polygons and the discontinuous ones . the intersection of degenerated polygons is similar to the convergence of two ordered lists , which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing , in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette , and we have to calculate the intersection of all such line segments , the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object
同时利用共极线原理把三维计算投影到二维平面以降低求交计算的复杂度，该算法可以减少光锥向图像平面投影计算的次数，以边池搜索取代散乱点集上进行的三角剖分； ( 2 )基于退化多边形求交的多面体可见壳模型重构，系统引入退化多边形的概念，把锥体平面的交集中不连通的部分用一个退化多边形来表示，并引入了新的基于退化多边形的求交算法，与传统多面体可见壳重构相比，该算法有以下几点创新：在图像平面以退化多边形组织投影锥体和物体轮廓的交集，把任意锥面与物体轮廓的交集归一到一个退化多边形；基于退化多边形的二维平面上多边形快速相交算法，该算法在一定程度上就是两个有序链表的合并，大大简化了先前的布尔求交计算； ( 3 )基于光线跟踪的算法，该算法中所有通过轮廓顶点的光线和对应其它图像轮廓的光锥进行求交计算，最后得到每次求交计算得到线段的交集，该线段的顶点就认为是物体表面点，从而得到物体表面的点云。