168 research outputs found
Automatic Leaf Extraction from Outdoor Images
Automatic plant recognition and disease analysis may be streamlined by an
image of a complete, isolated leaf as an initial input. Segmenting leaves from
natural images is a hard problem. Cluttered and complex backgrounds: often
composed of other leaves are commonplace. Furthermore, their appearance is
highly dependent upon illumination and viewing perspective. In order to address
these issues we propose a methodology which exploits the leaves venous systems
in tandem with other low level features. Background and leaf markers are
created using colour, intensity and texture. Two approaches are investigated:
watershed and graph-cut and results compared. Primary-secondary vein detection
and a protrusion-notch removal are applied to refine the extracted leaf. The
efficacy of our approach is demonstrated against existing work.Comment: 13 pages, India-UK Advanced Technology Centre of Excellence in Next
Generation Networks, Systems and Services (IU-ATC), 201
Segmentation-by-Detection: A Cascade Network for Volumetric Medical Image Segmentation
We propose an attention mechanism for 3D medical image segmentation. The
method, named segmentation-by-detection, is a cascade of a detection module
followed by a segmentation module. The detection module enables a region of
interest to come to attention and produces a set of object region candidates
which are further used as an attention model. Rather than dealing with the
entire volume, the segmentation module distills the information from the
potential region. This scheme is an efficient solution for volumetric data as
it reduces the influence of the surrounding noise which is especially important
for medical data with low signal-to-noise ratio. Experimental results on 3D
ultrasound data of the femoral head shows superiority of the proposed method
when compared with a standard fully convolutional network like the U-Net
Semantic Context Forests for Learning-Based Knee Cartilage Segmentation in 3D MR Images
The automatic segmentation of human knee cartilage from 3D MR images is a
useful yet challenging task due to the thin sheet structure of the cartilage
with diffuse boundaries and inhomogeneous intensities. In this paper, we
present an iterative multi-class learning method to segment the femoral, tibial
and patellar cartilage simultaneously, which effectively exploits the spatial
contextual constraints between bone and cartilage, and also between different
cartilages. First, based on the fact that the cartilage grows in only certain
area of the corresponding bone surface, we extract the distance features of not
only to the surface of the bone, but more informatively, to the densely
registered anatomical landmarks on the bone surface. Second, we introduce a set
of iterative discriminative classifiers that at each iteration, probability
comparison features are constructed from the class confidence maps derived by
previously learned classifiers. These features automatically embed the semantic
context information between different cartilages of interest. Validated on a
total of 176 volumes from the Osteoarthritis Initiative (OAI) dataset, the
proposed approach demonstrates high robustness and accuracy of segmentation in
comparison with existing state-of-the-art MR cartilage segmentation methods.Comment: MICCAI 2013: Workshop on Medical Computer Visio
Accelerated hardware video object segmentation: From foreground detection to connected components labelling
This is the preprint version of the Article - Copyright @ 2010 ElsevierThis paper demonstrates the use of a single-chip FPGA for the segmentation of moving objects in a video sequence. The system maintains highly accurate background models, and integrates the detection of foreground pixels with the labelling of objects using a connected components algorithm. The background models are based on 24-bit RGB values and 8-bit gray scale intensity values. A multimodal background differencing algorithm is presented, using a single FPGA chip and four blocks of RAM. The real-time connected component labelling algorithm, also designed for FPGA implementation, run-length encodes the output of the background subtraction, and performs connected component analysis on this representation. The run-length encoding, together with other parts of the algorithm, is performed in parallel; sequential operations are minimized as the number of run-lengths are typically less than the number of pixels. The two algorithms are pipelined together for maximum efficiency
- …