3D Building Detection and Reconstruction from Aerial Images Using Perceptual Organization and Fast Graph Search

Size: px
Start display at page:

Download "3D Building Detection and Reconstruction from Aerial Images Using Perceptual Organization and Fast Graph Search"

Transcription

1 436 Journal of Electrical Engineering & Technology, Vol. 3, No. 3, pp. 436~443, 008 3D Building Detection and Reconstruction fro Aerial Iages Using Perceptual Organization and Fast Graph Search Dong-Min Woo and Quoc-Dat Nguyen* Abstract This paper presents a new ethod for building detection and reconstruction fro aerial iages. In our approach, we extract useful building location inforation fro the generated disparity ap to segent the interested objects and consequently reduce unnecessary line segents extracted in the low level feature extraction step. Hypothesis selection is carried out by using an undirected graph, in which close cycles represent coplete rooftops hypotheses. We test the proposed ethod with the synthetic iages generated fro Avenches dataset of Ascona aerial iages. The experient result shows that the extracted 3D line segents of the reconstructed buildings have an average error of 1.69 and our ethod can be efficiently used for the tas of building detection and reconstruction fro aerial iages. Keywords: Aaerial iages, Building detection, Building reconstruction, Perceptual grouping 1. Introduction Building detection and reconstruction fro aerial iages is one of the ost challenging tass in coputer vision. It has been used widely in various applications including traditional applications such as cartography and photointerpretation as well as recent applications including ission planning, urban planning, coputer graphics, and virtual reality. There are two ain probles that need resolution in any building detection approach. The interested objects ust be segented fro the bacground and the fragented line segents of the interested object s boundaries should be grouped to huan-ade structures. These are challenges because the objects of interest could be partly occluded by the presence of vegetation, shadows, roadways, and other objects. Moreover, lines and corners of objects are often fragented and issed due to the typical failures of low level feature extraction. These tass have been intensively studied in the field of coputer vision. Early approaches tried to use a singe iage only [1], []. This direction has soe restrictions such as the difficulty in inferring 3D inforation fro one iage and the existence of abiguities in the detected buildings that can be only resolved by feature atching in ultiple iages. As such, ultiple aerial iages can only be obtained with extra cost. Most of the recent wor in this area has focused on ultiple-view analysis [3-5]. Mohan and Nevatia [6] proposed an approach for Corresponding Author: Dept. of Inforation Engineering, Myongji University, Korea. (dwoo@ju.ac.r) * HSBC, Vietna. (iav@yahoo.co) Received 15 January, 008 ; Accepted 1 June, 008 detecting and describing buildings in aerial iages using perceptual grouping. They deonstrated the usefulness of the structural relationships called collated features which can be explored by perceptual organization in coplex iage analysis. All reasonable feature groupings are first detected and the candidates are then selected by a constraint satisfaction networ. But this approach involves all extracted line segents in the iage. Consequently, it requires a significant coputational effort. It also depends on the accurate extraction of line segents. Huertas [7] suggested using extracted cues fro the IFSAR data, while Ki [8] utilizes coercial DEM (Digital Elevation Map) to solve the proble of segentation of interested objects. The extracted cues do not give us the shape of the buildings. However, they can give us the idea where the buildings are located in the iage. Unfortunately, it is not easy to have IFSAR data or DEM iage in all cases. Soe approaches such as in [] and Noronha [4] use hypotheses and verify paradigs based on perceptual grouping to solve the second probles. Hypotheses are generated by a hierarchical perceptual grouping process and verified by the evidence of visible walls and expected shadows. But the syste needs to ae several decisions in the selection and verification process based on siplicity and intuitive judgents that affects uch of the final result. In onocular analysis, Jaynes [9] proposed tas driven perceptual organization for extraction of rooftop. Features such as corner and line segents are first extracted and assigned a certainty value. Then features and their grouping are stored in a feature relation graph. Close cycles in the graph represent the grouped polygon

2 Dong-Min Woo and Quoc-Dat Nguyen 437 hypotheses. The independent set of closed groups that have axiu su of certainty values of its parts is the final grouping choice. This approach is liited on rectangular buildings and tends to have false hypotheses in coplexity iages. In this paper, we propose a new ethod for rectilinear building detection and reconstruction using two overlapping aerial iages. We use hypothesis generation and selection based on perceptual organization strategy to solve the building detection tas. The ey idea is that we use the proposed suspected building regions extracted fro the disparity ap for obtaining the location of interested objects in the iage. This building location inforation helps to reove the unnecessary line segents in the low level feature extraction result and thus reduces coputational coplexity and false hypotheses in later steps. Additionally, hypothesis selection is carried out by graph searching for close cycles in an undirected graph. Copared with Jaynes s approach, our ethod detects corners fro filtered low level features before constructing the graph, whereas corners are extracted using pre-defined corner ass and each corner can tae part in any different close cycles in his approach. So our syste can significantly reduce coputational coplexity and false hypotheses. Moreover, we expand the condition required for a lin between two corners to be fored and thus enable our syste to detect the rectilinear buildings that Jaynes s approach does not detect. For building reconstruction, we retrieve 3D inforation of the buildings using 3D triangulation with the nown geoetric paraeters of iage acquisition. The reainder of this paper is organized as follows: An overview of the syste is shown in Section. Section 3 describes the generation of epipolar iages, disparity ap, and suspected building regions. In Section 4, the principle of low level features processing and rooftop hypothesis is introduced. Section 5 presents experiental results on an aerial iage data set. At last, the conclusion and future wor are given in Section 6.. Syste Overview Fig. 1 shows the ain coponents in our syste. The epipolar iages are generated fro the aerial iages by the epipolar resapling process. We obtain the disparity ap between the epipolar pairs by stereo atching using area-based atching with non-paraetric technique. Fro the disparity ap, we generate the DEM as a 3D terrain odel. The building location inforation extracted fro the disparity ap is used to reove the unnecessary line segents extracted in the low level process. After D lines are generated, perceptual grouping is applied to the filtered line segents in order to obtain the structural relationship features such as parallel line segent pairs and U-shapes. These can be used to generate rooftop hypotheses. Aong the generated hypothesis, the candidate rooftop is selected by searching close cycles in the undirected graph. Finally, we retrieve 3D buildings by using 3D triangulation for each line segent of detected rooftops. 3.1 Epipolar Iages Fig. 1. Syste overview 3. Building Region Extraction The goal of this step is to generate the epipolar iages fro the two original aerial iages. For each point in one of the epipolar iages, we only need to search for the points in the sae row index of the other iage for the corresponding point. In this way, atching can be reduced to a one-diensional search instead of a two-diensional search. Consequently, the syste can significantly reduce coputational coplexity in solving the correspondence proble in the disparity ap step. To generate epipolar iages, we project four corners of the original reference R and wrap W iages onto the overlap plane Z. Next, we calculate overlap area, the intersection of the plane Z, with the region in the object space that is visible in both iages. Then, epipolar lines that bound the left, right, top, and botto of the overlap area are found. Each pixel in the row of the resapled iage corresponding to the epipolar line segent between the right and left bound are bac projected onto the R and W iages. The corresponding coordinate of each pixel in the epipolar iages can be calculated by resapling the R and W iage along a straight line that passes through the bac projected start and end point of that line. Finally, we obtain the pixel s intensity value of epipolar iages by using interpolation.

