subject:(tree detection)

Universidade de Lisboa

1. Jieke, Pan. Cooperative Intrusion Detection For The Next Generation Carrier Ethernet.

Degree: 2008, Universidade de Lisboa

URL: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/13881

► Current OSI model layer 2 network elements (NEs, e.g., bridges, switches) are complex hardware and software boxes, often running an operating system, service and administration… (more)

Subjects/Keywords: Cooperative Intrusion Detection; Specification-based Intrusion Detection; Carrier Ethernet; Spanning Tree Protocol; Network Topology; Security

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jieke, P. (2008). Cooperative Intrusion Detection For The Next Generation Carrier Ethernet. (Thesis). Universidade de Lisboa. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/13881

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Jieke, Pan. “Cooperative Intrusion Detection For The Next Generation Carrier Ethernet.” 2008. Thesis, Universidade de Lisboa. Accessed December 11, 2019. http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/13881.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Jieke, Pan. “Cooperative Intrusion Detection For The Next Generation Carrier Ethernet.” 2008. Web. 11 Dec 2019.

Vancouver:

Jieke P. Cooperative Intrusion Detection For The Next Generation Carrier Ethernet. [Internet] [Thesis]. Universidade de Lisboa; 2008. [cited 2019 Dec 11]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/13881.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jieke P. Cooperative Intrusion Detection For The Next Generation Carrier Ethernet. [Thesis]. Universidade de Lisboa; 2008. Available from: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/13881

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

The Ohio State University

2. Yoon, Taehun. Object Recognition Based on Multi-agent Spatial Reasoning.

Degree: PhD, Geodetic Science and Surveying, 2008, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1206075792

► Object recognition is one of the key processes in Photogrammetry to generate maps from sensory information, because it is to convert 'data' to 'information.'… (more)

▼ Object recognition is one of the key processes in Photogrammetry to generate maps from sensory information, because it is to convert 'data' to 'information.' However, as the size of input data is increased, it also has been one of the bottle neck processes in Photogrammetry. Thus many researchers have been working on developing semi-automated or automated object recognition methods to speed up the process. Some of the developed methods have been proved to be feasible in controlled environments, and others have been applicable for real world applications. However, most of the conventional object recognition methods still require human operators' interventions to correct errors or clarify ambiguous results. The new object recognition method proposed in this dissertation is to recognize multiple types of objects in parallel so that the ambiguous results would be minimized. Since 1980's, new paradigms in Computer Science such as parallel computing and agent models have emerged with the progress of computer systems. The proposed method is built on one of the paradigms, the agent model. With built-in knowledge and predefined goals, the agent actively searches clues to reach the goals. In a multi-agent model, several agents with specific goals and tasks are deployed, and they are trying to reach the main goal together. The proposed system consists of the coordinator agent, the recognition agents, and the data agent. The coordinator agent initiates other agents, and the data agent handles and processes input data. While the recognition agents aggressively collect regions for the target objects, sometimes conflicts arise between more than two recognition agents. With the proposed conflict resolution scheme, the conflicts can be resolved, and finally ambiguity can be removed. Experiments on the proposed system were performed with a multi-spectral image and LIDAR data. Results of feature extraction done by the data agent, and object recognition are presented. The results show that the proposed method successfully recognized target objects(buildings and trees), and the multi-agent model enhances the accuracy of the results. Advisors/Committee Members: Schenk, Anton (Advisor).

Subjects/Keywords: Computer Science; Object recognition; spatial reasoning; agent model; building detection; tree detection; linear feature extraction

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yoon, T. (2008). Object Recognition Based on Multi-agent Spatial Reasoning. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1206075792

Chicago Manual of Style (16^th Edition):

Yoon, Taehun. “Object Recognition Based on Multi-agent Spatial Reasoning.” 2008. Doctoral Dissertation, The Ohio State University. Accessed December 11, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1206075792.

MLA Handbook (7^th Edition):

Yoon, Taehun. “Object Recognition Based on Multi-agent Spatial Reasoning.” 2008. Web. 11 Dec 2019.

Vancouver:

Yoon T. Object Recognition Based on Multi-agent Spatial Reasoning. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2019 Dec 11]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1206075792.

Council of Science Editors:

Yoon T. Object Recognition Based on Multi-agent Spatial Reasoning. [Doctoral Dissertation]. The Ohio State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1206075792

Rochester Institute of Technology

3. Allmann, Josh. Approximate nearest neighbors for recognition of foreground and background in images and video.

Degree: Computer Science (GCCIS), 2013, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/5513

► Problems in image matching, saliency detection in images, and background detection in video are studied. Algorithms based on approximate nearest-neighbor matching are proposed to solve… (more)

Subjects/Keywords: Approximate nearest neighbor; Background detection; Foreground detection; Kd-tree; Saliency; Walsh-hadamard transform

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Allmann, J. (2013). Approximate nearest neighbors for recognition of foreground and background in images and video. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/5513

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Allmann, Josh. “Approximate nearest neighbors for recognition of foreground and background in images and video.” 2013. Thesis, Rochester Institute of Technology. Accessed December 11, 2019. https://scholarworks.rit.edu/theses/5513.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Allmann, Josh. “Approximate nearest neighbors for recognition of foreground and background in images and video.” 2013. Web. 11 Dec 2019.

Vancouver:

Allmann J. Approximate nearest neighbors for recognition of foreground and background in images and video. [Internet] [Thesis]. Rochester Institute of Technology; 2013. [cited 2019 Dec 11]. Available from: https://scholarworks.rit.edu/theses/5513.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Allmann J. Approximate nearest neighbors for recognition of foreground and background in images and video. [Thesis]. Rochester Institute of Technology; 2013. Available from: https://scholarworks.rit.edu/theses/5513

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Stellenbosch University

4. Thom, Jacobus Daniël. Combining tree kernels and text embeddings for plagiarism detection.

Degree: MSc, Mathematical Sciences, 2018, Stellenbosch University

URL: http://hdl.handle.net/10019.1/103550

►

ENGLISH ABSTRACT : The internet allows for vast amounts of information to be accessed with ease. Consequently, it becomes much easier to plagiarize any of… (more)

▼

ENGLISH ABSTRACT : The internet allows for vast amounts of information to be accessed with ease. Consequently, it becomes much easier to plagiarize any of this information as well. Most plagiarism detection techniques rely on n-grams to find similarities between suspicious documents and possible sources. N-grams, due to their simplicity, do not make full use of all the syntactic and semantic information contained in sentences. We therefore investigated two methods, namely tree kernels applied to the parse trees of sentences and text embeddings, to utilize more syntactic and semantic information respectively. A plagiarism detector was developed using these techniques and its effectiveness was tested on the PAN 2009 and 2011 external plagiarism corpora. The detector achieved results that were on par with the state of the art for both PAN 2009 and PAN 2011. This indicates that the combination of tree kernel and text embedding techniques is a viable method of plagiarism detection.

AFRIKAANSE OPSOMMING : Die internet laat mens toe om groot hoeveelhede inligting maklik in die hande te kry. Gevolglik word dit ook baie makliker om plagiaat op enige van hierdie inligting te pleeg. Meeste plagiaatopsporingstegnieke maak staat op n-gramme om ooreenkomste tussen verdagte dokumente en moontlike bronne op te spoor. Aangesien n-gramme taamlik eenvoudig is, maak hulle nie volle gebruik van al die syntaktiese en semantiese inligting wat sinne bevat nie. Ons ondersoek dus twee metodes, naamlik boomkernfunksies, wat toegepas word op die ontledingsbome van sinne, en teksinbeddings, om onderskeidelik meer sintaktiese en semantiese inligting te gebruik. 'n Plagiaatdetektor is ontwikkel met behulp van hierdie twee tegnieke en die e ektiwiteit daarvan is getoets op die PAN 2009 en 2011 eksterne plagiaatkorpora. Die detektor het resultate behaal wat vergelykbaar was met die beste vir beide PAN 2009 en PAN 2011. Dit dui aan dat die kombinasie van boomkern- en teksinbeddingstegnieke 'n redelike metode van plagiaatopsporing is.

Advisors/Committee Members: van der Merwe, Brink, Stellenbosch University. Faculty of Science. Dept. of Mathematical Sciences (Computer Science).

