Search results for "Pattern recognition"
showing 10 items of 2301 documents
A System for Simultaneous People Tracking and Posture Recognition in the context of Human-Computer Interaction
2005
The paper deals with an artificial-vision based system for simultaneous people tracking and posture recognition In the context of human-computer Interaction. We adopt no particular assumptions on the movement of a person and on Its appearance, making the system suitable to several real-world applications. The system can be roughly subdivided Into two highly correlated phases: tracking and recognition. The tracking phase Is concerned with establishing coherent relations of the same subject between frames. We adopted the Condensation algorithm due to Its robustness In highly cluttered environments. The recognition phase adopts a modified elgenspace technique In order to classify between sever…
Automatic image representation for content-based access to personal photo album
2007
The proposed work exploits methods and techniques for automatic characterization of images for content-based access to personal photo libraries. Several techniques, even if not reliable enough to address the general problem of content-based image retrieval, have been proven quite robust in a limited domain such as the one of personal photo album. In particular, starting from the observation that most personal photos depict a usually small number of people in a relatively small number of different contexts (e.g. Beach, Public Garden, Indoor, Nature, Snow, City, etc...) we propose the use of automatic techniques borrowed from the fields of computer vision and pattern recognition to index imag…
Inclusion ratio based estimator for the mean length of the boolean line segment model with an application to nanocrystalline cellulose
2014
A novel estimator for estimating the mean length of fibres is proposed for censored data observed in square shaped windows. Instead of observing the fibre lengths, we observe the ratio between the intensity estimates of minus-sampling and plus-sampling. It is well-known that both intensity estimators are biased. In the current work, we derive the ratio of these biases as a function of the mean length assuming a Boolean line segment model with exponentially distributed lengths and uniformly distributed directions. Having the observed ratio of the intensity estimators, the inverse of the derived function is suggested as a new estimator for the mean length. For this estimator, an approximation…
A multiagent system approach for image segmentation using genetic algorithms and extremal optimization heuristics
2006
We propose a new distributed image segmentation algorithm structured as a multiagent system composed of a set of segmentation agents and a coordinator agent. Starting from its own initial image, each segmentation agent performs the iterated conditional modes method, known as ICM, in applications based on Markov random fields, to obtain a sub-optimal segmented image. The coordinator agent diversifies the initial images using the genetic crossover and mutation operators along with the extremal optimization local search. This combination increases the efficiency of our algorithm and ensures its convergence to an optimal segmentation as it is shown through some experimental results.
Statistical atlas based exudate segmentation
2013
Diabetic macular edema (DME) is characterized by hard exudates. In this article, we propose a novel statistical atlas based method for segmentation of such exudates. Any test fundus image is first warped on the atlas co-ordinate and then a distance map is obtained with the mean atlas image. This leaves behind the candidate lesions. Post-processing schemes are introduced for final segmentation of the exudate. Experiments with the publicly available HEI-MED data-set shows good performance of the method. A lesion localization fraction of 82.5% at 35% of non-lesion localization fraction on the FROC curve is obtained. The method is also compared to few most recent reference methods.
RootsGLOH2: embedding RootSIFT 'square rooting' in sGLOH2
2020
This study introduces an extension of the shifting gradient local orientation histogram doubled (sGLOH2) local image descriptor inspired by RootSIFT ‘square rooting’ as a way to indirectly alter the matching distance used to compare the descriptor vectors. The extended descriptor, named RootsGLOH2, achieved the best results in terms of matching accuracy and robustness among the latest state-of-the-art non-deep descriptors in recent evaluation contests dealing with both planar and non-planar scenes. RootsGLOH2 also achieves a matching accuracy very close to that obtained by the best deep descriptors to date. Beside confirming that ‘square rooting’ has beneficial effects on sGLOH2 as it happe…
Mammogram Segmentation by Contour Searching and Mass Lesions Classification with Neural Network
2006
The mammography is the most effective procedure for an early diagnosis of the breast cancer. In this paper, an algorithm for detecting masses in mammographic images will be presented. The database consists of 3762 digital images acquired in several hospitals belonging to the MAGIC-5 collaboration (Medical Applications on a Grid Infrastructure Connection). A reduction of the whole image's area under investigation is achieved through a segmentation process, by means of a ROI Hunter algorithm, without loss of meaningful information. In the following classification step, feature extraction plays a fundamental role: some features give geometrical information, other ones provide shape parameters.…
On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals
2015
We study a variation of the classical Shortest Common Superstring (SCS) problem in which a shortest superstring of a finite set of strings $S$ is sought containing as a factor every string of $S$ or its reversal. We call this problem Shortest Common Superstring with Reversals (SCS-R). This problem has been introduced by Jiang et al., who designed a greedy-like algorithm with length approximation ratio $4$. In this paper, we show that a natural adaptation of the classical greedy algorithm for SCS has (optimal) compression ratio $\frac12$, i.e., the sum of the overlaps in the output string is at least half the sum of the overlaps in an optimal solution. We also provide a linear-time implement…
Spectral band selection for vegetation properties retrieval using Gaussian processes regression
2020
Abstract With current and upcoming imaging spectrometers, automated band analysis techniques are needed to enable efficient identification of most informative bands to facilitate optimized processing of spectral data into estimates of biophysical variables. This paper introduces an automated spectral band analysis tool (BAT) based on Gaussian processes regression (GPR) for the spectral analysis of vegetation properties. The GPR-BAT procedure sequentially backwards removes the least contributing band in the regression model for a given variable until only one band is kept. GPR-BAT is implemented within the framework of the free ARTMO's MLRA (machine learning regression algorithms) toolbox, w…
Unlocking the potential of deep learning for marine ecology: overview, applications, and outlook
2022
The deep learning revolution is touching all scientific disciplines and corners of our lives as a means of harnessing the power of big data. Marine ecology is no exception. These new methods provide analysis of data from sensors, cameras, and acoustic recorders, even in real time, in ways that are reproducible and rapid. Off-the-shelf algorithms can find, count, and classify species from digital images or video and detect cryptic patterns in noisy data. Using these opportunities requires collaboration across ecological and data science disciplines, which can be challenging to initiate. To facilitate these collaborations and promote the use of deep learning towards ecosystem-based management…