default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan L. P. de Lameillieure
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2009
[j12]Stijn Notebaert, Jan De Cock, Samie Beheydt, Jan de Lameillieure, Rik Van de Walle:
Mixed architectures for H.264/AVC digital video transrating. Multim. Tools Appl. 44(1): 39-64 (2009)- 1997
- [j11]Minhua Zhou, Jan L. P. de Lameillieure:
IDCT output range before clipping in MPEG video coding. Signal Process. Image Commun. 11(2): 137-145 (1997) - [j10]Peter Kauff, Bela Makai, S. Rauthenberg, Ulrich Goelz, Jan L. P. de Lameillieure, Thomas Sikora:
Functional coding of video using a shape-adaptive DCT algorithm and an object-based motion prediction toolbox. IEEE Trans. Circuits Syst. Video Technol. 7(1): 181-196 (1997) - 1993
- [j9]Günter Schamel, Jan de Lameillieure:
Subband based TV coding. Signal Process. Image Commun. 5(1-2): 105-118 (1993) - 1992
- [j8]Jan de Lameillieure, Günter Schamel:
A Transformation for the Calculation of Filter Pairs for Perfect Reconstruction in Subband Coding with Linequincunx Subsampling. IEEE J. Sel. Areas Commun. 10(5): 972-975 (1992) - 1991
- [j7]Jan de Lameillieure, Ignace Bruyland:
Comments on 'A subjective evaluation of noise-shaping quantization for adaptive intra-/interframe DPCM coding of color television signals' [by B. Girod et al.]. IEEE Trans. Commun. 39(8): 1192 (1991) - 1990
- [j6]Jan de Lameillieure, Ignace Bruyland:
Single stage 280 Mbit/s coding of HDTV using HDPCM with a vector quantizer based on masking functions. Signal Process. Image Commun. 2(3): 279-289 (1990) - 1988
- [j5]Jan L. P. de Lameillieure:
Correction to 'A heuristic algorithm for the construction of a code with limited word length' (May 87 438-443). IEEE Trans. Inf. Theory 34(4): 893-894 (1988) - 1987
- [j4]Jan L. P. de Lameillieure, Ignace Bruyland:
Corrections to "Comment on ́Algorithm for Construction of Variable Length Code with Limited Maximum Word Length́". IEEE Trans. Commun. 35(8): 846 (1987) - [j3]Jan L. P. de Lameillieure:
A heuristic algorithm for the construction of a code with limited word length. IEEE Trans. Inf. Theory 33(3): 438-443 (1987) - 1986
- [j2]Jan de Lameillieure:
Comments on "A Predictor Switching Scheme for DPCM Coding of Video Signals". IEEE Trans. Commun. 34(6): 628-630 (1986) - [j1]Jan L. P. de Lameillieure, Ignace Bruyland:
Comment on "Algorithm for Construction of Variable Length Code with Limited Maximum Word Length". IEEE Trans. Commun. 34(12): 1252-1253 (1986)
Conference and Workshop Papers
- 1995
- [c1]Gertjan Keesman, Andrew Cotton, Damien Kessler, Jan de Lameillieure, Jean-Pierre Henot, André Nicoulin, Dimitris Kalivas:
Study of the subjective performance of a range of MPEG-2 encoders. ICIP 1995: 543-546
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
