/
naive.cc
150 lines (139 loc) · 5.65 KB
/
naive.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
// Copyright 2012 Alexandre Yukio Harano
//
// Licensed under the ImageMagick License (the "License"); you may not use
// this file except in compliance with the License. You may obtain a copy
// of the License at
//
// http://www.imagemagick.org/script/license.php
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
// License for the specific language governing permissions and limitations
// under the License.
//
// Author: Alexandre Yukio Harano <ayharano AT ime DOT usp DOT br>
// This file contains the implementation of naive erosion and
// dilation transforms.
#include <cstdio>
#include "naive.h"
// imaging::binary::morphology::NaiveDilation
bool imaging::binary::morphology::NaiveDilation::DetectBorder(
const imaging::SEIndex current_se_index,
const std::vector<imaging::ImagePositionIndex> ¤t_se_indexes) {
imaging::ImagePositionIndex current = 0;
const imaging::ImagePositionIndex current_cardinality =
se_cardinality_.at(current_se_index);
const std::vector< imaging::ImagePositionIndex > ¤t_se_vector =
se_elements_.at(current_se_index);
imaging::ImagePositionIndex i = 0;
bool keep_pixel = true;
imaging::ImagePositionIndex next = 0;
bool ok_so_far = true;
bool position_value = true;
imaging::Position target;
current = candidate_next_.at(imaging::HEADER);
while (ok_so_far && current != imaging::HEADER) {
keep_pixel = true;
const imaging::Position ¤t_p = candidate_position_.at(current);
next = candidate_next_.at(current);
for (i = 0; ok_so_far && keep_pixel && i < current_cardinality; ++i) {
// For this iteration, calculate border, which is
// - internal morphological gradient in case of erosion
// - external morphological gradient in case of dilation
const imaging::ImagePositionIndex current_element_index =
current_se_indexes.at(i);
const imaging::ImagePositionIndex element_index =
current_se_vector.at(current_element_index);
const imaging::Position &delta = u_elements_.at(element_index);
algorithm_determinate_border_comparison_counter_->at(se_iteration_) += 1;
ok_so_far = current_p.Subtract(delta, &target);
if (!ok_so_far) continue;
if (Y_->IsPositionValid(target)) {
ok_so_far = Y_->value(target, &position_value);
if (!ok_so_far) continue;
if (!position_value) continue;
} else {
continue;
}
keep_pixel = false;
}
if (!keep_pixel) {
border_.at(border_counter_) = current;
++border_counter_;
}
current = next;
}
return ok_so_far;
}
bool imaging::binary::morphology::NaiveDilation::InitialCandidatePositionFound(
const imaging::binary::Image &/*image*/,
const imaging::ImagePositionIndex &image_position,
const imaging::Position &/*value*/) {
return this->EnqueueCandidateNode(image_position);
}
bool imaging::binary::morphology::NaiveDilation::InsertNewCandidateFromBorder(
imaging::grayscale::Image **output_image) {
if (output_image == NULL) return false;
if (*output_image == NULL) return false;
return true;
}
// imaging::binary::morphology::NaiveErosion
bool imaging::binary::morphology::NaiveErosion::DetectBorder(
const imaging::SEIndex current_se_index,
const std::vector<imaging::ImagePositionIndex> ¤t_se_indexes) {
imaging::ImagePositionIndex current = 0;
const imaging::ImagePositionIndex current_cardinality =
se_cardinality_.at(current_se_index);
const std::vector< imaging::ImagePositionIndex > ¤t_se_vector =
se_elements_.at(current_se_index);
imaging::ImagePositionIndex i = 0;
bool keep_pixel = true;
imaging::ImagePositionIndex next = 0;
bool ok_so_far = true;
bool position_value = true;
imaging::Position target;
current = candidate_next_.at(imaging::HEADER);
while (ok_so_far && current != imaging::HEADER) {
keep_pixel = true;
const imaging::Position ¤t_p = candidate_position_.at(current);
next = candidate_next_.at(current);
for (i = 0; ok_so_far && keep_pixel && i < current_cardinality; ++i) {
// For this iteration, calculate border, which is
// - internal morphological gradient in case of erosion
// - external morphological gradient in case of dilation
const imaging::ImagePositionIndex current_element_index =
current_se_indexes.at(i);
const imaging::ImagePositionIndex element_index =
current_se_vector.at(current_element_index);
const imaging::Position &delta = u_elements_.at(element_index);
algorithm_determinate_border_comparison_counter_->at(se_iteration_) += 1;
ok_so_far = current_p.Sum(delta, &target);
if (!ok_so_far) continue;
if (Y_->IsPositionValid(target)) {
ok_so_far = Y_->value(target, &position_value);
if (!ok_so_far) continue;
if (position_value) continue;
}
keep_pixel = false;
}
if (!keep_pixel) {
border_.at(border_counter_) = current;
++border_counter_;
}
current = next;
}
return ok_so_far;
}
bool imaging::binary::morphology::NaiveErosion::InitialCandidatePositionFound(
const imaging::binary::Image &/*image*/,
const imaging::ImagePositionIndex &image_position,
const imaging::Position &/*value*/) {
return this->EnqueueCandidateNode(image_position);
}
bool imaging::binary::morphology::NaiveErosion::InsertNewCandidateFromBorder(
imaging::grayscale::Image **output_image) {
if (output_image == NULL) return false;
if (*output_image == NULL) return false;
return true;
}