A novel context template design method is presented for lossless compression of halftone images. In each pixel traversal,
the proposed method modifies context template according to inter-pixel correlation. Then, each pixel is arithmetic coded
by using the updated context template. Based on its adaptation to local pixel correlation, the proposed design scheme
outperforms the standard JBIG arithmetic coding by 29 % of bit saving.
A novel template design algorithm is presented for lossless compression of color halftone images. First, we extract the
line pattern in the neighbor local region of each bi-level pixel. Then, the representative line pattern is evaluated from
these obtained lines, using the least square error minimization. According to the evaluated line pattern and two design
constraints, therefore, the context template is shaped. With the designed template, finally, each color channel image is
compressed by a context-based binary arithmetic encoder. Based on the adaptiveness of the template to the input image,
the proposed templates yield better compression performance than the conventional JBIG templates, which saves 35% of
the JBIG bitstream.
A multiple description coding (MDC) technique for 3D surface geometry is proposed in this work. The encoder uses a plane-based representation to describe point samples. Then, those plane primitives are classified into two disjoint subsets or two descriptions, each of which provides equal contribution in 3D surface description. The two descriptions are compressed and transmitted over distinct channels. At the decoder, if both channels are available, the descriptions are decoded and merged together to reconstruct a high quality surface. If only one channel is available, we employ a surface interpolation method to fill visual holes and reconstruct a smooth surface. Therefore, the proposed algorithm can provide an acceptable reconstruction even though one channel is totally lost. Simulation results demonstrate that the proposed algorithm is a promising scheme for 3D data transmission over noisy channels.
In this work, we propose a novel 3-D mesh editing algorithm using motion features. First, a vertex-wise motion vector is defined between the corresponding vertex pair of two sample meshes. Then, we
extract the motion feature for each vertex, which represents the similarity of neighboring vertex-wise motion vectors on a local mesh
region. When anchor vertices are moved by external force, the mesh
geometry is deformed such that the motion feature of each vertex is
preserved to the greatest extent. Extensive simulation results on
various mesh models demonstrate that the proposed mesh deformation
scheme yields visually pleasing editing results.
We present a low-cost WDM-PON employing colorless uncooled RSOA-based
spectrum sliced sources. Colorless operations over 32 WDM channels are demonstrated from 0 to 60 oC in 155-Mb/s transmissions over 25 km.
An algorithm for robust transmission of compressed 3-D mesh data is
proposed in this work. In the encoder, we partition a 3-D mesh
adaptively according to the surface complexity, and then encode each
partition separately to reduce the error propagation effect. To
encode joint boundaries compactly, we propose a boundary edge
collapse rule, which also enables the decoder to zip partitions
seamlessly. In the decoder, an error concealment scheme is employed
to improve the visual quality of corrupted partitions. The
concealment algorithm utilizes the information in neighboring
partitions and reconstructs the lost surface based on the
semi-regular connectivity reconstruction and the polynomial
interpolation. Simulation results demonstrate that the proposed
algorithm provides a good rendering quality even in severe error
conditions.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.