The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper exploits the problem of fitting special forms of annuli that correspond to 4-connected digital circles to a given set of points in 2D images in the presence of noise by maximizing the number of inliers, namely the consensus set. We prove that the optimal solutions can be described by solutions with three points on the annulus boundary. These solutions correspond to vertices of the preimage...
The problem of detection of label-noise in large datasets is investigated. We consider applications where data are susceptible to label error and a human expert is available to verify a limited number of such labels in order to cleanse the data. We show the support vectors of a Support Vector Machine (SVM) contain almost all of these noisy labels. Therefore, the verification of support vectors allows...
Semi-supervised learning (SSL) relies on a few labeled samples to explore data's intrinsic structure through pairwise smooth transduction. The performance of SSL mainly depends on two folds: (1) the accuracy of labeled queries, (2) the integrity of manifolds in data distribution. Both of these qualities would be poor in real applications as data often consist of several irrelevant clusters and discrete...
In this paper, we study and evaluate the application to image segmentation of a p-Laplacian based relaxation of the Cheeger Cut problem. Based on a l1 relaxation of the initial clustering problem, we show that these methods can outperform usual well-known graph based approaches, e.g., min-cut/max-flow algorithm or l2 spectral clustering, for unsupervised and very weakly supervised image segmentation...
In the emerging field of adaptive biometrics, systems aim to adapt enrolled templates to variations in samples observed during operations. However, despite numerous advantages, few commercial vendors have adopted auto-update procedures in their products. This is due to limitations associated with existing adaptation schemes. This paper proposes a dual-staged template adaptation scheme that allows...
We introduce an adaptation framework based on scale space filtering for making thinning algorithms robust against noise in sketch images. The framework takes a sketch image as input, produces a set of Gaussian blurred images of the input sketch and uses a thinning algorithm to produce thinned versions of the blurred images. The algorithm's output is then the thinned image with the best performance...
We present a sparse representation-based method for detecting adventitious lung sounds in low-quality auscultation signals. Since the noise cannot be represented sparsely by any bases, we can extract clear breath sounds and adventitious sounds from noisy electronic auscultation signals via the sparse representation. Using these clear sound components, we measure the level of abnormality, and robustly...
In this paper we present a methodology for nonlocal processing of 3D colored point clouds using regularization of functions defined on weighted graphs. To adapt it to nonlocal processing of 3D data, a new definition of patches for 3D point clouds is introduced and used for nonlocal filtering of 3D data such as colored point clouds. Results illustrate the benefits of our nonlocal approach to filter...
Zernike moments are commonly used in pattern recognition but are not suited for texture analysis. In this paper we introduce regional Zernike moments (RZM) where we combine the Zernike moments for the pixels in a region to create a measure suitable for texture analysis. We compare our proposed measures to texture measures based on Gabor filters, Haralick cooccurrence matrices and local binary patterns...
This paper proposes a new edge descriptor named centripetal-SIFT edge descriptor. A method for symmetric object detection is presented based on symmetry and centripetal-SIFT descriptor in real unsegmented images. Our method includes three main steps: 1) The dominant symmetry axis is located based on SIFT feature point; 2) Image edge points are extracted in scale space and described by the proposed...
Symbol retrieval for technical documents is still a hot challenge in the document analysis community. In this paper we propose another way to spot symbols. A pixel-based template operator which is an adaptation of the hit-or-miss transform is defined. This operator is robust to translation, rotation and reflection. Experimental results on a real application show the efficiency of our approach.
The well-known bilateral filter is used to smooth noisy images while keeping their edges. This filter is commonly used with Gaussian kernel functions without real justification. The choice of the kernel functions has a major effect on the filter behavior. We propose to use exponential kernels with L1 distances instead of Gaussian ones. We derive Stein's Unbiased Risk Estimate to find the optimal parameters...
This paper presents a practical method for pool-based active learning that is robust to annotation noise. Our work is inspired by recent approaches to active learning in two different noise-free settings: importance-weighted methods for streams and unbiased pool-based techniques. In our proposed method, we employ an ensemble of classifiers to guide the label requests from a pool of unlabeled training...
Most conventional smoothing and denoising methods for color images deal with each color channel independently, which results in discolorations due to unbalancing the relation between the color components. In this paper, we propose a smoothing algorithm to reduce discolorations based on ”color-lines”. Our iterative algorithm consists of a local color decomposition step by color-line vectors and an...
We propose a novel trajectory clustering algorithm which is suitable for online processing of pedestrian or vehicle trajectories computed with a vision-based tracker. Our approach does not require defining distances between trajectories, and can thus process broken trajectories which are inevitable in most cases when object trackers are applied to real world video footage. Clusters are defined as...
We present a method for recovering fast and robustly the 3D shape of inextensible and smooth surfaces from a monocular image. We propose a weighted iterative least squares approach to minimize the reprojection error between 2D-3D point correspondences preserving the 3D lengths. In addition, a local 3D smoothness constraint for each mesh vertex is proposed to increase the robustness to noisy correspondences...
Concentric circles (C2Tag's) are planar markers which offer great advantages for detection and tracking. As the circular point-pair (CPP) is the geometric information encoded by a C2Tag, this work is focused on factorization techniques for Structure-and-Motion from multiple CPP images. Gathering all of them in a measurement matrix, two issues are addressed: how to scale the existing entries and how...
Sparse representation based classification (SRC) has been widely used for face recognition (FR). Although SRC algorithm is also adopted in human action recognition, the evaluations of different regular terms have not been given. In this paper, we will discuss and evaluate the role of different regular terms of SRC in human action recognition, after that, we propose human action recognition algorithm...
In traditional bag-of-words method, each local feature is treated evenly for representation. One disadvantage of this method is that it is not robust to noise, which makes the performance impaired. In this paper, a novel human action recognition approach which learns weights for features is proposed, where each feature is assigned a weight for human action representation. These weights are learned...
In this paper, we address the problem of representing objects using contours for the purpose of recognition. We propose a novel segmentation method for integrating a new contour matching energy into level set based segmentation schemes. The contour matching energy is represented by major components of Elliptic Fourier shape descriptors and serves as a shape prior to guide the curve evolution. The...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.