Package me.uits.aiphial.imaging

Examples of me.uits.aiphial.imaging.LuvPoint

72
73
74
75
76
77
78
79
80
81
82
        for (int i = 0; i < points.length; i++)
        {
            for (int j = 0; j < points[i].length; j++)
            {
                points[i][j] = new LuvPoint(i + sx, j + sy, new LUV(0,0,0));
            }

        }

    }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
        while (!unprocesed.isEmpty())
        {
            //TODO fix outofmemory error sometimes
            List<LuvPoint> resultCountour = new ArrayList(boundary.size());
           
            LuvPoint onboundary = unprocesed.iterator().next();

            LuvPoint firstPoint = onboundary;

            resultCountour.add(firstPoint);
            unprocesed.remove(firstPoint);

            LuvPoint prevprev = null;
            LuvPoint prev = firstPoint;
            while (true)
            {
                LuvPoint next = getNextPoint(prev, prevprev);

                if (next == null)
                {
                    break;
                }
View Full Code Here
141
142
143
144
145
146
147
148
149
150
151
    }


    private LuvPoint getNextPoint(LuvPoint cur, LuvPoint prev)
    {
        LuvPoint result = null;
     
            result = getStepFromQeury(clustersMap.getPointsMap().get8CouterClockwise(cur), cur, prev);
        return result;
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
    }

    private LuvPoint getStepFromQeury(CircleList<LuvPoint> cc4, LuvPoint cur, LuvPoint pstep)
    {

        LuvPoint result = null;
        Iterator<LuvPoint> iterator;

        if (pstep == null)
        {
            iterator = cc4.iterator();

            Iterable<LuvPoint> nearest4 = clustersMap.getPointsMap().get4Nearest(cur);
            LuvPoint in4outer = null;
            for (LuvPoint luvPoint : nearest4)
            {
                if (clustersMap.getAt(luvPoint) != cluster)
                {
                    in4outer = luvPoint;
                    break;
                }
            }
            if (in4outer != null)
            {
                iterator = cc4.iterator(in4outer);
            }

        } else
        {
            iterator = cc4.iterator(pstep);
        }

        LuvPoint first = iterator.next();
        LuvPoint prev = first;

        while (iterator.hasNext())
        {
            LuvPoint curr = iterator.next();
            if (clustersMap.getAt(prev) != cluster && clustersMap.getAt(curr) == cluster)
            {
                result = curr;
                break;
            }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
        while (!unprocesed.isEmpty())
        {
            //TODO fix outofmemory error sometimes
            List<LuvPoint> resultCountour = new ArrayList(boundary.size());
           
            LuvPoint onboundary = unprocesed.iterator().next();

            LuvPoint firstPoint = onboundary;

            resultCountour.add(firstPoint);
            unprocesed.remove(firstPoint);

            LuvPoint prevprev = null;
            LuvPoint prev = firstPoint;
            while (true)
            {
                LuvPoint next = getNextPoint(prev, prevprev);

                if (next == null)
                {
                    break;
                }
View Full Code Here
141
142
143
144
145
146
147
148
149
150
151
    }


    private LuvPoint getNextPoint(LuvPoint cur, LuvPoint prev)
    {
        LuvPoint result = null;
     
            result = getStepFromQeury(clustersMap.getPointsMap().get8CouterClockwise(cur), cur, prev);
        return result;
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
    }

    private LuvPoint getStepFromQeury(CircleList<LuvPoint> cc4, LuvPoint cur, LuvPoint pstep)
    {

        LuvPoint result = null;
        Iterator<LuvPoint> iterator;

        if (pstep == null)
        {
            iterator = cc4.iterator();

            Iterable<LuvPoint> nearest4 = clustersMap.getPointsMap().get4Nearest(cur);
            LuvPoint in4outer = null;
            for (LuvPoint luvPoint : nearest4)
            {
                if (clustersMap.getAt(luvPoint) != cluster)
                {
                    in4outer = luvPoint;
                    break;
                }
            }
            if (in4outer != null)
            {
                iterator = cc4.iterator(in4outer);
            }

        } else
        {
            iterator = cc4.iterator(pstep);
        }

        LuvPoint first = iterator.next();
        LuvPoint prev = first;

        while (iterator.hasNext())
        {
            LuvPoint curr = iterator.next();
            if (clustersMap.getAt(prev) != cluster && clustersMap.getAt(curr) == cluster)
            {
                result = curr;
                break;
            }
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
    public  Collection<LuvPoint> getOrdered()
    {

        Collection<LuvPoint> result = new ArrayList<LuvPoint>(unorderedBoundary.size());
        final Map<LuvPoint, Integer> distanses = new HashMap<LuvPoint, Integer>(unorderedBoundary.size());
        LuvPoint centerPoint = calkcenter(cluster);
        for (LuvPoint luvPoint : unorderedBoundary)
        {
            int cx = centerPoint.getX();
            int cy = centerPoint.getY();
            int nx = luvPoint.getX();
            int ny = luvPoint.getY();
            distanses.put(luvPoint, (cx - nx) * (cx - nx) + (cy - ny) * (cy - ny));
        }
        Set<LuvPoint> unprocesed = new HashSet<LuvPoint>(unorderedBoundary.size());
        unprocesed.addAll(unorderedBoundary);
        LuvPoint elem = null;
        while (!unprocesed.isEmpty())
        {
            if (elem == null)
            {
                elem = unprocesed.iterator().next();
            }
            result.add(elem);
            unprocesed.remove(elem);
            Collection<LuvPoint> nearest = searchForNearest(elem, unprocesed);
            if (!nearest.isEmpty())
            {
                Iterator<LuvPoint> nearests = nearest.iterator();
                elem = nearests.next();
                while (nearests.hasNext())
                {
                    LuvPoint c = nearests.next();
                    if (distanses.get(c) > distanses.get(elem))
                    {
                        elem = c;
                    }
                }
View Full Code Here
105
106
107
108
109
110
111
             x+=luvPoint.getX();
             y+=luvPoint.getY();
             n++;
         }

         return new LuvPoint(x/n, y/n, null);
     }
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
        for (int i = 0; i < points.length; i++)
        {
            for (int j = 0; j < points[i].length; j++)
            {
                points[i][j] = new LuvPoint(i+sx, j+sy, LUV.zeroLuv());
            }

        }

    }
View Full Code Here
TOP

Related Classes of me.uits.aiphial.imaging.LuvPoint

  • me.uits.aiphial.imaging.boundary.BugInnerBO
  • me.uits.aiphial.imaging.boundary.PointsMap
  • MyImage.ClusterPanelDebug
  • MyImage.utls.BoundaryOrderer
  • MyImage.utls.BoundaryOrderer1
  • MyImage.utls.BoundaryOrderer2
  • MyImage.utls.BugInnerBO
  • MyImage.utls.BugOuterBO
  • MyImage.utls.Path
  • MyImage.utls.Path2
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.