journal
MENU ▼
Read by QxMD icon Read
search

IEEE Transactions on Pattern Analysis and Machine Intelligence

journal
https://www.readbyqxmd.com/read/28534768/personalized-age-progression-with-bi-level-aging-dictionary-learning
#1
Xiangbo Shu, Jinhui Tang, Zechao Li, Hanjiang Lai, Liyan Zhang, Shuicheng Yan
Age progression is defined as aesthetically re-rendering the aging face at any future age for an individual face. In this work, we aim to automatically render aging faces in a personalized way. Basically, for each age group, we learn an aging dictionary to reveal its aging characteristics (e.g., wrinkles), where the dictionary bases corresponding to the same index yet from two neighboring aging dictionaries form a particular aging pattern cross these two age groups, and a linear combination of all these patterns expresses a particular personalized aging process...
May 17, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28534767/domain-generalization-and-adaptation-using-low-rank-exemplar-svms
#2
Wen Li, Zheng Xu, Dong Xu, Dengxin Dai, Luc Van Gool
Domain adaptation between diverse source and target domains is a challenging research problem, especially in the real-world visual recognition tasks where the images and videos consist of significant variations in viewpoints, illuminations, qualities, etc. In this paper, we propose a new approach for domain generalization and domain adaptation based on exemplar SVMs. Specifically, we decompose the source domain into many subdomains, each of which contains only one positive training sample and all negative samples...
May 16, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28504932/generalizing-pooling-functions-in-cnns-mixed-gated-and-tree
#3
Chen-Yu Lee, Patrick Gallagher, Zhuowen Tu
In this paper, we seek to improve deep neural networks by generalizing the pooling operations that play a central role in the current architectures. We pursue a careful exploration of approaches to allow pooling to learn and to adapt to complex and variable patterns. The two primary directions lie in: (1) learning a pooling function via (two strategies of) combining of max and average pooling, and (2) learning a pooling function in the form of a tree-structured fusion of pooling filters that are themselves learned...
May 12, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28504933/a-novel-linelet-based-representation-for-line-segment-detection
#4
Nam-Gyu Cho, Alan Yuille, Seong-Whan Lee
This paper proposes a method for line segment detection in digital images.We propose a novel linelet-based representation to model intrinsic properties of line segments in rasterized image space. Based on this, line segment detection, validation, and aggregation frameworks are constructed. For a numerical evaluation on real images, we propose a new benchmark dataset of real images with annotated lines called YorkUrban-LineSegment. The results show that the proposed method outperforms state-of-the-art methods numerically and visually...
May 11, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28489533/shakeout-a-new-approach-to-regularized-deep-neural-network-training
#5
Guoliang Kang, Jun Li, Dacheng Tao
Recent years have witnessed the success of deep neural networks in dealing with a plenty of practical problems. Dropout has played an essential role in many successful deep neural networks, by inducing regularization in the model training. In this paper, we present a new regularized training approach: Shakeout. Instead of randomly discarding units as Dropout does at the training stage, Shakeout randomly chooses to enhance or reverse each unit's contribution to the next layer. This minor modification of Dropout has the statistical trait: the regularizer induced by Shakeout adaptively combines L0, L1 and L2 regularization terms...
May 5, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28489532/video-super-resolution-via-bidirectional-recurrent-convolutional-networks
#6
Yan Huang, Wei Wang, Liang Wang
Super resolving a low-resolution video, namely video super-resolution (SR), is usually handled by either single-image SR or multi-frame SR. Single-Image SR deals with each video frame independently, and ignores intrinsic temporal dependency of video frames which actually plays a very important role in video SR. Multi-Frame SR generally extracts motion information, e.g., optical flow, to model the temporal dependency, but often shows high computational cost. Considering that recurrent neural networks (RNNs) can model long-term temporal dependency of video sequences well, we propose a fully convolutional RNN named bidirectional recurrent convolutional network for efficient multi-frame SR...
May 4, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28489531/3d-object-localisation-from-multi-view-image-detections
#7
Cosimo Rubino, Marco Crocco, Alessio Del Bue
In this work we present a novel approach to recover objects 3D position and occupancy in a generic scene using only 2D object detections from multiple view images. The method reformulates the problem as the estimation of a quadric (ellipsoid) in 3D given a set of 2D ellipses fitted to the object detection bounding boxes in multiple views. We show that a closed-form solution exists in the dual-space using a minimum of three views while a solution with two views is possible through the use of non-linear optimisation and object constraints on the size of the object shape...
May 4, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28475049/towards-reaching-human-performance-in-pedestrian-detection
#8
Shanshan Zhang, Rodrigo Benenson, Mohamed Omran, Jan Hosang, Bernt Schiele
Encouraged by the recent progress in pedestrian detection, we investigate the gap between current state-of-the-art methods and the "perfect single frame detector". We enable our analysis by creating a human baseline for pedestrian detection (over the Caltech pedestrian dataset). After manually clustering the frequent errors of a top detector, we characterise both localisation and backgroundversus- foreground errors. To address localisation errors we study the impact of training annotation noise on the detector performance, and show that we can improve results even with a small portion of sanitised training data...
May 2, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28475048/trunk-branch-ensemble-convolutional-neural-networks-for-video-based-face-recognition
#9
Changxing Ding, Dacheng Tao
Human faces in surveillance videos often suffer from severe image blur, dramatic pose variations, and occlusion. In this paper, we propose a comprehensive framework based on Convolutional Neural Networks (CNN) to overcome challenges in video-based face recognition (VFR). First, to learn blur-robust face representations, we artificially blur training data composed of clear still images to account for a shortfall in real-world video training data. Using training data composed of both still images and artificially blurred data, CNN is encouraged to learn blur-insensitive features automatically...
May 2, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28475047/retrieval-of-sentence-sequences-for-an-image-stream-via-coherence-recurrent-convolutional-networks
#10
Cesc Park, Youngjin Kim, Gunhee Kim
We propose an approach for retrieving a sequence of natural sentences for an image stream. Since general users often take a series of pictures on their experiences, much online visual information exists in the form of image streams, for which it would better take into consideration of the whole image stream to produce natural language descriptions. While almost all previous studies have dealt with the relation between a single image and a single natural sentence, our work extends both input and output dimension to a sequence of images and a sequence of sentences...
May 2, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28475046/convolutional-oriented-boundaries-from-image-segmentation-to-high-level-tasks
#11
Kevis-Kokitsi Maninis, Jordi Pont-Tuset, Pablo Arbelaez, Luc Van Gool
We present Convolutional Oriented Boundaries (COB), which produces multiscale oriented contours and region hierarchies starting from generic image classification Convolutional Neural Networks (CNNs). COB is computationally efficient, because it requires a single CNN forward pass for multi-scale contour detection and it uses a novel sparse boundary representation for hierarchical segmentation; it gives a significant leap in performance over the state-of-the-art, and it generalizes very well to unseen categories and datasets...
May 2, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28475045/mixture-of-probabilistic-principal-component-analyzers-for-shapes-from-point-sets
#12
Ali Gooya, Karim Lekadir, Isaac Castro-Mateos, Jose M Pozo, Alejandro F Frangi
Inferring a probability density function (pdf) for shape from a population of point sets is a challenging problem. The lack of point-to-point correspondences and the non-linearity of the shape spaces undermine the linear models. Methods based on manifolds model the shape variations naturally, however, statistics are often limited to a single geodesic mean and an arbitrary number of variation modes. We relax the manifold assumption and consider a piece-wise linear form, implementing a mixture of distinctive shape classes...
May 2, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28475044/a-survey-on-learning-to-hash
#13
Jingdong Wang, Ting Zhang, Jingkuan Song, Nicu Sebe, Heng Tao Shen
Nearest neighbor search is a problem of finding the data points from the database such that the distances from them to the query point are the smallest. Learning to hash is one of the major solutions to this problem and has been widely studied recently. In this paper, we present a comprehensive survey of the learning to hash algorithms, categorize them according to the manners of preserving the similarities into: pairwise similarity preserving, multiwise similarity preserving, implicit similarity preserving, as well as quantization, and discuss their relations...
May 2, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28463187/automatic-camera-calibration-using-multiple-sets-of-pairwise-correspondences
#14
Francisco Vasconcelos, Joao P Barreto, Edmond Boyer
We propose a new method to add an uncalibrated node into a network of calibrated cameras using only pairwise point correspondences. While previous methods perform this task using triple correspondences, these are often difficult to establish when there is limited overlap between different views. In such challenging cases we must rely on pairwise correspondences and our solution becomes more advantageous. Our method includes an 11-point minimal solution for the intrinsic and extrinsic calibration of a camera from pairwise correspondences with other two calibrated cameras, and a new inlier selection framework that extends the traditional RANSAC family of algorithms to sampling across multiple datasets...
April 28, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28463186/deeplab-semantic-image-segmentation-with-deep-convolutional-nets-atrous-convolution-and-fully-connected-crfs
#15
Liang-Chieh Chen, George Papandreou, Iasonas Kokkinos, Kevin Murphy, Alan L Yuille
In this work we address the task of semantic image segmentation with Deep Learning and make three main contributions that are experimentally shown to have substantial practical merit. First, we highlight convolution with upsampled filters, or 'atrous convolution', as a powerful tool in dense prediction tasks. Atrous convolution allows us to explicitly control the resolution at which feature responses are computed within Deep Convolutional Neural Networks. It also allows us to effectively enlarge the field of view of filters to incorporate larger context without increasing the number of parameters or the amount of computation...
April 27, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28459684/towards-robust-and-accurate-multi-view-and-partially-occluded-face-alignment
#16
Junliang Xing, Zhiheng Niu, Junshi Huang, Weiming Hu, Xi Zhou, Shuicheng Yan
Face alignment acts as an important task in computer vision. Regression-based methods currently dominate the approach to solving this problem, which generally employ a series of mapping functions from the face appearance to iteratively update the face shape hypothesis. One keypoint here is thus how to perform the regression procedure. In this work, we formulate this regression procedure as a sparse coding problem. We learn two relational dictionaries, one for the face appearance and the other one for the face shape, with coupled reconstruction coefficient to capture their underlying relationships...
April 25, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28459683/rethinking-the-sgloh-descriptor
#17
Fabio Bellavia, Carlo Colombo
sGLOH (shifting GLOH) is a histogrambased keypoint descriptor that can be associated to multiple quantized rotations of the keypoint patch without any recomputation. This property can be exploited to define the best distance between two descriptor vectors, thus avoiding computing the dominant orientation. In addition, sGLOH can reject incongruous correspondences by adding a global constraint on the rotations either as an a priori knowledge or based on the data. This paper thoroughly reconsiders sGLOH and improves it in terms of robustness, speed and descriptor dimension...
April 25, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28436848/challenging-the-time-complexity-of-exact-subgraph-isomorphism-for-huge-and-dense-graphs-with-vf3
#18
Vincenzo Carletti, Pasquale Foggia, Alessia Saggese, Mario Vento
Graph matching is essential in several fields that use structured information, such as biology, chemistry, social networks, knowledge management, document analysis and others. Except for special classes of graphs, graph matching has in the worst-case an exponential complexity; however, there are algorithms that show an acceptable execution time, as long as the graphs are not too large and not too dense. In this paper we introduce a novel subgraph isomorphism algorithm, VF3, particularly efficient in the challenging case of graphs with thousands of nodes and a high edge density...
April 24, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28436847/learning-trans-dimensional-random-fields-with-applications-to-language-modeling
#19
Bin Wang, Zhijian Ou, Zhiqiang Tan
To describe trans-dimensional observations in sample spaces of different dimensions, we propose a probabilistic model, called the trans-dimensional random field (TRF) by explicitly mixing a collection of random fields. In the framework of stochastic approximation (SA), we develop an effective training algorithm, called augmented SA, which jointly estimates the model parameters and normalizing constants while using trans-dimensional mixture sampling to generate observations of different dimensions. Furthermore, we introduce several statistical and computational techniques to improve the convergence of the training algorithm and reduce computational cost, which together enable us to successfully train TRF models on large datasets...
April 24, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
https://www.readbyqxmd.com/read/28436846/efficient-2d-and-3d-facade-segmentation-using-auto-context
#20
Raghudeep Gadde, Varun Jampani, Renaud Marlet, Peter Gehler
This paper introduces a fast and efficient segmentation technique for 2D images and 3D point clouds of building facades. Facades of buildings are highly structured and consequently most methods that have been proposed for this problem aim to make use of this strong prior information. Contrary to most prior work, we are describing a system that is almost domain independent and consists of standard segmentation methods. We train a sequence of boosted decision trees using auto-context features. This is learned using stacked generalization...
April 24, 2017: IEEE Transactions on Pattern Analysis and Machine Intelligence
journal
journal
34134
1
2
Fetch more papers »
Fetching more papers... Fetching...
Read by QxMD. Sign in or create an account to discover new knowledge that matter to you.
Remove bar
Read by QxMD icon Read
×

Search Tips

Use Boolean operators: AND/OR

diabetic AND foot
diabetes OR diabetic

Exclude a word using the 'minus' sign

Virchow -triad

Use Parentheses

water AND (cup OR glass)

Add an asterisk (*) at end of a word to include word stems

Neuro* will search for Neurology, Neuroscientist, Neurological, and so on

Use quotes to search for an exact phrase

"primary prevention of cancer"
(heart or cardiac or cardio*) AND arrest -"American Heart Association"