Results 251 to 260 of about 1,465,159 (304)
A review: research progress on intelligent technologies for orchard yield monitoring. [PDF]
Front Plant SciZhao S, Lin H, Jiang Y, Liu J.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 30th annual Southeast regional conference on - ACM-SE 30, 1992
Summary: A new data structure, segmented winner tree, is introduced. This is useful when one needs to represent data that are partitioned into segments. The segment operations that are efficiently supported are: initialize a unit length segment, find the element with least value in any given segment, update an element in any segment, merge two adjacent
Andrew Lim 0001, Sartaj Sahni
openaire +4 more sources
Summary: A new data structure, segmented winner tree, is introduced. This is useful when one needs to represent data that are partitioned into segments. The segment operations that are efficiently supported are: initialize a unit length segment, find the element with least value in any given segment, update an element in any segment, merge two adjacent
Andrew Lim 0001, Sartaj Sahni
openaire +4 more sources
Individual tree segmentation and tree-counting using supervised clustering
Computers and Electronics in Agriculture, 2023Xubing Yang, Liyong Fu, Xijian Fan
exaly +3 more sources
Algorithmica, 1994
The segment tree is a well-known internal data structure with numerous applications in computational geometry. It allows the dynamical maintenance of a set of intervals such that the intervals enclosing a query point can be found efficiently (point enclosure search).
Gabriele Blankenagel +1 more
openaire +1 more source
The segment tree is a well-known internal data structure with numerous applications in computational geometry. It allows the dynamical maintenance of a set of intervals such that the intervals enclosing a query point can be found efficiently (point enclosure search).
Gabriele Blankenagel +1 more
openaire +1 more source
Image Segmentation with Directed Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1980This correspondence presents a simple algorithm to detect and label homogeneous areas in an image, using directed trees for region labeling. The scheme constructs directed trees with the image points as nodes, guided by an edge value computed at every point. These directed trees segment the image into disjoint regions.
P. M. Narendra, Morris Goldberg
openaire +2 more sources
Segmentation of the pulmonary vascular tree
2012 XXXVIII Conferencia Latinoamericana En Informatica (CLEI), 2012A method to semi-automatically segment the pulmonary vascular tree from computed axial tomography (CAT) images is presented. The main goal is to aid the diagnosis and treatment of acute respiratory distress syndrome and pulmonary embolism. The proposed methodology is based on a variational region growing method and a multi-scale vessel enhancement ...
Juan-Carlos Prieto 0001 +6 more
openaire +2 more sources
Image segmentation by tree pruning
Proceedings. 17th Brazilian Symposium on Computer Graphics and Image Processing, 2004The image foresting transform (IFT) has been proposed for the design of image operators based on connectivity. The IFT reduces image processing problems into a minimum-cost path forest problem in a graph derived from the image. It has been successfully used for image filtering, segmentation, and analysis. In this work, we propose a novel image operator
Alexandre X. Falcão +2 more
openaire +1 more source