Subjects/Keywords: Text embeddings; Plagiarism – Detection; Tree kernels; Syntactic structures; Semantic structures

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Thom, J. D. (2018). Combining tree kernels and text embeddings for plagiarism detection. (Masters Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/103550

Chicago Manual of Style (16^th Edition):

Thom, Jacobus Daniël. “Combining tree kernels and text embeddings for plagiarism detection.” 2018. Masters Thesis, Stellenbosch University. Accessed December 11, 2019. http://hdl.handle.net/10019.1/103550.

MLA Handbook (7^th Edition):

Thom, Jacobus Daniël. “Combining tree kernels and text embeddings for plagiarism detection.” 2018. Web. 11 Dec 2019.

Vancouver:

Thom JD. Combining tree kernels and text embeddings for plagiarism detection. [Internet] [Masters thesis]. Stellenbosch University; 2018. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10019.1/103550.

Council of Science Editors:

Thom JD. Combining tree kernels and text embeddings for plagiarism detection. [Masters Thesis]. Stellenbosch University; 2018. Available from: http://hdl.handle.net/10019.1/103550

Delft University of Technology

5. Schellenberger, R. Plagiarism detection by similarity join:.

Degree: 2009, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:a18b62c5-e73e-44fc-9336-83a78275f266

► Since the internet is so big and most of its content is public, it is very hard to find out where the information came from… (more)

Subjects/Keywords: plagarism detection; similarity join; shingles; signature tree; news articles

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Schellenberger, R. (2009). Plagiarism detection by similarity join:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:a18b62c5-e73e-44fc-9336-83a78275f266

Chicago Manual of Style (16^th Edition):

Schellenberger, R. “Plagiarism detection by similarity join:.” 2009. Masters Thesis, Delft University of Technology. Accessed December 11, 2019. http://resolver.tudelft.nl/uuid:a18b62c5-e73e-44fc-9336-83a78275f266.

MLA Handbook (7^th Edition):

Schellenberger, R. “Plagiarism detection by similarity join:.” 2009. Web. 11 Dec 2019.

Vancouver:

Schellenberger R. Plagiarism detection by similarity join:. [Internet] [Masters thesis]. Delft University of Technology; 2009. [cited 2019 Dec 11]. Available from: http://resolver.tudelft.nl/uuid:a18b62c5-e73e-44fc-9336-83a78275f266.

Council of Science Editors:

Schellenberger R. Plagiarism detection by similarity join:. [Masters Thesis]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:a18b62c5-e73e-44fc-9336-83a78275f266

McMaster University

6. Blomfield, Douglas. 3-D Imaging of Root Architecture Using Multichannel GPR.

Degree: MSc, 2018, McMaster University

URL: http://hdl.handle.net/11375/22653

► Root biomass accounts for about 25% of the carbon storage in mid-latitude forests. Estimation of root biomass for carbon cycling studies requires either direct measurement… (more)

▼ Root biomass accounts for about 25% of the carbon storage in mid-latitude forests. Estimation of root biomass for carbon cycling studies requires either direct measurement by excavation of root systems, or remote measurement using ground penetrating radar (GPR) or other geophysical methods. This study evaluated the ability of a 2-GHz multi-channel GPR system (IDS Hi-BrigHT) to detect and map white pine roots in managed forest near Turkey Point, southern Ontario. The GPR system employed eight dual-polarized antenna pairs separated at 10 cm intervals. GPR data were acquired as overlapping swaths (2 cm line spacing, 0.4 cm inline) across a 25-m2 test site (TP74-R) containing a juvenile white pine tree. Radargrams were processed to full 3-D radar volumes for time slicing and interpretation of root architecture and comparison with the excavated root network. Radargram signal processing was successful in suppressing airwave and other background noise and improved the detection of root diffractions on radargrams. The majority of roots were found in the rooting zone at a depth of 5-40 cm. Roots as small as 0.5 cm were detected with the 2-GHz frequency, but many roots <1.5 cm diameter could not be detected as continuous root structures. Root detection was strongly dependent on root orientation; large, coarse roots (>3-5 cm) were imaged as continuous root segments when oriented perpendicular to GPR profiles. Roots intersecting GPR profiles at angles <30-45 degrees were either imaged incompletely or not detected on radargrams. The highest rate of root detection was achieved with horizontally polarized (HH) antennas (dipole axis parallel with the root structures). Isosurface root models constructed from the Hilbert-transformed radargrams allowed mapping of the 3-D dimensional root architecture for large (> 3-5 cm diameter) roots. Isosurface models provide a means for estimating the coarse root volume for large roots and could be employed in future work to monitor temporal changes in root biomass by repeat survey at the same measurement site. Radargram signal processing was successful in suppressing airwave and other background noise and improved the detection of root diffractions on radargrams. The majority of roots were found in the rooting zone at a depth of 5-40 cm. Roots as small as 0.5 cm were detected with the 2-GHz frequency, but many roots <1.5 cm diameter could not be detected as continuous root structures. Many roots were not detected due to dependence of root reflection amplitude on root orientation. Roots oriented at >30-45 degrees to the survey swaths were imaged incompletely or not detected. Most large coarse roots (>5 cm diameter) were mapped as continuous structures when the root orientation was either parallel to, or perpendicular to the GPR transects. The highest rate of root detection was achieved with the horizontally polarized (HH) antennas, with the dipole axis perpendicular to the root structures. Isosurface root models constructed from the Hilbert-transformed radargrams allowed mapping of the 3-D… Advisors/Committee Members: Boyce, Joseph, Earth Sciences.

Subjects/Keywords: 3-D multi channel GPR; dual polarization; tree roots; root detection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Blomfield, D. (2018). 3-D Imaging of Root Architecture Using Multichannel GPR. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/22653

Chicago Manual of Style (16^th Edition):

Blomfield, Douglas. “3-D Imaging of Root Architecture Using Multichannel GPR.” 2018. Masters Thesis, McMaster University. Accessed December 11, 2019. http://hdl.handle.net/11375/22653.

MLA Handbook (7^th Edition):

Blomfield, Douglas. “3-D Imaging of Root Architecture Using Multichannel GPR.” 2018. Web. 11 Dec 2019.

Vancouver:

Blomfield D. 3-D Imaging of Root Architecture Using Multichannel GPR. [Internet] [Masters thesis]. McMaster University; 2018. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/11375/22653.

Council of Science Editors:

Blomfield D. 3-D Imaging of Root Architecture Using Multichannel GPR. [Masters Thesis]. McMaster University; 2018. Available from: http://hdl.handle.net/11375/22653

Mississippi State University

7. Fleming, Heather Lynne. MULTI-SCALE ROOST SITE SELECTION BY RAFINESQUE¡¯S BIG-EARED BATS AND SOUTHEASTERN MYOTIS IN MISSISSIPPI.

Degree: MS, Wildlife, Fisheries & Aquaculture, 2011, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10252011-191022/ ;

► Rafinesques big-eared bats (<i>Corynorhinus rafinesquii</i>; RBEB) and southeastern myotis (<i>Myotis austroriparius</i>; SEM) are listed on IUCN Red List of Threatened Species. Limited information on… (more)

Subjects/Keywords: Rafinesque's big-eared bat; Southeastern myotis; roost; cavity tree; detection probability

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Fleming, H. L. (2011). MULTI-SCALE ROOST SITE SELECTION BY RAFINESQUE¡¯S BIG-EARED BATS AND SOUTHEASTERN MYOTIS IN MISSISSIPPI. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-10252011-191022/ ;

Chicago Manual of Style (16^th Edition):

Fleming, Heather Lynne. “MULTI-SCALE ROOST SITE SELECTION BY RAFINESQUE¡¯S BIG-EARED BATS AND SOUTHEASTERN MYOTIS IN MISSISSIPPI.” 2011. Masters Thesis, Mississippi State University. Accessed December 11, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-10252011-191022/ ;.

MLA Handbook (7^th Edition):

Fleming, Heather Lynne. “MULTI-SCALE ROOST SITE SELECTION BY RAFINESQUE¡¯S BIG-EARED BATS AND SOUTHEASTERN MYOTIS IN MISSISSIPPI.” 2011. Web. 11 Dec 2019.

Vancouver:

Fleming HL. MULTI-SCALE ROOST SITE SELECTION BY RAFINESQUE¡¯S BIG-EARED BATS AND SOUTHEASTERN MYOTIS IN MISSISSIPPI. [Internet] [Masters thesis]. Mississippi State University; 2011. [cited 2019 Dec 11]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10252011-191022/ ;.

Council of Science Editors:

Fleming HL. MULTI-SCALE ROOST SITE SELECTION BY RAFINESQUE¡¯S BIG-EARED BATS AND SOUTHEASTERN MYOTIS IN MISSISSIPPI. [Masters Thesis]. Mississippi State University; 2011. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10252011-191022/ ;

University of Southern California

8. Zhou, Qian-Yi. 3D urban modeling from city-scale aerial LiDAR data.

Degree: PhD, Computer Science, 2012, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/70401/rec/19

► 3D reconstruction from point clouds is a fundamental problem in both computer vision and computer graphics. As urban modeling is an important reconstruction problem that… (more)

▼ 3D reconstruction from point clouds is a fundamental problem in both computer vision and computer graphics. As urban modeling is an important reconstruction problem that has various significant applications, this thesis investigates the complex problem of reconstructing 3D urban models from aerial LiDAR (Light Detection And Ranging) point cloud. ❧ In the first part of this thesis, an automatic urban modeling system is proposed which consists of three modules: (1) the classification module classifies input points into trees and buildings; (2) the segmentation module splits building points into different roof patches; (3) the modeling module creates building models, ground, and trees from point patches respectively. In order to support city-scale data sets, this pipeline is extended into an out-of-core streaming framework. By storing data as stream files on hard disks and using main memory as only a temporary storage for ongoing computation, an efficient out-of-core data management is achieved. City-scale urban models are successfully created from billions of points with limited computing resource. ❧ The second part of this thesis explores the 2.5D nature of building structures. The 2.5D characteristic of building models is observed and formally defined as ""building structures are always composed of complex roofs and vertical walls"". Based on this observation, a 2.5D geometry representation is developed for the building structures, and used to extend a classic volumetric modeling approach into a 2.5D method, named 2.5D dual contouring. This algorithm can generate building models with arbitrarily shaped roofs while keeping the verticality of the walls. The next research studies the topology of 2.5D building structures. 2.5D building topology is formally defined as a set of roof features, wall features, and point features; together with the associations between them. Based on this research, the topology restrictions in 2.5D dual contouring are relaxed. The resulting model contains much less triangles but similar visual quality. To further capture the global regularities that intrinsically exist in building models because of human design and construction, a broad variety of global regularity patterns between 2.5D building elements are explored. An automatic algorithm is proposed to discover and enforce global regularities through a series of alignment steps, resulting in 2.5D building models with high quality in terms of both geometry and human judgement. Finally, the 2.5D characteristic of building structures is adopted to aid 3D reconstruction of residential urban areas: a more powerful classification algorithm is developed which adopts an energy minimization scheme based on the 2.5D characteristic of building structures. ❧ This thesis demonstrates the effectiveness of all the algorithms on a range of urban area scans from different cities; with varying sizes, density, complexity, and details. Advisors/Committee Members: Neumann, Ulrich (Committee Chair), Kuo, C.-C. Jay (Committee Member), Barbic, Jerney (Committee Member), You, Suya (Committee Member).

Subjects/Keywords: 2.5D; global regularity; LiDAR; streaming; tree detection; urban modeling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhou, Q. (2012). 3D urban modeling from city-scale aerial LiDAR data. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/70401/rec/19

Chicago Manual of Style (16^th Edition):

Zhou, Qian-Yi. “3D urban modeling from city-scale aerial LiDAR data.” 2012. Doctoral Dissertation, University of Southern California. Accessed December 11, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/70401/rec/19.

MLA Handbook (7^th Edition):

Zhou, Qian-Yi. “3D urban modeling from city-scale aerial LiDAR data.” 2012. Web. 11 Dec 2019.

Vancouver:

Zhou Q. 3D urban modeling from city-scale aerial LiDAR data. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2019 Dec 11]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/70401/rec/19.

Council of Science Editors:

Zhou Q. 3D urban modeling from city-scale aerial LiDAR data. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/70401/rec/19

University of Alberta

9. Shahbazi, Ali. Diversity-Based Automated Test Case Generation.

Degree: PhD, Department of Electrical and Computer Engineering, 2015, University of Alberta

URL: https://era.library.ualberta.ca/files/ct435gd13q

► Software testing is an expensive task that consumes around half of a project’s effort. To reduce the cost of testing and improve the software quality,… (more)

