default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 80 matches
- 1982
- Hendrik James Antonisse:
Image segmentation in pyramids. Comput. Graph. Image Process. 19(1): 88 (1982) - Hendrik James Antonisse:
Image segmentation in pyramids. Comput. Graph. Image Process. 19(4): 367-383 (1982) - Wolfgang Böhm:
On cubics: A survey. Comput. Graph. Image Process. 19(1): 84 (1982) - Wolfgang Böhm:
On cubics: A survey. Comput. Graph. Image Process. 19(3): 201-226 (1982) - Peter J. Burt:
Fast algorithms for estimating local image properties. Comput. Graph. Image Process. 19(1): 90 (1982) - Virginio Cantoni:
Matching the task to an I. P. architecture. Comput. Graph. Image Process. 19(4): 402 (1982) - Jean-Marc Chassery:
Discrete convexity: Definition, parametrization, and compatibility with continuous convexity. Comput. Graph. Image Process. 19(1): 87 (1982) - Roland T. Chin, Chia-Lung Yeh:
Quantitative evaluationof some edge-preserving noisse-smoothing techniques. Comput. Graph. Image Process. 19(4): 402 (1982) - Jean-Pierre Crettez, J. C. Simon:
A model for cell receptive fields in the visual striate cortex. Comput. Graph. Image Process. 19(1): 85 (1982) - Larry S. Davis:
Mites (mit-∂s): A model-driven, iterative texture segmentation algorithm. Comput. Graph. Image Process. 19(1): 84 (1982) - Larry S. Davis:
A structural analysis of complex aerial photographs : Makoto Nagao and Takashi Matsuyama. Plenum Press, New York, 1980. 199 pages. Comput. Graph. Image Process. 19(2): 196-197 (1982) - Larry S. Davis, Amar Mitiche:
MITES (mit-æs): A model-driven, iterative texture segmentation algorithm. Comput. Graph. Image Process. 19(2): 95-110 (1982) - Paul Dierckx:
Algorithms for smoothing data with periodic and parametric splines. Comput. Graph. Image Process. 19(1): 89 (1982) - Arcangelo Distante, Nicola Veneziani:
A two-pass filling algorithm for raster graphics. Comput. Graph. Image Process. 19(1): 93 (1982) - Leonie Dreschler, Hans-Hellmut Nagel:
Volumetric model and 3D trajectory of a moving car derived from monocular TV frame sequences of a street scence. Comput. Graph. Image Process. 19(1): 88 (1982) - Charles R. Dyer:
The space efficiency of quadtrees. Comput. Graph. Image Process. 19(1): 89 (1982) - Charles R. Dyer:
The space efficiency of quadtrees. Comput. Graph. Image Process. 19(4): 335-348 (1982) - John M. Einbu:
Nonlinear reduction of data. Comput. Graph. Image Process. 19(1): 91 (1982) - Tommy Elfving, Jan-Olof Eklundh:
Some properties of stochastic labeling procedures. Comput. Graph. Image Process. 19(1): 89 (1982) - Gerald E. Farin:
A construction for visual C1 continuity of polynomial surface patches. Comput. Graph. Image Process. 19(1): 94 (1982) - Irene Gargantini:
Linear octtres for fast processing of three-dimensional objects. Comput. Graph. Image Process. 19(1): 88-89 (1982) - L. Gibson, D. Lucas:
Vectorization of raster images using hierarchcial methods. Comput. Graph. Image Process. 19(1): 92 (1982) - Baldemar Gil, Amar Mitiche, J. K. Aggarwal:
Experiments in combining intensity and range-edge maps. Comput. Graph. Image Process. 19(1): 94 (1982) - Robert L. Haar:
Sketching: Estimating object positions from relational descriptions. Comput. Graph. Image Process. 19(1): 89 (1982) - Robert L. Haar:
Sketching: Estimating object positions from relational descriptions. Comput. Graph. Image Process. 19(3): 227-247 (1982) - F. R. Hansen, Howard Elliott:
Image segmentation using simple markov field models. Comput. Graph. Image Process. 19(1): 86 (1982) - Koichi Harada, Eihachiro Nakamae:
An isotropic four-point interpolation based on cubic splines. Comput. Graph. Image Process. 19(1): 91 (1982) - Robert M. Haralick, David Queeney:
Understanding engineering drawings. Comput. Graph. Image Process. 19(1): 90 (1982) - Susan M. Haynes, Ramesh C. Jain:
Detection of moving edges. Comput. Graph. Image Process. 19(1): 90 (1982) - Gabor T. Herman:
A topological proof of a surface tracking algorithm. Comput. Graph. Image Process. 19(4): 401-402 (1982)
skipping 50 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-02 10:13 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint