| Home | [31–40] << 41 42 43 44 45 46 47 48 49 50 >> [51–60] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Sergio Escalera; Alicia Fornes; Oriol Pujol; Josep Llados; Petia Radeva | ||||
| Title | Circular Blurred Shape Model for Multiclass Symbol Recognition | Type | Journal Article | ||
| Year | 2011 | Publication | IEEE Transactions on Systems, Man and Cybernetics (Part B) (IEEE) | Abbreviated Journal | TSMCB |
| Volume | 41 | Issue | 2 | Pages | 497-506 |
| Keywords | |||||
| Abstract | In this paper, we propose a circular blurred shape model descriptor to deal with the problem of symbol detection and classification as a particular case of object recognition. The feature extraction is performed by capturing the spatial arrangement of significant object characteristics in a correlogram structure. The shape information from objects is shared among correlogram regions, where a prior blurring degree defines the level of distortion allowed in the symbol, making the descriptor tolerant to irregular deformations. Moreover, the descriptor is rotation invariant by definition. We validate the effectiveness of the proposed descriptor in both the multiclass symbol recognition and symbol detection domains. In order to perform the symbol detection, the descriptors are learned using a cascade of classifiers. In the case of multiclass categorization, the new feature space is learned using a set of binary classifiers which are embedded in an error-correcting output code design. The results over four symbol data sets show the significant improvements of the proposed descriptor compared to the state-of-the-art descriptors. In particular, the results are even more significant in those cases where the symbols suffer from elastic deformations. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1083-4419 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
Notes  |
MILAB; DAG;HuPBA | Approved | no | ||
| Call Number | Admin @ si @ EFP2011 | Serial | 1784 | ||
| Permanent link to this record | |||||
| Author | Xavier Otazu; Oriol Pujol | ||||
| Title | Wavelet based approach to cluster analysis. Application on low dimensional data sets | Type | Journal Article | ||
| Year | 2006 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 27 | Issue | 14 | Pages | 1590–1605 |
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
MILAB; CIC; HuPBA | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ OtP2006 | Serial | 658 | ||
| Permanent link to this record | |||||
| Author | Simon Jégou; Michal Drozdzal; David Vazquez; Adriana Romero; Yoshua Bengio | ||||
| Title | The One Hundred Layers Tiramisu: Fully Convolutional DenseNets for Semantic Segmentation | Type | Conference Article | ||
| Year | 2017 | Publication | IEEE Conference on Computer Vision and Pattern Recognition Workshops | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | Semantic Segmentation | ||||
| Abstract | State-of-the-art approaches for semantic image segmentation are built on Convolutional Neural Networks (CNNs). The typical segmentation architecture is composed of (a) a downsampling path responsible for extracting coarse semantic features, followed by (b) an upsampling path trained to recover the input image resolution at the output of the model and, optionally, (c) a post-processing module (e.g. Conditional Random Fields) to refine the model predictions.
Recently, a new CNN architecture, Densely Connected Convolutional Networks (DenseNets), has shown excellent results on image classification tasks. The idea of DenseNets is based on the observation that if each layer is directly connected to every other layer in a feed-forward fashion then the network will be more accurate and easier to train. In this paper, we extend DenseNets to deal with the problem of semantic segmentation. We achieve state-of-the-art results on urban scene benchmark datasets such as CamVid and Gatech, without any further post-processing module nor pretraining. Moreover, due to smart construction of the model, our approach has much less parameters than currently published best entries for these datasets. |
||||
| Address | Honolulu; USA; July 2017 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | CVPRW | ||
| Notes |
MILAB; ADAS; 600.076; 600.085; 601.281 | Approved | no | ||
| Call Number | ADAS @ adas @ JDV2016 | Serial | 2866 | ||
| Permanent link to this record | |||||
| Author | Pierluigi Casale; Oriol Pujol; Petia Radeva | ||||
| Title | Approximate polytope ensemble for one-class classification | Type | Journal Article | ||
| Year | 2014 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 47 | Issue | 2 | Pages | 854-864 |
| Keywords | One-class classification; Convex hull; High-dimensionality; Random projections; Ensemble learning | ||||
| Abstract | In this work, a new one-class classification ensemble strategy called approximate polytope ensemble is presented. The main contribution of the paper is threefold. First, the geometrical concept of convex hull is used to define the boundary of the target class defining the problem. Expansions and contractions of this geometrical structure are introduced in order to avoid over-fitting. Second, the decision whether a point belongs to the convex hull model in high dimensional spaces is approximated by means of random projections and an ensemble decision process. Finally, a tiling strategy is proposed in order to model non-convex structures. Experimental results show that the proposed strategy is significantly better than state of the art one-class classification methods on over 200 datasets. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
MILAB; 605.203 | Approved | no | ||
| Call Number | Admin @ si @ CPR2014a | Serial | 2469 | ||
| Permanent link to this record | |||||
| Author | Marc Bolaños; Mariella Dimiccoli; Petia Radeva | ||||
| Title | Towards Storytelling from Visual Lifelogging: An Overview | Type | Journal Article | ||
| Year | 2017 | Publication | IEEE Transactions on Human-Machine Systems | Abbreviated Journal | THMS |
| Volume | 47 | Issue | 1 | Pages | 77 - 90 |
| Keywords | |||||
| Abstract | Visual lifelogging consists of acquiring images that capture the daily experiences of the user by wearing a camera over a long period of time. The pictures taken offer considerable potential for knowledge mining concerning how people live their lives, hence, they open up new opportunities for many potential applications in fields including healthcare, security, leisure and
the quantified self. However, automatically building a story from a huge collection of unstructured egocentric data presents major challenges. This paper provides a thorough review of advances made so far in egocentric data analysis, and in view of the current state of the art, indicates new lines of research to move us towards storytelling from visual lifelogging. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
MILAB; 601.235 | Approved | no | ||
| Call Number | Admin @ si @ BDR2017 | Serial | 2712 | ||
| Permanent link to this record | |||||
| Author | Mariella Dimiccoli; Marc Bolaños; Estefania Talavera; Maedeh Aghaei; Stavri G. Nikolov; Petia Radeva | ||||
| Title | SR-Clustering: Semantic Regularized Clustering for Egocentric Photo Streams Segmentation | Type | Journal Article | ||
| Year | 2017 | Publication | Computer Vision and Image Understanding | Abbreviated Journal | CVIU |
| Volume | 155 | Issue | Pages | 55-69 | |
| Keywords | |||||
| Abstract | While wearable cameras are becoming increasingly popular, locating relevant information in large unstructured collections of egocentric images is still a tedious and time consuming processes. This paper addresses the problem of organizing egocentric photo streams acquired by a wearable camera into semantically meaningful segments. First, contextual and semantic information is extracted for each image by employing a Convolutional Neural Networks approach. Later, by integrating language processing, a vocabulary of concepts is defined in a semantic space. Finally, by exploiting the temporal coherence in photo streams, images which share contextual and semantic attributes are grouped together. The resulting temporal segmentation is particularly suited for further analysis, ranging from activity and event recognition to semantic indexing and summarization. Experiments over egocentric sets of nearly 17,000 images, show that the proposed approach outperforms state-of-the-art methods. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
MILAB; 601.235 | Approved | no | ||
| Call Number | Admin @ si @ DBT2017 | Serial | 2714 | ||
| Permanent link to this record | |||||
| Author | M. Oliver; G. Haro; Mariella Dimiccoli; B. Mazin; C. Ballester | ||||
| Title | A Computational Model for Amodal Completion | Type | Journal Article | ||
| Year | 2016 | Publication | Journal of Mathematical Imaging and Vision | Abbreviated Journal | JMIV |
| Volume | 56 | Issue | 3 | Pages | 511–534 |
| Keywords | Perception; visual completion; disocclusion; Bayesian model;relatability; Euler elastica | ||||
| Abstract | This paper presents a computational model to recover the most likely interpretation
of the 3D scene structure from a planar image, where some objects may occlude others. The estimated scene interpretation is obtained by integrating some global and local cues and provides both the complete disoccluded objects that form the scene and their ordering according to depth. Our method first computes several distal scenes which are compatible with the proximal planar image. To compute these different hypothesized scenes, we propose a perceptually inspired object disocclusion method, which works by minimizing the Euler's elastica as well as by incorporating the relatability of partially occluded contours and the convexity of the disoccluded objects. Then, to estimate the preferred scene we rely on a Bayesian model and define probabilities taking into account the global complexity of the objects in the hypothesized scenes as well as the effort of bringing these objects in their relative position in the planar image, which is also measured by an Euler's elastica-based quantity. The model is illustrated with numerical experiments on, both, synthetic and real images showing the ability of our model to reconstruct the occluded objects and the preferred perceptual order among them. We also present results on images of the Berkeley dataset with provided figure-ground ground-truth labeling. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
MILAB; 601.235 | Approved | no | ||
| Call Number | Admin @ si @ OHD2016b | Serial | 2745 | ||
| Permanent link to this record | |||||
| Author | Maria Oliver; Gloria Haro; Mariella Dimiccoli; Baptiste Mazin; Coloma Ballester | ||||
| Title | A computational model of amodal completion | Type | Conference Article | ||
| Year | 2016 | Publication | SIAM Conference on Imaging Science | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | This paper presents a computational model to recover the most likely interpretation of the 3D scene structure from a planar image, where some objects may occlude others. The estimated scene interpretation is obtained by integrating some global and local cues and provides both the complete disoccluded objects that form the scene and their ordering according to depth. Our method first computes several distal scenes which are compatible with the proximal planar image. To compute these different hypothesized scenes, we propose a perceptually inspired object disocclusion method, which works by minimizing the Euler's elastica as well as by incorporating the relatability of partially occluded contours and the convexity of the disoccluded objects. Then, to estimate the preferred scene we rely on a Bayesian model and define probabilities taking into account the global complexity of the objects in the hypothesized scenes as well as the effort of bringing these objects in their relative position in the planar image, which is also measured by an Euler's elastica-based quantity. The model is illustrated with numerical experiments on, both, synthetic and real images showing the ability of our model to reconstruct the occluded objects and the preferred perceptual order among them. We also present results on images of the Berkeley dataset with provided figure-ground ground-truth labeling. | ||||
| Address | Albuquerque; New Mexico; USA; May 2016 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | IS | ||
| Notes |
MILAB; 601.235 | Approved | no | ||
| Call Number | Admin @ si @OHD2016a | Serial | 2788 | ||
| Permanent link to this record | |||||
| Author | Adriana Romero; Petia Radeva; Carlo Gatta | ||||
| Title | Meta-parameter free unsupervised sparse feature learning | Type | Journal Article | ||
| Year | 2015 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 37 | Issue | 8 | Pages | 1716-1722 |
| Keywords | |||||
| Abstract | We propose a meta-parameter free, off-the-shelf, simple and fast unsupervised feature learning algorithm, which exploits a new way of optimizing for sparsity. Experiments on CIFAR-10, STL- 10 and UCMerced show that the method achieves the state-of-theart performance, providing discriminative features that generalize well. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
MILAB; 600.068; 600.079; 601.160 | Approved | no | ||
| Call Number | Admin @ si @ RRG2014b | Serial | 2594 | ||
| Permanent link to this record | |||||
| Author | Adriana Romero; Carlo Gatta | ||||
| Title | Do We Really Need All These Neurons? | Type | Conference Article | ||
| Year | 2013 | Publication | 6th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
| Volume | 7887 | Issue | Pages | 460--467 | |
| Keywords | Retricted Boltzmann Machine; hidden units; unsupervised learning; classification | ||||
| Abstract | Restricted Boltzmann Machines (RBMs) are generative neural networks that have received much attention recently. In particular, choosing the appropriate number of hidden units is important as it might hinder their representative power. According to the literature, RBM require numerous hidden units to approximate any distribution properly. In this paper, we present an experiment to determine whether such amount of hidden units is required in a classification context. We then propose an incremental algorithm that trains RBM reusing the previously trained parameters using a trade-off measure to determine the appropriate number of hidden units. Results on the MNIST and OCR letters databases show that using a number of hidden units, which is one order of magnitude smaller than the literature estimate, suffices to achieve similar performance. Moreover, the proposed algorithm allows to estimate the required number of hidden units without the need of training many RBM from scratch. | ||||
| Address | Madeira; Portugal; June 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-38627-5 | Medium | |
| Area | Expedition | Conference | IbPRIA | ||
| Notes |
MILAB; 600.046 | Approved | no | ||
| Call Number | Admin @ si @ RoG2013 | Serial | 2311 | ||
| Permanent link to this record | |||||
| Author | Mariella Dimiccoli | ||||
| Title | Figure-ground segregation: A fully nonlocal approach | Type | Journal Article | ||
| Year | 2016 | Publication | Vision Research | Abbreviated Journal | VR |
| Volume | 126 | Issue | Pages | 308-317 | |
| Keywords | Figure-ground segregation; Nonlocal approach; Directional linear voting; Nonlinear diffusion | ||||
| Abstract | We present a computational model that computes and integrates in a nonlocal fashion several configural cues for automatic figure-ground segregation. Our working hypothesis is that the figural status of each pixel is a nonlocal function of several geometric shape properties and it can be estimated without explicitly relying on object boundaries. The methodology is grounded on two elements: multi-directional linear voting and nonlinear diffusion. A first estimation of the figural status of each pixel is obtained as a result of a voting process, in which several differently oriented line-shaped neighborhoods vote to express their belief about the figural status of the pixel. A nonlinear diffusion process is then applied to enforce the coherence of figural status estimates among perceptually homogeneous regions. Computer simulations fit human perception and match the experimental evidence that several cues cooperate in defining figure-ground segregation. The results of this work suggest that figure-ground segregation involves feedback from cells with larger receptive fields in higher visual cortical areas. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
MILAB; | Approved | no | ||
| Call Number | Admin @ si @ Dim2016b | Serial | 2623 | ||
| Permanent link to this record | |||||
| Author | Tadashi Araki; Sumit K. Banchhor; Narendra D. Londhe; Nobutaka Ikeda; Petia Radeva; Devarshi Shukla; Luca Saba; Antonella Balestrieri; Andrew Nicolaides; Shoaib Shafique; John R. Laird; Jasjit S. Suri | ||||
| Title | Reliable and Accurate Calcium Volume Measurement in Coronary Artery Using Intravascular Ultrasound Videos | Type | Journal Article | ||
| Year | 2016 | Publication | Journal of Medical Systems | Abbreviated Journal | JMS |
| Volume | 40 | Issue | 3 | Pages | 51:1-51:20 |
| Keywords | Interventional cardiology; Atherosclerosis; Coronary arteries; IVUS; calcium volume; Soft computing; Performance Reliability; Accuracy | ||||
| Abstract | Quantitative assessment of calcified atherosclerotic volume within the coronary artery wall is vital for cardiac interventional procedures. The goal of this study is to automatically measure the calcium volume, given the borders of coronary vessel wall for all the frames of the intravascular ultrasound (IVUS) video. Three soft computing fuzzy classification techniques were adapted namely Fuzzy c-Means (FCM), K-means, and Hidden Markov Random Field (HMRF) for automated segmentation of calcium regions and volume computation. These methods were benchmarked against previously developed threshold-based method. IVUS image data sets (around 30,600 IVUS frames) from 15 patients were collected using 40 MHz IVUS catheter (Atlantis® SR Pro, Boston Scientific®, pullback speed of 0.5 mm/s). Calcium mean volume for FCM, K-means, HMRF and threshold-based method were 37.84 ± 17.38 mm3, 27.79 ± 10.94 mm3, 46.44 ± 19.13 mm3 and 35.92 ± 16.44 mm3 respectively. Cross-correlation, Jaccard Index and Dice Similarity were highest between FCM and threshold-based method: 0.99, 0.92 ± 0.02 and 0.95 + 0.02 respectively. Student’s t-test, z-test and Wilcoxon-test are also performed to demonstrate consistency, reliability and accuracy of the results. Given the vessel wall region, the system reliably and automatically measures the calcium volume in IVUS videos. Further, we validated our system against a trained expert using scoring: K-means showed the best performance with an accuracy of 92.80 %. Out procedure and protocol is along the line with method previously published clinically. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
MILAB; | Approved | no | ||
| Call Number | Admin @ si @ ABL2016 | Serial | 2729 | ||
| Permanent link to this record | |||||
| Author | Mariella Dimiccoli; Jean-Pascal Jacob; Lionel Moisan | ||||
| Title | Particle detection and tracking in fluorescence time-lapse imaging: a contrario approach | Type | Journal Article | ||
| Year | 2016 | Publication | Journal of Machine Vision and Applications | Abbreviated Journal | MVAP |
| Volume | 27 | Issue | Pages | 511-527 | |
| Keywords | particle detection; particle tracking; a-contrario approach; time-lapse fluorescence imaging | ||||
| Abstract | In this work, we propose a probabilistic approach for the detection and the
tracking of particles on biological images. In presence of very noised and poor quality data, particles and trajectories can be characterized by an a-contrario model, that estimates the probability of observing the structures of interest in random data. This approach, first introduced in the modeling of human visual perception and then successfully applied in many image processing tasks, leads to algorithms that do not require a previous learning stage, nor a tedious parameter tuning and are very robust to noise. Comparative evaluations against a well established baseline show that the proposed approach outperforms the state of the art. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
MILAB; | Approved | no | ||
| Call Number | Admin @ si @ DJM2016 | Serial | 2735 | ||
| Permanent link to this record | |||||
| Author | Maedeh Aghaei; Mariella Dimiccoli; Petia Radeva | ||||
| Title | Multi-face tracking by extended bag-of-tracklets in egocentric photo-streams | Type | Journal Article | ||
| Year | 2016 | Publication | Computer Vision and Image Understanding | Abbreviated Journal | CVIU |
| Volume | 149 | Issue | Pages | 146-156 | |
| Keywords | |||||
| Abstract | Wearable cameras offer a hands-free way to record egocentric images of daily experiences, where social events are of special interest. The first step towards detection of social events is to track the appearance of multiple persons involved in them. In this paper, we propose a novel method to find correspondences of multiple faces in low temporal resolution egocentric videos acquired through a wearable camera. This kind of photo-stream imposes additional challenges to the multi-tracking problem with respect to conventional videos. Due to the free motion of the camera and to its low temporal resolution, abrupt changes in the field of view, in illumination condition and in the target location are highly frequent. To overcome such difficulties, we propose a multi-face tracking method that generates a set of tracklets through finding correspondences along the whole sequence for each detected face and takes advantage of the tracklets redundancy to deal with unreliable ones. Similar tracklets are grouped into the so called extended bag-of-tracklets (eBoT), which is aimed to correspond to a specific person. Finally, a prototype tracklet is extracted for each eBoT, where the occurred occlusions are estimated by relying on a new measure of confidence. We validated our approach over an extensive dataset of egocentric photo-streams and compared it to state of the art methods, demonstrating its effectiveness and robustness. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes |
MILAB; | Approved | no | ||
| Call Number | Admin @ si @ ADR2016b | Serial | 2742 | ||
| Permanent link to this record | |||||
| Author | Mariella Dimiccoli | ||||
| Title | Fundamentals of cone regression | Type | Journal | ||
| Year | 2016 | Publication | Journal of Statistics Surveys | Abbreviated Journal | |
| Volume | 10 | Issue | Pages | 53-99 | |
| Keywords | cone regression; linear complementarity problems; proximal operators. | ||||
| Abstract | Cone regression is a particular case of quadratic programming that minimizes a weighted sum of squared residuals under a set of linear inequality constraints. Several important statistical problems such as isotonic, concave regression or ANOVA under partial orderings, just to name a few, can be considered as particular instances of the cone regression problem. Given its relevance in Statistics, this paper aims to address the fundamentals of cone regression from a theoretical and practical point of view. Several formulations of the cone regression problem are considered and, focusing on the particular case of concave regression as an example, several algorithms are analyzed and compared both qualitatively and quantitatively through numerical simulations. Several improvements to enhance numerical stability and bound the computational cost are proposed. For each analyzed algorithm, the pseudo-code and its corresponding code in Matlab are provided. The results from this study demonstrate that the choice of the optimization approach strongly impacts the numerical performances. It is also shown that methods are not currently available to solve efficiently cone regression problems with large dimension (more than many thousands of points). We suggest further research to fill this gap by exploiting and adapting classical multi-scale strategy to compute an approximate solution. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1935-7516 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes |
MILAB; | Approved | no | ||
| Call Number | Admin @ si @Dim2016a | Serial | 2783 | ||
| Permanent link to this record | |||||