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

Phoom Sagetong

dblp:92/3037 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-author

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 networks
1 paper
Wireless networking · 77% Cellular and mobile networks · 23%
Computer graphics and multimedia
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › error resilience
error-resilient video coding
0.012004
Video transport over wireless networks · ACM Multimedia 2004
Wireless networking › wireless multimedia
wireless video transmission
0.012004
Video transport over wireless networks · ACM Multimedia 2004
Cellular and mobile networks › mobile networks › mobile network architecture › cellular network architecture
cdma2000
0.012004
Video transport over wireless networks · ACM Multimedia 2004

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

variable rate vocoder · 0.1explicit bit rate compression · 0.1
YearPublicationVenuePosition
2004 Video transport over wireless networks
abstract
In this paper, we propose an efficient scheme to transport video over wireless networks, specifically cdma2000® 1x. Speech transmission over cdma2000® uses a variable rate voice coder (vocoder) over a channel with multiple fixed rates. We apply these ideas to compressed video transmission over wireless IP networks. Explicit Bit Rate (EBR) video compression is designed to match the video encoder output to a set of fixed channel rates. We show that in comparison with VBR video transmission over a fixed rate wireless channel, EBR video transmission provides improved error resilience, reduced latency and improved efficiency.
Harinath Garudadri, Phoom Sagetong, Sanjiv Nanda
ACM Multimedia2
2003 Estimation of erased data in a H.263 coded stream by using unbalanced multiple description coding
abstract
In this work we tackle the problem of error propagation that packet losses can cause in commonly used predictive video coding environments. Using unbalanced multiple description coding (UMDC) to generate redundant source data, we apply the consistency sequence estimation (CSE) algorithm for estimating the lost data. The CSE algorithm, proposed by Singh and Ortega for a 1-D input source signal in a DPCM context, uses a sequence search to verify the consistency of the estimates with the received data. The novelty of our work is the extension of the CSE algorithm to a block matching ME/MC video coder (such as H.263). To reach this aim we propose to work in the spatial domain. Among the advantages of the proposed error resilience scheme are its low-complexity and its compatibility with standard video coders.
Marco Fumagalli, Phoom Sagetong, Antonio Ortega
ICME2
2002 Rate-distortion model and analytical bit allocation for wavelet-based region of interest coding
abstract
We introduce a novel rate-distortion (RD) model for images coded with a progressive wavelet coder, such as SPIHT (set partitioning in hierarchical trees) or JPEG2000, and especially designed to capture RD behavior when different parts of an image are refined at different speeds. Our model is an extension of Mallat's model (Mallat and Falzon 1998), which takes into account that the rates used are not necessarily the same throughout the image. Because of the different rates, certain modeling approximations (e.g., those for coarse quantization) can not be used uniformly throughout the image. Allocating different numbers of bits to different regions in an image is a problem that appears in applications such as region of interest (ROI) coding or multiple description coding (MDC), where the wavelet coefficients are divided by different factors before coding to enable different bit allocations to different regions. We show that the proposed RD model provides a more accurate estimate than Mallat's model.
Phoom Sagetong, Antonio Ortega
ICIP (3)1
2002 Dynamic wavelet feature-based watermarking for copyright tracking in digital movie distribution systems
abstract
We propose novel watermark embedding and detection methods to address the problem of copyright tracking of movies distributed to theaters by satellites. Temporal and spatial wavelet transformation as well as feature-based watermark embedding procedures are deployed such that the proposed watermarking algorithm is able to affect a compromise tradeoff between the visual quality and the robustness. The multi-resolution nature of the wavelet transformations of a video sequence makes the watermark very robust and secure. Wavelet features make huge watermark patterns possible, which allows unique labeling of huge number of videos and video sequences dynamically. Changing some of the features in the video wavelet transformation domain according to the defined rules makes the watermark detection semi-oblivious, which allows watermark detection very robust and independent without the original sequence. Our proposed watermark can also be detected robustly after many kinds of malicious pirating attacks and modifying, and experimental results are reported in this paper.
Phoom Sagetong, Wensheng Zhou
ICIP (3)1
2001 Analytical Model-Based Bit Allocation Forwavelet Coding With Applications To Multiple Description Coding And Region Of Interest Coding
abstract
We address the problem of allocating bits to the different regions in an image coded with a progressive wavelet coder such as SPIHT (Set Partitioning in Hierarchical Trees) [1]. This type of problem appears in applications such as Region of Interest (ROI) coding or Multiple Description Coding (MDC). The wavelet coefficients in both cases are divided by different factors before coding to enable different bit allocation to different regions, because the coefficients in each region are refined at different speeds. While this is a popular approach for ROI coding [2, 3], we propose using it for MDC as well. In this work, we introduce a priority scaling factor ( ) as a dividing factor. The main contribution of this work is to provide an analytical technique to determine what the should be, given criteria such as relative importance of the regions in ROI coding or degree of redundancy in an MDC. Our approach is based on an approximation to Mallat's model [4]. We show how our selection of is basically the same as that obtained by optimization of empirical data, with significantly less complexity. 1.
Phoom Sagetong, Antonio Ortega
ICME1