PARP Research Group

Universidad de Murcia

---

src/qvip/qvcomponenttree.h Go to the documentation of this file. /* * Copyright (C) 2007, 2008, 2009, 2010, 2011, 2012. PARP Research Group. * <http://perception.inf.um.es> * University of Murcia, Spain. * * This file is part of the QVision library. * * QVision is free software: you can redistribute it and/or modify * it under the terms of the GNU Lesser General Public License as * published by the Free Software Foundation, version 3 of the License. * * QVision is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with QVision. If not, see <http://www.gnu.org/licenses/>. */ #ifndef QVCOMPONENTTREE_H #define QVCOMPONENTTREE_H #include <stdio.h> #include <stdlib.h> #include <iostream> #include <qvip.h> #define NULL_NODE 256*256*256 class QVComponentTree { public: QVComponentTree(const QVImage<uChar,1> &image, bool inverseTree= false, bool useAlternative = false); bool isInverseTree() const { return inverseTree; } uInt & rootNode() { return rootNodeID; } uInt & seedX(uInt index) { return nodes[index].seedX; } uInt & seedY(uInt index) { return nodes[index].seedY; } uChar & firstThreshold(uInt index) { return nodes[index].firstThreshold; } uChar & lastThreshold(uInt index) { return nodes[index].lastThreshold; } uInt & numChilds(uInt index) { return nodes[index].numChilds; } uInt & firstChild(uInt index) { return nodes[index].child; } uInt & nextSibling(uInt index) { return nodes[index].sibling; } uInt *area(uInt index) { return nodes[index].area; } uInt getNumNodes() const { return numNodes; } uInt getLeafNodes() const { return leafNodes; } uInt getTotalPoints() const { return totalPoints; } private: void getComponentTree(const QVImage<uChar> &image); uInt numNodes, freePoints, totalPoints, leafNodes, rootNodeID, maxNodes; bool inverseTree; bool & closedNode(uInt index) { return nodes[index].closed; } uInt newNode(uInt SeedX, uInt SeedY, uChar Threshold) { uInt newNodeID = this->numNodes++; seedX(newNodeID) = SeedX; seedY(newNodeID) = SeedY; firstThreshold(newNodeID) = lastThreshold(newNodeID) = Threshold; firstChild(newNodeID) = nextSibling(newNodeID) = NULL_NODE; numChilds(newNodeID) = 0; area(newNodeID)[Threshold] = 0; closedNode(newNodeID) = false; return newNodeID; } void addChild(uInt ParentNodeID, uInt ChildNodeID) { nextSibling(ChildNodeID) = firstChild(ParentNodeID); firstChild(ParentNodeID) = ChildNodeID; numChilds(ParentNodeID)++; } void mergeNodes(uInt actualNodeID, uInt vecinoNodeID) { uInt next, lastActualChildNodeID = firstChild(actualNodeID); while ((next=nextSibling(lastActualChildNodeID)) != NULL_NODE) lastActualChildNodeID = next; numChilds(actualNodeID) += numChilds(vecinoNodeID); nextSibling(lastActualChildNodeID) = firstChild(vecinoNodeID); } class QVComponentTreeNode { public: uInt seedX, seedY; uInt child, sibling, numChilds; uChar firstThreshold, lastThreshold; uInt area[256]; bool closed; /*bool operator==(const QVComponentTreeNode &other) const { if (seedX != other.seedX) return false; if (seedY != other.seedY) return false; //if (child != other.child) // return false; //if (sibling != other.sibling) // return false; if (numChilds != other.numChilds) return false; if (firstThreshold != other.firstThreshold) return false; if (lastThreshold != other.lastThreshold) return false; for (int i = firstThreshold; i < lastThreshold; i++) if (area[i] != other.area[i]) return false; return true; }*/ }; QVector<QVComponentTreeNode> nodes; //void testComponentTree(const QVImage<uChar,1> &image, QVDisjointSet &disjointSet); }; #endif //IFNDEF

---

QVision framework. PARP research group. Copyright © 2007, 2008, 2009, 2010, 2011.