zoukankan      html  css  js  c++  java
  • fit_line_contour_xld的bug

    fit_line_contour_xld (BottomEdgeContours, 'huber', -1, 0, 5, 2, RowBegin, ColBegin, RowEnd, ColEnd, Nr, Nc, Dist) 
    存在bug,结果RowBegin, ColBegin, RowEnd, ColEnd两点重合,这个时候需要Nr, Nc, Dist计算直线。

    fit_line_contour_xld approximates the XLD contours Contours by line segments. It does not perform a segmentation of the input contours. Thus, one has to make sure that each contour corresponds to one and only one line segment. The operator returns for each contour the start point (RowBegin, ColBegin), the end point (RowEnd, ColEnd), and the regression line to the contour given by the normal vector (Nr, Nc) of the line and its distance Dist from the origin, i.e., the line equation is given by

    就只能用 R*Nr+C*Nc-Dist=0的关系来求直线

                int MeasureDotNum = 20;
                int DeltaMeasureDistance;
                DeltaMeasureDistance = Convert.ToInt32(BoardLength / (MeasureDotNum + 1));
     
                int[] MeasureDotColAry = new int[MeasureDotNum];
                for (int i = 1; i <= MeasureDotNum; i++)
                {
                    MeasureDotColAry[i - 1] = tempCol1.I + DeltaMeasureDistance * i;
                }
     
                HTuple tempRowAry = new HTuple();
                HTuple tempColumnAry = new HTuple();
     
                HTuple MeasureHandle, tempRowEdge, tempColEdge, tempAmplitede, tempDistance;
     
    for (int i = 0; i <= MeasureDotNum - 1; i++)
                {
                    HOperatorSet.GenMeasureRectangle2(tempRow2, MeasureDotColAry[i], 1.5707963, 300, 20, tempImageWidth, tempImageHeight, "nearest_neighbor", out MeasureHandle);
                    HOperatorSet.MeasurePos(tempImage, MeasureHandle, 1.2, 10, "positive", "first", out  tempRowEdge, out  tempColEdge, out  tempAmplitede, out tempDistance);
                    HOperatorSet.CloseMeasure(MeasureHandle);
     
                    HOperatorSet.TupleConcat(tempRowAry, tempRowEdge, out tempRowAry);
                    HOperatorSet.TupleConcat(tempColumnAry, tempColEdge, out tempColumnAry);
                }
     
                int tempDotNum=tempRowAry.Length;
                if (tempDotNum < 2)
                {
                    return false;
                }
     
                HObject tempPolygonRegion = null;
                HOperatorSet.GenRegionPolygon(out tempPolygonRegion, tempRowAry, tempColumnAry);
     
                HObject tempContourXld = null;
                HOperatorSet.GenContourRegionXld(tempPolygonRegion, out tempContourXld, "center");
     
                HTuple tempRowBegin, tempColumnBegin, tempRowEnd, tempColumnEnd,tempNr,tempNc,tempDist;
                HOperatorSet.FitLineContourXld(tempContourXld, "huber", -1, 0, 5, 2, out tempRowBegin, out tempColumnBegin, out tempRowEnd, out tempColumnEnd, out tempNr, out tempNc, out tempDist);
     
                tempPolygonRegion.Dispose();
                tempContourXld.Dispose();
     
                if (tempNr.Length<1)
                {
                    return false;
                }
                double tempA,tempBx;
                tempBx = -tempNc.D / tempNr.D;
                tempA = tempDist.D / tempNr.D;
     /// 对一组点通过最小二乘法进行线性回归  y=A+x*Bx
  • 相关阅读:
    【翻译自mos文章】rman 标准版和企业版的兼容性
    HDU 1010 Tempter of the Bone
    uva 10716 Evil Straw Warts Live(贪心回文串)
    适配器及适配器模式
    Android推送技术研究
    【hadoop2.6.0】倒排索引遇到问题了
    【hadoop2.6.0】MapReduce原理
    【hadoop2.6.0】一句话形容mapreduce
    【leetcode】Median of Two Sorted Arrays(hard)★!!
    【leetcode】Merge k Sorted Lists
  • 原文地址:https://www.cnblogs.com/QuincyYi/p/12636024.html
Copyright © 2011-2022 走看看