Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John Kassebaum

dblp:52/3463 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorComputer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Image and video coding · 82% Visual content generation and editing · 12% Audio and music processing · 6%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video coding › region-based video coding
region-of-interest coding
0.112008
Supporting region-of-interest cropping through constrained compression · ACM Multimedia 2008
Image and video coding
video compression
0.112008
Supporting region-of-interest cropping through constrained compression · ACM Multimedia 2008
Visual content generation and editing › video retargeting
video cropping
0.012008
Supporting region-of-interest cropping through constrained compression · ACM Multimedia 2008
Audio and music processing › source separation › speech separation
cocktail party problem
0.011989
The Cocktail Party Problem: Speech/Data Signal Separation Comparison between Backpropagation and SONN · NIPS 1989
Audio and music processing › source separation
speech separation
0.011989
The Cocktail Party Problem: Speech/Data Signal Separation Comparison between Backpropagation and SONN · NIPS 1989
Machine learning › Deep learning architectures and training
backpropagation
0.011989
The Cocktail Party Problem: Speech/Data Signal Separation Comparison between Backpropagation and SONN · NIPS 1989

Methods — techniques the papers use, named apart from their topics

constrained compression · 0.1MPEG-2 · 0.1self-organizing neural network · 0.0backpropagation · 0.0
YearPublicationVenuePosition
2011 Supporting region-of-interest cropping through constrained compression
abstract
The ability to create super high-resolution video is becoming relative easy to do either through a single high-definition video camera or panoramic video that automatically stitches multiple views together. As an example of the former, the motion picture industry now has 6000 × 4000 pixel full-rate video cameras available. This means that supporting region-of-interest cropping will become more important in the future. In this article, we propose a mechanism to support region-of-interest adaptation of stored video. The proposed approach creates a compression-compliant stream (e.g., MPEG-2), while still allowing it to be cropped. Fortunately, video standards like MPEG-2 specify the format of a compliant stream, and not the algorithm to get there. As a result, there is an opportunity to allow system researchers and implementers ways to optimize for applications. We show various fundamental tradeoffs that are made in order to support region-of-interest cropping with super high-resolution video which we received from a local motion-picture firm.
Wu-chi Feng, Thanh Dang, John Kassebaum, Tim Bauman
ACM Trans. Multim. Comput. Commun. Appl.3
2010 3-D Target-Based Distributed Smart Camera Network Localization
abstract
For distributed smart camera networks to perform vision-based tasks such as subject recognition and tracking, every camera's position and orientation relative to a single 3-D coordinate frame must be accurately determined. In this paper, we present a new camera network localization solution that requires successively showing a 3-D feature point-rich target to all cameras, then using the known geometry of a 3-D target, cameras estimate and decompose projection matrices to compute their position and orientation relative to the coordinatization of the 3-D target's feature points. As each 3-D target position establishes a distinct coordinate frame, cameras that view more than one 3-D target position compute translations and rotations relating different positions' coordinate frames and share the transform data with neighbors to facilitate realignment of all cameras to a single coordinate frame. Compared to other localization solutions that use opportunistically found visual data, our solution is more suitable to battery-powered, processing-constrained camera networks because it requires communication only to determine simultaneous target viewings and for passing transform data. Additionally, our solution requires only pairwise view overlaps of sufficient size to see the 3-D target and detect its feature points, while also giving camera positions in meaningful units. We evaluate our algorithm in both real and simulated smart camera networks. In the real network, position error is less than 1 ('') when the 3-D target's feature points fill only 2.9% of the frame area.
John Kassebaum, Nirupama Bulusu, Wu-chi Feng
IEEE Trans. Image Process.1
2008 Supporting region-of-interest cropping through constrained compression
abstract
The ability to create very high-resolution video is becoming relative easy to do today, either through a single high definition video camera or panoramic video stitched from multiple cameras. This means that supporting region-of-interest cropping will become more important in the future. In this paper, we propose a mechanism to support region-of-interest adaptation of stored video. The proposed approach creates a compression compliant stream (e.g., MPEG-2), while still allowing it to be cropped. Using data from a motion-picture industry video camera, we show that the proposed approach, while adding a small amount of overhead, can be used to efficiently crop large resolution video into a smaller stream.
Wu-chi Feng, Thanh Dang, John Kassebaum, Tim Bauman
ACM Multimedia3
1989 The Cocktail Party Problem: Speech/Data Signal Separation Comparison between Backpropagation and SONN
John Kassebaum, Manoel Fernando Tenorio, Christoph Schaefers
NIPS1