Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Computer vision (3)
- Machine learning (3)
- ALgorithms (1)
- Agda (Programming language) (1)
- Algorithms (1)
-
- Bayesian field theory (1)
- Computer algorithms (1)
- Convolutions (Mathematics) -- Data processing (1)
- Curry (Programming language) -- Evaluation (1)
- Digital video (1)
- Functional programming (Computer science) (1)
- Image processing -- Digital techniques (1)
- Image processing -- Methodology (1)
- Image recognition (Computer vision) (1)
- Interpolation -- Applications to image processing (1)
- Mathematical models (1)
- Neural networks (Computer science) (1)
- Nondeterministic computation (1)
- Pattern recognition systems -- Data processing (1)
Articles 1 - 6 of 6
Full-Text Articles in Computer Engineering
Video Frame Interpolation Via Adaptive Separable Convolution, Simon Niklaus, Long Mai, Feng Liu
Video Frame Interpolation Via Adaptive Separable Convolution, Simon Niklaus, Long Mai, Feng Liu
Computer Science Faculty Publications and Presentations
Standard video frame interpolation methods first estimate optical flow between input frames and then synthesize an intermediate frame guided by motion. Recent approaches merge these two steps into a single convolution process by convolving input frames with spatially adaptive kernels that account for motion and re-sampling simultaneously. These methods require large kernels to handle large motion, which limits the number of pixels whose kernels can be estimated at once due to the large memory demand. To address this problem, this paper formulates frame interpolation as local separable convolution over input frames using pairs of 1D kernels. Compared to regular 2D …
Fast On-Line Kernel Density Estimation For Active Object Localization, Anthony D. Rhodes, Max H. Quinn, Melanie Mitchell
Fast On-Line Kernel Density Estimation For Active Object Localization, Anthony D. Rhodes, Max H. Quinn, Melanie Mitchell
Computer Science Faculty Publications and Presentations
A major goal of computer vision is to enable computers to interpret visual situations—abstract concepts (e.g., “a person walking a dog,” “a crowd waiting for a bus,” “a picnic”) whose image instantiations are linked more by their common spatial and semantic structure than by low-level visual similarity. In this paper, we propose a novel method for prior learning and active object localization for this kind of knowledge-driven search in static images. In our system, prior situation knowledge is captured by a set of flexible, kernel-based density estimations— a situation model—that represent the expected spatial structure of the given situation. These …
Sparse Coding On Stereo Video For Object Detection, Sheng Y. Lundquist, Melanie Mitchell, Garrett T. Kenyon
Sparse Coding On Stereo Video For Object Detection, Sheng Y. Lundquist, Melanie Mitchell, Garrett T. Kenyon
Computer Science Faculty Publications and Presentations
Deep Convolutional Neural Networks (DCNN) require millions of labeled training examples for image classification and object detection tasks, which restrict these models to domains where such a dataset is available. We explore the use of unsupervised sparse coding applied to stereo-video data to help alleviate the need for large amounts of labeled data. In this paper, we show that unsupervised sparse coding is able to learn disparity and motion sensitive basis functions when exposed to unlabeled stereo-video data. Additionally, we show that a DCNN that incorporates unsupervised learning exhibits better performance than fully supervised networks. Furthermore, finding a sparse representation …
Video Frame Interpolation Via Adaptive Convolution, Simon Niklaus, Long Mai, Feng Liu
Video Frame Interpolation Via Adaptive Convolution, Simon Niklaus, Long Mai, Feng Liu
Computer Science Faculty Publications and Presentations
Video frame interpolation typically involves two steps: motion estimation and pixel synthesis. Such a two-step approach heavily depends on the quality of motion estimation. This paper presents a robust video frame interpolation method that combines these two steps into a single process. Specifically, our method considers pixel synthesis for the interpolated frame as local convolution over two input frames. The convolution kernel captures both the local motion between the input frames and the coefficients for pixel synthesis. Our method employs a deep fully convolu- tional neural network to estimate a spatially-adaptive con- volution kernel for each pixel. This deep neural …
Bayesian Optimization For Refining Object Proposals, Anthony D. Rhodes, Jordan Witte, Melanie Mitchell, Bruno Jedynak
Bayesian Optimization For Refining Object Proposals, Anthony D. Rhodes, Jordan Witte, Melanie Mitchell, Bruno Jedynak
Computer Science Faculty Publications and Presentations
We develop a general-purpose algorithm using a Bayesian optimization framework for the efficient refinement of object proposals. While recent research has achieved substantial progress for object localization and related objectives in computer vision, current state-of-the-art object localization procedures are nevertheless encumbered by inefficiency and inaccuracy. We present a novel, computationally efficient method for refining inaccurate bounding-box proposals for a target object using Bayesian optimization. Offline, image features from a convolutional neural network are used to train a model to predict an object proposal’s offset distance from a target object. Online, this model is used in a Bayesian active search to …
Proving Non-Deterministic Computations In Agda, Sergio Antoy, Michael Hanus, Steven Libby
Proving Non-Deterministic Computations In Agda, Sergio Antoy, Michael Hanus, Steven Libby
Computer Science Faculty Publications and Presentations
We investigate proving properties of Curry programs using Agda. First, we address the functional correctness of Curry functions that, apart from some syntactic and semantic differences, are in the intersection of the two languages. Second, we use Agda to model non-deterministic functions with two distinct and competitive approaches incorporating the non-determinism. The first approach eliminates non-determinism by considering the set of all non-deterministic values produced by an application. The second approach encodes every non-deterministic choice that the application could perform. We consider our initial experiment a success. Although proving properties of programs is a notoriously difficult task, the functional logic …