2013 IEEE 25th International Conference on Tools with Artificial Intelligence, 2013
ABSTRACT Image segmentation is one of the basic steps in image analysis. Clustering methods are a... more ABSTRACT Image segmentation is one of the basic steps in image analysis. Clustering methods are an unsupervised way to provide image segmentation. This paper proposes a clustering algorithm for contextual image segmentation, called spatially variant finite mixture model (SVFMM). For the case of spatially varying mixture of Gaussian density functions with unknown means and variances, an expectation-maximization (EM) algorithm is derived for maximum likelihood estimation of the parameters of the mixture model. In this paper, the Potts model is adopted as a priori density function for the spatially variant mixture proportions to imposes spatial smoothness constraints in the model. Experimental results on a set of different real images show the effectiveness of the proposed method.
Crumpled surfaces (CS) obtained from random and irreversible compactification of aluminium foils ... more Crumpled surfaces (CS) obtained from random and irreversible compactification of aluminium foils are low-density fractal structures which become increasingly easy to deform as their size increases. The authors study the deformation of these objects when ...
Physica A: Statistical Mechanics and its Applications, 1993
ABSTRACT One of the most important features of biological life in all levels is its astounding di... more ABSTRACT One of the most important features of biological life in all levels is its astounding diversity. In this work we study the well-known game ``Life'' due to Conway analysing the statistics of cluster population, N(t), and cluster diversity, D(t). We have performed simulations on ``Life'' for dimensions d = 1 and 2 starting with an uncorrelated distribution of live and dead sites at t = 0. For d = 2 we study the effect of different neighbourhood relations in identifying and counting clusters. An interesting scaling relation connecting the maxima of N(t) and D(t) is found.
2013 IEEE International Conference on Systems, Man, and Cybernetics, 2013
ABSTRACT We present a combined features approach for speaker segmentation task. This approach uti... more ABSTRACT We present a combined features approach for speaker segmentation task. This approach utilizes different acoustic features extracted from audio stream. The Bayesian Information Criterion (BIC) is used for each acoustic feature as a distance measure to verify the merging of two audio segments. An Artificial Neural Network (ANN) combines the time index from each ?BIC with the highest value, and estimates the change point. In the experiments, a data set containing examples with several speakers is used to compare our approach with the Chen and Gopalakrishnan's window-growing-based approach, using different acoustic features sets. The results show an improvement in both the Miss Detection Rate (MDR) and the False Alarm Rate (FAR) compared to the window-growing-based approach.
2013 IEEE International Conference on Systems, Man, and Cybernetics, 2013
ABSTRACT Pedestrian detection is a very promising area in computer vision, since it enables inter... more ABSTRACT Pedestrian detection is a very promising area in computer vision, since it enables interesting and a variety of applications such as car assistance, surveillance systems and robot vision. During the last years, a variety of new techniques were proposed which greatly improved the detection rates. However, the performance of such systems rapidly deteriorates when pedestrians are under occlusion. This paper analyze how the detection rates of HOG, HOG-LBP, and two new combinations, HOG-LTP and HOG-LMEBP, are affected when occlusion area are progressively added to pedestrian images. Using the INRIA dataset, occlusions were synthetically generated by merging different sizes of non-pedestrian images from different directions. We show that detection of pedestrian under occlusion can be improved by simply combining features.
Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics, 2012
ABSTRACT Neighborhood coding is a binary image representation method that has been performing suc... more ABSTRACT Neighborhood coding is a binary image representation method that has been performing successfully for a variety of applications such as features extraction for image recognition, shape descriptor, and image compression. Despite the success of this coding method, the representation lacked a formal notation. Here, we proposed a formal mathematical notation to represent any binary image into a neighborhood coding scheme. Using this representation we also introduce the concept of neighborhood operations, a procedure akin to mathematical morphology, however having a lower computational cost.
Crumpled surfaces (CS) obtained from random and irreversible compactification of aluminium foils ... more Crumpled surfaces (CS) obtained from random and irreversible compactification of aluminium foils are low-density fractal structures which become increasingly easy to deform as their size increases. The authors study the deformation of these objects when ...
Journal of Physics A: Mathematical and General, 1992
Geometrical and statistical properties of non-equilibrium crumpled surfaces (CS) and crumpled wir... more Geometrical and statistical properties of non-equilibrium crumpled surfaces (CS) and crumpled wires (CW) are investigated and compared. The relationship between the geodesic distance x and the Pythagorean distance r in CS and CW and their dependence on the linear (uncrumpled) size L is studied. Among other results the authors show that the moments of the probability distribution P(x, r) for
Journal of Physics A: Mathematical and General, 1990
ABSTRACT The authors study how the three-dimensional 'air' or Pythagorean distanc... more ABSTRACT The authors study how the three-dimensional 'air' or Pythagorean distance r(Q, Q') between two points Q and Q' on a non-equilibrium crumpled fractal surface (CS), with the topology of the plane, transforms in the internal or geodesic distance x(Q, Q')-with probability P(x, r)-after the unfolding of the CS on a plane. The probability distribution P(x, r) governing this process is examined for the first time. Among other results they find that (1) the width of P(x, r) 'diverges' for r near the ensemble average radius R of the CS and (2) (x) approximately r13.
Journal of Physics A-mathematical and General, 1997
We report the occurrence of critical probabilities associated with the maximum of diversity and t... more We report the occurrence of critical probabilities associated with the maximum of diversity and the maximum number of fragments (clusters) on a two-dimensional square lattice. Some scaling relations of these two variables are observed in accordance with work on fragmentation processes.
2013 IEEE 25th International Conference on Tools with Artificial Intelligence, 2013
ABSTRACT Image segmentation is one of the basic steps in image analysis. Clustering methods are a... more ABSTRACT Image segmentation is one of the basic steps in image analysis. Clustering methods are an unsupervised way to provide image segmentation. This paper proposes a clustering algorithm for contextual image segmentation, called spatially variant finite mixture model (SVFMM). For the case of spatially varying mixture of Gaussian density functions with unknown means and variances, an expectation-maximization (EM) algorithm is derived for maximum likelihood estimation of the parameters of the mixture model. In this paper, the Potts model is adopted as a priori density function for the spatially variant mixture proportions to imposes spatial smoothness constraints in the model. Experimental results on a set of different real images show the effectiveness of the proposed method.
Crumpled surfaces (CS) obtained from random and irreversible compactification of aluminium foils ... more Crumpled surfaces (CS) obtained from random and irreversible compactification of aluminium foils are low-density fractal structures which become increasingly easy to deform as their size increases. The authors study the deformation of these objects when ...
Physica A: Statistical Mechanics and its Applications, 1993
ABSTRACT One of the most important features of biological life in all levels is its astounding di... more ABSTRACT One of the most important features of biological life in all levels is its astounding diversity. In this work we study the well-known game ``Life'' due to Conway analysing the statistics of cluster population, N(t), and cluster diversity, D(t). We have performed simulations on ``Life'' for dimensions d = 1 and 2 starting with an uncorrelated distribution of live and dead sites at t = 0. For d = 2 we study the effect of different neighbourhood relations in identifying and counting clusters. An interesting scaling relation connecting the maxima of N(t) and D(t) is found.
2013 IEEE International Conference on Systems, Man, and Cybernetics, 2013
ABSTRACT We present a combined features approach for speaker segmentation task. This approach uti... more ABSTRACT We present a combined features approach for speaker segmentation task. This approach utilizes different acoustic features extracted from audio stream. The Bayesian Information Criterion (BIC) is used for each acoustic feature as a distance measure to verify the merging of two audio segments. An Artificial Neural Network (ANN) combines the time index from each ?BIC with the highest value, and estimates the change point. In the experiments, a data set containing examples with several speakers is used to compare our approach with the Chen and Gopalakrishnan's window-growing-based approach, using different acoustic features sets. The results show an improvement in both the Miss Detection Rate (MDR) and the False Alarm Rate (FAR) compared to the window-growing-based approach.
2013 IEEE International Conference on Systems, Man, and Cybernetics, 2013
ABSTRACT Pedestrian detection is a very promising area in computer vision, since it enables inter... more ABSTRACT Pedestrian detection is a very promising area in computer vision, since it enables interesting and a variety of applications such as car assistance, surveillance systems and robot vision. During the last years, a variety of new techniques were proposed which greatly improved the detection rates. However, the performance of such systems rapidly deteriorates when pedestrians are under occlusion. This paper analyze how the detection rates of HOG, HOG-LBP, and two new combinations, HOG-LTP and HOG-LMEBP, are affected when occlusion area are progressively added to pedestrian images. Using the INRIA dataset, occlusions were synthetically generated by merging different sizes of non-pedestrian images from different directions. We show that detection of pedestrian under occlusion can be improved by simply combining features.
Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics, 2012
ABSTRACT Neighborhood coding is a binary image representation method that has been performing suc... more ABSTRACT Neighborhood coding is a binary image representation method that has been performing successfully for a variety of applications such as features extraction for image recognition, shape descriptor, and image compression. Despite the success of this coding method, the representation lacked a formal notation. Here, we proposed a formal mathematical notation to represent any binary image into a neighborhood coding scheme. Using this representation we also introduce the concept of neighborhood operations, a procedure akin to mathematical morphology, however having a lower computational cost.
Crumpled surfaces (CS) obtained from random and irreversible compactification of aluminium foils ... more Crumpled surfaces (CS) obtained from random and irreversible compactification of aluminium foils are low-density fractal structures which become increasingly easy to deform as their size increases. The authors study the deformation of these objects when ...
Journal of Physics A: Mathematical and General, 1992
Geometrical and statistical properties of non-equilibrium crumpled surfaces (CS) and crumpled wir... more Geometrical and statistical properties of non-equilibrium crumpled surfaces (CS) and crumpled wires (CW) are investigated and compared. The relationship between the geodesic distance x and the Pythagorean distance r in CS and CW and their dependence on the linear (uncrumpled) size L is studied. Among other results the authors show that the moments of the probability distribution P(x, r) for
Journal of Physics A: Mathematical and General, 1990
ABSTRACT The authors study how the three-dimensional 'air' or Pythagorean distanc... more ABSTRACT The authors study how the three-dimensional 'air' or Pythagorean distance r(Q, Q') between two points Q and Q' on a non-equilibrium crumpled fractal surface (CS), with the topology of the plane, transforms in the internal or geodesic distance x(Q, Q')-with probability P(x, r)-after the unfolding of the CS on a plane. The probability distribution P(x, r) governing this process is examined for the first time. Among other results they find that (1) the width of P(x, r) 'diverges' for r near the ensemble average radius R of the CS and (2) (x) approximately r13.
Journal of Physics A-mathematical and General, 1997
We report the occurrence of critical probabilities associated with the maximum of diversity and t... more We report the occurrence of critical probabilities associated with the maximum of diversity and the maximum number of fragments (clusters) on a two-dimensional square lattice. Some scaling relations of these two variables are observed in accordance with work on fragmentation processes.
Uploads