[37] | 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 [depthBins,countBuf,count1,count2,count3,count4]=trimDepthBuf(depthBins,countBuf,panBins,sweepBins) |
---|
| 40 | |
---|
| 41 | %% first trim columns |
---|
| 42 | |
---|
| 43 | count4=0; |
---|
| 44 | for j=1:sweepBins |
---|
| 45 | j=1; |
---|
| 46 | tmp=sum(depthBins(:,j)'); |
---|
| 47 | if(tmp==0) |
---|
| 48 | depthBins=depthBins(:,[j+1:end]); |
---|
| 49 | countBuf=countBuf(:,[j+1:end]); |
---|
| 50 | count4=count4+1; |
---|
| 51 | else |
---|
| 52 | break; |
---|
| 53 | end |
---|
| 54 | end |
---|
| 55 | count3=0; |
---|
| 56 | for j=size(depthBins,2):-1:1 |
---|
| 57 | j=size(depthBins,2); |
---|
| 58 | tmp=sum(depthBins(:,j)'); |
---|
| 59 | if(tmp==0) |
---|
| 60 | depthBins=depthBins(:,1:end-1); |
---|
| 61 | countBuf=countBuf(:,1:end-1); |
---|
| 62 | count3=count3+1; |
---|
| 63 | else |
---|
| 64 | break; |
---|
| 65 | end |
---|
| 66 | end |
---|
| 67 | |
---|
| 68 | %% then trim rows |
---|
| 69 | count2=0; |
---|
| 70 | for i=1:panBins |
---|
| 71 | i=1; |
---|
| 72 | tmp=sum(depthBins(i,:)'); |
---|
| 73 | if(tmp==0) |
---|
| 74 | depthBins=depthBins([i+1:end],:); |
---|
| 75 | countBuf=countBuf([i+1:end],:); |
---|
| 76 | count2=count2+1; |
---|
| 77 | else |
---|
| 78 | break; |
---|
| 79 | end |
---|
| 80 | end |
---|
| 81 | count1=0; |
---|
| 82 | for i=size(depthBins,1):-1:1 |
---|
| 83 | i=size(depthBins,1); |
---|
| 84 | tmp=sum(depthBins(i,:)'); |
---|
| 85 | if(tmp==0) |
---|
| 86 | depthBins=depthBins([1:end-1],:); |
---|
| 87 | countBuf=countBuf([1:end-1],:); |
---|
| 88 | count1=count1+1; |
---|
| 89 | else |
---|
| 90 | break; |
---|
| 91 | end |
---|
| 92 | end |
---|