default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeal C. Gallagher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[j23]Daniel Leo Lau
, Gonzalo R. Arce, Neal C. Gallagher:
Digital color halftoning with generalized error diffusion and multichannel green-noise masks. IEEE Trans. Image Process. 9(5): 923-935 (2000)- [j22]Gonzalo R. Arce, Nikolai A. Grabowski, Neal C. Gallagher:
Weighted median filters with sigma-delta modulation encoding. IEEE Trans. Signal Process. 48(2): 489-498 (2000)
1990 – 1999
- 1999
- [c7]Daniel Leo Lau, Gonzalo R. Arce, Neal C. Gallagher:
Robust Halftoning with Green-Noise. PICS 1999: 315-320 - 1998
- [j21]Daniel L. Lau, Gonzalo R. Arce, Neal C. Gallagher:
Green-noise digital halftoning. Proc. IEEE 86(12): 2424-2444 (1998) - [c6]Daniel Leo Lau, Gonzalo R. Arce, Neal C. Gallagher:
Green Noise Digital Halftoning. ICIP (2) 1998: 39-43 - 1996
- [c5]Daniel Leo Lau, Gonzalo R. Arce, Neal C. Gallagher:
Robust image wavelet shrinkage for denoising. ICIP (1) 1996: 371-374 - 1994
- [j20]Robert W. Hawley, Neal C. Gallagher Jr., Mike P. Fitz:
Stack filter phase lock loops. Signal Process. 38(3): 317-329 (1994) - [j19]Robert W. Hawley, Neal C. Gallagher Jr.:
On Edgeworth's method for minimum absolute error linear regression. IEEE Trans. Signal Process. 42(8): 2045-2054 (1994)
1980 – 1989
- 1989
- [c4]Cameron H. G. Wright, Edward J. Delp, Neal C. Gallagher Jr.:
Morphological based target enhancement algorithms to counter the hostile nuclear environment. SMC 1989: 358-363 - 1988
- [j18]Gonzalo R. Arce, Neal C. Gallagher Jr.:
Stochastic analysis for the recursive median filter process. IEEE Trans. Inf. Theory 34(4): 669-679 (1988) - 1986
- [j17]Peter D. Wendt, Edward J. Coyle, Neal C. Gallagher Jr.:
Stack filters. IEEE Trans. Acoust. Speech Signal Process. 34(4): 898-911 (1986) - [c3]S. S. H. Naqvi, Neal C. Gallagher, Edward J. Coyle:
An application of median filters to digital television. ICASSP 1986: 2451-2454 - 1985
- [j16]J. Patrick Fitch, Edward J. Coyle, Neal C. Gallagher Jr.:
Root properties and convergence rates of median filters. IEEE Trans. Acoust. Speech Signal Process. 33(1): 230-240 (1985) - [j15]Guang-Yu Liao, Thomas A. Nodes, Neal C. Gallagher Jr.:
Output distributions of two-dimensional median filters. IEEE Trans. Acoust. Speech Signal Process. 33(5): 1280-1295 (1985) - 1984
- [j14]Thomas A. Nodes, Neal C. Gallagher:
The Output Distribution of Median Type Filters. IEEE Trans. Commun. 32(5): 532-541 (1984) - [c2]Thomas A. Nodes, Guang-Yu Liao, Neal C. Gallagher Jr.:
Statistical analysis of two dimensional median filtered images. ICASSP 1984: 255-258 - 1983
- [j13]Gonzalo R. Arce, Neal C. Gallagher Jr.:
BTC Image Coding Using Median Filter Roots. IEEE Trans. Commun. 31(6): 784-793 (1983) - [c1]Thomas A. Nodes, Neal C. Gallagher Jr.:
Image convergence under two dimensional separable median filtering. ICASSP 1983: 407-410 - 1982
- [j12]James A. Bucklew, Neal C. Gallagher Jr.:
A Note on the Computation of Optimal Minimum Mean-Square Error Quantizers. IEEE Trans. Commun. 30(1): 298-301 (1982) - [j11]Neal C. Gallagher Jr., James A. Bucklew:
Properties of minimum mean squared error block quantizers. IEEE Trans. Inf. Theory 28(1): 105-107 (1982) - [j10]Kerry D. Rines, Neal C. Gallagher Jr.:
The design of two-dimensional quantizers using prequantization. IEEE Trans. Inf. Theory 28(2): 232-238 (1982) - [j9]T. E. McCannon, Neal C. Gallagher Jr., D. Minoo-Hamedani, Gary L. Wise:
On the design of nonlinear discrete-time predictors. IEEE Trans. Inf. Theory 28(2): 366-371 (1982) - 1981
- [j8]T. E. McCannon, Neal C. Gallagher Jr.:
On a class of random processes exhibiting optimal nonlinear one-step predictors. IEEE Trans. Inf. Theory 27(5): 652-656 (1981) - 1980
- [j7]James A. Bucklew, Neal C. Gallagher Jr.:
Some properties of uniform step size quantizers (Corresp.). IEEE Trans. Inf. Theory 26(5): 610-613 (1980)
1970 – 1979
- 1979
- [j6]James A. Bucklew, Neal C. Gallagher Jr.:
A note on optimal quantization (Corresp.). IEEE Trans. Inf. Theory 25(3): 365-366 (1979) - [j5]James A. Bucklew, Neal C. Gallagher Jr.:
Quantization schemes for bivariate Gaussian random variables. IEEE Trans. Inf. Theory 25(5): 537-543 (1979) - [j4]James A. Bucklew, Neal C. Gallagher Jr.:
Two-dimensional quantization of bivariate circularly symmetric densities. IEEE Trans. Inf. Theory 25(6): 667-671 (1979) - 1978
- [j3]Gary L. Wise, Neal C. Gallagher Jr.:
On spherically invariant random processes (Corresp.). IEEE Trans. Inf. Theory 24(1): 118-120 (1978) - [j2]Neal C. Gallagher Jr.:
Quantizing schemes for the discrete Fourier transform of a random time-series. IEEE Trans. Inf. Theory 24(2): 156-163 (1978) - 1976
- [j1]Neal C. Gallagher Jr.:
Discrete spectral phase coding (Corresp.). IEEE Trans. Inf. Theory 22(5): 622-624 (1976)
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:15 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:
