7,500 research outputs found
Fuzzy Clustering for Image Segmentation Using Generic Shape Information
The performance of clustering algorithms for image segmentation are highly sensitive to the features used and types of objects in the image, which ultimately limits their generalization capability. This provides strong motivation to investigate integrating shape information into the clustering framework to improve the generality of these algorithms. Existing shape-based clustering techniques mainly focus on circular and elliptical clusters and so are unable to segment arbitrarily-shaped objects. To address this limitation, this paper presents a new shape-based algorithm called fuzzy clustering for image segmentation using generic shape information (FCGS), which exploits the B-spline representation of an object's shape in combination with the Gustafson-Kessel clustering algorithm. Qualitative and quantitative results for FCGS confirm its superior segmentation performance consistently compared to well-established shape-based clustering techniques, for a wide range of test images comprising various regular and arbitrary-shaped objects
Image segmentation with adaptive region growing based on a polynomial surface model
A new method for segmenting intensity images into smooth surface segments is presented. The main idea is to divide the image into flat, planar, convex, concave, and saddle patches that coincide as well as possible with meaningful object features in the image. Therefore, we propose an adaptive region growing algorithm based on low-degree polynomial fitting. The algorithm uses a new adaptive thresholding technique with the L∞ fitting cost as a segmentation criterion. The polynomial degree and the fitting error are automatically adapted during the region growing process. The main contribution is that the algorithm detects outliers and edges, distinguishes between strong and smooth intensity transitions and finds surface segments that are bent in a certain way. As a result, the surface segments corresponding to meaningful object features and the contours separating the surface segments coincide with real-image object edges. Moreover, the curvature-based surface shape information facilitates many tasks in image analysis, such as object recognition performed on the polynomial representation. The polynomial representation provides good image approximation while preserving all the necessary details of the objects in the reconstructed images. The method outperforms existing techniques when segmenting images of objects with diffuse reflecting surfaces
Efficient Video Transport over Lossy Networks
Nowadays, packet video is an important application of the Internet. Unfortunately the capacity of the Internet is still very heterogeneous because it connects high bandwidth ATM networks as well as low bandwidth ISDN dial in lines. The MPEG-2 and MPEG-4 video compression standards provide efficient video encoding for high and low bandwidth media streams. In particular they include two paradigms which make those standards suitable for the transmission of video via heterogeneous networks. Both support layered video streams and MPEG-4 additionally allows the independent coding of video objects. In this paper we discuss those two paradigms, give an overview of the MPEG video compression standards and describe transport protocols for Real Time Media transport over lossy networks. Furthermore, we propose a real-time segmentation approach for extracting video objects in teleteaching scenarios
Wavelet-based distributed source coding of video
Publication in the conference proceedings of EUSIPCO, Antalya, Turkey, 200
Steered mixture-of-experts for light field images and video : representation and coding
Research in light field (LF) processing has heavily increased over the last decade. This is largely driven by the desire to achieve the same level of immersion and navigational freedom for camera-captured scenes as it is currently available for CGI content. Standardization organizations such as MPEG and JPEG continue to follow conventional coding paradigms in which viewpoints are discretely represented on 2-D regular grids. These grids are then further decorrelated through hybrid DPCM/transform techniques. However, these 2-D regular grids are less suited for high-dimensional data, such as LFs. We propose a novel coding framework for higher-dimensional image modalities, called Steered Mixture-of-Experts (SMoE). Coherent areas in the higher-dimensional space are represented by single higher-dimensional entities, called kernels. These kernels hold spatially localized information about light rays at any angle arriving at a certain region. The global model consists thus of a set of kernels which define a continuous approximation of the underlying plenoptic function. We introduce the theory of SMoE and illustrate its application for 2-D images, 4-D LF images, and 5-D LF video. We also propose an efficient coding strategy to convert the model parameters into a bitstream. Even without provisions for high-frequency information, the proposed method performs comparable to the state of the art for low-to-mid range bitrates with respect to subjective visual quality of 4-D LF images. In case of 5-D LF video, we observe superior decorrelation and coding performance with coding gains of a factor of 4x in bitrate for the same quality. At least equally important is the fact that our method inherently has desired functionality for LF rendering which is lacking in other state-of-the-art techniques: (1) full zero-delay random access, (2) light-weight pixel-parallel view reconstruction, and (3) intrinsic view interpolation and super-resolution
Hybrid Region-based Image Compression Scheme for Mamograms and Ultrasound Images
The need for transmission and archive of mammograms and ultrasound Images has
dramatically increased in tele-healthcare applications. Such images require large
amount of' storage space which affect transmission speed. Therefore an effective
compression scheme is essential. Compression of these images. in general. laces a
great challenge to compromise between the higher compression ratio and the relevant
diagnostic information. Out of the many studied compression schemes. lossless
.
IPl. (i-
LS and lossy SPII IT are found to he the most efficient ones. JPEG-LS and SI'll IT are
chosen based on a comprehensive experimental study carried on a large number of
mammograms and ultrasound images of different sizes and texture. The lossless
schemes are evaluated based on the compression ratio and compression speed. The
distortion in the image quality which is introduced by lossy methods evaluated based
on objective criteria using Mean Square Error (MSE) and Peak signal to Noise Ratio
(PSNR). It is found that lossless compression can achieve a modest compression ratio
2: 1 - 4: 1. bossy compression schemes can achieve higher compression ratios than
lossless ones but at the price of the image quality which may impede diagnostic
conclusions. In this work, a new compression approach called Ilvbrid Region-based Image
Compression Scheme (IIYRICS) has been proposed for the mammograms and
ultrasound images to achieve higher compression ratios without compromising the
diagnostic quality. In I LYRICS, a modification for JPI; G-LS is introduced to encode
the arbitrary shaped disease affected regions. Then Shape adaptive SPIT IT is applied
on the remaining non region of interest. The results clearly show that this hybrid
strategy can yield high compression ratios with perfect reconstruction of diagnostic
relevant regions, achieving high speed transmission and less storage requirement. For
the sample images considered in our experiment, the compression ratio increases
approximately ten times. However, this increase depends upon the size of the region
of interest chosen. It is also föund that the pre-processing (contrast stretching) of
region of interest improves compression ratios on mammograms but not on ultrasound
images
Methods of Hierarchical Clustering
We survey agglomerative hierarchical clustering algorithms and discuss
efficient implementations that are available in R and other software
environments. We look at hierarchical self-organizing maps, and mixture models.
We review grid-based clustering, focusing on hierarchical density-based
approaches. Finally we describe a recently developed very efficient (linear
time) hierarchical clustering algorithm, which can also be viewed as a
hierarchical grid-based algorithm.Comment: 21 pages, 2 figures, 1 table, 69 reference
- …