▼ Software testing is an expensive task that consumes around half of a project’s effort. To reduce the cost of testing and improve the software quality, test cases can be produced automatically. Random Testing (RT) is a low cost and straightforward automated test generation approach. However, its effectiveness is not satisfactory. To increase the effectiveness of RT, researchers have developed more effective test generation approaches such as Adaptive Random Testing (ART) which improves the testing by increasing the test case coverage of the input domain. This research proposes new test case generation methods that improve the effectiveness of the test cases by increasing the diversity of the test cases. Numerical, string, and tree test case structures are investigated. For numerical test generation, the use of Centroidal Voronoi Tessellations (CVT) is proposed. Accordingly, a test case generation method, namely Random Border CVT (RBCVT), is introduced which can enhance the previous RT methods to improve their coverage of the input space. The generated numerical test cases by the other methods act as the input to the RBCVT algorithm and the output is an improved set of test cases. An extensive simulation study and a mutant based software testing investigation have been performed demonstrating that RBCVT outperforms previous methods. For string test cases, two objective functions are introduced to produce effective test cases. The diversity of the test cases is the first objective, where it can be measured through string distance functions. The second objective is guiding the string length distribution into a Benford distribution which implies shorter strings have, in general, a higher chance of failure detection. When both objectives are enforced via a multi-objective optimization algorithm, superior string test sets are produced. An empirical study is performed with several real-world programs indicating that the generated string test cases outperform test cases generated by other methods. Prior to tree test generation study, a new tree distance function is proposed. Although several distance or similarity functions for trees have been introduced, their failure detection performance is not always satisfactory. This research proposes a new similarity function for trees, namely Extended Subtree (EST), where a new subtree mapping is proposed. EST generalizes the edit base distances by providing new rules for subtree mapping. Further, the new approach seeks to resolve the problems and limitations of previous approaches. Extensive evaluation frameworks are developed to evaluate the performance of the new approach against previous methods. Clustering and classification case studies are performed to provide an evaluation against different tree distance functions. The experimental results demonstrate the superior performance of the proposed distance function. In addition, an empirical runtime analysis demonstrates that the new approach is one of the best tree distance functions in terms of runtime efficiency. Finally, the…

Subjects/Keywords: software testing; failure detection; tree test case; diversity-based test generation; string test case; tree distance; black-box test generation; tree similarity; test case generation; automated software testing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shahbazi, A. (2015). Diversity-Based Automated Test Case Generation. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/ct435gd13q

Chicago Manual of Style (16^th Edition):

Shahbazi, Ali. “Diversity-Based Automated Test Case Generation.” 2015. Doctoral Dissertation, University of Alberta. Accessed December 11, 2019. https://era.library.ualberta.ca/files/ct435gd13q.

MLA Handbook (7^th Edition):

Shahbazi, Ali. “Diversity-Based Automated Test Case Generation.” 2015. Web. 11 Dec 2019.

Vancouver:

Shahbazi A. Diversity-Based Automated Test Case Generation. [Internet] [Doctoral dissertation]. University of Alberta; 2015. [cited 2019 Dec 11]. Available from: https://era.library.ualberta.ca/files/ct435gd13q.

Council of Science Editors:

Shahbazi A. Diversity-Based Automated Test Case Generation. [Doctoral Dissertation]. University of Alberta; 2015. Available from: https://era.library.ualberta.ca/files/ct435gd13q

EPFL

10. Sun, Xiaolu. Localizing Polygonal Objects in Man-Made Environments.

Degree: 2015, EPFL

URL: http://infoscience.epfl.ch/record/210604

► Object detection is a significant challenge in Computer Vision and has received a lot of attention in the field. One such challenge addressed in this… (more)

▼ Object detection is a significant challenge in Computer Vision and has received a lot of attention in the field. One such challenge addressed in this thesis is the detection of polygonal objects, which are prevalent in man-made environments. Shape analysis is an important cue to detect these objects. We propose a contour-based object detection framework to deal with the related challenges, including how to efficiently detect polygonal shapes and how to exploit them for object detection. First, we propose an efficient component tree segmentation framework for stable region extraction and a multi-resolution line segment detection algorithm, which form the bases of our detection framework. Our component tree segmentation algorithm explores the optimal threshold for each branch of the component tree, and achieves a significant improvement over image thresholding segmentation, and comparable performance to more sophisticated methods but only at a fraction of computation time. Our line segment detector overcomes several inherent limitations of the Hough transform, and achieves a comparable performance to the state-of-the-art line segment detectors. However, our approach can better capture dominant structures and is more stable against low-quality imaging conditions. Second, we propose a global shape analysis measurement for simple polygon detection and use it to develop an approach for real-time landing site detection in unconstrained man-made environments. Since the task of detecting landing sites must be performed in a few seconds or less, existing methods are often limited to simple local intensity and edge variation cues. By contrast, we show how to efficiently take into account the potential sitesâ global shape, which is a critical cue in man-made scenes. Our method relies on component tree segmentation algorithm and a new shape regularity measure to look for polygonal regions in video sequences. In this way we enforce both temporal consistency and geometric regularity, resulting in reliable and consistent detections. Third, we propose a generic contour grouping based object detection approach by exploring promising cycles in a line fragment graph. Previous contour-based methods are limited to use additive scoring functions. In this thesis, we propose an approximate search approach that eliminates this restriction. Given a weighted line fragment graph, we prune its cycle space by removing cycles containing weak nodes or weak edges, until the upper bound of the cycle space is less than the threshold defined by the cyclomatic number. Object contours are then detected as maximally scoring elementary circuits in the pruned cycle space. Furthermore, we propose another more efficient algorithm, which reconstructs the graph by grouping the strongest edges iteratively until the number of the cycles reaches the upper bound. Our approximate search approaches can be used with any cycle scoring function. Moreover, unlike other contour grouping based approaches, our approach does not rely on a greedy strategy for… Advisors/Committee Members: Fua, Pascal.

Subjects/Keywords: Image processing; computer vision; object detection; image segmentation; polygon; contour grouping; cycle basis; component tree; line segment detection; automated landing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sun, X. (2015). Localizing Polygonal Objects in Man-Made Environments. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/210604

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Sun, Xiaolu. “Localizing Polygonal Objects in Man-Made Environments.” 2015. Thesis, EPFL. Accessed December 11, 2019. http://infoscience.epfl.ch/record/210604.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Sun, Xiaolu. “Localizing Polygonal Objects in Man-Made Environments.” 2015. Web. 11 Dec 2019.

Vancouver:

Sun X. Localizing Polygonal Objects in Man-Made Environments. [Internet] [Thesis]. EPFL; 2015. [cited 2019 Dec 11]. Available from: http://infoscience.epfl.ch/record/210604.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sun X. Localizing Polygonal Objects in Man-Made Environments. [Thesis]. EPFL; 2015. Available from: http://infoscience.epfl.ch/record/210604

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Pretoria

11. Venter, Petrus Johannes. Feasibility of CMOS optical clock distribution networks.

Degree: Electrical, Electronic and Computer Engineering, 2010, University of Pretoria

URL: http://hdl.handle.net/2263/26440

► CMOS is well known for its ability to scale. This fact is reflected in the aggressive scaling on a continual basis from the invention of… (more)

Subjects/Keywords: Clock disribution; Cmos; Optical clock; Optical interconnect; Repeater; H-tree; Detection; Power consumption; UCTD

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Venter, P. J. (2010). Feasibility of CMOS optical clock distribution networks. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/26440

Chicago Manual of Style (16^th Edition):

Venter, Petrus Johannes. “Feasibility of CMOS optical clock distribution networks.” 2010. Masters Thesis, University of Pretoria. Accessed December 11, 2019. http://hdl.handle.net/2263/26440.

MLA Handbook (7^th Edition):

Venter, Petrus Johannes. “Feasibility of CMOS optical clock distribution networks.” 2010. Web. 11 Dec 2019.

Vancouver:

