1 | % * This code was used in the following articles:
|
---|
2 | % * [1] Learning 3-D Scene Structure from a Single Still Image,
|
---|
3 | % * Ashutosh Saxena, Min Sun, Andrew Y. Ng,
|
---|
4 | % * In ICCV workshop on 3D Representation for Recognition (3dRR-07), 2007.
|
---|
5 | % * (best paper)
|
---|
6 | % * [2] 3-D Reconstruction from Sparse Views using Monocular Vision,
|
---|
7 | % * Ashutosh Saxena, Min Sun, Andrew Y. Ng,
|
---|
8 | % * In ICCV workshop on Virtual Representations and Modeling
|
---|
9 | % * of Large-scale environments (VRML), 2007.
|
---|
10 | % * [3] 3-D Depth Reconstruction from a Single Still Image,
|
---|
11 | % * Ashutosh Saxena, Sung H. Chung, Andrew Y. Ng.
|
---|
12 | % * International Journal of Computer Vision (IJCV), Aug 2007.
|
---|
13 | % * [6] Learning Depth from Single Monocular Images,
|
---|
14 | % * Ashutosh Saxena, Sung H. Chung, Andrew Y. Ng.
|
---|
15 | % * In Neural Information Processing Systems (NIPS) 18, 2005.
|
---|
16 | % *
|
---|
17 | % * These articles are available at:
|
---|
18 | % * http://make3d.stanford.edu/publications
|
---|
19 | % *
|
---|
20 | % * We request that you cite the papers [1], [3] and [6] in any of
|
---|
21 | % * your reports that uses this code.
|
---|
22 | % * Further, if you use the code in image3dstiching/ (multiple image version),
|
---|
23 | % * then please cite [2].
|
---|
24 | % *
|
---|
25 | % * If you use the code in third_party/, then PLEASE CITE and follow the
|
---|
26 | % * LICENSE OF THE CORRESPONDING THIRD PARTY CODE.
|
---|
27 | % *
|
---|
28 | % * Finally, this code is for non-commercial use only. For further
|
---|
29 | % * information and to obtain a copy of the license, see
|
---|
30 | % *
|
---|
31 | % * http://make3d.stanford.edu/publications/code
|
---|
32 | % *
|
---|
33 | % * Also, the software distributed under the License is distributed on an
|
---|
34 | % * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either
|
---|
35 | % * express or implied. See the License for the specific language governing
|
---|
36 | % * permissions and limitations under the License.
|
---|
37 | % *
|
---|
38 | % */
|
---|
39 | function [Sup, SupOri, SupNeighborTable]=CleanedSupNew(Default,Sup,maskSky, SupNeighborTable) |
---|
40 | |
---|
41 | displayFlag = false; |
---|
42 | ImCloseFlag = false; |
---|
43 | |
---|
44 | % get rid of the Sky for Sup |
---|
45 | SkyCandidate = unique(Sup(maskSky)); |
---|
46 | % testing sky candidate for two property |
---|
47 | % 1) is at least half of the superpixel are sky |
---|
48 | tempSkyCandidate = SkyCandidate; |
---|
49 | for i = tempSkyCandidate' |
---|
50 | mask = Sup == i; |
---|
51 | if sum(mask(maskSky))/sum(mask(:))<=0.5 % check if half is Sky |
---|
52 | SkyCandidate = setdiff(SkyCandidate', i)'; |
---|
53 | end |
---|
54 | end |
---|
55 | |
---|
56 | % 2) is at least one of its neighbor is sky |
---|
57 | tempSupNeighborTable = SupNeighborTable; |
---|
58 | for i = SkyCandidate' |
---|
59 | mask = Sup == i; |
---|
60 | Nei = setdiff(find(tempSupNeighborTable(i,:)),i); |
---|
61 | if sum( sum( repmat( SkyCandidate, 1, size(Nei,2)) == ... |
---|
62 | repmat( Nei, size(SkyCandidate,1), 1) )) >=1% check if at least one neighbor is sky |
---|
63 | Sup(mask) = 0; |
---|
64 | |
---|
65 | % clearn SupNeighborTable |
---|
66 | SupNeighborTable(i,:) = 0; |
---|
67 | SupNeighborTable(:,i) = 0; |
---|
68 | end |
---|
69 | end |
---|
70 | maskSky = Sup == 0; |
---|
71 | |
---|
72 | if displayFlag, |
---|
73 | DisplaySup(Sup, 2000); |
---|
74 | end |
---|
75 | |
---|
76 | SupOri = Sup; |
---|
77 | % extend the sky to merger small sup near sky |
---|
78 | ThreSmall = 10; |
---|
79 | SE = strel('disk',5); |
---|
80 | maskSky_dilate = imdilate(maskSky,SE); |
---|
81 | SmallSupNearSky = setdiff(Sup(maskSky_dilate),0); |
---|
82 | if ~isempty(SmallSupNearSky) |
---|
83 | SE = strel('disk',3); |
---|
84 | for i = SmallSupNearSky' |
---|
85 | mask = Sup ==i; |
---|
86 | if sum(mask(:)) < ThreSmall |
---|
87 | % naive merge |
---|
88 | mask_dilate = imdilate(mask,SE); |
---|
89 | mask_dilate(mask) = 0; |
---|
90 | mask_dilate(maskSky) = 0; |
---|
91 | target = mode(Sup(mask_dilate)); |
---|
92 | if isnan(target) |
---|
93 | Sup(mask) = 0; |
---|
94 | % clearn SupNeighborTable |
---|
95 | SupNeighborTable(i,:) = 0; |
---|
96 | SupNeighborTable(:,i) = 0; |
---|
97 | else |
---|
98 | Sup(mask) = target; |
---|
99 | SupNeighborTable( target,:) = ... |
---|
100 | SupNeighborTable( target,:) + SupNeighborTable( i,:); |
---|
101 | SupNeighborTable( :, target) = ... |
---|
102 | SupNeighborTable( :, target) + SupNeighborTable( :, i); |
---|
103 | % clearn SupNeighborTable |
---|
104 | SupNeighborTable(i,:) = 0; |
---|
105 | SupNeighborTable(:,i) = 0; |
---|
106 | end |
---|
107 | end |
---|
108 | end |
---|
109 | end |
---|
110 | |
---|
111 | if displayFlag, |
---|
112 | figure(250), imagesc(Sup), |
---|
113 | newmap = [rand(max(Sup(:)),3); [0 0 0]]; |
---|
114 | colormap(newmap); |
---|
115 | %DisplaySup(Sup, 3500); |
---|
116 | end |
---|
117 | |
---|
118 | |
---|
119 | if ImCloseFlag ==1 |
---|
120 | % 1) clearn the Sup first (default mask close) |
---|
121 | % with option to merge under other condition |
---|
122 | % use just a greedy closing algorithm |
---|
123 | NuSup = setdiff(unique(Sup)',0); |
---|
124 | se = strel('diamond',5); |
---|
125 | for i = NuSup |
---|
126 | mask = Sup == i; |
---|
127 | CloseMask = imclose(mask,se); |
---|
128 | ClosedCandidate = setdiff(unique(Sup(CloseMask)),i); |
---|
129 | if ~isempty(ClosedCandidate) |
---|
130 | for j = ClosedCandidate' |
---|
131 | if all(CloseMask(Sup == j)) |
---|
132 | Sup( Sup == j) = i; |
---|
133 | end |
---|
134 | end |
---|
135 | end |
---|
136 | end |
---|
137 | end |
---|