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

Edward L. Schwartz

dblp:52/1632 · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 7Databases, data management, data science and information retrieval · 4Artificial intelligence and machine learning · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 77% Integrated circuit design · 23%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
boltzmann machine
0.011993
Digital Boltzmann VLSI for Constraint Satisfaction and Learning · NIPS 1993
Hardware accelerators and domain-specific architectures
constraint satisfaction
0.011993
Digital Boltzmann VLSI for Constraint Satisfaction and Learning · NIPS 1993
Integrated circuit design
digital circuit design
0.011993
Digital Boltzmann VLSI for Constraint Satisfaction and Learning · NIPS 1993

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

boltzmann machine · 0.0VLSI · 0.0
YearPublicationVenuePosition
2014 Image-based document management: aggregating collections of handwritten forms
abstract
Many companies still operate critical business processes using paper-based forms, including customer surveys, inspections, contracts and invoices. Converting those handwritten forms to symbolic data is expensive and complicated. This paper presents an overview of the Image-Based Document Management (IBDM) system for analyzing handwritten forms without requiring conversion to symbolic data. Strokes captured in a questionnaire on a tablet are separated into fields that are then displayed in a spreadsheet. Rows represent documents while columns represent corresponding fields across all documents. IBDM allows a process owner to capture and analyze large collections of documents with minimal IT support. IBDM supports the creation of filters and queries on the data. IBDM also allows the user to request symbolic conversion of individual columns of data and permits the user to create custom views by reordering and sorting the columns. In other words, IBDM provides a "writing on paper" experience for the data collector and a web-based database experience for the analyst.
John W. Barrus, Edward L. Schwartz
ACM Symposium on Document Engineering2
2010 Automatic Discovery and Execution of Personal Applications from Shared IO Devices
abstract
Shared office information appliances such as copiers, scanners and meeting-room displays are increasingly being integrated into complex electronic document workflows. To support this new role these appliances are being designed with advanced features such as optical character recognition, networked storage, content-based routing and integration with back-end databases, yet availability of these features is often hampered by various factors. Here we present an architecture, code named Odessa, that moves all task-specific processing off the office appliance and on to a user's own device: PC / laptop, or smartphone. Key features of the architecture include a simple RESTful HTTP application interface and automatic service discovery.
Bradley J. Rhodes, Sergey Chemishkian, Edward L. Schwartz, Stephen Savitzky, Haixia Yu
CCNC3
2006 Standards based high resolution Document editing using low resolution proxy images
abstract
This poster presents an implementation of the JPIP-JPM standard which allows low bandwidth access to remote high resolution documents. The implementation goes beyond the standard by allowing simple editing operations at the client without obtaining all of the compressed data. These edits form a new version of the document that can be easily uploaded over low bandwidth connections.
Michael J. Gormish, Edward L. Schwartz
ACM Symposium on Document Engineering2
2002 Removal of tile artifacts using projection onto scaling functions for JPEG2000
abstract
For practical image compression systems, handling images divided into independent tiles in the pixel domain is important. However, tiling introduces artifacts when transform coefficients are quantized The paper presents a "detiling" solution applicable to wavelet transform coefficients. The solution, called projection onto scaling functions, eliminates the blocking artifacts by computing approximations that match the smoothness of the compressed image inside a tile. This solution is applicable to any wavelet filter - extending previous work that applied only to a limited class of wavelet filters - and specifically targets decoding of JPEG2000 compressed images.
Kathrin Berkner, Edward L. Schwartz
ICIP (1)2
2000 A New Wavelet-Based Approach to Sharpening and Smoothing of Images in Besov Spaces with Applications to Deblurring
abstract
The problem of image enhancement arises in many applications such as scanners, copiers and digital cameras. Enhancement often includes a denoising and a deblurring or sharpening step. Similar to image compression, state-of-the-art denoising techniques use wavelet bases instead of Fourier bases since wavelet domain processing provides local adaptation in smooth and non-smooth parts due to the theoretical link between wavelets and smoothness spaces. In this paper the same smoothness spaces are used to propose a way of performing sharpening and smoothing of signals with wavelets (WSS) in Besov spaces. As an application the completely wavelet-based enhancement of a scanned document is discussed.
Kathrin Berkner, Michael J. Gormish, Edward L. Schwartz, Martin P. Boliek
ICIP3
1997 Next generation image compression and manipulation using CREW
abstract
As the applications of digital imagery expand in resolution and pixel fidelity there is a greater need for more efficient compression and extraction of images and sub-images. No longer is it sufficient to compress and decompress an image for a specific target device. The ability to handle many types of image data, extract images at different resolutions and quality, zoom and pan, and to extract regions-of-interest are the new measures of image compression systems. CREW (compression with reversible embedded wavelets) is a high quality image compression system that is progressive from high compression to lossless, pyramidal, and supports regions-of-interest and multiple image types. This paper describes the CREW system and format, shows how the correct data can be quickly extracted from a CREW file to support a variety of target devices, describes the mechanisms needed for panning, zooming, and fixed-size compression, and explains the superior performance on bi-level and graphic images.
Martin P. Boliek, Michael J. Gormish, Edward L. Schwartz, Alexander Keith
ICIP (3)3
1996 Device Selective Quantization for Reversible Wavelets
abstract
Compression with reversible embedded wavelets (CREW) consists of three major parts: a wavelet transform, an embedded context model, and a binary entropy coder. The wavelet transform is a special implementation of high quality wavelet which provides perfect reconstruction with finite precision coefficients. The context model describes the wavelet coefficients in a particular order with conditional probability estimates. Finally the FSM-coder, a binary entropy coder with functionality similar to the QM-coder, is used to generate the final code stream.
Michael J. Gormish, Ahmad Zandi, Edward L. Schwartz, Alexander Keith, Martin P. Boliek
Data Compression Conference3
1996 Compression with reversible embedded wavelets with an enhanced binary mode
abstract
Compression with reversible embedded wavelets (CREW) is a unified lossless and lossy continuous-tone still image compression system. Wavelet coefficients are encoded in a bit-significance embedded order, allowing lossy compression by truncating the compressed data after encoding. CREW's context-based coding, called Horizon coding, takes advantage of the spatial and spectral information available in the wavelet domain and adapts well to the lessor significant bits. CREW's capabilities have been enhanced to include a binary mode for compression of binary and graphic images. This also improves compression on some images that do not use the full dynamic range. The binary mode encodes bit-planes of the image without using the transform. This JBIG-like system uses the resources already available in the CREW system. This paper introduces some basic concepts of CREW and describes the binary mode in detail.
Ahmad Zandi, Martin P. Boliek, Edward L. Schwartz, Alexander Keith
ICASSP3
1995 CREW: Compression with Reversible Embedded Wavelets
abstract
Compression with Reversible Embedded Wavelets (CREW) is a unified lossless and lossy continuous tone still image compression system. It is wavelet based using a "reversible" approximation of one of the best wavelet filters. Reversible wavelets are linear filters with non linear rounding which implement exact reconstruction systems with minimal precision integer arithmetic. Wavelet coefficients are encoded in a bit significance embedded order, allowing lossy compression by simply truncating the compressed data. For coding of coefficients, CREW uses a method similar to J. Shapiro's (1993) zero tree, and a completely novel method called Horizon. Horizon coding is a context based coding that takes advantage of the spatial and spectral information available in the wavelet domain. CREW provides state of the art lossless compression of medical images (greater than 8 bits deep), and lossy and lossless compression of 8 bit deep images with a single system. CREW has reasonable software and hardware implementations.
Ahmad Zandi, James D. Allen, Edward L. Schwartz, Martin P. Boliek
Data Compression Conference3
1994 Very High Speed Entropy Coding
abstract
Efforts to build high-speed hardware for many different entropy coders are limited by fundamental feedback loops. A method that allows for parallel compression in hardware is described. This parallelism results in extremely high rates, 100 million symbols/second or higher. The system is generalizable to any lossless or lossy system with deterministic decompression. Prototype hardware that divides the data into multiple streams that feed parallel coders is presented. The problem of efficient transmission of multiple streams of variable-length coded data is solved by a unique coded data interleave method.>
Martin P. Boliek, James D. Allen, Edward L. Schwartz, Michael J. Gormish
ICIP (3)3
1993 Digital Boltzmann VLSI for Constraint Satisfaction and Learning
Michael Murray, Ming-Tak Leung, Kan Boonyanit, Kong Kritayakirana, James B. Burr, Gregory J. Wolff, Tokahiro Watanabe, Edward L. Schwartz, David G. Stork, Allen M. Peterson
NIPS8