Venter PJ. Feasibility of CMOS optical clock distribution networks. [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2263/26440.

Council of Science Editors:

Venter PJ. Feasibility of CMOS optical clock distribution networks. [Masters Thesis]. University of Pretoria; 2010. Available from: http://hdl.handle.net/2263/26440

Linnaeus University

12. Bahtiyar, Muhammed Yasin. JClone: Syntax tree based clone detection for Java.

Degree: Physics and Mathematics, 2010, Linnaeus University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-5455

► An unavoidable amount of money is spent on maintaining existing software systems today. Software maintenance cost generally higher than development cost of the system… (more)

Subjects/Keywords: clone detection; abstract syntax tree; java; eclipse; software; maintenance; Software Engineering; Programvaruteknik

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bahtiyar, M. Y. (2010). JClone: Syntax tree based clone detection for Java. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-5455

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bahtiyar, Muhammed Yasin. “JClone: Syntax tree based clone detection for Java.” 2010. Thesis, Linnaeus University. Accessed December 11, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-5455.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bahtiyar, Muhammed Yasin. “JClone: Syntax tree based clone detection for Java.” 2010. Web. 11 Dec 2019.

Vancouver:

Bahtiyar MY. JClone: Syntax tree based clone detection for Java. [Internet] [Thesis]. Linnaeus University; 2010. [cited 2019 Dec 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-5455.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bahtiyar MY. JClone: Syntax tree based clone detection for Java. [Thesis]. Linnaeus University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-5455

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Pretoria

13. Venter, Petrus Johannes. Feasibility of CMOS optical clock distribution networks .

Degree: 2010, University of Pretoria

URL: http://upetd.up.ac.za/thesis/available/etd-07202010-194604/

► CMOS is well known for its ability to scale. This fact is reflected in the aggressive scaling on a continual basis from the invention of… (more)

Subjects/Keywords: Clock disribution; Cmos; Optical clock; Optical interconnect; Repeater; H-tree; Detection; Power consumption; UCTD

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Venter, P. J. (2010). Feasibility of CMOS optical clock distribution networks . (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-07202010-194604/

Chicago Manual of Style (16^th Edition):

Venter, Petrus Johannes. “Feasibility of CMOS optical clock distribution networks .” 2010. Masters Thesis, University of Pretoria. Accessed December 11, 2019. http://upetd.up.ac.za/thesis/available/etd-07202010-194604/.

MLA Handbook (7^th Edition):

Venter, Petrus Johannes. “Feasibility of CMOS optical clock distribution networks .” 2010. Web. 11 Dec 2019.

Vancouver:

Venter PJ. Feasibility of CMOS optical clock distribution networks . [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2019 Dec 11]. Available from: http://upetd.up.ac.za/thesis/available/etd-07202010-194604/.

Council of Science Editors:

Venter PJ. Feasibility of CMOS optical clock distribution networks . [Masters Thesis]. University of Pretoria; 2010. Available from: http://upetd.up.ac.za/thesis/available/etd-07202010-194604/

Université Catholique de Louvain

14. Martin, Xavier. Fast sequential implementation of a lightweight, data stream driven, parallel language with application to intrusion detection.

Degree: 2007, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/6253

►

The general problem we consider in this thesis is the following: we have to analyze a stream of data (records, packets, events ...) by successively… (more)

▼

The general problem we consider in this thesis is the following: we have to analyze a stream of data (records, packets, events ...) by successively applying to each piece of data a set of ``rules'. Rules are best viewed as lightweight parallel processes synchronizing on each arrival of a new piece of data. In many applications, such as signature-based intrusion detection, only a few rules are concerned with each new piece of data. But all other rules have to be executed anyway just to conclude that they can ignore it. Our goal is to make it possible to avoid this useless work completely. To do so, we perform a static analysis of the code of each rule and we build a decision tree that we apply to each piece of data before executing the rule. The decision tree tells us whether executing the rule or not will change anything to the global analysis results. The decision trees are built at compile time, but their evaluation at each cycle (i.e., for each piece of data) entails an overhead. Thus we organize the set of all computed decision trees in a way that makes their evaluation as fast as possible. The two main original contributions of this thesis are the following. Firstly, we propose a method to organize the set of decision trees and the set of active rules in such a way that deciding which rules to execute can be made optimally in O(r_u), where r_u is the number of useful rules. This time complexity is thus independent of the actual (total) number of active rules. This method is based on the use of a global decision tree that integrates all individual decision trees built from the code of the rules. Secondly, as such a global tree may quickly become much too large if usual data structures are used, we introduce a novel kind of data structure called sequential tree that allows us to keep global decision trees much smaller in many situations where the individual trees share few common conditions. (When many conditions are shared by individual trees the global tree remains small.) To assess our contribution, we first modify the implementation of ASAX, a generic system for data stream analysis based on the rule paradigm presented above. Then we compare the efficiency of the optimized system with respect to its original implementation, using the MIT Lincoln Laboratory Evaluation Dataset and a classical set of intrusion detection rules. Impressive speed-ups are obtained. Finally, our optimized implementation has been used by Nicolas Vanderavero, in his PhD thesis, for the design of stateful honeytanks (i.e., low-interaction honeypots). It makes it possible to simulate tens of thousands hosts on a single computer, with a high level of realism.

(FSA 3) – UCL, 2007

Advisors/Committee Members: UCL - FSA/INGI - Département d'ingénierie informatique, Le Charlier, Baudouin, Deville, Yves, Van Lamsweerde, Axel, Mounji, Abdelaziz, Ducassé, Mireille, Dacier, Marc.

Subjects/Keywords: Decision tree; Parallel analyses; Intrusion detection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Martin, X. (2007). Fast sequential implementation of a lightweight, data stream driven, parallel language with application to intrusion detection. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/6253

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Martin, Xavier. “Fast sequential implementation of a lightweight, data stream driven, parallel language with application to intrusion detection.” 2007. Thesis, Université Catholique de Louvain. Accessed December 11, 2019. http://hdl.handle.net/2078.1/6253.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Martin, Xavier. “Fast sequential implementation of a lightweight, data stream driven, parallel language with application to intrusion detection.” 2007. Web. 11 Dec 2019.

Vancouver:

Martin X. Fast sequential implementation of a lightweight, data stream driven, parallel language with application to intrusion detection. [Internet] [Thesis]. Université Catholique de Louvain; 2007. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2078.1/6253.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Martin X. Fast sequential implementation of a lightweight, data stream driven, parallel language with application to intrusion detection. [Thesis]. Université Catholique de Louvain; 2007. Available from: http://hdl.handle.net/2078.1/6253

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

15. Clyde, Georgia Emily. A fine-scale lidar-based habitat suitability mapping methodology for the marbled murrelet (Brachyramphus marmoratus) on Vancouver Island, British Columbia.

Degree: Department of Geography, 2017, University of Victoria

URL: http://hdl.handle.net/1828/7923

► The marbled murrelet (Brachyramphus marmoratus) is a Threatened seabird with very particular nesting requirements. They choose to nest almost exclusively on mossy platforms, provided by… (more)

▼ The marbled murrelet (Brachyramphus marmoratus) is a Threatened seabird with very particular nesting requirements. They choose to nest almost exclusively on mossy platforms, provided by large branches or deformities, in the upper canopies of coniferous old-growth trees located within 50 km of the ocean. Due primarily to a loss of this nesting habitat, populations in B.C. have seen significant decline over the past several decades. As such, reliable spatial habitat data are required to facilitate efficient management of the species and its remaining habitats. Current habitat mapping methodologies are limited by their qualitative assessment of habitat attributes and the large, stand-based spatial scale at which they classify and map habitat. This research aimed to address these limitations by utilizing light detection and ranging (lidar) technologies to develop an object-based habitat mapping methodology capable of quantitatively mapping habitat suitability at the scale of an individual tree on Northern Vancouver Island, British Columbia (B.C.). Using a balanced random forest (BRF) classification algorithm and in-field habitat suitability data derived from low-level aerial surveys (LLAS), a series of lidar-derived terrain and canopy descriptors were used to predict the habitat suitability (Rank 1: Very High Suitability – Rank 6: Nil Suitability) of lidar-derived individual tree objects. The classification model reported an overall classification accuracy of 71%, with Rank 1 – Rank 5 reporting individual class accuracies of 90%, 86%, 74%, 67%, and 98%, respectively. Evaluation of the object-based predictive habitat suitability maps provided evidence that this new methodology is capable of identifying and quantifying within-stand habitat variability at the scale of an individual tree. This improved quantification provides a superior level of habitat differentiation currently unattainable using existing habitat mapping methods. As the total amount of suitable nesting habitat in B.C. is expected to continue to decline, this improved quantification is a critical advancement for strategic managers, facilitating improved habitat and species management. Advisors/Committee Members: Niemann, K. O. (Knut Olaf) (supervisor).

Subjects/Keywords: lidar; marbled murrelet; balanced random forest; habitat classification; habitat suitability; single tree detection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Clyde, G. E. (2017). A fine-scale lidar-based habitat suitability mapping methodology for the marbled murrelet (Brachyramphus marmoratus) on Vancouver Island, British Columbia. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7923

Chicago Manual of Style (16^th Edition):

Clyde, Georgia Emily. “A fine-scale lidar-based habitat suitability mapping methodology for the marbled murrelet (Brachyramphus marmoratus) on Vancouver Island, British Columbia.” 2017. Masters Thesis, University of Victoria. Accessed December 11, 2019. http://hdl.handle.net/1828/7923.

MLA Handbook (7^th Edition):

Clyde, Georgia Emily. “A fine-scale lidar-based habitat suitability mapping methodology for the marbled murrelet (Brachyramphus marmoratus) on Vancouver Island, British Columbia.” 2017. Web. 11 Dec 2019.

Vancouver:

Clyde GE. A fine-scale lidar-based habitat suitability mapping methodology for the marbled murrelet (Brachyramphus marmoratus) on Vancouver Island, British Columbia. [Internet] [Masters thesis]. University of Victoria; 2017. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1828/7923.

Council of Science Editors:

Clyde GE. A fine-scale lidar-based habitat suitability mapping methodology for the marbled murrelet (Brachyramphus marmoratus) on Vancouver Island, British Columbia. [Masters Thesis]. University of Victoria; 2017. Available from: http://hdl.handle.net/1828/7923

University of Houston

16. Raines, Calvin E 1992-. Attribute Selection Using Machine Learning Algorithms for Intrusion Detection.

Degree: Computer Science, Department of, 2018, University of Houston

URL: http://hdl.handle.net/10657/3453

► As technology progresses, more critical information is being stored on computers. This allows the data to be stored more compactly, and sometimes adds benefits such… (more)

▼ As technology progresses, more critical information is being stored on computers. This allows the data to be stored more compactly, and sometimes adds benefits such as searchability. At the same time, these storage spaces are often connected through a network to the outside world. This increases the chance of attack, as clever thieves can now access the data remotely. Authentication methods can be used to try and block attackers, but hackers can get around them by gaining access to user credentials. Then they can steal data under the guise of a normal user. To combat this, I look at how attacker activity differs from normal user activity. I used two categories from the Windows-Users and -Intruder simulations Logs dataset, one of time and the other of file pathway. From these categories, I calculated ten attributes. Each attribute has an intuitive expectation of highlighting differences between attack and normal behavior. Then various methods were used to analyze the attributes. First, I looked at how a simple threshold on each attribute would perform individually. Correlation between the attributes was considered to avoid information overlap. Then I used a white-box machine learning method. First it was trained with all the attributes, and the second time it was trained with only the attributes that performed well with a simple threshold. Next, I used a black-box machine learning method. This method was trained once with all attributes, once with the best individual attributes, and once with the attributes selected by the white-box method. I found that only a couple of the original attributes did well on their own. However, most of the attributes selected by the white-box method were poor individual performers. The black-box method did best with the attributes selected by the white-box method, and worst with the best individual performers. The white-box method strongly outperformed the black-box method on attack data, but did slightly worse at correctly identifying normal data. Advisors/Committee Members: Huang, S.-H. Stephen (advisor), Verma, Rakesh M (committee member), Conklin, Wm. Arthur (committee member).

Subjects/Keywords: intrusion detection; machine learning; WUIL; data theft; recursive partitioning; decision tree; deep neural network

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Raines, C. E. 1. (2018). Attribute Selection Using Machine Learning Algorithms for Intrusion Detection. (Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/3453

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Raines, Calvin E 1992-. “Attribute Selection Using Machine Learning Algorithms for Intrusion Detection.” 2018. Thesis, University of Houston. Accessed December 11, 2019. http://hdl.handle.net/10657/3453.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Raines, Calvin E 1992-. “Attribute Selection Using Machine Learning Algorithms for Intrusion Detection.” 2018. Web. 11 Dec 2019.

Vancouver:

Raines CE1. Attribute Selection Using Machine Learning Algorithms for Intrusion Detection. [Internet] [Thesis]. University of Houston; 2018. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10657/3453.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Raines CE1. Attribute Selection Using Machine Learning Algorithms for Intrusion Detection. [Thesis]. University of Houston; 2018. Available from: http://hdl.handle.net/10657/3453

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Clemson University

17. Chen, Qi. Water-Tree Modelling and Detection for Underground Cables.

Degree: PhD, Electrical and Computer Engineering (Holcomb Dept. of), 2017, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/1993

► In recent years, aging infrastructure has become a major concern for the power industry. Since its inception in early 20th century, the electrical system has… (more)

▼ In recent years, aging infrastructure has become a major concern for the power industry. Since its inception in early 20th century, the electrical system has been the cornerstone of an industrial society. Stable and uninterrupted delivery of electrical power is now a base necessity for the modern world. As the times march-on, however, the electrical infrastructure ages and there is the inevitable need to renew and replace the existing system. Unfortunately, due to time and financial constraints, many electrical systems today are forced to operate beyond their original design and power utilities must find ways to prolong the lifespan of older equipment. Thus, the concept of preventative maintenance arises. Preventative maintenance allows old equipment to operate longer and at better efficiency, but in order to implement preventative maintenance, the operators must know minute details of the electrical system, especially some of the harder to assess issues such water-tree. Water-tree induced insulation degradation is a problem typically associated with older cable systems. It is a very high impedance phenomenon and it is difficult to detect using traditional methods such as Tan-Delta or Partial Discharge. The proposed dissertation studies water-tree development in underground cables, potential methods to detect water-tree location and water-tree severity estimation. The dissertation begins by developing mathematical models of water-tree using finite element analysis. The method focuses on surface-originated vented tree, the most prominent type of water-tree fault in the field. Using the standard operation parameters of North American electrical systems, the water-tree boundary conditions are defined. By applying finite element analysis technique, the complex water-tree structure is broken down to homogeneous components. The result is a generalized representation of water-tree capacitance at different stages of development. The result from the finite element analysis is used to model water-tree in large system. Both empirical measurements and the mathematical model show that the impedance of early-stage water-tree is extremely large. As the result, traditional detection methods such Tan-Delta or Partial Discharge are not effective due to the excessively high accuracy requirement. A high-frequency pulse detection method is developed instead. The water-tree impedance is capacitive in nature and it can be reduced to manageable level by high-frequency inputs. The method is able to determine the location of early-stage water-tree in long-distance cables using economically feasible equipment. A pattern recognition method is developed to estimate the severity of water-tree using its pulse response from the high-frequency test method. The early-warning system for water-tree appearance is a tool developed to assist the practical implementation of the high-frequency pulse detection method. Although the equipment used by the detection method is economically feasible, it is still a specialized test and not… Advisors/Committee Members: Dr. Daniel L. Noneaker, Chair, Dr. Elham B. Makram, Advisor, Dr. Richard E. Groff, Dr. Carl W. Baum, Dr. John R. Wagner.

Subjects/Keywords: detection; early warning; finite element analysis; high frequency; remote estimation; water tree

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chen, Q. (2017). Water-Tree Modelling and Detection for Underground Cables. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/1993

Chicago Manual of Style (16^th Edition):

Chen, Qi. “Water-Tree Modelling and Detection for Underground Cables.” 2017. Doctoral Dissertation, Clemson University. Accessed December 11, 2019. https://tigerprints.clemson.edu/all_dissertations/1993.

MLA Handbook (7^th Edition):

Chen, Qi. “Water-Tree Modelling and Detection for Underground Cables.” 2017. Web. 11 Dec 2019.

Vancouver:

Chen Q. Water-Tree Modelling and Detection for Underground Cables. [Internet] [Doctoral dissertation]. Clemson University; 2017. [cited 2019 Dec 11]. Available from: https://tigerprints.clemson.edu/all_dissertations/1993.

Council of Science Editors:

Chen Q. Water-Tree Modelling and Detection for Underground Cables. [Doctoral Dissertation]. Clemson University; 2017. Available from: https://tigerprints.clemson.edu/all_dissertations/1993

University of Cambridge

18. Lee, Juheon. Mapping individual trees from airborne multi-sensor imagery.

Degree: PhD, 2016, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/266686 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.723521

► Airborne multi-sensor imaging is increasingly used to examine vegetation properties. The advantage of using multiple types of sensor is that each detects a different feature… (more)

▼ Airborne multi-sensor imaging is increasingly used to examine vegetation properties. The advantage of using multiple types of sensor is that each detects a different feature of the vegetation, so that collectively they provide a detailed understanding of the ecological pattern. Specifically, Light Detection And Ranging (LiDAR) devices produce detailed point clouds of where laser pulses have been backscattered from surfaces, giving information on vegetation structure; hyperspectral sensors measure reflectances within narrow wavebands, providing spectrally detailed information about the optical properties of targets; while aerial photographs provide high spatial-resolution imagery so that they can provide more feature details which cannot be identified from hyperspectral or LiDAR intensity images. Using a combination of these sensors, effective techniques can be developed for mapping species and inferring leaf physiological processes at ITC-level. Although multi-sensor approaches have revolutionised ecological research, their application in mapping individual tree crowns is limited by two major technical issues: (a) Multi-sensor imaging requires all images taken from different sensors to be co-aligned, but different sensor characteristics result in scale, rotation or translation mismatches between the images, making correction a pre-requisite of individual tree crown mapping; (b) reconstructing individual tree crowns from unstructured raw data space requires an accurate tree delineation algorithm. This thesis develops a schematic way to resolve these technical issues using the-state-of-the-art computer vision algorithms. A variational method, called NGF-Curv, was developed to co-align hyperspectral imagery, LiDAR and aerial photographs. NGF-Curv algorithm can deal with very complex topographic and lens distortions efficiently, thus improving the accuracy of co-alignment compared to established image registration methods for airborne data. A graph cut method, named MCNCP-RNC was developed to reconstruct individual tree crowns from fully integrated multi-sensor imagery. MCNCP-RNC is not influenced by interpolation artefacts because it detects trees in 3D, and it detects individual tree crowns using both hyperspectral imagery and LiDAR. Based on these algorithms, we developed a new workflow to detect species at pixel and ITC levels in a temperate deciduous forest in the UK. In addition, we modified the workflow to monitor physiological responses of two oak species with respect to environmental gradients in a Mediterranean woodland in Spain. The results show that our scheme can detect individual tree crowns, find species and monitor physiological responses of canopy leaves.

Subjects/Keywords: 621.36; Remote Sensing; Image Processing; Image segmentation; Image registration; Tree species detection; LiDAR; Hyperspectral Imagery

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lee, J. (2016). Mapping individual trees from airborne multi-sensor imagery. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/266686 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.723521

Chicago Manual of Style (16^th Edition):

Lee, Juheon. “Mapping individual trees from airborne multi-sensor imagery.” 2016. Doctoral Dissertation, University of Cambridge. Accessed December 11, 2019. https://www.repository.cam.ac.uk/handle/1810/266686 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.723521.

MLA Handbook (7^th Edition):

Lee, Juheon. “Mapping individual trees from airborne multi-sensor imagery.” 2016. Web. 11 Dec 2019.

Vancouver:

Lee J. Mapping individual trees from airborne multi-sensor imagery. [Internet] [Doctoral dissertation]. University of Cambridge; 2016. [cited 2019 Dec 11]. Available from: https://www.repository.cam.ac.uk/handle/1810/266686 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.723521.

Council of Science Editors:

Lee J. Mapping individual trees from airborne multi-sensor imagery. [Doctoral Dissertation]. University of Cambridge; 2016. Available from: https://www.repository.cam.ac.uk/handle/1810/266686 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.723521

University of Cambridge

19. Lee, Juheon. Mapping individual trees from airborne multi-sensor imagery .

Degree: 2016, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/266686

► Airborne multi-sensor imaging is increasingly used to examine vegetation properties. The advantage of using multiple types of sensor is that each detects a different feature… (more)

▼ Airborne multi-sensor imaging is increasingly used to examine vegetation properties. The advantage of using multiple types of sensor is that each detects a different feature of the vegetation, so that collectively they provide a detailed understanding of the ecological pattern. Specifically, Light Detection And Ranging (LiDAR) devices produce detailed point clouds of where laser pulses have been backscattered from surfaces, giving information on vegetation structure; hyperspectral sensors measure reflectances within narrow wavebands, providing spectrally detailed information about the optical properties of targets; while aerial photographs provide high spatial-resolution imagery so that they can provide more feature details which cannot be identified from hyperspectral or LiDAR intensity images. Using a combination of these sensors, effective techniques can be developed for mapping species and inferring leaf physiological processes at ITC-level. Although multi-sensor approaches have revolutionised ecological research, their application in mapping individual tree crowns is limited by two major technical issues: (a) Multi-sensor imaging requires all images taken from different sensors to be co-aligned, but different sensor characteristics result in scale, rotation or translation mismatches between the images, making correction a pre-requisite of individual tree crown mapping; (b) reconstructing individual tree crowns from unstructured raw data space requires an accurate tree delineation algorithm. This thesis develops a schematic way to resolve these technical issues using the-state-of-the-art computer vision algorithms. A variational method, called NGF-Curv, was developed to co-align hyperspectral imagery, LiDAR and aerial photographs.NGF-Curv algorithm can deal with very complex topographic and lens distortions efficiently, thus improving the accuracy of co-alignment compared to established image registration methods for airborne data. A graph cut method, named MCNCP-RNC was developed to reconstruct individual tree crowns from fully integrated multi-sensor imagery. MCNCP-RNC is not influenced by interpolation artefacts because it detects trees in 3D, and it detects individual tree crowns using both hyperspectral imagery and LiDAR. Based on these algorithms, we developed a new workflow to detect species at pixel and ITC levels in a temperate deciduous forest in the UK. In addition, we modified the workflow to monitor physiological responses of two oak species with respect to environmental gradients in a Mediterranean woodland in Spain. The results show that our scheme can detect individual tree crowns, find species and monitor physiological responses of canopy leaves.

Subjects/Keywords: Remote Sensing; Image Processing; Image segmentation; Image registration; Tree species detection; LiDAR; Hyperspectral Imagery

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lee, J. (2016). Mapping individual trees from airborne multi-sensor imagery . (Thesis). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/266686

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lee, Juheon. “Mapping individual trees from airborne multi-sensor imagery .” 2016. Thesis, University of Cambridge. Accessed December 11, 2019. https://www.repository.cam.ac.uk/handle/1810/266686.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lee, Juheon. “Mapping individual trees from airborne multi-sensor imagery .” 2016. Web. 11 Dec 2019.

Vancouver:

Lee J. Mapping individual trees from airborne multi-sensor imagery . [Internet] [Thesis]. University of Cambridge; 2016. [cited 2019 Dec 11]. Available from: https://www.repository.cam.ac.uk/handle/1810/266686.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lee J. Mapping individual trees from airborne multi-sensor imagery . [Thesis]. University of Cambridge; 2016. Available from: https://www.repository.cam.ac.uk/handle/1810/266686

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

George Mason University

20. Zhou, Weiwei. Computationally Efficient Equalizer Design .

Degree: 2014, George Mason University

URL: http://hdl.handle.net/1920/8989

► Intersymbol interference (ISI) caused by frequency selective multipath propagation is a primary source of distortion in wireless communication systems. ISI significantly degrades system performance, and… (more)

Subjects/Keywords: Electrical engineering; Asymptotic efficiency; Blind sequential detection; Equalizer design; sparse ISI channel; Tree search

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhou, W. (2014). Computationally Efficient Equalizer Design . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/8989

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zhou, Weiwei. “Computationally Efficient Equalizer Design .” 2014. Thesis, George Mason University. Accessed December 11, 2019. http://hdl.handle.net/1920/8989.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zhou, Weiwei. “Computationally Efficient Equalizer Design .” 2014. Web. 11 Dec 2019.

Vancouver:

Zhou W. Computationally Efficient Equalizer Design . [Internet] [Thesis]. George Mason University; 2014. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1920/8989.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhou W. Computationally Efficient Equalizer Design . [Thesis]. George Mason University; 2014. Available from: http://hdl.handle.net/1920/8989

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

North Carolina State University

21. Mahalati, Jaideep. Facilitating Alert Correlation Using Resource Trees.

Degree: MS, Computer Science, 2005, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/2759

► With the steady increase in the number of attacks against networks and hosts, security systems such as intrusion detection systems are widely deployed into networks.… (more)

▼ With the steady increase in the number of attacks against networks and hosts, security systems such as intrusion detection systems are widely deployed into networks. Intrusion detection systems may flag large numbers of alerts, where false alerts are mixed with true ones. To understand the security threats and take appropriate actions, it is necessary to perform alert correlation. One class of alert correlation methods is the prerequisite and consequence based approach, where the prerequisite of an attack is the necessary condition to launch the attack, and the consequence of an attack is the possible outcome if the attack succeeds. Through matching the consequence of earlier attacks with the prerequisites of later ones, attack scenarios can be discovered. However, one limitation of these approaches is that the specification of prerequisites and consequences for different alert types usually is time-consuming and error-prone. To address this limitation, this thesis proposes a resource tree based method to facilitate the specification of prerequisites and consequences. Attacks can be viewed from the perspective of resources. Example resources include various network services and privileges. This thesis further organizes resources into trees, where the nodes in the trees are labelled with conditions (represented by predicates). To specify the prerequisite and consequence of an attack, it is required to look for the desirable resource trees related to the attack's prerequisite and consequence, then traverse the trees to find the appropriate nodes, and finally select the suitable predicates to put into the prerequisite and consequence. This approach is simple and less expert-dependent. The usability study and comprehensiveness study (with more than 3000 alert types) demonstrate the effectiveness of this approach. Correlation results with different datasets further show that prerequisites and consequences defined using our methodology can be effectively used for alert correlation. Advisors/Committee Members: Dr. Peng Ning, Committee Chair (advisor), Dr. Douglas S. Reeves, Committee Member (advisor), Dr. Ting Yu, Committee Member (advisor).

Subjects/Keywords: Resource Tree; Alert Correlation; Intrusion Detection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mahalati, J. (2005). Facilitating Alert Correlation Using Resource Trees. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/2759

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Mahalati, Jaideep. “Facilitating Alert Correlation Using Resource Trees.” 2005. Thesis, North Carolina State University. Accessed December 11, 2019. http://www.lib.ncsu.edu/resolver/1840.16/2759.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Mahalati, Jaideep. “Facilitating Alert Correlation Using Resource Trees.” 2005. Web. 11 Dec 2019.

Vancouver:

Mahalati J. Facilitating Alert Correlation Using Resource Trees. [Internet] [Thesis]. North Carolina State University; 2005. [cited 2019 Dec 11]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2759.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mahalati J. Facilitating Alert Correlation Using Resource Trees. [Thesis]. North Carolina State University; 2005. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2759

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto

22. Gallego, Cristina. Computer-aided Diagnosis for MRI Screening of the Breast in High Risk Women.

Degree: PhD, 2019, University of Toronto

URL: http://hdl.handle.net/1807/95844

► Breast cancer is currently the second leading cause of death from cancer in Canadian women. Routine mammograms are considered the best screening approach for early… (more)

Subjects/Keywords: Cancer detection and diagnosis; Computer-aided diagnosis; Decision tree classifiers; Magnetic resonance imaging; 0800

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gallego, C. (2019). Computer-aided Diagnosis for MRI Screening of the Breast in High Risk Women. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/95844

Chicago Manual of Style (16^th Edition):

Gallego, Cristina. “Computer-aided Diagnosis for MRI Screening of the Breast in High Risk Women.” 2019. Doctoral Dissertation, University of Toronto. Accessed December 11, 2019. http://hdl.handle.net/1807/95844.

MLA Handbook (7^th Edition):

Gallego, Cristina. “Computer-aided Diagnosis for MRI Screening of the Breast in High Risk Women.” 2019. Web. 11 Dec 2019.

Vancouver:

Gallego C. Computer-aided Diagnosis for MRI Screening of the Breast in High Risk Women. [Internet] [Doctoral dissertation]. University of Toronto; 2019. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1807/95844.

Council of Science Editors:

Gallego C. Computer-aided Diagnosis for MRI Screening of the Breast in High Risk Women. [Doctoral Dissertation]. University of Toronto; 2019. Available from: http://hdl.handle.net/1807/95844

University of Sydney

23. Bargoti, Suchet. Fruit Detection and Tree Segmentation for Yield Mapping in Orchards .

Degree: 2017, University of Sydney

URL: http://hdl.handle.net/2123/17021

► Accurate information gathering and processing is critical for precision horticulture, as growers aim to optimise their farm management practices. An accurate inventory of the crop… (more)

▼ Accurate information gathering and processing is critical for precision horticulture, as growers aim to optimise their farm management practices. An accurate inventory of the crop that details its spatial distribution along with health and maturity, can help farmers efficiently target processes such as chemical and fertiliser spraying, crop thinning, harvest management, labour planning and marketing. Growers have traditionally obtained this information by using manual sampling techniques, which tend to be labour intensive, spatially sparse, expensive, inaccurate and prone to subjective biases. Recent advances in sensing and automation for field robotics allow for key measurements to be made for individual plants throughout an orchard in a timely and accurate manner. Farmer operated machines or unmanned robotic platforms can be equipped with a range of sensors to capture a detailed representation over large areas. Robust and accurate data processing techniques are therefore required to extract high level information needed by the grower to support precision farming. This thesis focuses on yield mapping in orchards using image and light detection and ranging (LiDAR) data captured using an unmanned ground vehicle (UGV). The contribution is the framework and algorithmic components for orchard mapping and yield estimation that is applicable to different fruit types and orchard configurations. The framework includes detection of fruits in individual images and tracking them over subsequent frames. The fruit counts are then associated to individual trees, which are segmented from image and LiDAR data, resulting in a structured spatial representation of yield. The first contribution of this thesis is the development of a generic and robust fruit detection algorithm. Images captured in the outdoor environment are susceptible to highly variable external factors that lead to significant appearance variations. Specifically in orchards, variability is caused by changes in illumination, target pose, tree types, etc. The proposed techniques address these issues by using state-of-the-art feature learning approaches for image classification, while investigating the utility of orchard domain knowledge for fruit detection. Detection is performed using both pixel-wise classification of images followed instance segmentation, and bounding-box regression approaches. The experimental results illustrate the versatility of complex deep learning approaches over a multitude of fruit types. The second contribution of this thesis is a tree segmentation approach to detect the individual trees that serve as a standard unit for structured orchard information systems. The work focuses on trellised trees, which present unique challenges for segmentation algorithms due to their intertwined nature. LiDAR data are used to segment the trellis face, and to generate proposals for individual trees trunks. Additional trunk proposals are provided using pixel-wise classification of the image data. The multi-modal observations are fine-tuned by…

Subjects/Keywords: fruit detection; tree segmentation; yield mapping; computer vision; field robotics; machine learning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bargoti, S. (2017). Fruit Detection and Tree Segmentation for Yield Mapping in Orchards . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/17021

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bargoti, Suchet. “Fruit Detection and Tree Segmentation for Yield Mapping in Orchards .” 2017. Thesis, University of Sydney. Accessed December 11, 2019. http://hdl.handle.net/2123/17021.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bargoti, Suchet. “Fruit Detection and Tree Segmentation for Yield Mapping in Orchards .” 2017. Web. 11 Dec 2019.

Vancouver:

Bargoti S. Fruit Detection and Tree Segmentation for Yield Mapping in Orchards . [Internet] [Thesis]. University of Sydney; 2017. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2123/17021.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bargoti S. Fruit Detection and Tree Segmentation for Yield Mapping in Orchards . [Thesis]. University of Sydney; 2017. Available from: http://hdl.handle.net/2123/17021

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Cape Peninsula University of Technology

24. Botes, Frans Hendrik. Ant tree miner amyntas for intrusion detection .

Degree: 2018, Cape Peninsula University of Technology

URL: http://etd.cput.ac.za/handle/20.500.11838/2865

► With the constant evolution of information systems, companies have to acclimatise to the vast increase of data flowing through their networks. Business processes rely heavily… (more)

Subjects/Keywords: Ant Tree Miner; Intrusion detection systems (Computer security); Computer networks – Security measures; Computer algorithms

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Botes, F. H. (2018). Ant tree miner amyntas for intrusion detection . (Thesis). Cape Peninsula University of Technology. Retrieved from http://etd.cput.ac.za/handle/20.500.11838/2865

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Botes, Frans Hendrik. “Ant tree miner amyntas for intrusion detection .” 2018. Thesis, Cape Peninsula University of Technology. Accessed December 11, 2019. http://etd.cput.ac.za/handle/20.500.11838/2865.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Botes, Frans Hendrik. “Ant tree miner amyntas for intrusion detection .” 2018. Web. 11 Dec 2019.

Vancouver:

Botes FH. Ant tree miner amyntas for intrusion detection . [Internet] [Thesis]. Cape Peninsula University of Technology; 2018. [cited 2019 Dec 11]. Available from: http://etd.cput.ac.za/handle/20.500.11838/2865.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Botes FH. Ant tree miner amyntas for intrusion detection . [Thesis]. Cape Peninsula University of Technology; 2018. Available from: http://etd.cput.ac.za/handle/20.500.11838/2865

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Khameneh, Mohammad Amin Alizadeh. Tree Detection and Species Identification using LiDAR Data.

Degree: Geodesy and Geoinformatics, 2013, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-119269

► The importance of single-tree-based information for forest management and related industries in countries like Sweden, which is covered in approximately 65% by forest, is… (more)

▼ The importance of single-tree-based information for forest management and related industries in countries like Sweden, which is covered in approximately 65% by forest, is the motivation for developing algorithms for tree detection and species identification in this study. Most of the previous studies in this field are carried out based on aerial and spectral images and less attention has been paid on detecting trees and identifying their species using laser points and clustering methods. In the first part of this study, two main approaches of clustering (hierarchical and K-means) are compared qualitatively in detecting 3-D ALS points that pertain to individual tree clusters. Further tests are performed on test sites using the supervised k-means algorithm in which the initial clustering points are defined as seed points. These points, which represent the top point of each tree are detected from the cross section analysis of the test area. Comparing those three methods (hierarchical, ordinary K-means and supervised K-means), the supervised K-means approach shows the best result for clustering single tree points. An average accuracy of 90% is achieved in detecting trees. Comparing the result of the thesis algorithms with results from the DPM software, developed by the Visimind Company for analysing LiDAR data, shows more than 85% match in detecting trees. Identification of trees is the second issue of this thesis work. For this analysis, 118 trees are extracted as reference trees with three species of spruce, pine and birch, which are the dominating species in Swedish forests. Totally six methods, including best fitted 3-D shapes (cone, sphere and cylinder) based on least squares method, point density, hull ratio and slope changes of tree outer surface are developed for identifying those species. The methods are applied on all extracted reference trees individually. For aggregating the results of all those methods, a fuzzy logic system is used because of its good reputation in combining fuzzy sets with no distinct boundaries. The best-obtained model from the fuzzy system provides 73%, 87% and 71% accuracies in identifying the birch, spruce and pine trees, respectively. The overall obtained accuracy in species categorization of trees is 77%, and this percentage is increased dealing with only coniferous and deciduous types classification. Classifying spruce and pine as coniferous versus birch as deciduous species, yielded to 84% accuracy.

Subjects/Keywords: Airborn laser scanning; point cloud classification; tree detection; tree identification

…e.g. Lämås & Eriksson, 2003). Therefore, single tree detection and related information… …single tree detection methods are higher compared to area based estimations (Næsset, 2002… …Packalén, 2009). In addition, ALS based tree detection limited in a way that it can miss a… …x29;. In addition to tree detection, the classification of trees is also involved in this… …are developed for detection and then based on clustering methods, the tree points are…

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Khameneh, M. A. A. (2013). Tree Detection and Species Identification using LiDAR Data. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-119269

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Khameneh, Mohammad Amin Alizadeh. “Tree Detection and Species Identification using LiDAR Data.” 2013. Thesis, KTH. Accessed December 11, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-119269.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Khameneh, Mohammad Amin Alizadeh. “Tree Detection and Species Identification using LiDAR Data.” 2013. Web. 11 Dec 2019.

Vancouver:

Khameneh MAA. Tree Detection and Species Identification using LiDAR Data. [Internet] [Thesis]. KTH; 2013. [cited 2019 Dec 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-119269.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Khameneh MAA. Tree Detection and Species Identification using LiDAR Data. [Thesis]. KTH; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-119269

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

KTH

26. Spik, Charlotta. Using Hash Trees for Database Schema Inconsistency Detection.

Degree: Electrical Engineering and Computer Science (EECS), 2019, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254672

►

For this work, two algorithms have been developed to improve the performance of the inconsistency detection by using Merkle trees. The first builds a… (more)

▼

For this work, two algorithms have been developed to improve the performance of the inconsistency detection by using Merkle trees. The first builds a hash tree from a database schema version, and the second compares two hash trees to find where changes have occurred. The results of performance testing done on the hash tree approach compared to the current approach used by Cisco where all data in the schema is traversed, shows that the hash tree algorithm for inconsistency detection performs significantly better than the complete traversal algorithm in all cases tested, with the exception of when all nodes have changed in the tree. The factor of improvement is directly related to the number of nodes that have to be traversed for the hash tree, which in turn depends on the number of changes done between versions and the positioning in the schema of the nodes that have changed. The real-life example scenarios used for performance testing show that on average, the hash tree algorithm only needs to traverse 1,5% of the number of nodes that the complete traversal algorithm used by Cisco does, and on average gives a 200 times improvement in performance. Even in the worst real-life case used for testing, the hash tree algorithm performed five times better than the complete traversal algorithm.

I detta arbete har två algoritmer utvecklats for att förbättra prestandan på processen att hitta skillnader mellan schemana genom att använda Merkle träd. Den första bygger ett hashträd från schemaversionen, och den andra jämför två hashträd för att hitta var förändringar har skett. Resultaten från prestandautvärderingen som gjorts på hashträdalgoritmen jämfört med nuvarande algoritm som används på Cisco där all data i schemat traverseras, visar att hashträdalgoritmen presterar signifikant bättre än algoritmen som traverserar all data i alla fall som testats, förutom då alla noder har ändrats i trädet. Förbättringsfaktorn är direkt kopplad till antalet noder som behöver traverseras för hashträdalgoritmen, vilket i sin tur beror på antalet förändringar som skett mellan versionerna och positioneringen i schemat av de noder som har förändrats. De exempelscenarior som har tagits från riktiga uppdateringar som har skett för existerande scheman visar att i genomsnitt behöver hashträdalgoritmen bara traversera 1,5% av noderna som den nuvarande algoritmen som används av Cisco måste traversera, och hashträdalgoritmen ger i genomsnitt en 200 gånger prestandaförbättring. Även i det värsta fallet för dessa uppdateringar tagna från verkliga scenarier presterade hashträdalgoritmen fem gånger bättre än algoritmen som traverserar all data i schemat.

Subjects/Keywords: Merkle Tree; Hash Tree; inconsistency detection; Anti-Entropy Repair; replica synchronization; Merkle träd; Hashträd; detektion av inkonsekvenser; Anti-Entropi Reparation; Synkronisering av replikor; Computer and Information Sciences; Data- och informationsvetenskap

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Spik, C. (2019). Using Hash Trees for Database Schema Inconsistency Detection. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254672

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Spik, Charlotta. “Using Hash Trees for Database Schema Inconsistency Detection.” 2019. Thesis, KTH. Accessed December 11, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254672.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Spik, Charlotta. “Using Hash Trees for Database Schema Inconsistency Detection.” 2019. Web. 11 Dec 2019.

Vancouver:

Spik C. Using Hash Trees for Database Schema Inconsistency Detection. [Internet] [Thesis]. KTH; 2019. [cited 2019 Dec 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254672.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Spik C. Using Hash Trees for Database Schema Inconsistency Detection. [Thesis]. KTH; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254672

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

27. Bančák, Michal. Nástroj na vizualizaci plagiátů v různých programovacích jazycích .

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/180322

► Práca sa zaoberá návrhom a implementáciou nástroja na detekciu plagiátov v programovacích jazykoch C, Python a PHP. Popisuje techniky, ktoré slúžia na zakrytie plagiátorstva. Cieľom… (more)

▼ Práca sa zaoberá návrhom a implementáciou nástroja na detekciu plagiátov v programovacích jazykoch C, Python a PHP. Popisuje techniky, ktoré slúžia na zakrytie plagiátorstva. Cieľom práce je vytvoriť návrh nástroja na detekciu a vizualizáciu plagiátov, ktoré využívajú tieto techniky a jeho následnú implementáciu. Nástroj vykonáva detekciu transformáciou zadaných vstupných projektov do formy abstraktného syntaktického stromu, ktorý je získaný pomocou lexikálnej a syntaktickej analýzy, ktoré bude následne porovnávať navrhnutým algoritmom, ktorý využíva ohodnocovanie uzlov a podstromov pomocou it{hash} funkcie. Nástroj taktiež nájdené časti kódu, u ktorých mohlo potenciálne prísť k plagiátorstvu, vizualizuje vo forme podstromu abstraktného syntaktického stromu, príslušnému danej nájdenej časti kódu. Práca ďalej popisuje testovanie tohto nástroja na identifikovaných plagiátorských technikách a špecifikuje, ktoré dokáže pri detekcii obísť. Ďalej práca načrtáva možný ďalší vývoj nástroja.; The thesis describes the design and implementation of a plagiarism tool for programming languages C, Python and PHP. It describes techniques that are used to cover a plagiarism. The aim of this work is to create a tool for detection and visualization of plagiarisms covered up using these techniques. The tool performs detection by transforming input projects into an abstract syntactic tree, which is obtained by lexical and syntactic analysis. These trees will be compared by a proposed algorithm that uses node and subtree valuation using the {hash} function. The found parts of the code that could potentially lead to plagiarism are visualized in the form of a subtree of an abstract syntactic tree that represents the parts of the code found by the tool. Further, the work describes testing of this tool on identified plagiarism techniques and specifies which of them it can eliminate. In its conclusion, the work describes the possible further development of the tool. Advisors/Committee Members: Křivka, Zbyněk (advisor).

Subjects/Keywords: Detekcia plagiátov; vizualizácia plagiátov; hash funkcia; ANTLR; stromový prístup; abstraktný syntaktický strom.; Plagiarism detection; plagiarism visualization; hash function; ANTLR; tree approach; abstract syntax tree.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bančák, M. (2019). Nástroj na vizualizaci plagiátů v různých programovacích jazycích . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/180322

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bančák, Michal. “Nástroj na vizualizaci plagiátů v různých programovacích jazycích .” 2019. Thesis, Brno University of Technology. Accessed December 11, 2019. http://hdl.handle.net/11012/180322.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bančák, Michal. “Nástroj na vizualizaci plagiátů v různých programovacích jazycích .” 2019. Web. 11 Dec 2019.

Vancouver:

Bančák M. Nástroj na vizualizaci plagiátů v různých programovacích jazycích . [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/11012/180322.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bančák M. Nástroj na vizualizaci plagiátů v různých programovacích jazycích . [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/180322

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Temple University

28. Nuzhnaya, Tatyana. ANALYSIS OF ANATOMICAL BRANCHING STRUCTURES.

Degree: PhD, 2015, Temple University

URL: http://digital.library.temple.edu/u?/p245801coll10,322471

►

Computer and Information Science

Development of state-of-the-art medical imaging modalities such as Magnetic Resonance Imaging, Computed Tomography, Galactography, MR Diffusion Tensor Imaging, and Tomosynthesis plays… (more)

Subjects/Keywords: Computer science; Artificial intelligence; Medical imaging and radiology;

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nuzhnaya, T. (2015). ANALYSIS OF ANATOMICAL BRANCHING STRUCTURES. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,322471

Chicago Manual of Style (16^th Edition):

Nuzhnaya, Tatyana. “ANALYSIS OF ANATOMICAL BRANCHING STRUCTURES.” 2015. Doctoral Dissertation, Temple University. Accessed December 11, 2019. http://digital.library.temple.edu/u?/p245801coll10,322471.

MLA Handbook (7^th Edition):

Nuzhnaya, Tatyana. “ANALYSIS OF ANATOMICAL BRANCHING STRUCTURES.” 2015. Web. 11 Dec 2019.

Vancouver:

Nuzhnaya T. ANALYSIS OF ANATOMICAL BRANCHING STRUCTURES. [Internet] [Doctoral dissertation]. Temple University; 2015. [cited 2019 Dec 11]. Available from: http://digital.library.temple.edu/u?/p245801coll10,322471.

Council of Science Editors:

Nuzhnaya T. ANALYSIS OF ANATOMICAL BRANCHING STRUCTURES. [Doctoral Dissertation]. Temple University; 2015. Available from: http://digital.library.temple.edu/u?/p245801coll10,322471

Université Montpellier II

29. Zhou, Jia. Application de l’identification d’objets sur images à l’étude de canopées de peuplements forestiers tropicaux : cas des plantations d'Eucalyptus et des mangroves : Object identification on remote sensing images of tropical forest canopies -Applications to the study of Eucalyptus plantation and mangrove forest.

Degree: Docteur es, Ecosystèmes, 2012, Université Montpellier II

URL: http://www.theses.fr/2012MON20214

►

La thèse s'inscrit dans l'étude de la structuration des forêts à partir des propriétés de la canopée telles que décrites par la distribution spatiale ou… (more)

▼

La thèse s'inscrit dans l'étude de la structuration des forêts à partir des propriétés de la canopée telles que décrites par la distribution spatiale ou la taille des houppiers des arbres dominants. L'approche suivie est fondée sur la théorie des Processus Ponctuels Marqués (PPM) qui permet de modéliser ces houppiers comme des disques sur images considérées comme un espace 2D. Le travail a consisté à évaluer le potentiel des PPM pour détecter automatiquement les houppiers d'arbres dans des images optiques de très résolution spatiale acquises sur des forêts de mangroves et des plantations d'Eucalyptus. Pour les mangroves, nous avons également travaillé sur des images simulées de réflectance et des données Lidar. Différentes adaptations (paramétrage, modèles d'énergie) de la méthode de PPM ont été testées et comparées grâce à des indices quantitatifs de comparaison entre résultats de la détection et références de positionnement issues du terrain, de photo-interprétation ou de maquettes forestières.Dans le cas des mangroves, les tailles de houppier estimées par détection restent cohérentes avec les sorties des modèles allométriques disponibles. Les résultats thématiques indiquent que la détection par PPM permet de cartographier dans une jeune plantation d'Eucalyptus la densité locale d'arbres dont la taille des houppiers est proche de la résolution spatiale de l'image (0.5m). Cependant, la qualité de la détection diminue quand le couvert se complexifie. Ce travail dresse plusieurs pistes de recherche tant mathématique, comme la prise en compte des objets de forme complexe, que thématiques, comme l'apport des informations forestières à des échelles pertinentes pour la mise au point de méthodes de télédétection.

This PhD work aims at providing information on the forest structure through the analysis of canopy properties as described by the spatial distribution and the crown size of dominant trees. Our approach is based on the Marked Point Processes (MPP) theory, which allows modeling tree crowns observed in remote sensing images by discs belonging a two dimensional space. The potential of MPP to detect the trees crowns automatically is evaluated by using very high spatial resolution optical satellite images of both Eucalyptus plantations and mangrove forest. Lidar and simulated reflectance images are also analyzed for the mangrove application. Different adaptations (parameter settings, energy models) of the MPP method are tested and compared through the development of quantitative indices that allow comparison between detection results and tree references derived from the field, photo-interpretation or the forest mockups.In the case of mangroves, the estimated crown sizes from detections are consistent with the outputs from the available allometric models. Other results indicate that tree detection by MPP allows mapping, the local density of trees of young Eucalyptus plantations even if crown size is close to the image spatial resolution (0.5m). However, the quality of detection by MPP decreases with canopy closeness.…

Advisors/Committee Members: Couteron, Pierre (thesis director), Zerubia, Josiane (thesis director).

Subjects/Keywords: Détection d'objets; Processus ponctuels marqués; Houppiers; Structure forestière; Object detection; Marked point processes; Tree crowns; Forest structure

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhou, J. (2012). Application de l’identification d’objets sur images à l’étude de canopées de peuplements forestiers tropicaux : cas des plantations d'Eucalyptus et des mangroves : Object identification on remote sensing images of tropical forest canopies -Applications to the study of Eucalyptus plantation and mangrove forest. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2012MON20214

Chicago Manual of Style (16^th Edition):

Zhou, Jia. “Application de l’identification d’objets sur images à l’étude de canopées de peuplements forestiers tropicaux : cas des plantations d'Eucalyptus et des mangroves : Object identification on remote sensing images of tropical forest canopies -Applications to the study of Eucalyptus plantation and mangrove forest.” 2012. Doctoral Dissertation, Université Montpellier II. Accessed December 11, 2019. http://www.theses.fr/2012MON20214.

MLA Handbook (7^th Edition):

Zhou, Jia. “Application de l’identification d’objets sur images à l’étude de canopées de peuplements forestiers tropicaux : cas des plantations d'Eucalyptus et des mangroves : Object identification on remote sensing images of tropical forest canopies -Applications to the study of Eucalyptus plantation and mangrove forest.” 2012. Web. 11 Dec 2019.

Vancouver:

Zhou J. Application de l’identification d’objets sur images à l’étude de canopées de peuplements forestiers tropicaux : cas des plantations d'Eucalyptus et des mangroves : Object identification on remote sensing images of tropical forest canopies -Applications to the study of Eucalyptus plantation and mangrove forest. [Internet] [Doctoral dissertation]. Université Montpellier II; 2012. [cited 2019 Dec 11]. Available from: http://www.theses.fr/2012MON20214.

Council of Science Editors:

Zhou J. Application de l’identification d’objets sur images à l’étude de canopées de peuplements forestiers tropicaux : cas des plantations d'Eucalyptus et des mangroves : Object identification on remote sensing images of tropical forest canopies -Applications to the study of Eucalyptus plantation and mangrove forest. [Doctoral Dissertation]. Université Montpellier II; 2012. Available from: http://www.theses.fr/2012MON20214

30. Luciano Teixeira de Oliveira. Aplicação do LIDAR no inventário de florestas plantadas.

Degree: 2011, UNIVERSIDADE FEDERAL DE LAVRAS

URL: http://bdtd.ufla.br//tde_busca/arquivo.php?codArquivo=3676

►

LIDAR (Light Detection and Ranging) has become an efficient tool for data extraction in forest inventory and other forest related studies. This works objective was… (more)

▼

LIDAR (Light Detection and Ranging) has become an efficient tool for data extraction in forest inventory and other forest related studies. This works objective was to establish an efficient methodology for the use of this technology with the goal of counting the number of stems in a Eucalyptus plantation in South Bahia, Brazil, from the processing of raw data up to the results in counting the number stems. The efficiency of each intermediate step is of vital importance in the quality of the results, and thus were obtained in the following processing order: organization of the raw data (3D vectors); creation of canopy height surface through Triangular Irregular Network and Inverse distance weighted interpolation (IDW); local maximum algorithm for counting the number of steams with 3X3 and 5X5 windows. The obtained results were compared to a manual counting procedure executed in a Quickbird image. The automated counting procedure had an accuracy of 97.36% in the data set generated by IDW interpolation with 5X5 window counting procedure. This result exhibits the efficiency of the methodology and its potential for future applications.

O Light Detection and Ranging, ou LIDAR, tem se tornado uma eficiente ferramenta auxiliar para a extração de dados no inventário florestal e também em outros estudos florestais. Este trabalho foi realizado com o objetivo de estabelecer uma metodologia eficiente para a utilização do LIDAR para a contagem do número de árvores em um povoamento de Eucalyptus sp., localizado no sul do estado da Bahia. Apresenta-se desde o processamento dos dados brutos obtidos em voo até o número final da contagem de árvores. Os passos intermediários são de vital importância para a qualidade dos resultados e os mesmos são obtidos por meio das seguintes etapas de processamento: organização da nuvem de pontos, criação do modelo de superfície do dossel (MSD) através da geração de uma TIN e interpolação Inverse Distance Weighted (IDW) e contagem automatizada final das árvores com um algoritmo de máxima local com janelas de 5 x 5 e 3 x 3. Os resultados obtidos foram comparados à contagem manual das árvores em imagens Quickbird para a verificação da acurácia. O acerto da contagem foi de 97,36% por meio da interpolação IDW com a janela de 5X5 para o algoritmo de contagem. Este resultado evidencia a eficácia da metodologia produzida e o potencial para futuras aplicações.

Advisors/Committee Members: Luis Marcelo Tavares de Carvalho, José Roberto Soares Scolforo, André Vital Saúde, Maria Zélia Ferreira, Lucas Rezende Gomide.

Subjects/Keywords: inventário florestal; modelagem; detecção de árvores; local máxima; RECURSOS FLORESTAIS E ENGENHARIA FLORESTAL; forest inventory; modeling; single tree detection; local maxima

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Oliveira, L. T. d. (2011). Aplicação do LIDAR no inventário de florestas plantadas. (Thesis). UNIVERSIDADE FEDERAL DE LAVRAS. Retrieved from http://bdtd.ufla.br//tde_busca/arquivo.php?codArquivo=3676

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Oliveira, Luciano Teixeira de. “Aplicação do LIDAR no inventário de florestas plantadas.” 2011. Thesis, UNIVERSIDADE FEDERAL DE LAVRAS. Accessed December 11, 2019. http://bdtd.ufla.br//tde_busca/arquivo.php?codArquivo=3676.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Oliveira, Luciano Teixeira de. “Aplicação do LIDAR no inventário de florestas plantadas.” 2011. Web. 11 Dec 2019.

Vancouver:

Oliveira LTd. Aplicação do LIDAR no inventário de florestas plantadas. [Internet] [Thesis]. UNIVERSIDADE FEDERAL DE LAVRAS; 2011. [cited 2019 Dec 11]. Available from: http://bdtd.ufla.br//tde_busca/arquivo.php?codArquivo=3676.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oliveira LTd. Aplicação do LIDAR no inventário de florestas plantadas. [Thesis]. UNIVERSIDADE FEDERAL DE LAVRAS; 2011. Available from: http://bdtd.ufla.br//tde_busca/arquivo.php?codArquivo=3676

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Open Access Theses and Dissertations