不久前，我問了一個關(guān)于平方檢測的問題，卡爾菲利普得出了不錯的結(jié)果?，F(xiàn)在，我想更進(jìn)一步，找到邊緣不完全可見的正方形?？匆幌逻@個例子：例有任何想法嗎？我正在使用karlphillips代碼：void find_squares(Mat& image, vector<vector<Point> >& squares){    // blur will enhance edge detection    Mat blurred(image);    medianBlur(image, blurred, 9);    Mat gray0(blurred.size(), CV_8U), gray;    vector<vector<Point> > contours;    // find squares in every color plane of the image    for (int c = 0; c < 3; c++)    {        int ch[] = {c, 0};        mixChannels(&blurred, 1, &gray0, 1, ch, 1);        // try several threshold levels        const int threshold_level = 2;        for (int l = 0; l < threshold_level; l++)        {            // Use Canny instead of zero threshold level!            // Canny helps to catch squares with gradient shading            if (l == 0)            {                Canny(gray0, gray, 10, 20, 3); //                 // Dilate helps to remove potential holes between edge segments                dilate(gray, gray, Mat(), Point(-1,-1));            }            else            {                    gray = gray0 >= (l+1) * 255 / threshold_level;            }            // Find contours and store them in a list            findContours(gray, contours, CV_RETR_LIST, CV_CHAIN_APPROX_SIMPLE);            // Test contours            vector<Point> approx;            for (size_t i = 0; i < contours.size(); i++)            {                    // approximate contour with accuracy proportional                    // to the contour perimeter                    approxPolyDP(Mat(contours[i]), approx, arcLength(Mat(contours[i]), true)*0.02, true);                    // Note: absolute value of an area is used because                    // area may be positive or negative - in accordance with the                    // contour orientation                    }            }        }    }}