3 438 3D Building Detection and Reconstruction fro Aerial Iages Using Perceptual Organization and Fast Graph Search 3. Disparity Map The goal of the iage atching process is finding a atch between the pixels in the first (reference) R and second (wrap) W iage such that the pixel located at (i, j) in the R iage and a pixel located at (i+i(i, j), j+j(i, j)) in the W iage view the sae point in an object space, i.e., W(i+I(i, j), j+j(i, j)) -> R(i, j), where I(i, j) is horizontal disparity ap, and J(i, j) is vertical disparity ap. The index i (colun index) is easured along scan lines and the index j (row index) is easured across scan lines. In this paper, we use resapled epipolar iages as the input so that J(i, j) = 0 for all i and j, and the relation reduces to W(i+I(i, j), j) -> R(i, j). Considering the correspondence proble, there are two popular approaches. The first one is Noralized Cross Correlation (NCC), which is an area-based atching typical etric approach and the second one is nonparaetric technique with census transfor [10]. We eploy the census transfor due to its preservation of the edges and siple coputational coplexity. To find the accurate disparity ap, we eployed a ulti-resolution schee, referred to as hierarchical, or pyraid processing. For each resolution schee, the correspondence proble is solved by first coputing a census transfored iage and then using Haing distance correlation on that iage. The census transforation aps the local region surrounding a pixel to a bit string with pixels having lesser intensities. For exaple, in a window surrounding a pixel, if a particular pixel s value is less than the centre pixel, the corresponding position in the bit string will be set to 1; otherwise it is set to 0. After that, two census transfored iages will be copared using a siilarity etric based on the Haing distance, which is the nuber of bits that differ in the two correlation window bit string. The Haing distance [11] is sued over the window, as in (1). ( u, v) W ' ' Ha in g( I1 ( u, v), I ( x + u, y + v)) (1) where I ' 1 and I ' represent the census transfors of I 1 and I. W is the correlation window. 3.3 Suspected Building Regions It is usually difficult to separate interested objects fro D line segent collection obtained in low level features extraction. The boundary of interested objects, the buildings, can be partly occluded by vegetation, shadows, and other objects. In the rooftop hypothesis process, these fragented boundaries and the presence of roads, vehicles, etc., can ae false hypotheses including unwanted rooftops and rooftops of the wrong shape. This causes not only significant coputational effort in processing but also erroneous final results. To solve this proble, the syste should be able to detect line segents that are within or near buildings in the iage. Here, we use suspected building regions that are extracted fro the disparity ap. The suspected building regions are areas in which pixel values change in coparison with the surrounding area. The difference in pixel values between the suspected building region and surrounding areas indicates the difference of elevation values. It specifies the existence of higher objects such as buildings, trees, etc., in those regions. In other words, these regions can give us the inforation of where the buildings are located. These regions could be extracted by using a siple height threshold technique. Their boundaries are extracted by convolving the disparity ap with a aplacian-of- Gaussian filter and then eploying connected coponent analysis to achieve zero-crossing pixels coordinates in the convolution output. We have og as an operator or convolution ernel defined as in (). og( x, y) = ΔG σ = x ( x, y) 1 = πσ Gσ ( x, y) + y x + y 1 σ G ( x, y) σ e x + y σ 4. 3D Rooftop Model Generation 4.1 ow evel Features Extraction To detect D lines fro an epipolar iage, edge detection is carried out first and then D lines are fored fro the edges. To do so, we eployed the Canny edge detector, since it is optial according to the criteria where edge is defined and coes up with thin edges. To obtain a D line segent, we used the Boldt algorith [1] based on toen grouping. This ethod extracts a basic line eleent, toen, in ters of the properties of line A and constructs a D line using the grouping process. It is efficient in detecting D lines of large structure appearing in urban iages. 4. Grouping and Filtering Process Suspected building regions are used to reove line segents that are outside or far fro interested object boundaries eanwhile the needed line segents are still ept for later processing steps. ()

4 Dong-Min Woo and Quoc-Dat Nguyen 439 Then, we group the closely parallel linear segents since they usually represent a linear structure of objects in an iage, lie the border of a roof or the divider between ground terrain and building, by using a folding space between two line segents. If both line segents are inside the folding space, two line segents can be replaced by a single line in which orientation is the longer line segent orientation and length is the total length of two segents. After this process, each group of the closely overlapping and parallel line segents is represented by one single line. Fig. gives the typical case of closely parallel linear segent grouping. These linear segents either are, or nearly, parallel lines. So the first condition is that the angle between the should be fro 0 0 to If two line segents are fragented lines fro one edge, these line segents ust be close and should be inside a folding space created by the. The U shaped structure in Fig. 3 is used to detect candidates for rooftop hypothesis generation. Any line segent in a set of parallel lines with a U shaped structure is a candidate ept as input for hypothesis generation, otherwise that line segent will be reoved. junction, it connects to any type of corner. However, it prefers connecting to a corner which label is II or IV. If that corner is T-junction, it can only connect to a corner which label is II or IV. This rule is used in hypothesis generation to build collated features. With the flexible connection between corners, our ethod is able to detect rectilinear rooftops. Fig. 5 reveals soe exaples of corner detection. A, B, E, F, and G are -junctions while C and D are T-junctions. Fig. 4. Corner labeling Fig. 5. Corner detection 4.4 Rooftop Hypothesis Generation 4.3 Corner Detection Fig.. Folding space Fig. 3. U-structure Corners are calculated as the intersection of two line segents that have an angle fro 80 0 to with one of the having the nearest distance to another one. We define four types of corner. They are labeled as I, II, III, and IV, as shown in Fig. 4. Each corner has an attribute to indicate whether it is -junction or T-junction. This attribute is used to decide whether two different corners have a connection or not. For exaple, if a corner s label is I and type is - A collated feature is a sequence of perceptually grouped corners and line segents. Here, collated features are constructed fro filtered line segents and corners obtained fro the filtering and grouping process. This reduces coputational effort and false hypotheses. Hypotheses are fored by the alternation of corners and line segents that for collated features. In a collated feature, two corners have connectivity only if they satisfy the corner relation condition and they are the nearest appropriate corner to each other. Beside, every corner connects to only one corner on each of its line segent directions. Hypothesis generation is perfored by constructing the feature graph. Construction of the graph can be seen as placing corners as nodes and edges between nodes if there is the relation between the corresponding corners in the collated features. When a node is inserted into the graph, the syste loos into the reaining nodes to deterine whether any node has a relation with the inserted node. If soe nodes satisfy the connectivity relation rules, those nodes are inserted into the graph and the syste creates an edge between the. In the exaple shown in Fig. 5, C is T-junction, and it can connect to D, A, and E. Meanwhile, A can connect to B, C, and E but C is

5 440 3D Building Detection and Reconstruction fro Aerial Iages Using Perceptual Organization and Fast Graph Search nearer than E towards A on the line segent AE so that A only connects to B and C. Consequently there are two collated features, ACGB and CEFD, in Fig Rooftop Hypothesis Selection The graph is the place to store features and their groupings. Feature as corner is node in the graph and relations between corners are represented with an edge between the corresponding nodes. Closed cycles in the graph represent the rooftop candidates. Hypothesis selection can be seen as a siple graph search proble. The close cycles in the graph are rooftops that we need to detect. Fig. 6 shows a graph constructed fro the exaple in Fig. 5. Corner C and corner D are T-junctions so that there are two nodes in the graph for each corner, node C1 and C for corner C and node D1 and D for corner D. There are two close cycles, C1 and C, as shown in Fig. 6. space coordinate syste. We have a syste of equations for five variables fro each pair of points in two iages. Solving that syste of equations we have the real 3D coordinates of the selected points in two iages. As a result, we have 3D line segents fro the corresponding D line segents. 5. Experiental Results The experiental environent was set up based on Ascona aerial iages of the Avenches area. Since this area s 3D odel is supplied as ground truth data, we can evaluate the quantitative accuracy for the 3D rooftop odel generated by the proposed ethod. Two aerial iages as revealed in Fig. 7 are used as a set of stereo iages for the experients. Fig. 7. Aerial iages used as a set of stereo iages Fig. 6. Feature graph 4.6 3D Building Reconstruction 3D triangulation is used to generate 3D line segents. The relationship between point located at X = ( X, Y, Z ) in odel/object space and the projection of point located at x = ( x, y, f ) in the iage of caera is depicted in (3). 0 X X 0 = + Y Y λ 0 Z Z x y f (3) Also, it is expressed as a vector for, as in (4). 0 X = X + λ * * x (4) X = ( X, Y, Z ) is the odel space coordinates of the focal point of caera, f is the focal length of caera, λ is the scale factor for point projected on the focal plane of caera, and is the rotation atrix between the iage space coordinate syste and the odel The result of the epipolar resapling process is shown in Fig. 8. We generate suspected building regions fro the ap to reduce unnecessary line segents. To find the accurate disparity ap, we eployed the ulti-resolution schee with four different resolutions, where scaled iage sizes are equal to original size divided by n, n = (0,1,,3). The corresponding correlation window sizes are 3x3, 5x5, 7x7, and 9x9, while the census transfor window sizes are 3x3, 5x5, 7x7, and 9x9. The final disparity ap is presented in Fig. 9. Fig. 10 gives the generated DEM iage by using area-based stereo atching [13], and also shows its ground truth iage. Fig. 8. Exaple of epipolar iages

6 Dong-Min Woo and Quoc-Dat Nguyen 441 Fig. 9. Exaple of disparity ap Fig. 1. Exaple of suspected building regions Fig. 10. Generated DEM iage and ground truth iage Fig. 11 gives the line segents obtained fro the low level feature extraction process. The nuber of extracted line segents is about 145. To reove unnecessary line segents, we use the suspected building regions extracted fro the disparity ap as shown in Fig. 1. The result of unnecessary line segent reoval is presented in Fig. 13. The reaining line segents total about 405. At this point, the perceptual filtering and grouping process is eployed to obtain line segents which can be part of any U-structure group. The close parallel line segents that are inside their folding space will be grouped into one representation line. The line segents that are part of a collection of line segents foring the U-structure will be used to generate hypotheses in the next step. Fig. 14 shows the line segents foring U-structures in a collection of line segents. The colors indicate which U-structure group that the line segent belongs to. Fig. 13. Exaple of filtered line segents Fig. 14. Exaple of U-structures Fig. 15. Exaple of corner detection Fig. 11. Exaple of low level extraction result The corners are calculated fro the intersection of the line segents that satisfy two conditions: their angle is fro 85 0 to 95 0 and one of the has the nearest distance to another one. Fig. 15 provides extracted corners fro the line segent collection. We can use the obtained corners and line segents fro the previous steps to build the collated features. In order to have a lin between each other, two corners ust satisfy

7 44 3D Building Detection and Reconstruction fro Aerial Iages Using Perceptual Organization and Fast Graph Search the connecting relation of corner type and the required condition of their distance. Another iportant rule that helps to define the corner connectivity is that on each line segent of a corner, there is only one corner that has connection with it. Fig. 16 shows the collated features obtained fro the line segent collection. Fig. 19. Exaple of 3D building reconstruction Fig. 16. Exaple of collated features Fig. 17. Exaple of close cycles The collated features are used to construct a graph by placing a corner as a node and two corners of a line segent as an edge between two nodes if there is a relation between the corresponding corners in the collated features. Closed cycles in the graph represent the possible rooftops. Hypothesis selection becoes the searching of close cycles in the graph. Fig. 17 shows the close cycles selected fro the line segent collection. Fig. 18 presents the rooftop detection result of the entire area. There is a building located near the border of the epipolar iage that the syste cannot detect correctly due Fig. 18. Exaple of detected rooftops to issing line segents in low level extraction step. The result of the reaining building is very good. Fro the detected rooftop and the nown geoetric paraeters of iage acquisition, we reconstructed 3D building using 3D triangulation as shown in Fig. 19. To represent the quantitative accuracy of 3D building reconstructed by our approach, we obtained the error by calculating the average distance between the extracted 3D line segents and the ground truth line segents as in (5). e1 i + ei di E = d In (5), e 1i is the distance fro the starting point of line segent i to the ground truth 3D line, while e i is the distance fro the end point of line segent i to the ground truth 3D line and d i is the length of line segent i. Error calculation indicates that the average error of the reconstructed buildings is 1.65 while the error of the corresponding digital elevation odel is Conclusion A new approach to detect and reconstruct buildings using perceptual organization fro two aerial iages has been suggested. ow level feature extraction is not applied in the original iages but fro the epipolar iages that help to reduce the search effort in the iage atching process. The proposed suspected building regions are used to reove the unnecessary line segents before generating rooftop hypotheses to help in reducing coputational coplexity and false hypotheses. Using the undirected feature graph, the selection of rooftop hypotheses becoes a siple graph searching for close cycles. The experiental result shows that the proposed ethod can be very effectively utilized for the rectilinear structures of an urban area. i (5)

8 Dong-Min Woo and Quoc-Dat Nguyen 443 Acnowledgeents This wor was supported by the Korea Science and Engineering Foundation (KOSEF) grant funded by the Korean governent (MOST) (Grant No.: R ). References [1] A. Huertas and R. Nevatia, Detecting Buildings in Aerial Iages, Coputer Vision, Graphics and Iage Processing, vol. 41, no., 1988, pp [] C. A. in and R. Nevatia, Building detection and description fro a single intensity iage, Coputer Vision and Iage Understanding, vol.7, no., pp , [3] A. Fischer, T. Kolbe, F. ang, A. Creers, W. Forstner,. Pluer, and V. Steinhage, Extracting buildings fro aerial iages using hierarchical aggregation in D and 3D, Coputer Vision and Iage Understanding, vol. 7, no., pp , [4] S. Noronha and R. Nevatia, Detection and odeling of buildings fro ultiple aerial iages, IEEE Transaction on Pattern Analysis and Machine Intelligence, vol. 3, no. 5, pp , 001. [5] R. Collins, C. Jaynes, Y. Q. Cheng, X. Wang, F. Stolle, E. Risean, and A. Hanson, The ascender syste: autoated site odeling fro ultiple aerial iages, Coputer Vision and Iage Understanding, vol. 7, no., pp , [6] R. Mohan and R. Nevatia, Using perceptual organization to extract 3D Structure, Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 11, pp , [7] A. Huertas, Z. Ki, and R. Nevatia, Use of cues fro range data for building odeling, Proc. DARPA Iage Understanding Worshop, 1998, pp [8] Z. Ki and R. Nevatia, Autoatic description of coplex buildings fro ultiple iages, Coputer Vision and Iage Understanding, vol. 96, pp , 004. [9] C. Jaynes, F. Stolle, and R. Collin, Tas driven perceptual organization for extraction of rooftop polygons, IEEE Worshop on Application of Coputer Vision, pp , [10] R. Zabih and J. Woodfill, A non-paraetric approach to visual correspondence, Subitted to IEEE Transactions on Pattern Analysis and Machine Intelligence. [11] J. Bans, M. Bennaoun, and P. Core Nonparaetric technique for fast and robust stereo atching, in Proceedings of IEEE TENCON Speech and Iage Technologies for Coputing and Telecounication, 1997, pp [1] M. Boldt, R. Weiss, and E. Risean, Toen-based Extraction of Straight ines, IEEE Trans. Systes Man Cybernetics, vol. 19, 1989, pp [13] H. Schultz, Terrain Reconstruction fro Widely Separated Iages, in Proceedings of SPIE, vol. 486, 1995, pp Dong-Min Woo He received his B.S and M.S degrees in Electronic Engineering fro Yonsei University, and his Ph.D. in Electrical Engineering fro Case Western Reserve University. His research interests are coputer vision and satellite iage analysis. Quoc-Dat Nguyen He received his B.E. degree in Coputer Engineering fro Ho Chi Minh University of Technology, and his M.S in Inforation Engineering fro Myongji University. His research interests are iage processing and analysis.

BUILDING DETECTION AND RECONSTRUCTION FROM AERIAL IMAGES

BUILDING DETECTION AND RECONSTRUCTION FROM AERIAL IMAGES BULDNG DETECTON AND RECONSTRUCTON FROM AERAL MAGES Dong-Min Woo a, *, Quoc-Dat Nguyen a, Quang-Dung Nguyen Tran a, Dong-Chul Park a, Young-Kee Jung b a Dept. of nformation Engineering, Myongji University,

More information

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13 Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical

More information

Feature Based Registration for Panoramic Image Generation

Feature Based Registration for Panoramic Image Generation IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh

More information

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute

More information

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3 2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition

More information

HIGH PERFORMANCE PRE-SEGMENTATION ALGORITHM FOR SONAR IMAGES

HIGH PERFORMANCE PRE-SEGMENTATION ALGORITHM FOR SONAR IMAGES HIGH PERFORMANCE PRE-SEGMENTATION ALGORITHM FOR SONAR IMAGES Benjain Lehann*, Konstantinos Siantidis*, Dieter Kraus** *ATLAS ELEKTRONIK GbH Sebaldsbrücker Heerstraße 235 D-28309 Breen, GERMANY Eail: benjain.lehann@atlas-elektronik.co

More information

A wireless sensor network for visual detection and classification of intrusions

A wireless sensor network for visual detection and classification of intrusions A wireless sensor network for visual detection and classification of intrusions ANDRZEJ SLUZEK 1,3, PALANIAPPAN ANNAMALAI 2, MD SAIFUL ISLAM 1 1 School of Coputer Engineering, 2 IntelliSys Centre Nanyang

More information

Optimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model

Optimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model 1746 J. Opt. Soc. A. A/ Vol. 22, No. 9/ Septeber 2005 Y. J. Xiao and Y. F. Li Optiized stereo reconstruction of free-for space curves based on a nonunifor rational B-spline odel Yi Jun Xiao Departent of

More information

Task Driven Perceptual Organization for Extraction of Rooftop Polygons. Christopher Jaynes, Frank Stolle and Robert Collins

Task Driven Perceptual Organization for Extraction of Rooftop Polygons. Christopher Jaynes, Frank Stolle and Robert Collins Task Driven Perceptual Organization for Extraction of Rooftop Polygons Christopher Jaynes, Frank Stolle and Robert Collins Abstract A new method for extracting planar polygonal rooftops in monocular aerial

More information

A Novel 2D Texture Classifier For Gray Level Images

A Novel 2D Texture Classifier For Gray Level Images 2012, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.co A Novel 2D Texture Classifier For Gray Level Iages B.S. Mousavi 1 Young Researchers Club, Zahedan

More information

Galois Homomorphic Fractal Approach for the Recognition of Emotion

Galois Homomorphic Fractal Approach for the Recognition of Emotion Galois Hooorphic Fractal Approach for the Recognition of Eotion T. G. Grace Elizabeth Rani 1, G. Jayalalitha 1 Research Scholar, Bharathiar University, India, Associate Professor, Departent of Matheatics,

More information

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles

More information

A simplified approach to merging partial plane images

A simplified approach to merging partial plane images A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D

More information

Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation

Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation Quantitative Coparison of Sinc-Approxiating Kernels for Medical Iage Interpolation Erik H. W. Meijering, Wiro J. Niessen, Josien P. W. Plui, Max A. Viergever Iage Sciences Institute, Utrecht University

More information

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE Rafael García, Xevi Cufí and Lluís Pacheco Coputer Vision and Robotics Group Institute of Inforatics and Applications, University of

More information

INTRINSIC DECOMPOSITION FOR STEREOSCOPIC IMAGES

INTRINSIC DECOMPOSITION FOR STEREOSCOPIC IMAGES INTRINSIC DECOMPOSITION FOR STEREOSCOPIC IMAGES Dehua Xie 1, Shuaicheng Liu 1, Kaio Lin 2, Shuyuan Zhu 1, and Bing Zeng 1 1 School of Electronic Engineering, University of Electronic Science and Technology

More information

3 Conference on Inforation Sciences and Systes, The Johns Hopkins University, March, 3 Sensitivity Characteristics of Cross-Correlation Distance Metric and Model Function F. Porikli Mitsubishi Electric

More information

Relief shape inheritance and graphical editor for the landscape design

Relief shape inheritance and graphical editor for the landscape design Relief shape inheritance and graphical editor for the landscape design Egor A. Yusov Vadi E. Turlapov Nizhny Novgorod State University after N. I. Lobachevsky Nizhny Novgorod Russia yusov_egor@ail.ru vadi.turlapov@cs.vk.unn.ru

More information

Clustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering

Clustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into

More information

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering

More information

A Novel Fast Constructive Algorithm for Neural Classifier

A Novel Fast Constructive Algorithm for Neural Classifier A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore

More information

NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH

NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH V. Atienza; J.M. Valiente and G. Andreu Departaento de Ingeniería de Sisteas, Coputadores y Autoática Universidad Politécnica de Valencia.

More information

Colorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.

Colorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science. Professor Willia Hoff Dept of Electrical Engineering &Coputer Science http://inside.ines.edu/~whoff/ 1 Caera Calibration 2 Caera Calibration Needed for ost achine vision and photograetry tasks (object

More information

Novel Image Representation and Description Technique using Density Histogram of Feature Points

Novel Image Representation and Description Technique using Density Histogram of Feature Points Novel Iage Representation and Description Technique using Density Histogra of Feature Points Keneilwe ZUVA Departent of Coputer Science, University of Botswana, P/Bag 00704 UB, Gaborone, Botswana and Tranos

More information

Vision Based Mobile Robot Navigation System

Vision Based Mobile Robot Navigation System International Journal of Control Science and Engineering 2012, 2(4): 83-87 DOI: 10.5923/j.control.20120204.05 Vision Based Mobile Robot Navigation Syste M. Saifizi *, D. Hazry, Rudzuan M.Nor School of

More information

Use of IFSAR with Intensity Images for Automatic Building Modeling

Use of IFSAR with Intensity Images for Automatic Building Modeling Use of IFSAR with Intensity Images for Automatic Building Modeling A. Huertas, Z. Kim and R. Nevatia Institute for Robotics and Intelligent Systems University of Southern California Los Angeles, California

More information

Ascending order sort Descending order sort

Ascending order sort Descending order sort Scalable Binary Sorting Architecture Based on Rank Ordering With Linear Area-Tie Coplexity. Hatrnaz and Y. Leblebici Departent of Electrical and Coputer Engineering Worcester Polytechnic Institute Abstract

More information

Knowledge-Based Building Detection and Description:

Knowledge-Based Building Detection and Description: Knowledge-Based Building Detection and Description: 1997-1998 R. Nevatia and A. Huertas Institute for Robotics and Intelligent Systems University of Southern California Los Angeles, California 90098 http://iris.usc.edu

More information

Image Filter Using with Gaussian Curvature and Total Variation Model

Image Filter Using with Gaussian Curvature and Total Variation Model IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.

More information

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints 519 An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured fro Different Viewpoints Yousuke Kawauchi 1, Shin Usuki, Kenjiro T. Miura 3, Hiroshi Masuda 4 and Ichiro Tanaka 5 1 Shizuoka

More information

Effective Tracking of the Players and Ball in Indoor Soccer Games in the Presence of Occlusion

Effective Tracking of the Players and Ball in Indoor Soccer Games in the Presence of Occlusion Effective Tracking of the Players and Ball in Indoor Soccer Gaes in the Presence of Occlusion Soudeh Kasiri-Bidhendi and Reza Safabakhsh Airkabir Univerisity of Technology, Tehran, Iran {kasiri, safa}@aut.ac.ir

More information

Affine Invariant Texture Analysis Based on Structural Properties 1

Affine Invariant Texture Analysis Based on Structural Properties 1 ACCV: The 5th Asian Conference on Coputer Vision, --5 January, Melbourne, Australia Affine Invariant Texture Analysis Based on tructural Properties Jianguo Zhang, Tieniu Tan National Laboratory of Pattern

More information

Image hiding with an improved genetic algorithm and an optimal pixel adjustment process

Image hiding with an improved genetic algorithm and an optimal pixel adjustment process Eighth International Conference on Intelligent Systes Design and Applications Iage hiding with an iproved genetic algorith and an optial pixel adjustent process Lin-Yu Tseng Yung-Kuan Chan Yu-An Ho Yen-Ping

More information

Feature Selection to Relate Words and Images

Feature Selection to Relate Words and Images The Open Inforation Systes Journal, 2009, 3, 9-13 9 Feature Selection to Relate Words and Iages Wei-Chao Lin 1 and Chih-Fong Tsai*,2 Open Access 1 Departent of Coputing, Engineering and Technology, University

More information

EFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B.

EFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B. EFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B. Girod1 1 Stanford University, USA 2 Qualco Inc., USA ABSTRACT We study

More information

Boosted Detection of Objects and Attributes

Boosted Detection of Objects and Attributes L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly

More information

Feature based stereo correspondence using moment invariant

Feature based stereo correspondence using moment invariant University of Wollongong Research Online Faculty of Inforatics - Papers (Archive) Faculty of Engineering and Inforation Sciences 008 Feature based stereo correspondence using oent invariant Prashan Prearatne

More information

A Directional Space-scale Based Analysis Method for Three-dimensional Profile Detection by Fringe Projection Technique

A Directional Space-scale Based Analysis Method for Three-dimensional Profile Detection by Fringe Projection Technique International Journal of Optics and Applications 213, 3(5): 111-117 DOI: 1.5923/j.optics.21335.5 A Directional Space-scale Based Analysis Method for Three-diensional Profile Detection by Fringe Projection

More information

Gromov-Hausdorff Distance Between Metric Graphs

Gromov-Hausdorff Distance Between Metric Graphs Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value

More information

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu

More information

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University

More information

Simulated Sensor Reading. Heading. Y [m] local minimum ; m. local maximum ; M. discontinuity ; D. connection ; c X [m]

Simulated Sensor Reading. Heading. Y [m] local minimum ; m. local maximum ; M. discontinuity ; D. connection ; c X [m] Localization based on Visibility Sectors using Range Sensors Sooyong Lee y Nancy. Aato Jaes Fellers Departent of Coputer Science Texas A& University College Station, TX 7784 fsooyong,aato,jpf938g@cs.tau.edu

More information

Different criteria of dynamic routing

Different criteria of dynamic routing Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich

More information

Performance Analysis of RAID in Different Workload

Performance Analysis of RAID in Different Workload Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,

More information

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,

More information

Mathematical model formulations for block adjustment in Aerial Triangulation from high resolution satellite data

Mathematical model formulations for block adjustment in Aerial Triangulation from high resolution satellite data International Journal of Engineering and Technical Research (IJETR) ISSN: 2321-0869, Volue-2, Issue-10, October 2014 Matheatical odel forulations for block adjustent in Aerial Triangulation fro high resolution

More information

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural

More information

Data Acquisition of Obstacle Shapes for Fish Robots

Data Acquisition of Obstacle Shapes for Fish Robots Proceedings of the 2nd WEA International Conference on Dynaical ystes and Control, Bucharest, oania, October -17, 6 Data Acquisition of Obstacle hapes for Fish obots EUNG Y. NA, DAEJUNG HIN, JIN Y. KIM,

More information

PROBABILISTIC LOCALIZATION AND MAPPING OF MOBILE ROBOTS IN INDOOR ENVIRONMENTS WITH A SINGLE LASER RANGE FINDER

PROBABILISTIC LOCALIZATION AND MAPPING OF MOBILE ROBOTS IN INDOOR ENVIRONMENTS WITH A SINGLE LASER RANGE FINDER nd International Congress of Mechanical Engineering (COBEM 3) Noveber 3-7, 3, Ribeirão Preto, SP, Brazil Copyright 3 by ABCM PROBABILISTIC LOCALIZATION AND MAPPING OF MOBILE ROBOTS IN INDOOR ENVIRONMENTS

More information

A Method of Generating Multi-Scale Disc-Like Distributions for NDT Registration Algorithm

A Method of Generating Multi-Scale Disc-Like Distributions for NDT Registration Algorithm International Journal of Mechanical Engineering and Robotics Research Vol. 5, o., January 06 A Method of Generating Multi-Scale Disc-Like Distributions for D Registration Algorith Hyunki Hong and Beohee

More information

Shape Optimization of Quad Mesh Elements

Shape Optimization of Quad Mesh Elements Shape Optiization of Quad Mesh Eleents Yufei Li 1, Wenping Wang 1, Ruotian Ling 1, and Changhe Tu 2 1 The University of Hong Kong 2 Shandong University Abstract We study the proble of optiizing the face

More information

Construction of a regular hendecagon by two-fold origami

Construction of a regular hendecagon by two-fold origami J. C. LUCERO /207 Construction of a regular hendecagon by two-fold origai Jorge C. Lucero 1 Introduction Single-fold origai refers to geoetric constructions on a sheet of paper by perforing a sequence

More information

AUTOMATIC EXTRACTION OF BUILDING ROOFS FROM PICTOMETRY S ORTHOGONAL AND OBLIQUE IMAGES

AUTOMATIC EXTRACTION OF BUILDING ROOFS FROM PICTOMETRY S ORTHOGONAL AND OBLIQUE IMAGES AUTOMATIC EXTRACTION OF BUILDING ROOFS FROM PICTOMETRY S ORTHOGONAL AND OBLIQUE IMAGES Yandong Wang Pictometry International Corp. Suite A, 100 Town Centre Dr., Rochester, NY14623, the United States yandong.wang@pictometry.com

More information

Action Recognition Using Local SpatioTemporal Oriented Energy Features and Additive. Kernel SVMs

Action Recognition Using Local SpatioTemporal Oriented Energy Features and Additive. Kernel SVMs International Journal of Electronics and Electrical Engineering Vol., No., June, 4 Action Recognition Using Local SpatioTeporal Oriented Energy Features and Additive Kernel SVMs Jiangfeng Yang and Zheng

More information

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University

More information

ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH

ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH Kulapraote Prathuchai Geoinforatics Center, Asian Institute of Technology, 58 Moo9, Klong Luang, Pathuthani, Thailand.

More information

Overview. Topology as Central Information in Building Models. Basic Set. Topology Topological Space. What is topology?

Overview. Topology as Central Information in Building Models. Basic Set. Topology Topological Space. What is topology? Overview What is topology? as Central Inforation in Building Models Frank Gielsdorf Wolfgang uhnt technet Gb Berlin Technical University Berlin Why topology is needed for process odeling? ow can topologic

More information

Data pre-processing framework in SPM. Bogdan Draganski

Data pre-processing framework in SPM. Bogdan Draganski Data pre-processing fraework in SPM Bogdan Draganski Outline Why do we need pre-processing? Overview Structural MRI pre-processing fmri pre-processing Why do we need pre-processing? What do we want? Reason

More information

The optimization design of microphone array layout for wideband noise sources

The optimization design of microphone array layout for wideband noise sources PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun

More information

DEBARRED OBJECTS RECOGNITION BY PFL OPERATOR

DEBARRED OBJECTS RECOGNITION BY PFL OPERATOR DEBARRED OBJECTS RECOGNITION BY PFL OPERATOR Manish Kuar Srivastava,Madan Kushwah, Abhishe uar 3 Assistant Professor, Departent of CSE, Lal Bahadur Shastri Group of Institutions Lucnow, Uttar Pradesh,

More information

News Events Clustering Method Based on Staging Incremental Single-Pass Technique

News Events Clustering Method Based on Staging Incremental Single-Pass Technique News Events Clustering Method Based on Staging Increental Single-Pass Technique LI Yongyi 1,a *, Gao Yin 2 1 School of Electronics and Inforation Engineering QinZhou University 535099 Guangxi, China 2

More information

Identifying Converging Pairs of Nodes on a Budget

Identifying Converging Pairs of Nodes on a Budget Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering

More information

A Discrete Spring Model to Generate Fair Curves and Surfaces

A Discrete Spring Model to Generate Fair Curves and Surfaces A Discrete Spring Model to Generate Fair Curves and Surfaces Atsushi Yaada Kenji Shiada 2 Tootake Furuhata and Ko-Hsiu Hou 2 Tokyo Research Laboratory IBM Japan Ltd. LAB-S73 623-4 Shiotsurua Yaato Kanagawa

More information

A New Generic Model for Vision Based Tracking in Robotics Systems

A New Generic Model for Vision Based Tracking in Robotics Systems A New Generic Model for Vision Based Tracking in Robotics Systes Yanfei Liu, Ada Hoover, Ian Walker, Ben Judy, Mathew Joseph and Charly Heranson lectrical and Coputer ngineering Departent Cleson University

More information

HUMAN pose estimation is an important problem in computer

HUMAN pose estimation is an important problem in computer JOURNAL OF L A T E X CLASS FILES, VOL. 6, NO., JANUARY 7 Robust 3D Huan Pose Estiation fro Single Iages or Video Sequences Chunyu Wang, Student Meber, IEEE, Yizhou Wang, Meber, IEEE, Zhouchen Lin, Meber,

More information

O-Snap: Optimization-Based Snapping for Modeling Architecture

O-Snap: Optimization-Based Snapping for Modeling Architecture O-Snap: Optiization-Based Snapping for Modeling Architecture MURAT ARIKAN Vienna University of Technology MICHAEL SCHWÄRZLER VRVis Research Center SIMON FLÖRY and MICHAEL WIMMER Vienna University of Technology

More information

DIGITAL RECTIFICATION AND GENERATION OF ORTHOIMAGES IN ARCHITECTURAL PHOTOGRAMMETRY

DIGITAL RECTIFICATION AND GENERATION OF ORTHOIMAGES IN ARCHITECTURAL PHOTOGRAMMETRY DIGITAL RECTIFICATION AND GENERATION OF ORTHOIMAGES IN ARCHITECTURAL PHOTOGRAMMETRY MATTHIAS HEMMLEB Fokus GbH, Färberstr. 13, D-04105 Leipzig, Gerany E-ail: atti@fpk.tu-berlin.de ALBERT WIEDEMANN Technical

More information

The research on end-effector position and orientation error distribution of SCARA industrial robot

The research on end-effector position and orientation error distribution of SCARA industrial robot International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 2320-9364, ISSN (Print): 2320-9356 Volue 3 Issue 6 ǁ June 2015 ǁ PP.13-20 The research on end-effector position and orientation

More information

Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed

Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed Yonghwan Ki* & Dick K.P. Yue** Massachusetts Institute of Technology, Departent of Ocean Engineering, Cabridge,

More information

Ming-Wei Lee 1, Wei-Tso Lin 1, Yu-Ching Ni 2, Meei-Ling Jan 2, Yi-Chun Chen 1 * National Central University

Ming-Wei Lee 1, Wei-Tso Lin 1, Yu-Ching Ni 2, Meei-Ling Jan 2, Yi-Chun Chen 1 * National Central University Rapid Constructions of Circular-Orbit Pinhole SPECT Iaging Syste Matrices by Gaussian Interpolation Method Cobined with Geoetric Paraeter Estiations (GIMGPE Ming-Wei Lee, Wei-Tso Lin, Yu-Ching Ni, Meei-Ling

More information

Mirror Localization for a Catadioptric Imaging System by Projecting Parallel Lights

Mirror Localization for a Catadioptric Imaging System by Projecting Parallel Lights 2007 IEEE International Conference on Robotics and Autoation Roa, Italy, 10-14 April 2007 FrC2.5 Mirror Localization for a Catadioptric Iaging Syste by Projecting Parallel Lights Ryusuke Sagawa, Nobuya

More information

Resolution. Super-Resolution Imaging. Problem

Resolution. Super-Resolution Imaging. Problem Resolution Super-Resolution Iaging Resolution: Sallest easurable detail in a visual presentation Subhasis Chaudhuri Departent of Electrical Engineering Indian institute of Technology Bobay Powai, Mubai-400

More information

Brian Noguchi CS 229 (Fall 05) Project Final Writeup A Hierarchical Application of ICA-based Feature Extraction to Image Classification Brian Noguchi

Brian Noguchi CS 229 (Fall 05) Project Final Writeup A Hierarchical Application of ICA-based Feature Extraction to Image Classification Brian Noguchi A Hierarchical Application of ICA-based Feature Etraction to Iage Classification Introduction Iage classification poses one of the greatest challenges in the achine vision and achine learning counities.

More information

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011 EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction

More information

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented

More information

2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016)

2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016) 2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016) Method for Marking and Positioning Corrosions in the Autoobile Engine Cylinder Cavity fro the Ultrasonic Phased Array

More information

MGS-SIFT: A New Illumination Invariant Feature Based on SIFT Descriptor

MGS-SIFT: A New Illumination Invariant Feature Based on SIFT Descriptor International Journal of Coputer Theory and Engineering, Vol 5, No, February 0 MGS-SIFT: A New Illuination Invariant Feature Based on SIFT Descriptor Reza Javanard Alitappeh and Fariborz Mahoudi Abstract

More information

Geo-activity Recommendations by using Improved Feature Combination

Geo-activity Recommendations by using Improved Feature Combination Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,

More information

On computing global similarity in images

On computing global similarity in images On coputing global siilarity in iages S Ravela and R Manatha Coputer Science Departent University of Massachusetts, Aherst, MA 01003 Eail: ravela,anatha @csuassedu Abstract The retrieval of iages based

More information

A Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction

A Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao

More information

Set Theoretic Estimation for Problems in Subtractive Color

Set Theoretic Estimation for Problems in Subtractive Color Set Theoretic Estiation for Probles in Subtractive Color Gaurav Shara Digital Iaging Technology Center, Xerox Corporation, MS0128-27E, 800 Phillips Rd, Webster, NY 14580 Received 25 March 1999; accepted

More information

Image Processing for fmri John Ashburner. Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK.

Image Processing for fmri John Ashburner. Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK. Iage Processing for fmri John Ashburner Wellcoe Trust Centre for Neuroiaging, 12 Queen Square, London, UK. Contents * Preliinaries * Rigid-Body and Affine Transforations * Optiisation and Objective Functions

More information

Hand Gesture Recognition for Human-Computer Interaction

Hand Gesture Recognition for Human-Computer Interaction Journal of Coputer Science 6 (9): 002-007, 200 ISSN 549-3636 200 Science Publications Hand Gesture Recognition for Huan-Coputer Interaction S. ohaed ansoor Rooi, R. Jyothi Priya and H. Jayalakshi Departent

More information

Modeling Parallel Applications Performance on Heterogeneous Systems

Modeling Parallel Applications Performance on Heterogeneous Systems Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln

More information

MULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES. Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou

MULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES. Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou MULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou Departent of Coputer Science and Inforation Engineering, National Chiayi

More information

Prove Theorems about Lines and Angles

Prove Theorems about Lines and Angles GEOMETRY Prove Theores about Lines and Angles OJECTIVE #: G.CO.9 OJECTIVE Prove theores about lines and angles. Theores include: vertical angles are congruent; when a transversal crosses parallel lines,

More information

The Internal Conflict of a Belief Function

The Internal Conflict of a Belief Function The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of

More information

Module Contact: Dr Rudy Lapeer (CMP) Copyright of the University of East Anglia Version 1

Module Contact: Dr Rudy Lapeer (CMP) Copyright of the University of East Anglia Version 1 UNIVERSITY OF EAST ANGLIA School of Coputing Sciences Main Series UG Exaination 2016-17 GRAPHICS 1 CMP-5010B Tie allowed: 2 hours Answer THREE questions. Notes are not peritted in this exaination Do not

More information

An Optimization Clustering Algorithm Based on Texture Feature Fusion for Color Image Segmentation

An Optimization Clustering Algorithm Based on Texture Feature Fusion for Color Image Segmentation Algoriths 2015, 8, 234-247; doi:10.3390/a8020234 Article OPEN ACCESS algoriths ISSN 1999-4893 www.dpi.co/journal/algoriths An Optiization Clustering Algorith Based on Texture Feature Fusion for Color Iage

More information

Classification and Segmentation of Glaucomatous Image Using Probabilistic Neural Network (PNN), K-Means and Fuzzy C- Means(FCM)

Classification and Segmentation of Glaucomatous Image Using Probabilistic Neural Network (PNN), K-Means and Fuzzy C- Means(FCM) IJSRD - International Journal for Scientific Research & Developent Vol., Issue 7, 03 ISSN (online): 3-063 Classification and Segentation of Glaucoatous Iage Using Probabilistic Neural Network (PNN), K-Means

More information

(Geometric) Camera Calibration

(Geometric) Camera Calibration (Geoetric) Caera Calibration CS635 Spring 217 Daniel G. Aliaga Departent of Coputer Science Purdue University Caera Calibration Caeras and CCDs Aberrations Perspective Projection Calibration Caeras First

More information

Utility-Based Resource Allocation for Mixed Traffic in Wireless Networks

Utility-Based Resource Allocation for Mixed Traffic in Wireless Networks IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng

More information

LOSSLESS COMPRESSION OF BAYER MASK IMAGES USING AN OPTIMAL VECTOR PREDICTION TECHNIQUE

LOSSLESS COMPRESSION OF BAYER MASK IMAGES USING AN OPTIMAL VECTOR PREDICTION TECHNIQUE 1th European Signal Processing Conference (EUSIPCO 2006), Florence, Italy, Septeber -8, 2006, copyright by EUASIP LOSSLESS COMPESSION OF AYE MASK IMAES USIN AN OPTIMAL VECTO PEDICTION TECHNIQUE Stefano

More information

Energy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks

Energy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr

More information

A Psychovisual Threshold for Generating Quantization Process in Tchebichef Moment Image Compression

A Psychovisual Threshold for Generating Quantization Process in Tchebichef Moment Image Compression See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/617715 A Psychovisual Threshold for Generating Quantization Process in Tchebichef oent Iage

More information

Detection and Modeling of Buildings from Multiple Aerial Images

Detection and Modeling of Buildings from Multiple Aerial Images IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 23, NO. 5, MAY 2001 501 Detection and Modeling of Buildings from Multiple Aerial Images Sanjay Noronha and Ramakant Nevatia, Fellow,

More information

OPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PRE-ORDER AND POST-ORDER TRAVERSALS

OPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PRE-ORDER AND POST-ORDER TRAVERSALS OPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PRE-ORDER AND POST-ORDER TRAVERSALS ADRIAN DEACONU Transilvania University of Brasov, Roania Abstract A linear tie

More information

THE rapid growth and continuous change of the real

THE rapid growth and continuous change of the real IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa

More information

Evaluation of the Timing Properties of Two Control Networks: CAN and PROFIBUS

Evaluation of the Timing Properties of Two Control Networks: CAN and PROFIBUS Evaluation of the Tiing Properties of Two Control Networs: CAN and PROFIBUS Max Mauro Dias Santos 1, Marcelo Ricardo Steer 2 and Francisco Vasques 3 1 UnilesteMG, CEP 35170-056, Coronel Fabriciano MG Brasil.

More information

Guillotine subdivisions approximate polygonal subdivisions: Part III { Faster polynomial-time approximation schemes for

Guillotine subdivisions approximate polygonal subdivisions: Part III { Faster polynomial-time approximation schemes for Guillotine subdivisions approxiate polygonal subdivisions: Part III { Faster polynoial-tie approxiation schees for geoetric network optiization Joseph S. B. Mitchell y April 19, 1997; Last revision: May

More information