-
Bibligraphic index
@Article{AachKaupMest:1995:LoEnTr,
author = "Aach, T. and Kaup, A. and Mester, R.",
title = "On texture analysis: local energy transforms
versus quadrature filters",
journal = "Signal Processing",
year = "1995",
volume = "45",
number = "2",
pages = "173--181",
month = "August",
keywords = "texture analysis, texture energy measures,
quadrature filter pairs, gabor filters, envelope
demodulation, am communications.",
abstract = "The well-known method proposed by Laws for
texture analysis first subjects the texture to a
filter bank, followed by the computation of
energy measures, e.g. through local variance
estimation. As shown by Unser in 1986, the filter
bank application is equivalent to a linear
transformation of the grey values of neighbouring
pixels. In this contribution, we derive a further
linear relationship between the local variances
of the filter outputs and the autocorrelation
function of the texture process. Furthermore, we
examine how the filter bank approach is related
to another method based on multifiltering, namely
that one using quadrature filter pairs, by means
of which the amplitude envelopes of the filtered
texture signal can be obtained. It is shown that
the texture energy method can be understood as
the equivalent of an envelope detector receiver
commonly used in AM communication techniques.
Feature images provided by the texture energy
method are compared with their counterparts
resulting from the quadrature filter approach,
and criteria helping to decide when to use which
one of the methods are given.",
}
@Article{AbutalebKame:1999:GeAlEs,
author = "Abutaleb, Ahmed S. and Kamel, M.",
title = "A genetic algorithm for the estimation of ridges
in fingerprints",
journal = "IEEE Transactions on Image Processing",
year = "1999",
volume = "8",
number = "8",
pages = "1134--1139",
month = "August",
note = "",
keywords = "edge detection, fingerprint, genetic algorithm,
image processing",
abstract = "A genetic algorithm is developed to find the
ridges in paper fingerprints. It is based on the
fact that the ridges of the fingerprints are
parallel. When scanning the fingerprint, line by
line, the ideal noise-free gray level
distribution should yield lines of black and
white. The widths of these lines are not
constant. The proposed genetic algorithms
generates black and white lines of different
widths. The widths change until we get the best
match with the original fingerprint.",
copyholder = "faria - tese",
}
@Article{AndreadisGastTsal:1996:AnASFa,
author = "Andreadis, I. and Gasteratos, A. and Tsalides,
Ph.",
title = "An ASIC for fast grey-scale dilation",
journal = "Microprocessors and Microsystems",
year = "1996",
volume = "20",
number = "2",
pages = "89--95",
month = "April",
note = "",
keywords = "mathematical morphology, VLSI, ASIC",
abstract = "The design and VSLI implementation of a new ASIC
which performs the operation of grey-scale
dilation using both image and structuring element
threshold decomposition is presented in this
paper. The minimum rate of external operations of
this ASIC is 30 MPix/sec and it can handle 3x3
pixel images and structuring elements of up to
4-bit resolution. The high speed of operation is
achieved using the pipelining technique. The ASIC
is implemented using a DLM 1.0 micron, N-well,
CMOS process provided by the Europe an Silicon
Structures (ES2), and it occupies a silicon area
of 5.48x5.77 mm = 31.61 mm2. It is intended to be
used in machine vision applications, where the
need for short procesing times is crucial (e.g.
robotics and military systems).",
copyholder = "faria - tese",
}
@Article{AnelliBrogDest:1998:DeArSh,
author = "Anelli, Giovanni and Broggi, Alberto and Destri,
Giulio",
title = "Decomposition of arbitrarily shaped binary
morphological structuring elements using genetic
algorithms",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1998",
volume = "20",
number = "2",
pages = "217--224",
month = "February",
note = "",
keywords = "mathematical morphology, arbitrarily shaped
structuring element decomposition, genetic
algorithms",
abstract = "A number of different algorithms have been
described in the literature for decomposition of
both convex binary morphological structuring
elements and a specific subset of nonconvex ones.
Nevertheless, up to now no deterministic
solutions have been found to the problem of
decomposing arbitrarily shaped structuring
elements. This work presents a new stochastic
approach based on Genetic Algorithms in which no
constraints are imposed on the shape of the
initial structuring element, nor assumptions are
made on the elementary factors, which are
selected within a given set.",
copyholder = "faria - tese",
}
@Article{AnsoultSoil:1990:ToAuGI,
author = "Ansoult, M. M. and Soille, P. J.",
title = "Mathematical morphology: a tool for automated GIS
data acquisition from scanned thematic maps",
journal = "Photogrammetric Engineering and Remote Sensing",
year = "1990",
volume = "56",
number = "9",
pages = "1263--1271",
month = "September",
keywords = "mathematical morphology.",
abstract = "Over several years, the demand for digital data
has grown as geographical information systems
were implemented. Because of the cost of database
creation, data acquisition should unquestionably
be automated as much as possible. Today, scanning
devices produce a huge amount of data that still
needs complex processing. This paper proposes an
original approach using image processing tools
coming from Mathematical Morphology theory to
acquire GIS data from scanned thematic maps.
These tools are used in order to obtain a
segmentation prior to radiometric analysis. To
illustrate the methodology, a subset of the
Belgian soil map is treated.",
}
@Article{-Bajcsy:1989:MuElMa,
author = "Bajcsy, R.",
title = "Multiresolution elastic matching",
journal = "Computer Vision, Graphics and Image Processing",
year = "1989",
number = "46",
pages = "1--21",
month = "",
keywords = "matching.",
abstract = "Matching of locally variant data to an explicit
3-dimensional pictorial model is developed for
X-ray computed tomography scans of the human
brain, where the model is a voxel representation
of an anatomical human brain altlas. The matching
process is 3-dimensional without any preference
given to the slicing plane. After global
alignment the brain atlas is deformed like a
piece of rubber, without tearing or folding.
Deformation proceeds step-by-step in a
coarse-to-fine strategy, increasing the local
similarity and global coherence. The assumption
underlying this approach is that all normal
brains,at least at a certain level of
representation, have the same topological
structure, but may differ in shape details.
Results show that we can account for these
differences.",
}
@Book{BallardBrow:1982:CoVi,
author = "Ballard, D. H. and Brown, C. M.",
title = "Computer Vision",
publisher = "Prentice Hall",
year = "1982",
address = "Englewood Cliffs, New Jersey",
keywords = "computer vision, image formation, early
processing, boundary detection, region growing,
texture, motion, knowledge representation,
matching, inference, relational structures,
labeling, graph theoretic algorithms.",
}
@Article{BarneaSilv:1972:ClAlFa,
author = "Barnea, D. I. and Silverman, H. F.",
title = "A class of algorithms for fast digital image
registration",
journal = "IEEE Transactions on Computers",
year = "1972",
volume = "21",
number = "2",
pages = "179--186",
month = "February",
keywords = "registration efficiency, sequential similarity
detection algorithms, spatial cross correlation,
spatial registration of digital images.",
abstract = "The automatic determination of local similarity
between two structured data sets is fundamental
to the disciplines of pattern recognition and
image processing. A class of algorithms, which
may be used to determine similarity in a far more
efficient manner than methods currently in use,
is introduced in this paper. There may be a
saving computation time of two orders of
magnitude or more by adopting this new approach.
The problem of translational image registration,
used for an example throughout, is discussed and
the problems with the most widely used
method-correlation explained. Simple
implementations of the new algorithms are
introduced to motivate the basic idea of their
structure. Real data from ITOS-1 satellites are
presented to give meaningful empirical
justification for theoretical predictions.",
}
@Article{BarreraDougBrun:2000:InCoAp,
author = "Barrera, Junior and Dougherty, Edward R. and
Brun, Marcel",
title = "Hybrid human-machine binary morphological
operator design: an independent constraint
approach",
journal = "Signal Processing",
year = "2000",
volume = "80",
number = "8",
pages = "1469--1487",
month = "August",
note = "",
keywords = "morphological operator, heuristic design,
statistical design, independent constraint,
envelope",
abstract = "A basic paradigm in mathematical morphology is
the construction of set operators by
concatenations of dilations and erosions via the
operations of composition, union, intersection
and complementation. Since its introduction, in
the 1960's by Matheron and Serra, this paradigm
has been applied on image analysis for designing
set operators, that were called morphological
operators. Classically, morphological operators
are constructed based on the experience and
intuition of humain beings. Recently, an approach
for the automatic design of morphological
operators, based on statistical optimization from
the observation of collections of image pairs,
was proposed. The two approaches have drawbacks:
usually, the first approach is slow and depends
on an expert in mathematical morphology, while
the second requires large amounts of observed
data. This paper proposes a symbiosis between the
human and the statistical design approaches. The
idea is that the design procedure be composed of
simplified forms of both. Thus, avoiding
difficulties that arise when applying each one
independently. The strategy adopted to achieve
this goal is restricting the space of operators
considered with a human-designed envelope.",
copyholder = "faria - tese",
}
@Article{BarreraDougTomi:1997:AuPrBi,
author = "Barrera, Junior and Dougherty, Edward R. and
Tomita, Nina Sumiko",
title = "Automatic programming of binary morphological
machines by design of statistically optimal
operators in the context of computational
learning theory",
journal = "Journal of Eletronic Imaging",
year = "1997",
volume = "6",
number = "1",
pages = "54--67",
month = "January",
note = "",
keywords = "computational learning theory, mathematical
morphology, bynary morphological machines,
W-operators, optimal operator design",
abstract = "Representation of set operators by artificial
neural networks and design of such operators by
inference of network parameters is a popular
technique in binary image analysis. We propose an
alternative to this technique: automatic
programming of morphological machines (MMachs) by
the design of statiscally optimal operators. We
propose a formulation of the procedure for
designing set operators that extends the one
stated by Dougherty for binary image restoration,
show the relation of this new formulation with
the one stated by Haussler for learning Boolean
concepts in the context of machine learning
theory (which usually is applied to neural
networks), present a new learning algorithm for
Boolean concepts represented as MMachs programs,
and give some application examples in binary
image analysis.",
copyholder = "faria - tese",
}
@Article{BarreraSala:1996:SeOpOn,
author = "Barrera, Junior and Salas, Guillermo Pablo",
title = "Set operations on closed intervals and their
applications to the automatic programming of
morphological machines",
journal = "Journal of Eletronic Imaging",
year = "1996",
volume = "5",
number = "3",
pages = "335--352",
month = "July",
note = "",
keywords = "automatic programming, canonical decomposition of
set operators, mathematical morphology,
morphological machines, set operation",
abstract = "Mathematical morphology on sets can be understood
as a formal language, whose vocabulary comprises
erosions, dilations, complementation,
intersection and union. This language is
complete, that is, it is enough to perform any
set operation. Since the sixties special
machines, called the Morphological Machines
(MMachs), have been built to implement this
language. In the literature, we find hundreds of
MMach programs that are used to solve image
analysis problems. However, the design of these
programs is not an elementary task. Thus,
recently much research effort has been addressed
to automating the programming of MMachs. A very
promising approach to this problem is the
description of the target operator by
input-output pairs of images and the translation
of these data into efficient MMach programs. This
approach can be decomposed into two equally
important steps: (1) learning of the target
operator from pairs of images; (2) search for
economical representations for the operators
learned. The theory presented in this paper is
useful in the second step of this procedure. We
present some set operations on collections of
closed intervals and give efficient algorithms to
perform them. These operations are used to
parallelize MMach programs and to prove the
equivalence between distinct MMach programs.",
copyholder = "faria - tese",
}
@Article{BarreraTeraHiraHira:2000:AuPrMo,
author = "Barrera, Junior and Terada, Routo and Hirata
Junior, Roberto and Hirata, Nina Sumiko Tomita",
title = "Automatic programming of morphological machines
by PAC learning",
journal = "Fundamenta Informaticae",
year = "2000",
volume = "41",
number = "1",
pages = "229--258",
month = "January",
note = "",
keywords = "mathematical morphology, operator decomposition,
PAC learning",
abstract = "An important aspect of mathematical morphology is
the description of complete lattice operators by
a formal language, the Mophological Languange
(ML), whose vocabulary is composed of infimum,
supremum, dilations, erosions, anti-dilations and
anti-erosions. This language is complete (i.e.,
it can represent any complete lattice operator)
and expressive (i.e., many useful operators can
be represented as phrases with relatively few
words). Since the sixties special machines, the
Morphological Machines (MMachs), have been built
to implement the ML restricted to the lattices of
binary and gray-scale images. However, designing
useful MMach programs is not an elementary task.
Recently, much research effort has been addressed
to automate the programming of MMachs. The goal
of the different approaches for this problem is
to find suitable knowledge representation
formalisms to describe transformations over
geometric structures and to translate them
automatically into MMach programs by
computational systems. We present here the
central ideas of an approach based on the
representation of transformations by collections
of observed-ideal pairs of images and the
estimation of suitable operators from these data.
In this approach, the estimation of operators is
based on statistical optimization or,
equivalently, on a branch of Machine Learning
Theory known as PAC Learning. These operators are
generated as standard form morphological
operators that may simplified (i.e., transformed
into equivalent morphological operators that use
fewer vocabulary words) by syntatical
transformations.",
copyholder = "faria - tese",
}
@Article{BeveridgeRise:1997:HoEaMa,
author = "Beveridge, J. R. and Riseman, E. M.",
title = "How easy is matching 2D line models using local
search?",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1997",
volume = "19",
number = "6",
pages = "564--579",
month = "June",
keywords = "object recognition, optimal model matching, line
segment models, run-time performance
characterization, random-starts local search.",
abstract = "Local search is a well established and highly
effective method for solving complex
combinatorial optimization problems. Here, local
serach is adapted to solve difficult geometric
matching problems. Matching is posed as the
problem of finding the optimal many-to-many
correspondence mapping between a line segment
model and image line segments. Image data is
assumed to be fragmented, noisy, and cluttered.
The algorithms presented have been used for robot
navigation, photo interpretation, and scene
understanding. This paper explores how local
search performs as model complexity increases,
image clutter increases, and additional model
instances are added to the image data. Expected
run-times to find optimal matches with 95 percent
confidence are determined for 48 distinct
problems involving six models. Nonlinear
regression is used to estimate run-time growth as
a function of problem size. Both polynomial and
exponential growth models are fit to the run-time
data. For problems with random clutter, the
polynomial model fits better and growth is
comparable to that tree search. For problems
involving symmetric models and multiple models
instances, where tree search is exponential, the
polynomial growth model is superior to the
exponential growth model for one search algorithm
and comparable for another.",
}
@Article{Brown:1992:SuImRe,
author = "Brown, L. G.",
title = "A survey of image registration techniques",
journal = "ACM Computing Surveys",
year = "1992",
volume = "24",
number = "4",
pages = "325--376",
month = "December",
keywords = "image registration, image warping, rectification,
template matching.",
abstract = "Registration is a fundamental task in image
processing used to match two or more pictures
taken, for example, at different times, from
different sensors, or from different viewpoints.
Virtually all large systems which evaluate images
require the registration of images, or a closely
related operation, as an intermediate step.
Specific examples of systems where image
registration is a significant component include
matching a target with a real-time image of a
scene for target recognition, monitoring global
land usage using satellite images, matching
stereo images to recover shape for autonomous
navigation, and aligning images from diffrent
medical modalities for diagnosis. Over the years,
a broad range of techniques has been developed
for various types of data and problems. These
techniques have been independently studied for
several different applications, resulting in a
large body research. This paper organizes this
material by establishing the relationship between
the variations in the images and the type of
registration techniques which can most
appropriately be applied. Three major types of
variations are distinguished. The first type are
the variations due to the differences in
acquisition which cause the images to be
misaligned. To register images, a spatial
transformation is found which will remove these
variations. The class of transformations which
must be searched to find the optimal
transformation is determined by knowledge about
the variations of this type. The transformation
class in turn influences the general technique
that should be taken. The second type of
variations are those which are also due to
differences in acquisition, but cannot be modeled
easily such as lighting and atmospheric
conditions. This type usually effects intensity
values, but they may also be spatial, such as
perspective distortions. The third type of
variations are differences in the images that are
of interest such as object movements, growths, or
other scene changes. Variations of the second and
third type are not directly removed by
registration, but they make registration more
difficult since an exact match is no longer
possible. In particular, it is critical that
variations of the third type are not removed.
Knowledge about the characteristics of each type
of variation effect the choice of feature space,
similarity measure, search space, and search
strategy which will make up the final technique.
All registration techniques can be viewed as
different combinations of these choices. This
framework is useful for understanding the merits
and relationships between the wide variety of
existing techniques and for assisting in the
selection of the most suitable technique for a
specific problem.",
}
@Article{BrunelliMess:1995:RoEsCo,
author = "Brunelli, R. and Messelodi, S.",
title = "Robust estimation of correlation with
applications to computer vision",
journal = "Pattern Recognition",
year = "1995",
volume = "28",
number = "6",
pages = "833--841",
month = "June",
keywords = "template matching, robust statistics,
correlation, face recognition, book
recognition.",
abstract = "In this paper we compare to the standard
correlation coefficient three estimators of
similarity for visual patterns which are based on
the L2 and L1 norms. The emphasis of the
comparison is on the stability of the resulting
estimates. Bias, efficiency, normality and
robustness are investigated through Monte Carlo
simulations in a statistical task, the estimation
of the correlation parameter of a binormal
distribution. The four estimators are then
compared on two pattern recognition tasks: people
identification through face recognition and book
identification from the cover image. The
similarity measures based on the L1 norm prove to
be less sensitive to noise and provide better
performance than those based on L2 norm.",
}
@Article{CagnoniDobrPoliYanc:1999:GeAlIn,
author = "Cagnoni, S. and Dobrzeniecki, A. B. and Poli, R.
and Yanch, J. C.",
title = "Genetic algorithm-based interactive segmentation
of 3D medical images",
journal = "Image and Vision Computing",
year = "1999",
volume = "17",
number = "12",
pages = "881--895",
month = "October",
copyholder = "faria - tese",
keywords = "genetic algorithm, elastic contour, filter",
abstract = "This article describes a method for evolving
adaptive procedures for the contour-based
segmentation of anatomical structures in 3D
medical data sets. With this method, the user
first manually traces one or more 2D contours of
an anatomical structure of interest on parallel
planes arbitrarily cutting the data set. Such
contours are then used as training examples for a
genetic algorithm to evolve a contour detector.
By applying the detector to the rest of the image
sequence it is possible to obtain a full
segmentation of the structure. The same detector
can then be used to segment other image sequences
of the same sort. Segmentation is driven by a
contour-tracking strategy that relies on an
elastic-contour model whose parameters are also
optimized by the genetic algorithm. We report
results obtained on a software-generated phantom
and on real tomographic images of different
sorts.",
note = "",
}
@Article{CampsKanuHara:1996:GrStEl,
author = "Camps, Octavia I. and Kanungo, Tapas and
Haralick, Robert M.",
title = "Gray-scale structuring element decomposition",
journal = "IEEE Transactions on Image Processing",
year = "1996",
volume = "5",
number = "1",
pages = "111--120",
month = "January",
copyholder = "faria - tese",
keywords = "structuring element decomposition, mathematical
morphology",
abstract = "Efficient implementation of morphological
operations requires the decomposition of
structuring elements into the dilation of smaller
structuring elements, Zhuang and Haralick
presented a search algorithm to find optimal
decompositions of structuring elements in binary
morphology. In this paper, we use the concepts of
Top of a set and Umbra of a surface to extend
this algorithm to find an optimal decomposition
of any arbitrary gray-scale structuring
element.",
note = "",
}
@Article{ChangChat:1995:SoDeAp,
author = "Chang, C. and Chatterjee, S.",
title = "Some deterministic approximations for stochastic
stereo matching",
journal = "Signal Processing",
year = "1995",
volume = "45",
number = "2",
pages = "143--160",
month = "August",
keywords = "mean field approximation, markov random field,
simulated annealing, stereo matching, relative
entropy, gibbs sampler, maximum a posteriori.",
abstract = "In this work, we look at mean field annealing
(MFA) as a deterministic approximation to the
stochastic relaxation (SR) algorithm in the
context of stereo matching. MFA is examined from
two different perspectives: information theory
and statistical mechanics. The mean field
solution, which minimizes the relative entropy of
an approximated distribution with respect to the
posterior distribution, is shown to be equivalent
to the optimal Bayes estimate in maximum a
posteriori (MAP) sense. Two illustrative examples
of approximated distribution are discussed. On
the other hand, from the viewpoint of statistical
mechanics, we examine a deterministic version of
simulated annealing (SA) algorithm with GIbbs
sampler based on the similarity between the
induced field and the marginal energy function.
An iterative, deterministic algorithm is
developed to obtain the mean field solution. A
number of image examples are used to verify the
proposed algorithms and to highlight how close
the MFA approximates SR.",
}
@Article{ChouChen:1990:MoPaMa,
author = "Chou, C. and Chen, Y.",
title = "Moment-preserving pattern matching",
journal = "Pattern Recognition",
year = "1990",
volume = "23",
number = "5",
pages = "411--421",
month = "May",
keywords = "template matching, similarity measure, pairing
function, moment-preserving quantization, motion
estimation, two-stage matching scheme, threshold
estimation, hardware implementation.",
abstract = "An accurate template matching algorithm of low
computational complexity that facilitates
low-cost hardware design and VLSI implementation
is highly desired by many image processing
applications. This paper describes a template
matching method, called moment-preserving pattern
matching (MPPM), which reduces the computational
complexity of template matching significantly and
provides several advantages in hardware
implementation. The methodology is based on the
concepts of pairing function and
moment-preserving quantization. The experimental
results show that it is computationally fast and
accurate in locating the template if noise
corruption is not too severe. For obtaining a
template matching algorithm of high accuracy and
robustness against noise, and low computational
cost, MPPM is applied to a two-stage matching
scheme. A statistical model for estimating the
correlation threshold is also given.",
}
@Article{CogginsJain:1985:SpFiAp,
author = "Coggins, J. M. and Jain, A. K.",
title = "A spatial filtering approach to texture
analysis",
journal = "Pattern Recognition Letters",
year = "1985",
volume = "3",
number = "3",
pages = "195--203",
month = "May",
keywords = "texture, spatial filtering, human vision,
segmentation, classification, clustering.",
abstract = "A theory regarding the information processing
strategies in human vision motivates the
development of a texture feature space. The
feature space is used in texture classification
and segmentation problems. A statistic for
determining the number of different textures in
the image is developed and demonstrated.",
}
@Article{-Coyle:1988:RaOrOp,
author = "Coyle, E. J.",
title = "Rank order operators and the mean absolute error
criterion",
journal = "IEEE Transactions on Acoustics, Speech and Signal
Processing",
year = "1988",
volume = "36",
number = "1",
pages = "63--76",
month = "January",
keywords = "rank order filter, stack filters.",
abstract = "Rank order filters are a subset of a class of
nonlinear filters called stack filters. All these
filters obey a weak superposition property known
as the threshold decomposition and an ordering
property called the stacking property. In this
paper, we show that among all randomizing stack
filters whose output decisions are based on the
sum of the bits in the window on each level of
the threshold decomposition architecture, rank
order operators are optimal under an error
criterion which is the sum of the absolute error
incurred on each on each level of the threshold
decomposition architecture. We also show that if
the filtering class being optimized obeys a
deterministic stacking property, then the
traditional multilevel mean absolute error
criterion reduces to the sum of the absolute
error incurred to each level. This leads to an
efficient algorithm for choosing the rank order
filter which minimizes the multilevel mean
absolute error criterion. These results show that
estimation under the mean absolute error
criterion is equivalent to massively parallel
level crossing decision making when these level
crossing decisions are forced to be consistent,
that is, to obey the stacking property.",
}
@InProceedings{DerenXiaoFei:1994:ApMaMo,
author = "Deren, L. and Xiaoyong, C. and Fei, M.",
title = "Applications of mathematical morphology in
automatic cartography and GIS",
booktitle = "International Archives of Photogrammetry and
Remote Sensing, v.30--4",
year = "1994",
editor = "Photogrammetry, International Society of and
Sensing, Remote",
pages = "127--134",
organization = "International Society of Photogrammetry and
Remote Sensing (ISPRS) - Commission IV
Simposium",
publisher = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
address = "Athens, Georgia, USA",
month = "May/June",
keywords = "mathematical morphology, topographic database,
digital elevation model, geographic information
system, image processing.",
abstract = "Mathematical morphology is very effective for
analyzing and processing the information content
both of binary image and of gray-scale image.
Some approaches of using mathematical morphology
transformations in automatic cartography and GIS
have been discussed in this paper which include
using morphological filtering to improve the
quality of scanned image; using hit-miss
transformation to extract features from images;
object recognition in contour maps; triangulated
irregular networks (TIN) construction to
represent digital elevation model (DEM);
producing the equidistance line for delimitation
of maritime boundary; geographic information
system (GIS) space operations and information
extraction from remote sensing image using
mathematical morphology and so on. Based on our
experiments, it is concluded that mathematical
morphology transforms are very useful for
constructing topographic database, for particular
presenting and organizing information in the
database.",
}
@Article{Destival:1986:MaMoAp,
author = "Destival, I.",
title = "Mathematical morphology applied to remote
sensing",
journal = "Acta Astronautica",
issn = "0094-5765",
year = "1986",
volume = "13",
number = "6/7",
pages = "371--385",
month = "",
keywords = "mathematical morphology.",
abstract = "Remote Sensing is a great help for experts who
need to know the surface of the Earth. The
problem is now to insert into a numerical
treatment of spatial images an automatic
detection of shapes and structures relevant
within a given problem. Unfortunately, classical
methods based on linear transformations are
numerical treatments and remain limited to a
punctual treatment. A new method, mathematical
morphology, is bringing about a revolution in
image analysis. It consists in representing
studied objects by one or more sets in adapted
spaces to analyse them with the use of set
tranformations. Such a method, involving notions
of neighbourhood inside a set, allows to analyse
shapes in a global way. It is beginning to be
used for remote sensing images. Insteresting
results have been obtained but need the
operator's interfering, whereas automatization
can better be obtained with a classical method.
The solution is lying in the use of two
approaches (classical and mathematical
morphology) within a single treatment. Results
have been convincing.",
}
@InProceedings{DiehlHeip:1992:SuReDa,
author = "Diehl, H. and Heipke, C.",
title = "Surface reconstruction from data of digital line
cameras by means of object based image matching",
booktitle = "International Archives of Photogrammetry and
Remote Sensing, v.29-B3 - 17th Congress -
Commission III",
year = "1992",
editor = "Photogrammetry, International Society of and
(ISPRS), Remote Sensing",
pages = "287--294",
organization = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
publisher = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
address = "Washington D. C., USA",
keywords = "image matching, 3-line camera, object surface
reconstruction, algorithm.",
abstract = "This paper deals with automatic surface
reconstruction from data of digital line cameras
in the framework of object based image matching.
In this approach grid heights of a digital
terrain model (DTM), the elements of exterior
orientation and grey values of an orthoimage are
simultaneously determined from the recorded image
grey values in a least squares adjustment. In
order to provide initial values for the unknowns
a hierarchical image representation is used. For
investigations simulated satellite images from a
high mountain area (the Vernagtferner in the
Austrian Alps) recorded with a 3-line camera are
used. The element of exterior orientation are
assumed to be given for every set of three scan
lines. The influence of white noise added to grey
values of the three image strips and of random
errors in the exterior orientation is
investigated. The results show that this approach
can tolerate a large amount of noise in the image
(up to a standard deviation of more then 10 grey
values), but is very sensitive to errors in the
exterior orientation.",
}
@Article{DjamdjiBijaMani:1993:MuAp,
author = "Djamdji, J. P. and Bijaoui, A. and Maniere, R.",
title = "Geometrical registration of images: the
multiresolution approach",
journal = "Photogrammetric Engineering and Remote Sensing",
year = "1993",
volume = "59",
number = "5",
pages = "645--653",
month = "May",
keywords = "automatic registration.",
abstract = "Geometrical registration of two images is
nowadays a current and important step in remote
sensing in view of further processing and
interpretation of the data. Therefore,
geometrical registration of images with different
ground resolutions is useful for a better
comprehension of dynamic processes (i.e.,
deforestation, desertification), as well as for
extrapolating models of interpretation from a
small region to larger areas. We present a new
method of automatic registration, based on a
multiresolution decomposition of the images using
the wavelet transform. The main properties of
this transform, as well as how the use of the
wavelet model leads to an automated geometric
matching between the different images, are
described. Our technique has been applied to
different sets of data acquired with the same
sensors (SPOT HRV; Landsat MSS), as well as from
different sensors with different resolutions
(SPOT HRV and Landsat MSS; Landsat TM and SPOT
HRV).",
}
@Article{-Dougherty:1992:I.OpBi,
author = "Dougherty, Edward R.",
title = "Optimal mean-square N-observation digital
morphological filters: I. Optimal binary
filters",
journal = "Computer Vision, Graphics and Image Processing",
year = "1992",
volume = "55",
number = "1",
pages = "36--54",
month = "January",
copyholder = "faria - tese",
keywords = "morphological filters, optimal mean-square
digital morphological filters, digital binary
morphological operations, optimal erosion filter,
optimal binary filters",
abstract = "The present paper places binary morphological
filtering into the framework of statistical
estimation, the intent being to develop the
theory of mean-square (MS) optimization.
Classical binary morphological operations are
interpreted as numerical functionals on binary
N-vectors, so that in the random setting they can
be treated as estimators dependent on N binary
observation random variables. For single-erosion
filters, optimization is achieved by finding the
structuring element that minimizes MS error.
Using the Matheron representation as a guide, we
generalize the analysis to morphological filters
given by unions of multiple erosions and optimize
by minimizing MS error over all collections of
erosions, or over a prefixed number of erosions.
In all cases, MS error is relative to the
estimation of an unobserved variable by a
morphological function of observed variables. A
key element in the method is use of the basis
form of the Matheron expansion to reduce
significantly the structuring element search. The
technique is adapted to special morphological
filters by constraining the basis representation
in accordance with the class of interest. It is
demonstrated that optimization in terms of
erosions is equivalent to optimization in terms
of dilations.",
note = "",
}
@Article{-Dougherty:1992:IIOpGr,
author = "Dougherty, Edward R.",
title = "Optimal mean-square N-observation digital
morphological filters: II. Optimal gray-scales
filters",
journal = "Computer Vision, Graphics and Image Processing",
year = "1992",
volume = "55",
number = "1",
pages = "55--72",
month = "January",
copyholder = "faria - tese",
keywords = "morphological filters, optimal mean-square
digital morphological filters, digital gray-scale
morphological operations, optimal gray-scale
erosion filter, optimal gray-scales filters",
abstract = "The second part of this two-part study interprets
digital gray-scale morphological operations as
numerical functionals on integer-valued vectors.
The result is a gray-scale morphological
statistical estimation theory based on N
observation random variables and a consequent
theory of mean-square optimization. Whereas in
the binary setting the search for optimal
structuring elements is clearly restricted by the
requirement of binary N-vector structuring
elements, gray-scale structuring elements are
N-vectors of integers (not confined to the range
of the images). Thus, it is necessary to find a
set of structuring elements from which both
single and multiple-erosion filters can be
optimized, the latter being characterized within
the framework of the gray-scale Matheron
representation. Consequently, a significant part
of the paper is concerned with the derivation of
the fundamental set, this set being a minimal
family of structuring elements from which it is
always possible to select the erosions comprising
an optimal filters. As in the case of binary
optimization, we treat constrained optimality;
however, here we apply it to construction of
optimal linear filters. Finally, we demonstrate
that erosion optimization is equivalent to
dilation optimization.",
note = "",
}
@Article{DoughertyLoce:1993:MoReEs,
author = "Dougherty, Edward R. and Loce, Robert P.",
title = "Optimal mean-absolute-error hit-or-miss filters:
morphological representation and estimation of
the binary conditional expectation",
journal = "Optical Engineering",
year = "1993",
volume = "32",
number = "4",
pages = "815--827",
month = "April",
copyholder = "faria - tese",
keywords = "mathematical morphology, morphological filters,
image restoration, mean-absolute estimator,
optimal estimator, nonlinear filters, hit-or-miss
transforms",
abstract = "The hit-or-miss operator is used as the building
block of optimal binary restoration filters.
Filter design methodologies are given for
general, maximum, and minimum noise environments,
the latter two producing optimal thinning and
tickening filters, respectively, and for
iterative filters. The approach is based on the
expression of translation-invariant filter as
unions of hit-or-miss transforms. Unions of
hit-or-miss transforms are expressed as canonical
logical sums of products, and the final
hit-or-miss templates are obtained by logical
reduction. The net effect is a morphological
representation and estimation of the conditional
expectation, which is the overall optimal
mean-absolute-error filter.",
note = "",
}
@Article{DoughertyLoce:1994:InNo,
author = "Dougherty, Edward R. and Loce, Robert P.",
title = "Precision of morphological representation
estimators for translation-invariant binary
filters: increasing and nonincreasing",
journal = "Signal Processing",
year = "1994",
volume = "40",
number = "2--3",
pages = "129--154",
month = "November",
copyholder = "faria - tese",
keywords = "mathematical morphology, morphological filter,
image processing, signal processing, image
restoration, mean-absolute estimator, optimal
estimator, nonlinear filter, hit-or-miss
transform, conditional expectation",
abstract = "Mean-absolute-error-optimal, finite-observation,
translation-invariant, binary-image filters have
previously been characterized in terms of
morphological representations: increasing filters
as unions of erosions and nonincreasing filters
as unions of hit-or-miss operators. Based on
these characterizations, (sub)optimal filters
have been designed via image-process
realizations. The present paper consider the
precision of filter estimation via realizations.
The following problems are considered: loss of
performance owing to employing erosion filters
limited by basis size, precision in the
estimation of erosion bases, and precision in the
estimation of union of hit-or-miss filters. A key
point: while precision deteriorates for both
erosion and hit-or-miss filters as window size
increases, the number of image realizations
required to obtain good estimation in the erosion
filter design can be much less than the number
required for hit-or-miss filter design. Thus,
while in theory optimal hit-or-miss filtering is
better because the unconstrained optimal
hit-or-miss filter is the conditional
expectation, owing to estimation error it is very
possible that estimated optimal erosion filters
are better than estimated optimal hit-or-miss
filters.",
note = "",
}
@Article{DoughertyZapa:1997:OpReTo,
author = "Dougherty, E. R. and Zapan, C. C.",
title = "Optimal reconstructive T-openings for disjoint
and statistically modeled nondisjoint grains",
journal = "Signal Processing",
year = "1997",
volume = "56",
number = "1",
pages = "45--58",
month = "January",
keywords = "mathematical morphology, opening, optimal filter,
granulometry, random set.",
abstract = "When a binary granular image is sieved by a
reconstructive T-opening, some grains are
entirely removed while the remaining grains are
fully passed. If desired grains are viewed as
composing the signal and undesired grains are
viewed as noise (or clutter), then the
reconstructive T-opening acts as filter and a
basic task is to find an optimal filter. The
present paper proceeds parametrically by
optimally selecting a T-opening from a Euclidean
granulometry. The optimal value of t results in
minimization of the expected area of the
symmetric difference between the pure signal and
the output of the reconstructed T-opening applied
to the noisy signal. There is no demand of
similarity between filter and image generators.
The general theory does not require grains to be
nonintersecting. When there is grain
intersection, overlapping is statiscally modeled
in a manner compatible with the assumption that
the binary image has resulted from thresholding
an image of touching or partially overlapping
blobs. The watershed is postulated as canonical
segmentation procedure and filtering is performed
relative to the segmented image. Error
minimization is more difficult when there is
grain intersection because the random geometry of
the segmented grains must be described as a
function of input geometry, the intersection
model, and the effect of the segmentation.",
}
@Article{DoughertyZhanChen:1996:OpItBi,
author = "Dougherty, Edward R. and Zhang, Yeqing and Chen,
Yidong",
title = "Optimal iterative binary morphological filters",
journal = "Optical Engineering",
year = "1996",
volume = "35",
number = "12",
pages = "3495--3507",
month = "December",
copyholder = "faria - tese",
keywords = "digital document, iterative filter, morphological
filter, optimal filter",
abstract = "Rather than design an optimal filter over a large
window, which may be computationally impossible
or require unacceptable design time, one can
design an iterative filter, each stage of which
is designed over a small window with acceptable
design time. If a two-stage iterative filter is
designed with each stage optimally designed over
a window, then the iterative filter is a
suboptimal approximation to the optimal filter
over a larger window formed as the dilation of
the small window with itself. Using image-noise
models, three basic questions regarding optimal
increasing iterative filters are statistically
adressed. How many iterations are required before
there is only a negligible increase in filter
preformance? As the number of iterations
increases, how good is filter performance in
comparison with large window noniterative
filters? What are the logical and probabilistic
relations between noniterative and approximating
iterative filters? Iterative filter performance
is seen to be the only slightly suboptimal, in
return for tractable design. A key conclusion is
that, while in terms of logic there may be a
significant difference between a noniterative and
approximating iterative filter, their
probabilistic difference as operators on random
sets can be negligible. This fundamental point is
discussed in the context of application to
digital document processes, which form a key area
of application.",
note = "",
}
@Article{DoughertyZhao:1992:MoChSt,
author = "Dougherty, Edward R. and Zhao, Dongming",
title = "Model-based characterization of statistically
optimal design for morphological shape
recognition algorithms via the hit-or-miss
transform",
journal = "Journal of Visual Communication and Image
Representation",
year = "1992",
volume = "3",
number = "2",
pages = "147--160",
month = "June",
copyholder = "faria - tese",
keywords = "automatic character reading, hit-or-miss
tranform, hit-or-miss shape recognition,
optimization, statistical image model,
statistically optimal design",
abstract = "Shape and character recognition via the
morphological hit-or-miss transform is studied in
a nondeterministic setting and the basic paradigm
is thereby extended. A shape is viewed as a
random process satisfying various model
constraints and the recognition process is
analyzed relative to the process. In particular,
expectations of various types of recognition
errors are analyzed. Rather than demand
sufficient conditions for perfect recognition,
the classical statistical approach is taken and
the paradigm is one of measuring recognition
efficiency and drawing from the probability model
a criterion of optimality. In the framework of
hit-or-miss shape recognition, optimization
results from finding a class of hit-or-miss
structuring element pairs that results in minimal
error, as measured by expectation relative to the
shape-process model.",
note = "",
}
@Article{Fernandez:1997:NoAp,
author = "Fernandez, X.",
title = "Template matching of binary targets in grey-scale
images: a nonparametric approach",
journal = "Pattern Recognition",
year = "1997",
volume = "30",
number = "7",
pages = "1175--1182",
month = "July",
keywords = "template matching, similarity measures,
kolmogorov-smirnov, nonparametric, thresholding,
normalized correlation.",
abstract = "This paper introduces a nonparametric similarity
measure, based on the Kolmogorov-Smirnov (KS)
statistic, to be used in template-matching
problems where a target of binary characteristics
is to be located in a grey-scale image. KS
statistic yields the best-expected value for a
binary-domain similarity measure if the threshold
selection to binarize the image had been
optimized to take into account the geometric
constraints of the template; there is, however,
no need to actually binarize the image. Some good
properties of a KS-based similarity measure are
exposed and compared with the corresponding
properties of normalized correlation. A pratical
algorithm to implement a template matching
procedure based on the kS statistic is shown, and
its computing time is compared with normalized
correlation. A KS-based similarity measure proves
to be usually much faster computationally than
normalized correlation. Finally, some
experimental results are shown.",
}
@Article{FlusserSuk:1994:MoApRe,
author = "Flusser, J. and Suk, T.",
title = "A moment-based approach to registration of images
with affine geometric distortion",
journal = "IEEE Transactions on Geoscience and Remote
Sensing",
year = "1994",
volume = "32",
number = "2",
pages = "382--387",
month = "March",
keywords = "image registration, affine geometric distortion,
control points, affine moment invariants, region
matching.",
abstract = "This paper deals with the registration of images
with affine geometric distortion. It describes a
new method for automatic control point selection
and matching. First, reference and sensed images
are segmented and closed-boundary regions are
extracted. Each region is represented by a set of
affine-invariant moment-based features.
Correspondence between the regions is then
established by a two-stage matching algorithm
that works both in the feature space and in the
image space. Centers of gravity of corresponding
regions are used as control points. A pratical
use of the proposed method is demonstrated by
registration of SPOT and Landsat TM images. It is
shown that our method can produce subpixel
registration accuracy.",
}
@InProceedings{Forstner:1986:FeBaCo,
author = "Forstner, W.",
title = "A feature based correspondence algorithm for
image matching",
booktitle = "International Archives of Photogrammetry and
Remote Sensing, v.26(3/3)",
year = "1986",
editor = "Photogrammetry, International Society of and
Sensing, Remote",
pages = "150--166",
organization = "International Society of Photogrammetry and
Remote Sensing (ISPRS) - Commission III",
publisher = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
keywords = "feature based matching, image matching, measure
similarity, maximum likelihood.",
abstract = "A new feature based correspondence algorithm for
image matching is presented. The interest
operator is optimal for selecting points which
promise high matching accuracy, for selecting
corners with arbitrary number and orientation of
edges or centres of discs, circles or rings. The
similarity measure can take the seldomness of the
selected points into account. The consistency of
the solution is achieved by maximum likelihood
type (robust) estimation for the parameters of an
object model. Approximate values have to be
better than 1/3 of the size of image in shift, 20
degree in rotation and 30% in scale.",
}
@Article{GabetGiraReno:1997:AuGeHi,
author = "Gabet, L. and Giraudon, G. and Renouard, L.",
title = "Automatic generation of high resolution urban
zone digital elevation models",
journal = "ISPRS Journal of Photogrammetry and Remote
Sensing",
year = "1997",
volume = "52",
number = "1",
pages = "33--47",
month = "February",
keywords = "digital elevation model, sequence of aerial
images, stereovision process, multiple
correlation algorithms.",
abstract = "Our paper presents an automatic generation of
high resolution urban digital elevation models
(DEMs) based on highly redundant correlation
process. We will discuss the difficulties of such
a task by commenting on the state of the art, and
we propose an approach in tree main steps. In the
first step, the image acquisition specification
as image sequences leads to pairs with various
base/height ratios in order to obtain good
precision and few errors due to hidden parts. In
the second step we use various stereovision
methods and we merge the results, thus
attributing to each pixel the most probable and
precise elevation. In the third step we
automatically extract terrain-DEM and
building-DEM from computed DEM in order to
specifically post-process each class. Finally, we
combine these two DEMs to generate a final DEM
which presents the best continuity for ground
surface, and which respects sharp building
discontinuities. The results obtained with an
operational example (including image size,
difficulty of the scene) demonstrate the
feasibility of generating metric resolution urban
data bases from automated digital stereo
methods.",
}
@Article{-Gader:1991:SeDeAp,
author = "Gader, Paul D.",
title = "Separable decompositions and approximations of
greyscale morphological templates",
journal = "Computer Vision, Graphics and Image Processing",
year = "1991",
volume = "53",
number = "3",
pages = "288--296",
month = "May",
copyholder = "faria - tese",
keywords = "decomposition, greyscale morphological templates,
filters",
abstract = "Decomposition of templates is a useful technique
for increasing the computational efficiency of
image processing operations, either by decreasing
the number of operations required or by
reorganizing computations into forms more
compatible with specialized image processing
architectures. There are numerous examples of
useful decompositions including FFTs,
decomposition of Laplacians of Gaussian masks,
and decompositions of separable, convex greyscale
structuring elements in mathematical morphology.
In this paper, a method for decomposing any
greyscale structuring element into the sum of a
separable and a totally inseparable template is
described. Simple methods for decomposing the
resulting separable template, or any separable
template, into separable factors with respect to
dilation are also described. The theory behind
the decompositions and algorithms for computing
them are both presented. If the original template
is separable, then the method yields a separable
decomposition. If the original template is not
separable, the method yields the closest
separable template to the original in the mean
square sense.",
note = "",
}
@Book{Goldberg:1989:GeAlIn,
author = "Goldberg, David Edward",
editor = "",
title = "Genetic algorithms in search, optimization, and
machine learning",
publisher = "Addison-Wesley Publishing Company",
year = "1989",
volume = "",
series = "",
address = "New York",
edition = "",
copyholder = "faria - tese",
keywords = "combinatorial optimization, machine learning,
algorithm genetic",
abstract = "",
note = "",
targetfile = "target.html",
}
@InCollection{GoldbergDeb:1991:CoAnSe,
author = "Goldberg, David Edward and Deb, Kalyanmoy",
title = "A comparative analysis of selection schemes used
in genetic algorithms",
booktitle = "Foundations of Genetic Algorithms",
publisher = "Morgan Kaufmann",
year = "1991",
editor = "Rawlins, Gregory J. E.",
pages = "69--93",
address = "San Mateo, CA",
copyholder = "faria - tese",
keywords = "proportionate selection, ranking selection,
tournament selection, genitor, takeover time,
time complexity, growth ratio.",
abstract = "This paper considers a number of selection
schemes commonly used in modern genetic
algorithms. Specifically, proportionate
reproduction, ranking selection, tournament
selection, and Genitor (or {"}steady state{"})
selection are compared on the basis of solutions
to deterministic difference or differential
equations, which are verified through computer
simulations. The analysis provides convenient
approximate or exact solutions as well as useful
convergence time and growth ratio estimates. The
paper recommends practical application of the
analysis and suggests a number of paths for more
detailed analytical investigation of selection
techniques.",
note = "",
targetfile = "target.html",
}
@InProceedings{GongShiChen:1992:ShImMa,
author = "Gong, W. and Shi, Q. and Cheng, M.",
title = "Shape and image matching by use of morphology",
booktitle = "11 th IAPR International Conference on Pattern
Recognition - Vol. II - Conference B: Pattern
Recognition, Methodology and Systems",
year = "1992",
pages = "673--676",
address = "The Hagne, Netherlands",
month = "August/September",
keywords = "mathematical morphology, matching.",
abstract = "New measures for shape and image matching error
are presented based on morphological method. It
is shown that rhey grasp the structural and
distributive information of the error so as to
avoid the incorrect decision by classical ways.
The properties of the new measures, such as
dominance of large features, are given. The
experiments show these measures have a strong
ability against noise and can be used effectively
in shape recognition and image registration.",
}
@Article{Goshtasby:1985:TeMaIn,
author = "Goshtasby, A.",
title = "Template matching in rotated images",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1985",
volume = "7",
number = "3",
pages = "338--344",
month = "May",
keywords = "image registration, invariant moments,
mann-whitney test, satellite imagery, two-stage
template matching.",
abstract = "A rotationally invariant template matching using
normalized invariant moments is described. It is
shown that if normalized invariant moments in
circular windows are used, then template matching
in rotated images becomes similar to template
matching in translated images. A speedup
technique based on the idea of two-stage template
matching is also described. In this technique,
the zeroth-order moment is used in the first
stage to determine the likely match positions,
and the second- and third-order moments are used
in the second stage to determine the best match
position among the likely ones.",
}
@Article{-GoshtasbyStoc:1985:PoPaMa,
author = "Goshtasby, A. and Stockman, G. C.",
title = "Point pattern matching using convex hull edges",
journal = "IEEE Transactions on Systems, Man and
Cybernetics",
year = "1985",
volume = "15",
number = "5",
pages = "631--637",
month = "September/October",
keywords = "matching, convex hull edges.",
abstract = "Algorithms for matching two sets of points in a
plane are given. These algorithms search in the
parameter space and find the transformation
parameters that can match the most points in the
two sets. Since an exhaustive search for the best
parameters is not affordable as the number of
points in the sets becomes large, a subset
selection method is given in order to reduce the
search domain. Subsets are chosen as points on
the boundary of the convex hulls of the sets. The
algorithms are tested on generated and real data
and their performance is compared.",
}
@Article{-GoutsiasHeijSiva:1995:MoOpIm,
author = "Goutsias, John and Heijmans, Henk J. A. M. and
Sivakumar, K.",
title = "Morphological operators for image sequences",
journal = "Computer Vision and Image Understanding",
year = "1995",
volume = "62",
number = "3",
pages = "326--346",
month = "November",
copyholder = "faria - tese",
keywords = "mathematical morphology, distance
transformations,algebraic basis",
abstract = "This paper presents a unifying approach to the
problem of morphologically processing image
sequences (or, equivalently, vector-valued
images) by means of lattice theory, thus
providing a mathematical foundation for vector
morphology. Lattice theory is an abstract
algebraic tool that has been extensively used as
a theoretical framework for scalar morphology
(i.e., mathematical morphology applied on single
images). Two approaches to vector morphology are
discussed. According to the first approach,
vector morphology is viewed as a natural
extension of the well-known scalar morphology.
This approach formalizes and generalizes Wilson's
matrix morphology and shows that the latter is a
direct consequence of marginal vector ordering.
The derivation of the second approach is more
delicate and requires careful treatment. This
approach is a direct consequence of a vector
transformation followed by marginal ordering.
When the vector transformation is the identity
transformation, the two approaches are
equivalent. A number of examples demonstrate the
applicability of the proposed theory in a number
of image processing and analysis problems.",
note = "",
}
@Article{-GroskyLu:1986:IcInUs,
author = "Grosky, W. I. and Lu, Yi",
title = "Iconic indexing using generalized pattern
matching techniques",
journal = "Computer Vision, Graphics and Image Processing",
year = "1986",
volume = "35",
number = "3",
pages = "383--403",
month = "September",
keywords = "iconic indexing, matching.",
}
@InProceedings{HaalaVoss:1992:ReRoRi,
author = "Haala, N. and Vosselman, G.",
title = "Recognition of road and river patterns by
relational matching",
booktitle = "International Archives of Photogrammetry and
Remote Sensing, v.29-B3 - 17th Congress -
Commission III",
year = "1992",
editor = "Photogrammetry, International Society of and
(ISPRS), Remote Sensing",
pages = "969--975",
organization = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
publisher = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
address = "Washington D. C., USA",
keywords = "artificial intelligence, image interpretation,
feature extraction, pattern recognition.",
abstract = "This paper discusses a procedure aiming at the
automatic exterior orientation of images. To this
purpose the relational matching method is used to
match relational descriptions of images and maps.
Because roads, rivers and land parcels often
constitute unique structures, these topographic
features are taken as the basic elements of the
descriptions and are used to identify and locate
landmarks like road crossings, waterway junctions
and specific parcel structures. The structural
descriptions of the images are obtained by
thresholding selected channels of colour images
and subsequent thinning of the linear structures.
Tree search methods are used to match the derived
relational image descriptions with hand made
descriptions of the landmarks.",
}
@InProceedings{Hannah:1988:DiStIm,
author = "Hannah, M. J.",
title = "Digital stereo image matching techniques",
booktitle = "International Archives of Photogrammetry and
Remote Sensing, v.27-B3 - 16th Congress -
Commission III",
year = "1988",
editor = "Photogrammetry, International Society of and
Sensing, Remote",
pages = "280--293",
organization = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
publisher = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
address = "Kyoto, Japan",
keywords = "stereo matching, area-based correlation.",
abstract = "This paper presents an overview of the various
classes of algorithms in use for matching points
from one digital image of a stereo pair with the
corresponding points in the second image of the
pair. These techniques primarily use area-based
measures, such as correlation between images
patches, or edge-based methods that match linear
features in images, but also include the use of
feature extractors to match single points in
images, as well as global optimization techniques
that simultaneously match all points in the
images. This paper also describes an automatic
system developed at SRI for stereo compilation;
this sytem uses area-based correlation, but
applies this basic technique in a variety of
novel ways to develop a disparity model for a
given stereo image pair. The techniques used are
hierarchical in nature, and incorporate iterative
refinement, as well as a best-first strategy, in
the matching process. To illustrate these
techniques, the results of this system on the
Image Matching Test A data set recently
distributed by ISPRS's Working Group III/4 are
presented.",
}
@Article{Hannah:1989:SyDiSt,
author = "Hannah, M. J.",
title = "A system for digital stereo matching",
journal = "Photogrammetric Engineering and Remote Sensing",
year = "1989",
volume = "55",
number = "12",
pages = "1765--1770",
month = "December",
keywords = "matching, area-based correlation.",
abstract = "The digital stereo image processing literature is
briefly reviewed, and an automatic system
developed at SRI Iternational for digital
matching of points in aerial stereo imagery is
described. Our system uses area-based
correlation, but couples this very basic measure
of match with a variety of novel search
techniques to develop a disparity model for a
given stereo image pair. The techniques used are
hierarchical in nature, incorporate iterative
refinement, and use a best-first strategy in the
matching process; matches are then checked by a
new technique that we call back matching. Our
techniques are illustrated using some of the
results produced by this system when we
participated in Image Matching Test A for ISPRS
Working Group III/4.",
}
@Book{HaralickShap:1992:CoRoVi,
author = "Haralick, R. M. and Shapiro, L. G.",
title = "Computer and robot vision",
publisher = "Addison-Wesley Publishing Company",
year = "1992",
volume = "1",
address = "New York",
keywords = "computer vision, machine vision, thresholding,
segmentation, pattern recognition, mathematical
morphology, labeling, texture, dilation, erosion,
opening, closing, matching.",
}
@Article{HaralickSterZhua:1987:ImAnUs,
author = "Haralick, Robert M. and Sternberg, Stanley R. and
Zhuang, Xinhua",
title = "Image analysis using mathematical morphology",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1987",
volume = "9",
number = "4",
pages = "532--550",
month = "July",
copyholder = "faria - tese",
keywords = "closing, dilation, erosion, filtering, image
analysis, morphology, opening, shape analysis",
abstract = "For the purposes of object or defect
identification required in industrial vision
applications, the operations of mathematical
morphology are more useful than the convolution
operations employed in signal processing because
the morphological operators relate directly to
shape. The tutorial provided in this paper
reviews both binary morphology and gray scale
morphology, covering the operations of dilation,
erosion, opening, and closing and their
relations. Examples are given for each
morphological concept and explanations are given
for many of their interrelationships.",
note = "",
}
@Article{HarveyMars:1996:UsGeAl,
author = "Harvey, Neal R. and Marshall, Stephen",
title = "The use of genetic algorithms in morphological
filter design",
journal = "Signal Processing: Image Communication",
year = "1996",
volume = "8",
number = "1",
pages = "55--71",
month = "January",
copyholder = "faria - tese",
keywords = "morphological filters, genetic algorithms,
design, optimization",
abstract = "Morphological filters are an important class of
non-linear digital signal processing and analysis
filters, having found a range of applications,
giving excellent results in areas such as noise
reduction, edge detection and object recognition.
However, design methods existing for these
morphological filters tend to be computationally
intractable or require some expert knowledge of
mathematical morphology. This paper demonstrates
how simple genetic algorithms can be employed in
the search for optimum morphological filters for
specific signal/image processing tasks. Some
examples of applying the method to some real
noise-reduction tasks are shown.",
note = "",
}
@Article{HawleyGallFitz:1994:StFiPh,
author = "Hawley, R. W. and Gallagher Junior, N. C. and
Fitz, M. P.",
title = "Stack filter phase lock loops",
journal = "Signal Processing",
year = "1994",
volume = "38",
number = "3",
pages = "317--329",
month = "August",
keywords = "synchronization, stack filters, phase lock loops,
non-linear signal processing, robust estimation,
median filters.",
abstract = "The basic design of a general purpose digital
phase lock loop is improved upon by incorporating
a stack filter into the feedback path of the
loop. The addition of a stack filter provides
enhanced performance in the presence of impulsive
noise while providing the same steady-state
performance of a conventional digital phase lock
loop. Both fisrt- and second-order loops benefit
from the addition of stack filters. The
particular case of using a median filter is
examined in detail. In addition, a linear
regression model is used in conjunction with the
absolute error criterion to provide robust
estimates of phase and frequency. The resulting
loop structure incorporates median and weighted
median filters in its feedback path.",
}
@Article{Heijmans:1991:ThAsGr,
author = "Heijmans, Henk J. A. M.",
title = "Theoretical aspects of gray-level morphology",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1991",
volume = "13",
number = "6",
pages = "568--582",
month = "June",
copyholder = "faria - tese",
keywords = "dilation, erosion, flat operator, gray-level
function, mathematical morphology, threshold
superposition principle, translation-invariance,
umbra",
abstract = "Originally, mathematical morphology has been
developed for binary images and extensively uses
set-theoretic operations such as union,
intersection, and set complement. Furthermore,
translation plays a major role in classical
morphology. Later, the theory has been extended
to gray-level images. Here one must distinguish
between two particular classes of morphological
operators, those which are invariant under
gray-level translations, and those which are not.
This paper presents a detailed study of
morphological operators on the space of
gray-level functions. It is shown how one can use
binary morphological operators and thresholding
techniques to a large class of gray-level
morphological operators. Particular attention is
given to the class of so-called flat operators,
i.e., operators which commute with thresholding.
It is also shown how to define dilations and
erosions with nonflat structuring elements if the
gray-level set is finite. Surprisingly, merely
trucation yields wrong results.",
note = "",
}
@Article{Heipke:1997:AuInRe,
author = "Heipke, C.",
title = "Automation of interior, relative, and absolute
orientation",
journal = "ISPRS Journal of Photogrammetry and Remote
Sensing",
year = "1997",
volume = "52",
number = "1",
pages = "1--19",
month = "February",
keywords = "orientation, automation, digital
photogrammetry.",
abstract = "Considerable progress has been achieved in the
automation of image orientation for
photogrammetry and remote sensing over the last
few years. Today, autonomous software modules for
interior and relative orientation are
commercially available in digital photogrammetric
workstations (DPWS), and so is automatic aerial
triangulation. The absolute orientation has been
successfully automated for a number of
applications. In this paper recent developments
and the state of the art in automatic image
orientation are presented.",
}
@InProceedings{HellwichFaig:1992:GrMaSt,
author = "Hellwich, O. and Faig, W.",
title = "Graph-based matching of stereo image features",
booktitle = "International Archives of Photogrammetry and
Remote Sensing, v.29-B3 - 17th Congress -
Commission III",
year = "1992",
editor = "Photogrammetry, International Society of and
(ISPRS), Remote Sensing",
pages = "307--317",
organization = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
publisher = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
address = "Washington D. C., USA",
keywords = "feature extraction, image matching,
stereoscopy.",
abstract = "A feature-based stereo vision method was
developed. It utilizes a neighbourhood graph in
order to control the search for matching edge
pairs. Information about neighbourhood relations
supports the establishment and the reliability of
matches. The matching method does not exploit any
geometric constraints and is therefore applicable
to a wide range of related problems, such as
finding correspondence between images and maps.
The most important advantages of the matching
algorithm are its independence from human
interaction and the use of curved edge segments.
The proposed method was implemented in the form
of a modular software package on a Sun
workstation using the XWindow user interface. The
complete software package forms a softcopy
photogrammetric program package. Its modular
nature provides the possibility to exchange parts
in order to adjust it to future technological
developments, and use it for further stereo
vision research. The features, advantages and
problems of the proposed method are discussed.
Digitized stereo image pairs for the
investigation of automobile accidents are used to
illustrate the method. For objects with
distinctive edges, 80% to 90% of the resultant
densely distributed feature pairs were found to
be correct.",
}
@InProceedings{Heygster:1980:DeSpPr,
author = "Heygster, G.",
title = "Two-dimensional rank-filters - deterministic and
spectral properties",
booktitle = "5th International Coference on Pattern
Recognition",
year = "1980",
editor = "New York, IEEE",
pages = "1165--1167",
address = "Miami Beach, Florida",
month = "December",
keywords = "rank filters, autocorrelation function, median
filter.",
abstract = "Rank filters operating on images assign the kth
value of the grey levels from the window
consisting of M pixels arranged according to
their value to the centre point of the window.
The special cases k = 1, k = M (MIN and MAX
filter) and k = (M+1)/2 (median filter), which
have already been applied in image processing,
are investigated in the systematic connection
with all rank filters. Some of their properties
can be formulated analytically. They commute with
monotonic transforms of the grey scale. In the
one-dimensional case - also valid for line-like
structures in images - the output function of
monotonic input functions can be calculated
directly. The alternating application of MIN and
MAX filters leads, if repeated more than once, to
the same results as single application. The
application of the rank filters to a set of test
images shows that there is no simple way to
describe their action on the spectrum by means of
a transfer or autocorrelation function.",
}
@Article{HirataDougBarr:2000:ItDeMo,
author = "Hirata, Nina Sumiko Tomita and Dougherty, Edward
R. and Barrera, Junior",
title = "Iterative design of morphological binary image
operators",
journal = "Optical Engineering",
year = "2000",
volume = "39",
number = "12",
pages = "3106--3123",
month = "December",
copyholder = "faria - tese",
keywords = "mathematical morphology, morphological operator,
morphological binary operator, mean-absolute
error",
abstract = "Iterating (composing) a sequence of window
operators results in an operator defined over the
window determined by the dilation of the
component windows. Although a statistically
designed iterative operator uses potentially all
of the variables in the large dilated window, the
design of each component operator requires design
only over a much smaller component window,
thereby resulting in a reduced estimation error.
This means that designed iterative operators can
perform better than designed estimates of fully
optimal operators over the same effective window.
While the optimal iterative and fully optimal
operators may differ substantially in their
logical structure, they may probabilistically
very close as operators on the random image
processes under consideration. Thus, a precisely
designed iterative operator can be closer to
optimal than a less precisely designed
unconstrained operator. We present three measures
by which to compare iterative operators, with
main interest focusing on the difference in their
mean-absolute errors (MAEs), and discuss
iterative design procedures and relationships
between MAEs occuring from various procedures. A
key aspect of design is the dependency on sample
size. Increasing the number of iterations may in
theory produce a better filter but, like using
large windows, increasing the number of
iterations increases the amount of data required
for precise design. We pay particular attention
to this issue. Using both restoration and
recognitiom operators, we consider the best
number of iterations and window size. We also
consider the manner in which the training data
should be split when designing the individual
component operators. Iteration number, window
size, and training method are all depedent on the
filtering task, image characteristics, and amount
of training data available.",
note = "",
}
@Article{HirataDougBarr:2000:SwAlDe,
author = "Hirata, Nina Sumiko Tomita and Dougherty, Edward
R. and Barrera, Junior",
title = "A switching algorithm for design of optimal
increasing binary filters over large windows",
journal = "Pattern Recognition",
year = "2000",
volume = "33",
number = "6",
pages = "1059--1081",
month = "June",
copyholder = "faria - tese",
keywords = "increasing filter, optimal filter, nonlinear
filter, boolean lattice, switching algorithm,
greedy algorithm, morphological filters",
abstract = "All known approaches for the design of increasing
translation-invariant binary window filters
involve combinatoric searches. This paper
proposes a new switching algorithm having the
advantage that the search is over a smaller set
than other algorithms. Beginning with an estimate
from image realizations of the optimal generic
(nonincreasing) window function, the algorithm
switches (exchanges) a set of observation vectors
(templates) between the optimal function's kernel
and the kernel's complement. There are many such
{"}switching sets{"} that provide a kernel
defining an increasing filter. The optimal
increasing filter is the one corresponding to the
switching set that produces the minimal increase
in error over the optimal generic filter. The
core of the search problem is the inversion set
of the optimal filter. The inversion set is
composed of all vectors in the kernel lying
beneath a nonkernel vector in the lattice of
observation vectors and all nonkernel vectors
lying above a kernel vector. The new algorithm,
which is based on an error-related greedy
property, recursively eliminates the inversion
set until the optimal increasing filter is
obtained. For purposes of computational
efficiency, the actual implementation may be
based on a relaxation of the original
construction, so that the result may be
suboptimal. For the various models tested, the
relaxed algorithm has proven to be optimal or
very close to optimal. Besides its good
estimation precision, the new algorithm has three
noteworthy properties: first, it is applicable to
relatively large windows; second, it operates
directly on the input data via estimates of
determining conditional probabilities; and third,
the degree of ralaxation serves as an input
parameter to the algorithm, so that computation
time can be bounded for large windows and the
algorithm can run to full optimality for small
windows.",
note = "",
}
@Book{Holland:1994:InAnAp,
author = "Holland, John H.",
editor = "",
title = "Adaptation in natural and artificial systems: an
introductory analysis with applications to
biology, control, and artificial intelligence.",
publisher = "MIT Press/Bradford Book",
year = "1994",
volume = "",
series = "",
address = "Cambridge, Massachusetts",
edition = "Second Edition",
copyholder = "faria - tese",
keywords = "adaptation, mathematical models, adaptive control
systems",
abstract = "",
note = "",
targetfile = "target.html",
}
@Article{HsiehMcKePerl:1992:PeEvSc,
author = "Hsieh, Y. C. and McKeown, D. M. and Perlant, F.
P.",
title = "Performance evaluation of scene registration and
stereo matching for cartographic feature
extraction",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1992",
volume = "14",
number = "2",
pages = "214--238",
month = "February",
keywords = "analysis of aerial imagery, cartography, computer
vision, digital mapping, image understanding,
performance evaluation, scene registration,
stereo matching.",
abstract = "One goal of automated cartography is to generate
an accurate 3-D model of man-made structures and
natural terrain. Some of the most challenging
problems in cartographic feature extraction occur
in dense urban areas where the level of detail
and scene clutter greatly complicate traditional
map compilation techniques. In this paper, we
describe experiments toward a comprehensive
stereo analysis system to recover the 3-D
description of an urban area using
high-resolution aerial imagery. Given an area of
interest in terms of geographic coverage, our
system can automatically find the appropriate
stereo pair using a spatial database, select
control points to register the two images so that
epipolar geometry is satisfied, and recover
disparity information using two complementary
matching techniques. in our research, we do not
assume that the initial input images satisfy the
epipolar geometry constraint because this is
rarely the case in unrectified aerial imagery,
Therefore, we argue that stereo mapping research
must explicitly address error and uncertainty in
both scene registration and stereo matching and
that we need techniques to evaluate such errors
in a rigorous manner. We also argue that in order
to achieve robust behavior, multiple methods for
scene feature extraction should be utilized, and
if possible, their results should be integrated
into a consistent framework. We describe
techniques for scene registration using five
different features that can be automatically
extracted to provide control points for fine
image registration. In the stereo matching
process, two techniques are utilized: an
area-based and a feature-based stereo matcher to
generate a disparity map for scene. We also
present some preliminary results on technique to
merge the results of the stereo matching
algorithms to provide improved information
regarding height estimates. Finally, we describe
techniques to generate rigorous performance
analysis metrics to compare stereo matching
algorithms based on a manually derived 3-D ground
truth segmentation. The analysis includes the
error estimation metrics for both height and
delineation accuracy based on the measurements of
deviations from manual estimates. These estimates
are computed globally over the entire scene and
locally on a structure-by-structure basis.",
}
@InProceedings{JianqingQing:1992:ImAnBa,
author = "Jianqing, Z. and Qingshong, F.",
title = "Image analysis based on mathematical morphology",
booktitle = "International Archives of Photogrammetry and
Remote Sensing, v.29--3",
year = "1992",
editor = "Photogrammetry, International Society of and
Sensing, Remote",
pages = "72--77",
organization = "International Society of Photogrammetry and
Remote Sensing (ISPRS) - Commission III",
publisher = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
address = "Washington, D. C., USA",
keywords = "image segmentation, mathematical morphology, edge
extraction, thinning, region decomposition.",
abstract = "Basic information of objects (regions) in digital
image is obtained by image segmentation. More
precise information about the object (regions) is
extracted based on image analysis, including edge
extracting, thinning, configuration fitting and
shape decomposition, which are mainly based on
mathematical morphology. The primitives of
structural features can be produced by means of
the methods. At last, the polygons and the
primitives of structure features can be acquired
for further image matching or understanding.",
}
@Article{JonesSval:1994:AlDeGr,
author = "Jones, Ronald and Svalbe, Imants D.",
title = "Algorithms for the decomposition of gray-scale
morphological operations",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1994",
volume = "16",
number = "6",
pages = "581--588",
month = "June",
copyholder = "faria - tese",
keywords = "gray-scale morphology, mathematical morphology,
morphologic basis decomposition",
abstract = "The choice and detailed design of structuring
elements plays a pivotal role in the morphologic
processing of images. A broad class of
morphological operations can be expressed as an
equivalent supremum of erosions by a minimal set
of basis filters. Diverse morphological
operations can then be expressed in a single,
comparable framework. The set of basis filters
are data-like structures, each filter
representing one type of local change possible
under that operation. The data-level description
of the basis set is a natural starting point for
the design of morphological filters. This paper
promotes the use of the basis decomposition of
gray-scale morphological operations to design and
apply morphological filters. A constructive proof
is given for the basis decomposition of general
gray-scale morphological operations, as are
practical algorithms to find all of the basis set
members for these operations. Examples are given
to illustrate the algorithms presented.",
note = "",
}
@Article{KarmakarDool:2002:GeFuRu,
author = "Karmakar, Gour C. and Dooley, Laurence S.",
title = "A generic fuzzy rule based image segmentation
algorithm",
journal = "Pattern Recognition Letters",
year = "2002",
volume = "23",
number = "10",
pages = "1215--1227",
month = "August",
copyholder = "faria - tese",
keywords = "generic fuzzy rules, image segmentation, spatial
information, fuzzy clustering",
abstract = "Fuzzy rule based image segmentation techniques
tend in general, to be application dependent with
structure of the merbership functions being
predefined and in certain cases, the
corresponding parameters being manually
determined. The net result is that the overall
performance of the segmentation technique is very
sensitive to parameter value selections. This
paper addresses these issues by introducing a
generic fuzzy rule based image image segmentation
(GFRIS) algorithm, which is both application
independent and exploits inter-pixel spatial
relationships. The GFRIS algorithm automatically
approximates both the key weighting factor and
threshold value in the definitions of the fuzzy
rule and neighbourhood system, respectively. A
quantitative evaluation is presented between the
segmentation results obtained using GFRIS and the
popular fuzzy c-means (FCM) and possibilistic
c-means (PCM) algorithms. The results demonstrate
that GFRIS exhibits a considerable improvement in
performance compared to both FCM abd PCM, for
many different image types.",
note = "",
}
@InProceedings{KherMitr:1992:ReNoSA,
author = "Kher, A. and Mitra, S.",
title = "Registration of noisy SAR imagery using
morphological feature extractor and 2-D
cepstrum",
booktitle = "SPIE Vol. 1771 Applications of Digital Image
Processing XV",
year = "1992",
editor = "SPIE",
pages = "281--291",
publisher = "SPIE",
keywords = "registration, noise, mathematical morphology,
speckle.",
abstract = "Registration of synthetic aperture radar (SAR)
images is a non-trivial task because of the
significant speckle noise associated with them.
We have performed the registration using 2-D
cepstrum technique which has been verified to be
more noise tolerant and computationally more
efficient than the conventional correlation
methods. The cepstral peaks revealed linear
translations between SAR image pairs, accurately.
Further work is in progress to isolate the
registration peaks from spurious peaks in a more
reliable way than the present heuristic approach.
Removal of speckle noise from the SAR images is
also addressed. Spatial averaging is a standard
technique used on SAR images to reduce speckle.
However, this causes a loss of resolution. We
have employed mathematical morphology techniques
to remove more speckle than spatial averaging
can, with little loss of resolution. Long,
one-dimensional structuring elements in different
orientations are used to filter speckle while
maintaining the sharpness of region boundaries.
Afterward, a small, two-dimensional structuring
element is use to remove thin line elements. The
targets appearing as small bright spots are
separated from the original images by a
thresholding operation and superimposed on the
filtered images. The computational time required
on a sequential machine is comparable to that
spatial averaging. In addition, like other
morphological filters, this technique could be
implemented on real time parallel architecture.
The improvement in resolution and noise reduction
over the spatial averaging is demosntrated for
images acquired at different wavelengths.",
}
@Article{KhosraviScha:1996:TeMaBa,
author = "Khosravi, M. and Schafer, Ronald W.",
title = "Template matching based on a grayscale
hit-or-miss transform",
journal = "IEEE Transactions on Image Processing",
year = "1996",
volume = "5",
number = "6",
pages = "1060--1066",
month = "June",
keywords = "template matching, hit-or-miss transform,
rank-order-based template matching.",
abstract = "This paper introduces a class of rank-order-based
template matching criteria that are
multiplier-free and independent of the dc
variations of the image. The core component of
these criteria is a grayscale morphological
hit-or-miss transform (GHMT). Experimental
results show that the GHMT features sharp and
robust indications in the presence of Gaussian
noise. The idea of the GHMT is used to develop
more general forms of matching criteria that are
robust to both Gaussian and impulsive noises.",
}
@Article{KimParkHwanKim:2002:ViSeSe,
author = "Kim, Eun Yi and Park, Se Hyun and Hwang, Sang Won
and Kim, Hang Joon",
title = "Video sequence segmentation using genetic
algorithms",
journal = "Pattern Recognition Letters",
year = "2002",
volume = "23",
number = "7",
pages = "843--863",
month = "May",
copyholder = "faria - tese",
keywords = "video sequence segmentation, distributed genetic
algorithm, temporal correlation",
abstract = "This paper proposes a new video sequence
segmentation method based on the genetic
algorithm (GA) that can improve computational
efficiency. The computation is distributed into
chromosomes that evolve using distributed genetic
algorithms (DGAs). Each chromosome consists of a
label and feature vector. The label is used as
the region number for the pixel where the
chromosome is located. Based on the temporal
correlation between two consecutive frames in a
video sequence, segmentation of a frame is
successively obtained using the segmentation
result of the previous frame. In addition to
eliminating redundant computation, only unstable
chromosomes corresponding to moving object parts
are evolved. Experimental results confirm the
effectiveness of the proposed method.",
note = "",
}
@Article{-KuoHwan:1996:GeAlDi,
author = "Kuo, Ting and Hwang, Shu-Yuen",
title = "A genetic algorithm with disruptive selection",
journal = "IEEE Transactions on Systems, Man and
Cybernetics - Part B: Cybernetics",
year = "1996",
volume = "26",
number = "2",
pages = "299--307",
month = "April",
copyholder = "faria - tese",
keywords = "genetic algorithm, disruptive selection, global
optimum",
abstract = "Genetic algorithms are a class of adaptive search
techniques based on the principles of population
genetics. The metaphor underlying genetic
algorithms is that of natural evolution. Applying
the {"}survival-of-the-fittest{"} principle,
traditional genetic algorithms allocate more
trials to above-average schemata. However,
increasing the sampling rate of schemata that are
above average does not guarantee convergence to a
global optimum; the global optimum could be a
relatively isolated peak or located in schemata
that have large variance in performance, In this
paper we propose a novel selection method,
disruptive selection. This method adopts a
nonmonotonic fitness function that is quite
different from traditional monotonic fitness
functions, Unlike traditional genetic algorithms,
this method favors both superior and inferior
individuals. Experimental results show that GA's
using the proposed method easily find the optimal
solution of a function that is hard for
traditional GA's to optimize, We also present
convergence analysis to estimate the occurrence
ratio of the optima of a deceptive function after
a certain number of generations of a genetic
algorithm, Experimental results show that GA's
using disruptive selection in some occasions find
the optima more quickly and reliably than GA's
using directional selection, These results
suggest that disruptive selection can be useful
in solving problems that have large variance
within schemata and problems that are
GA-deceptive.",
note = "",
}
@Article{-LeaLyba:1993:FiMeOc,
author = "Lea, S. M. and Lybanon, M.",
title = "Finding mesoscale ocean structures with
mathematical morphology",
journal = "Remote Sensing of Environment",
year = "1993",
volume = "44",
pages = "25--33",
keywords = "mathematical morphology.",
abstract = "We introduce a technique to aid in interpreting
infrared satellite images of the North Atlantic
Ocean Gulf Stream region. Present interpretive
methods are largely manual, require significant
effort, and are highly dependent on the
interpreter's skill. Our quasiautomated technique
is based on mathematical morphology, specifically
the image transformations of opening and closing,
which are defined in terms of erosion and
dilation. The implementation performs sucessive
openings and closings at increasing thresholds
until a stable division into objects and
background is found. This method finds the North
Wall of the Gulf Stream in approximately the same
place as human analysts and another automated
procedure, and does less smoothing of small
irregularities than the other two methods. The
North Wall is continuous and sharp except where
obscured by clouds. Performance in locating
warm-core eddies is also comparable to the others
methods. However, the present procedure does not
find cold-core rings well. We are presently
investigating ways to reduce the effects of
clouds and delete the unwanted water areas found
by method. We expect to be able to improve the
cold-core eddy performance.",
}
@Article{LeeLeeHsue:1995:GeFuHi,
author = "Lee, Yih-Gong and Lee, Jia-Hong and Hsueh,
Yuang-Cheh",
title = "Genetic-based fuzzy hit-or-miss texture spectrum
for texture analysis",
journal = "Electronics Letters",
year = "1995",
volume = "31",
number = "23",
pages = "1986--1988",
month = "November",
copyholder = "faria - tese",
keywords = "genetic algorithms, testure (image processing)",
abstract = "A new method using a fuzzy hit-or-miss transform
recognition procedure, which measures degrees of
fit of specified patterns within an image, is
proposed for texture analysis. For a given
texture, three optimal texture patterns
(structuring elements) dynamically generated by
genetic algorithms are used to inspect the
degrees of fit by using the fuzzy hit-or-miss
transform, respectively. The distribution of
these degrees of fit, converted into a texture
spectrum, is used as the texture feature for
texture analysis.",
note = "",
}
@InProceedings{Lemmens:1988:SuOnSt,
author = "Lemmens, M. J. P. M.",
title = "A survey on stereo matching techniques",
booktitle = "International Archives of Photogrammetry and
Remote Sensing, v.27-B8 - 16 th. Congress",
year = "1988",
editor = "International Society of Photogrammetry and
Remote Sensing",
pages = "v-11--v-23",
organization = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
publisher = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
address = "Kyoto, Japan",
keywords = "stereo matching, robot stereo vision.",
abstract = "Tracing of corresponding phenomena (matching) is
necessary in many applications, like image
sequence analysis, aerotriangulation and 3-D
geometric information extraction from stereo
pairs of images. An important industrial
application is robot stereo vision. In digital
images correspondence problem can be approached
by signal, feature or relational matching.
Common, at the moment, is the signal approach.
Because of its limitations more and more image
structures (features) and their mutual
relationships are used. The aim of this paper is
to review the current stereo matching
techniques.",
}
@Article{Li:1991:HiMuMa,
author = "Li, M.",
title = "Hierarchical multipoint matching",
journal = "Photogrammetric Engineering and Remote Sensing",
year = "1991",
volume = "57",
number = "8",
pages = "1039--1047",
month = "August",
keywords = "multipoint matching.",
abstract = "The problem of hierarchical structures for
multipoint matching is adressed. Related to this
problem, three structures, namely, multigrid,
multiresolution, and the combination of them,
have been developed and investigated. The
multigrid structure extends the regular grid
points, on which the multipoint matching is
performed, to a number of levels in spatial
resolution from coarse to fine, while the
multiresolution structure extends the image
resolution to number of levels from lower to
higher resolution. Each of these two structures,
in turn, removes one of the factors which
handicap the efficiency of the multipoint
matching. The combination of these two structures
then leads to a structure which achieves high
computational efficiency in multipoint matching.
The developed structures have been tested on a
number of images, and results are presented.",
}
@Article{LiDube:1985:FiStIn,
author = "Li, X. and Dubes, R. C.",
title = "The first stage in two-stage template matching",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1985",
volume = "7",
number = "6",
pages = "700--707",
month = "November",
keywords = "image registration, landsat imagery, similarity
measure, template matching.",
abstract = "This paper formulates the problem encountered in
the first stage of two-stage, binary template
matching as a set of hypoteses to be tested,
including a hypothesis of {"}no object{"}. Two
new statistics R and G are proposed, based on a
likelihood ratio, and are compared to the sum of
absolute differences and a correlation measure by
analytical approximations and Monte Carlo
experiments. Statistical power and a measure of
sensitivity to the true location of the object
are the criteria. Parameters are the numbers of
1's in object and image, subtemplate size, and
parameters reflecting intensity distortion
between template and object. One of the proposed
statistics R is much more computationally
intensive than the other G. Although R is more
powerful than G and other statistics, G is
generally more sensitive to the true object
location. Statistic G is also more powerful than
the sum of absolute differences and correlation.
All statistics are robust to incomplete knowledge
of distortion parameters. Experiments on Landsat
images confirm the sensitivity of G and recommend
it for application in the first stage.",
}
@Article{LiHaesRons:1997:ReMoFi,
author = "Li, W. and Haese-Coat, V. and Ronsin, J.",
title = "Residues of morphological filtering by
reconstruction for texture classification",
journal = "Pattern Recognition",
year = "1997",
volume = "30",
number = "7",
pages = "1081--1093",
month = "July",
keywords = "feature extraction, texture classification,
mathematical morphology, image analysis, feature
set optimization, robust texture feature.",
abstract = "This paper presents a set of texture features
which is based on morphological residues of
opening and closing by reconstruction. In texture
classification, this set of features is proven
much more robust to noise than the feature set
derived from traditional morphological residues.
An optimization algorithm is established to
search for the optimum feature subset. The
robustness to noise of our feature set is
investigated in detail qualitatively and
quantitatively. In various noise circumstances as
well as in image deformation, it is found that
this feature set bears quite high texture
classification accuracy compared to other texture
classification methods.",
}
@Article{LinIIICoyl:1994:StFiLa,
author = "Lin, L. and III, G. B. Adams and Coyle, E. J.",
title = "Stack filter lattices",
journal = "Signal Processing",
year = "1994",
volume = "38",
number = "3",
pages = "277--297",
month = "August",
keywords = "stack filters, rank-order filters, rank selection
probability, sample selection probability,
lattice.",
abstract = "Lattice theory, rank selection probabilities
(RSPs), and sample selection probabilities (SSPs)
are used to develop methods for comparing and
ordering stack filters. New recursive algorithms
for calculating RSPs and SSPs are developed. The
structure of this algorithms assists in the
derivation of several interesting properties of
RSPs and SSPs. The identification of some
important sublattices of the stack filter lattice
leads to an improved characterization of the
impulsive noise suppression capabilities of stack
filters.",
}
@Article{LoncaricDhaw:1995:NeMSSh,
author = "Loncaric, Sven and Dhawan, Atam P.",
title = "Near-optimal MST-based shape description using
genetic algorithm",
journal = "Pattern Recognition",
year = "1995",
volume = "28",
number = "4",
pages = "571--579",
month = "April",
copyholder = "faria - tese",
keywords = "shape description, mathematical morphology,
genetic algorithms, shape matching, multiscale
representation, multiresolution pyramid",
abstract = "A new method for selection of the optimal
structuring element for shape description and
matching based on the morphological signature
transform (MST) is presented in this paper. For a
given class of shapes the optimal structuring
element for MST method is selected by means of a
genetic algorithm. The optimization criteria is
formulated to enable a robust shape matching.
Experiments have been performed on class of model
shapes. The proposed optimal shape description
method is applied to the problem of shape
matching which evolves in many object recognition
applications. Here, an unknown object is matched
to a set of known objects in order to calssify it
into one of finite number of classes.
Experimental results are presented and
discussed.",
note = "",
}
@Article{LowenPeet:1998:DiBeFu,
author = "Lowen, R. and Peeters, W.",
title = "Distances between fuzzy sets representing grey
level images",
journal = "Fuzzy Sets and Systems",
year = "1998",
volume = "99",
number = "2",
pages = "135--149",
month = "October",
copyholder = "faria - tese",
keywords = "semi-pseudometrics, metric spaces, Lebesgue
integral, pattern recognition",
abstract = "The authors wish to present a class of
mathematical functions that can be used to
caculate the distance between fuzzy sets.
Essential is that this distance is given by a
semi-pseudometric, i.e. the triangle inequality
is not fulfilled. The relation to the ordinary
pseudometrics is explained. Also, some
theoretical examples are provided.",
note = "",
}
@InProceedings{LuhmannAltr:1986:InImMa,
author = "Luhmann, Thomas and Altrogge, Georg",
title = "Interest-operator for image matching",
booktitle = "International Archives of Photogrammetry and
Remote Sensing, v.26(3/2)",
year = "1986",
editor = "Photogrammetry, International Society of and
Sensing, Remote",
pages = "459--474",
organization = "International Society of Photogrammetry and
Remote Sensing (ISPRS) - Commission III",
publisher = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
keywords = "automatic matching, image matching, human visual
system, feature extraction, moravec operator,
dreschler operator, forstner operator.",
abstract = "Automatic matching of image sequences (stereo
pairs, multisensoral and multitemporal images)
requires the determination of corresponding image
points with sufficient accuracy. This paper
describes feature extraction methods for
detecting unique points using
interest-operators.",
}
@Article{-MaragosScha:1987:ReMeOr,
author = "Maragos, Petros and Schafer, Ronald W.",
title = "Morphlogical filters - Part II: their relations
to median, order-statistic, and stack filters",
journal = "IEEE Transactions on Acoustics, Speech and
Signal Processing",
year = "1987",
volume = "35",
number = "8",
pages = "1170--1184",
month = "August",
copyholder = "faria - tese",
keywords = "mathematical morphology, morphological filters,
median filter, order-statistic filter, stack
filters",
abstract = "This paper extents the theory of median,
order-statistic (OS), and stack filters by using
mathematical morphology to analyze them and by
relating them to those morphological erosions,
dilations, openings, closings, and open-closings
that commute with thresholding. The max-min
representation of OS filters is introduced by
showing that any median or other OS filter is
equal to maximum of erosions (moving local
minima) and also to minimum of dilations (moving
to local maxima). Thus, OS filters can be
computed by a closed formula that involves a
max-min on prespecified sets of numbers and no
sorting. Stack filters are established as the
class of filters that are composed exactly of a
finite number of max-min operations. The kernels
of median, OS, and stack filters are collections
of input signals that uniquely represent these
filters due to their translation-invariance. The
max-min functional definitions of these nonlinear
filters is shown to be equivalent to a maximum of
erosions by minimal (with respect to signal
ordering) kernel elements, and also to a minimum
of dilations by minimal kernel elements of dual
filters. The representation of stack filters
based on their minimal kernel elements is proven
to be equivalent to their representation based on
irreductible sum-of-products expressions of
Boolean functions. It is also shown that the
median filtering (and its iterations) of any
signal by convex 1-D windows is bounded below by
openings and above by closings; a signal is a
root (fixed point) of the median iff it is a root
of both an opening and a closing; the
open-closing and close-opening yield median roots
in one pass, suppress impulse noise similarity to
the median, can discriminate between positive and
negative noise impulses, and are computationally
less complex than the median. Some similar
results are obtained for 2-D median filtering.",
note = "",
}
@Article{-MaragosScha:1987:SeAnRe,
author = "Maragos, Petros and Schafer, Ronald W.",
title = "Morphlogical filters - Part I: their
set-theoretic analysis and relations to linear
shift-invariant",
journal = "IEEE Transactions on Acoustics, Speech and
Signal Processing",
year = "1987",
volume = "35",
number = "8",
pages = "1153--1169",
month = "August",
copyholder = "faria - tese",
keywords = "mathematical morphology, morphological filters,
linear shift invariant filters",
abstract = "This paper examines the set-theoretic
interpretation of morphological filters in the
framework of mathematical morphology and
introduces the representation of classical linear
filters in terms of morphological correlations,
which involve supremum/infimum operations and
additions. Binary signals are classified as sets,
and multilevel signal as functions. Two
set-theoretic representations of signals are
reviewed. Filters are classified as
set-processing (SP) or function-processing (FP).
Conditions are provided for certain FP filters
that pass binary signals to commute with signal
thresholding because then they can be analyzed
and implemented as SP filters. The basic
morphological operations of set erosion,
dilation, opening, and closing are related to
Minkowski set operations and are used to
construct FP morphological filters. Emphasis is
then given to analytically and geometrically
quantifying the similarities and differences
between morphological filtering of signals by
sets and functions; the latter case allows the
definition of morphological convolutions and
correlations. Toward this goal, various
properties of FP morphological filters are also
examined. Linear shift-invariant filters (due to
their translation-invariance) are uniquely
characterized by their kernel, which is a special
collection of input signals. Increasing linear
filters are represented as the supremum of
erosions by their kernel functions. If the
filters are also discrete and have a
finite-extent impulse response, they can be
represented as the supremum of erosions only by
their minimal (with respect to a signal ordering)
kernel functions. Stable linear filters can be
represented as the sum of (at most) two weighted
suprema of erosions. These results demonstrate
the power of mathematical morphology as a
unifying approach to both linear and nonlinear
signal-shaping strategies.",
note = "",
}
@Article{-MedioniNeva:1984:MaImUs,
author = "Medioni, G. and Nevatia, R.",
title = "Matching images using linear features",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1984",
volume = "6",
number = "6",
pages = "675--685",
month = "November",
keywords = "change detection, image-to-map correspondence,
image understanding, linear feature matching,
map-based guidance, matching relaxation.",
abstract = "We describe techniques for matching two images or
an image and a map. This operation is basic for
machine vision and is needed for the tasks of
object recognition, change detection, map
updating, passive navigation, and other tasks.
Our system uses line-based descriptions, and
matching is accomplished by a relaxation
operation which computes most similar geometrical
structures. A more efficient variation, called
the {"}kernel{"} method, is also described. We
give results on complex aerial images which
contain many image differences, caused by varying
sun position, different seasons, and imaging
environments, and also structural changes caused
by man-made alterations such as new
construction.",
}
@Article{-Meyer:1986:AuScCy,
author = "Meyer, F.",
title = "Automatic screening of cytological specimens",
journal = "Computer Vision, Graphics and Image Processing",
year = "1986",
volume = "35",
number = "3",
pages = "356--369",
month = "September",
keywords = "automatic screening.",
abstract = "A robot vision for the automatic screening of
cervical smears will be accepted by cytologists
only if it is both accurate and fast. The
iteration of neighbourhood transformations made
it possible to reach these contradictory targets.
Several modules of our screening program are
described: autofocusing, segmentation of nuclei,
selection of alarms, eleimination of artefacts,
calibration of cells. Results on 1459 slides are
presented.",
}
@Book{Michalewicz:1999:GeAlDa,
author = "Michalewicz, Zbigniew",
editor = "",
title = "Genetic algoritms + data estructures = evolution
programs",
publisher = "Springer-Verlag",
year = "1999",
volume = "",
series = "",
address = "New York",
edition = "Third Edition",
copyholder = "faria - tese",
keywords = "evolutionary programming, genetic algorithms,
data structures",
abstract = "",
targetfile = "target.html",
}
@Book{Mitchell:1996:AnInGe,
author = "Mitchell, Melanie",
editor = "",
title = "An introduction to genetic algorithms",
publisher = "MIT Press/Bradford Book",
year = "1996",
volume = "",
series = "",
address = "Cambridge, Massachusetts",
edition = "",
copyholder = "faria - tese",
keywords = "adaptation, mathematical models, genetic
algorithms, selection, crossover, mutation",
abstract = "",
note = "",
targetfile = "target.html",
}
@Article{-Moran:1990:MoTrSh,
author = "Moran, C. J.",
title = "A morphological transformation for sharpening
edges of features before segmentation",
journal = "Computer Vision, Graphics and Image Processing",
year = "1990",
volume = "49",
pages = "85--94",
keywords = "mathematical morphology, segmentation,
gradient.",
abstract = "A gradient-determined grey level morphological
opening procedure for edge enhancement is
presented. First, the maximum gradient, in the
local neighbourhood, forms the contribution to
the erosion of the centre pixel of that
neighbourhood. The gradients of the transformed
image are then used as contibutions to the
subsequent dilation of the eroded image. The
enhancement procedure is illustrated on sample
images representing multiple phases of soil pore
structure. Histogram partitioning is applied to
the sample images before and after edge
enhancement. The resulting segmentation is
visually better on the images after enhancement.
Stereological measurements made on segmented
images show that the quantity of each phase is
preserved but the degree of contact between
phases is altered.",
}
@InProceedings{MountNetaMoig:1997:EfAlRo,
author = "Mount, David M. and Netanyahu, Nathan S. and
Moigne, Jacqueline Le",
title = "Efficient algorithms for robust feature
matching",
booktitle = "Image Registration Workshop",
year = "1997",
editor = "Greenbelt, MD, NASA",
pages = "247--256",
address = "Greenbelt, MD",
month = "November",
keywords = "robust feature matching, point matching,
efficient algorithm matching.",
abstract = "One of the basic building blocks in any
point-based registration scheme involves matching
feature points that are extracted from sensed
image to their counterparts in the reference
image. This leads to the fundamental problem of
point matching: give two sets of points, find the
affine transformation that transforms one point
set so that its distance from the other point set
is minimized. Because of measurement errors and
the presence of outlying data points, it is
important that the distance measure between two
point sets be robust to these effects. We measure
distances using the generalized Hausdorff
distance. Point matching can be a computationally
intensive task, and there have been a number of
algorithms and approaches proposed for solving
this problem both theoretical and applied. We
present two approaches to the point matching
problem, in an attempt to reduce the
computational complexity of the problem, while
still providing guarantees on the quality of the
final match. Our first method is an approximation
algorithm, which is loosely based on a
branch-and-bound approach due to Huttenlocher and
Rucklidge [HR92, HR93]. We show that by varying
the approximation error bounds, it is possible to
achieve a tradeoff between then quality of the
match and the running time of the algorithm. Our
second method involves a Monte Carlo method for
accelerating the search process used in the first
algorithm. With high probability this method
succeeds in finding an approximately optimal
match. We establish the efficiency of our
approachs empirically.",
}
@Article{MuselliRide:1992:GlOpFu,
author = "Muselli, Marco and Ridella, Sandro",
title = "Global optimization of functions with the
interval genetic algorithm",
journal = "Complex Systems",
year = "1992",
volume = "6",
number = "3",
pages = "193--212",
month = "June",
copyholder = "faria - tese",
keywords = "crossover, genetic algorithm, global optimization
of functions, interval genetic algorithm,
mutation, selection, simulated annealing",
abstract = "A new evolutionary method for the global
optimization of functions with continuous
variables is proposed. This algorithm can be
viewed as an efficient parallelization of the
simulated annealing technique, although a
suitable interval coding shows a close analogy
between real coded genetic algorithms and the
proposed method, called interval genetic
algorithm. Some well-defined genetic operators
allow a considerable improvement in reliability
and efficiency with respect to conventional
simulated annealing even on a sequential
computer. Results of simulations on Rosembrock
valleys and cost functions with flat areas or
fine-grained local minima are reported.
Furthermore, tests on classical problems in the
field of neural networks are presented. They show
a possible practical application of the interval
genetic algorithm.",
note = "",
}
@Article{-PalBandMurt:1998:GeAlGe,
author = "Pal, Sankar K. and Bandyopadhyay, Sanghamitra and
Murthy, C. A.",
title = "Genetic algorithms for generation of class
boundaries",
journal = "IEEE Transactions on Systems, Man and
Cybernetics - Part B: Cybernetics",
year = "1998",
volume = "28",
number = "6",
pages = "816--828",
month = "December",
copyholder = "faria - tese",
keywords = "evolutionary computation, hyperplane fitting,
pattern recognition, variable mutation
probability",
abstract = "A method is described for finding decision
boundaries, approximated by piecewise linear
segments, for classifying patterns in R-N, N
greater than or equal to 2, using an elitist
model of genetic algorithms. It involves
generation and placement of a set of hyperplanes
(represented by strings) in the feature space
that yields minimum misclassification. A scheme
for the automatic deletion of redundant
hyperplanes is also developed in case the
algorithm starts with an initial conservative
estimate of the number of hyperplanes required
for modeling the decision boundary, The
effectiveness of the classification methodology,
along with the generalization ability of the
decision boundary, is demonstrated for different
parameter values on both artificial data and real
life data sets having nonlinear/overlapping class
boundaries. Results are compared extensively with
those of the Bayes classifier, k-NN rule and
multilayer perceptron.",
note = "",
}
@Article{ParkChin:1994:OpDeCo,
author = "Park, Hochong and Chin, Roland T.",
title = "Optimal decomposition of convex morphological
structuring elements for 4-connected parallel
array processors",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1994",
volume = "16",
number = "3",
pages = "304--313",
month = "March",
copyholder = "faria - tese",
keywords = "convex morphological structuring elements,
mathematical morphology, optimal decomposition,
structuring element decomposition",
abstract = "A morphological operation using a large
structuring element can be decomposed
equivalently into a sequence of recursive
operations, each using a smaller structuring
element. However, an optimal decomposition of
arbitrarily shaped structuring elements is yet to
be found. In this paper, we have derived an
optimal decomposition of a specific class of
structuring elements - convex sets - for a
specific type of machine - 4-connected parallel
array processors. The cost of morphological
operation on 4-connected parallel array
processors is the total number of 4-connected
shifts required by the set of structuring
elements. First, the original structuring element
is decomposed into a set o prime factors, and
then their locations are determined while
minimizing the cost function. Proofs are
presented to show the optimality of the
decomposition. Examples of optimal decomposition
are given and compared to an existing
decomposition reported by Xu.",
note = "",
}
@Article{ParkChin:1995:DeArSh,
author = "Park, Hochong and Chin, Roland T.",
title = "Decomposition of arbitrarily shaped morphological
structuring elements",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1995",
volume = "17",
number = "1",
pages = "2--15",
month = "January",
copyholder = "faria - tese",
keywords = "mathematical morphology, structuring element
decomposition, concave boundary",
abstract = "For image processing systems that have a limited
size of region of support, say 3x3, direct
implementation of morphological operations by a
structuring element larger than the prefixed size
is impossible. The decomposition of morphological
operations by a large structuring element into a
sequence of recursive operations, each using a
smaller structuring element, enables the
implementation of large morphological operations.
In this paper, we present the decomposition of
arbitrarily shaped (convex or concave)
structuring elements into 3x3 elements, optimized
with respect to the number of 3x3 elements. The
decomposition is based on the concept of
factorization of a structuring element into its
prime factors. For a given structuring element,
all its corresponding 3x3 prime concave factors
are first determined. From the set of the prime
factors, the decomposability of the structuring
element is then established, and subsequently the
structuring element is decomposed into smallest
possible set of 3x3 elements. Examples of optimal
decomposition and structuring elements that are
not decomposable are presented.",
note = "",
}
@Article{-PetridisKazaBaki:1998:CuStUn,
author = "Petridis, Vassilios and Kazarlis, Spyros and
Bakirtzis, Anastasios",
title = "Varying fitness functions in genetic algorithm
constrained optimization: the cutting stock and
unit commitment problems",
journal = "IEEE Transactions on Systems, Man and
Cybernetics - Part B: Cybernetics",
year = "1998",
volume = "28",
number = "5",
pages = "629--640",
month = "October",
copyholder = "faria - tese",
keywords = "constrained optimization, cutting stock, genetic
algorithms, genetic operators, unit commitment",
abstract = "In this paper, we present a specific varying
fitness function technique in genetic algorithm
(GA) constrained optimization. This technique
incorporates the problem's constraints into the
fitness function in a dynamic way. It consists in
forming a fitness function with varying penalty
terms. The resulting varying. fitness function
facilitates the GA search. The performance of the
technique is tested on two optimization problems:
the cutting stock, and the unit commitment
problems. Also, new domain-specific operators are
introduced. Solutions-obtained by means of the
varying and the conventional (nonvarying) fitness
function techniques are compared. results show
the superiority of the proposed technique.",
note = "",
}
@Article{-PierreLega:1998:GeAlDe,
author = "Pierre, Samuel and Legault, Gis{\`e}le",
title = "A genetic algorithm for designing distributed
computer network topologies",
journal = "IEEE Transactions on Systems, Man and
Cybernetics - Part B: Cybernetics",
year = "1998",
volume = "28",
number = "2",
pages = "249--258",
month = "April",
copyholder = "faria - tese",
keywords = "computer networks, distributed systems, genetic
algorithms, heuristic method, topological
design",
abstract = "The topological design of distributed packet
switched networks consists of finding a topology
that minimizes the communication costs by taking
into account a certain number of constraints such
as the delay and the reliability. This paper
proposes a genetic algorithm (GA) for generating
low-cost feasible computer network topologies
subject to these constraints. The implementation
of this algorithm has been subjected to extensive
tests in order to measure the quality of
solutions. Computational results confirm the
efficiency of the GA to provide good solutions
for medium-sized computer networks, in comparison
with well-tried conventional methods.",
note = "",
}
@Article{RibeiroFoTrelAlip:1994:GeAlPr,
author = "Ribeiro Filho, Jose L. and Treleaven, Philip C.
and Alippi, Cesare",
title = "Genetic algorithm programming environments",
journal = "Computer",
year = "1994",
volume = "27",
number = "6",
pages = "28--43",
month = "June",
copyholder = "faria - tese",
keywords = "genetic algorithms, selection, crossover,
mutation, programming environment",
abstract = "This review classifies genetic-algorithm
environments into application-orieted systems.
algorithm-oriented systems, and toolkits. It also
presents detailed case studies of leading
environments.",
note = "",
}
@Article{RignotKowkCurlPang:1991:ReTe,
author = "Rignot, E. J. M. and Kowk, R. and Curlander, J.
C. and Pang, S. S.",
title = "Automated multisensor registration: requirements
and techniques",
journal = "Photogrammetric Engineering and Remote Sensing",
year = "1991",
volume = "57",
number = "8",
pages = "1029--1038",
month = "August",
keywords = "registration.",
abstract = "The synergistic utilization of data from a suite
of remote sensors requires mutli-dimensional
analysis of the data. Prior to this analysis,
processing is required to correct for the
systematic geometric distortions characteristic
of each sensor, followed by a registration
operation to remove any residual offsets.
Furthermore, to handle a large volume of data and
high data rates, the registration process must be
fully automated. A conceptual approach is
presented that integrates a variety of
registration techniques and selects the candidate
algorithm based on certain performance criteria.
The performance requirements for an operational
algorithm are formulated given the spatially,
temporally, and spectrally varying factors that
influence the image characteristics and the
science requirements of various applications.
Several computational techniques are tested and
their performance evaluated using a multisensor
test data set assembled from the Landsat TM,
Seasat, SIR-B, TIMS, and SPOT sensors. The
results are discussed and recommendations for
future studies are given.",
}
@Article{Ronse:1996:LaMoVi,
author = "Ronse, C.",
title = "A lattice-theoretical morphological view on
template extraction in images",
journal = "Journal of Visual Communication and Image
Representation",
year = "1996",
volume = "7",
number = "3",
pages = "273--295",
month = "September",
copyholder = "faria - tese",
keywords = "mathematical morphology, template extraction,
template matching",
abstract = "The extraction of copies of a template appearing
in a figure can be defined as the composition of
hit-or-miss transform by a pair of structuring
elements, followed by a dilation by the first
structuring element. On the other hand, the
operation of template extraction can be
abstractly characterized by the three
requirements of antiextensivity, idempotence, and
a new property that we call
{"}overcondensation{"}; we designate by
{"}open-overcondensation{"} an operator having
these three properties. Examples include digital
contour extraction, or the above-mentioned
composition of hit-or-miss transform by a
dilation. Decompositions formulas of
open-overcondensations in terms of such operators
are given; they parallel the well-known
decomposition formulas for openings.
Generalizations of {"}rank-max{"} openings and
inf-overfilters are also given. These results
hold not only for sets or gray-level images, they
are valid in the framework of complete
lattices.",
note = "",
}
@Article{SafaFlou:1989:SpReOn,
author = "Safa, Fr{\'e}d{\'e}ric and Flouzat, Guy",
title = "Speckle removal on radar imagery based on
mathematical morphology",
journal = "Signal Processing",
year = "1989",
volume = "16",
number = "4",
pages = "319--333",
month = "April",
copyholder = "faria - tese",
keywords = "morphological filters, noise reduction, speckle,
Alternating Sequential Filters, remote sensing,
radar imagery",
abstract = "Removing speckle noise is one of the most
difficult problems encountered in coherent
imagery. In this paper, a geometrical approach
based on mathematical morphology is proposed.
After recalling some classical properties of
speckle, the influence of interpixel correlation
on statistical measures is studied. Two simple
sequences based on the general theory of
Alternating Sequential Filters are then
presented. These filters may be constructed so
that edges and thin linear elements in the image
are preserved. Some particular directions may be
emphasized as well. Finally, a quantitative
criterion is given to estimate the loss of
resolution in the filtered image: a {"}test
image{"} is constructed which, in the ideal case,
represents a uniform speckled object. Thus, the
diferent filters can be compared to each other by
means of statistical tests. Numerical results are
given for the proposed filters.",
note = "",
}
@Article{SantiniJain:1999:SiMe,
author = "Santini, Simone and Jain, Ramesh",
title = "Similariy measures",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1999",
volume = "21",
number = "9",
pages = "871--883",
month = "September",
copyholder = "faria - tese",
keywords = "similarity measures, content-based retrieval,
image databases, perceptual similarity, image
distance",
abstract = "With complex multimedia data, we see the
emergenece of database systems in which the
fundamental operation is similarity assessment.
Before database issues can be addressed, it is
necessary to give a definition of similarity as
an operation. In this paper, we develop a
similarity mesure, based on fuzzy logic, that
exhibits several features that match experimental
findings in humans. The model is dubbed Fuzzy
Feature Constrast (FFC) and is an extension to a
more general domain of the Feature Contrast model
due to Tversky. We show how the FFC model can be
used to model similarity assessment from fuzzy
judgement of properties, and we address the use
of fuzzy measures to deal with dependencies among
the properties.",
note = "",
}
@InProceedings{SatterGosh:1997:ReDeIm,
author = "Satter, Martin and Goshtasby, Ardeshir",
title = "Registration of deformed images",
booktitle = "Image Registration Workshop",
year = "1997",
editor = "Greenbelt, MD, NASA",
pages = "221--231",
address = "Greenbelt, MD",
month = "November",
keywords = "registration of deformed images, coarse-to-fine
method, surface fitting.",
abstract = "Determination of transformation functions for
registration of deformed images is discussed.
Each component of a transformation is viewed as a
surface, and by surface-fitting, transformations
are determined. Viewing the components of a
transformation as surfaces enables detection of
wrong homologous points and makes it possible to
estimate the geometry of the scene. Based on the
ideas presented in this paper, a coarse-to-fine
method is developed that can register images with
local geometric differences. At the coarsest
resolution, the images are aligned using planes
as the components of the transformation. At mid
resolutions, surfaces with radial basis functions
are used to register the images, and at the
highest resolution, elastic surfaces are used to
accommodate large local geometric differences
between the images. The results of the proposed
registration on a variety of images are
presented.",
}
@Article{SchenkLiToth:1991:ToAuSy,
author = "Schenk, T. and Li, J. C. and Toth, C.",
title = "Towards an autonomous system for orienting
digital stereopairs",
journal = "Photogrammetric Engineering and Remote Sensing",
year = "1991",
volume = "57",
number = "8",
pages = "1057--1064",
month = "August",
keywords = "hierarchical matching.",
abstract = "We present a method to automatically compute the
orientation of digital stereopairs. The system
that we developed is based on feature-based,
hierarchical matching combined with precise point
determination. We use the LoG operator to
determine zero crossings which we then match in
the psi-s domain. No assumptions are required
because the psi-s representation is rotation and
scale invariant. In order to obtain maximum
possible accuracy for corresponding points, a
precise point matching scheme is employed. With
the approximations obtained from matching zero
crossings, corresponding points with sub-pixel
accuracy are determined by using the Forstner
interest operator combined with area correlation.
The orientation parameters are computed by a
rigorous bundle adjustment with blunder
detection. The detailed description of our
approach is followed by an example. Finally, we
summarize results obtained with four differents
stereopairs.",
}
@Article{SchenkToth:1992:CoViDi,
author = "Schenk, T. and Toth, C.",
title = "Computer vision and digital photogrammetry",
journal = "ITC Journal",
year = "1992",
number = "1",
pages = "34--39",
month = "",
keywords = "digital photogrammetry, computer vision.",
abstract = "Digital photogrammetry is concerned with
capturing, processing and analyzing digital
images. Utimately, the goals to automatically
produce phtogrammetric products, for example a
digital map which may form the basis for a GIS.
It is extremely difficult to reason back from raw
grey-level intensities on the image to a highly
abstract description of the Earth's surface. The
complexity of the problem dictates a step-wise
approach with several intermediate
representations and descriptions. Methods and
tools developed in computer vision and machine
perception prove to be useful for increasing the
degree of automation in digital photogrammetry.
In this paper, we provide an overview of the
paradigms, followed by a motivation for using a
computer vision approach in digital
photogrammetry. We present a model for combining
remote sensing and digital photogrammetry in
their interaction with GIS.",
}
@Article{SchenkToth:1992:FeMaAu,
author = "Schenk, T. and Toth, C. K.",
title = "Feature-based matching for automatic image
registration",
journal = "ITC Journal",
year = "1992",
number = "1",
pages = "40--46",
month = "",
keywords = "matching, image registration.",
abstract = "For merging information extracted from satellite
images with a GIS, the images are usually
registered on a map by manually identifying a
number of points on the satellite image whose
coordinates are measured on the map. In this
paper, we describe a method to solve the
registration problem automatically. First, we
develop a general scheme to extract features
(edges) in the image and to match them with the
corresponding features on the map. We take
advantage of the multispectral resolution of the
satellite image to perform the matching with
selective features, for example with water
bodies, cultural features or roads. A scale space
approach is chosen for solving the problem of
vastly different image scales. The paper
concludes with experimental results.",
}
@Article{Schmitt:1989:AuPrSy,
author = "Schmitt, M.",
title = "Mathematical morphology and artificial
intelligence: an automatic programming system",
journal = "Signal Processing",
year = "1989",
volume = "16",
number = "4",
pages = "389--401",
month = "April",
copyholder = "faria - tese",
keywords = "automatic programming, rule-based systems,
mathematical morphology, primitives",
abstract = "This paper presents an automatic programming
system within the mathematical morphological
framework. After structuring the set of the
morphological transfomations, we show how we can
automatically choose the components of the
high-level primitives and their chaining by means
of geometric reasoning.",
note = "",
}
@InProceedings{SchneiderHahn:1992:MaImDi,
author = "Schneider, F. and Hahn, M.",
title = "Matching images of different geometric scale",
booktitle = "International Archives of Photogrammetry and
Remote Sensing, v.29-B3 - 17th Congress -
Commission III",
year = "1992",
editor = "Photogrammetry, International Society of and
(ISPRS), Remote Sensing",
pages = "295--302",
organization = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
publisher = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
address = "Washington D. C., USA",
keywords = "algorithm, image matching, focusing, resolution,
stereoscopic.",
abstract = "In typical photogrammetric image processing
applications scale differences between the images
are usually small. There are exceptions, however.
In close range applications it can not be avoided
that at least the image scales of some recorded
objects differ considerably from image to image.
The same problem we meet in the stereo-image
recordings of the MOMS-02 digital space-camera.
The pixel size related to the terrain surface is
4.4 m in the high resolution nadir channel and
13.2 m in the backward and forward locking
channels. For many digital photogrammetric tasks
like point transfer, orientation, DTM
reconstruction, etc., the problem of image or
feature matching has to be solved under such
conditions. The paper presents theoretical and
experimental investigations into the matching
problem with significantly different geometric
image scales. This implies multilevel and
focusing techniques. The quality of the matching
is assessed by the experimental investigations
with simulated and real images.",
}
@Article{Schonfeld:1994:OpStEl,
author = "Schonfeld, Dan",
title = "Optimal structuring elements for the
morphological pattern restoration of binary
images",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1994",
volume = "16",
number = "6",
pages = "589--601",
month = "June",
copyholder = "faria - tese",
keywords = "mathematical morphology, nonlinear filtering,
pattern restoration, random set theory",
abstract = "In this paper, we derive the optimal structuring
elements of morphological filters in image
restoration. The expected pattern transformation
of random sets is presented. An estimation theory
framework for random sets is subsequently
proposed. This framework is based on the least
mean difference (LMD) estimator. The least mean
diffrence (LMD) estimator is defined to minimize
the cardinality of the expected pattern
transformation of the set-difference of the
parameter and the estimate. Several important
results for the determination of the least mean
difference (LMD) estimator are derived. The least
mean difference (LMD) structuring elements of
morphological filters in image restoration are
finally derived.",
note = "",
}
@Article{ShapiroHara:1981:StDeIn,
author = "Shapiro, L. G. and Haralick, R. M.",
title = "Structural descriptions and inexact matching",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1981",
volume = "3",
number = "5",
pages = "504--519",
month = "September",
keywords = "backtracking, forward checking, inexact matching,
look-ahead matching, relational homomorphism,
relaxation, structural description, tree
search.",
abstract = "In this paper we formally define the structural
description of an object and the concepts of
exact and inexact matching of two structural
descriptions. We discuss the problems associated
with a brute-force backtracking tree search for
inexact matching and develop several different
algorithms to make the tree search more
efficient. We develop the formula for the
expected number of nodes in the tree for
backtracking alone and with a forward checking
algorithm. Finally, we present experimental
results showing that forward checking is the most
efficient of the algorithms tested.",
}
@Article{ShihMitc:1991:DeGrMo,
author = "Shih, Frank Yeong-Chyang and Mitchell, Owen
Robert",
title = "Decomposition of gray-scale morphological
structuring elements",
journal = "Pattern Recognition",
year = "1991",
volume = "24",
number = "3",
pages = "195--203",
month = "February",
copyholder = "faria - tese",
keywords = "mathematical morphology, image processing,
gray-scale morphology, decomposition,
thresholding, distance transform",
abstract = "Mathematical morphology has been developed
recently for many applications in image
processing and analysis. Most image processing
architectures adapted to morphlogical operations
use structuring elements of limited size.
Implementation difficulties arise when an
algorithm requires the use of a large size
structuring element. In this paper we present
techniques for decomposing big gray-scale
morphological structuring elements into combined
structures of segmented small components.
According to mathematical morphology properties,
such decomposition allow us to equate
morphlogical operations on big structuring
elements with operations on decomposed small
structuring components. The decomposition is
suitable for parallel pipelined architecture.
This thecnique will allow full freedom for users
to design any kind and any size of gray-scale
morphological structuring element.",
note = "",
}
@Article{SinghSidd:1996:SiAlAp,
author = "Singh, Balvinder and Siddiqi, M. U.",
title = "A simplified algorithm for approximate separable
decomposition of morphological templates",
journal = "Pattern Recognition",
year = "1996",
volume = "29",
number = "9",
pages = "1519--1522",
month = "September",
copyholder = "faria - tese",
keywords = "template decomposition, separable templates,
least squares approximation",
abstract = "Decomposition of morphological templates is a
useful technique for enhancing the computational
efficiency of morphological image processing
operations. This paper presents a simplified
algorithm for obtaining approximate separable
decomposition of grayscale morphological
templates. This algorithm is computationally less
intensive as compared to Gader's [12] algorithm
in yielding the separable parts of a given
template. Further, it overcomes the drawback of
Gader's algorithm by providing integer weight
separable parts for integer weight morphological
separable templates.",
note = "",
}
@Book{Soille:1999:PrAp,
author = "Soille, Pierre",
editor = "",
title = "Morphological image analysis: principles and
applications",
publisher = "Springer-Verlag",
year = "1999",
volume = "",
series = "",
address = "Berlin, Germany",
edition = "",
copyholder = "faria - tese",
keywords = "",
abstract = "",
targetfile = "target.html",
}
@Article{SrinivasPatn:1994:AdPrCr,
author = "Srinivas, M. and Patnaik, Lalit M.",
title = "Adaptive probabilities of crossover and mutation
in genetic algorithms",
journal = "IEEE Transactions on Systems, Man and
Cybernetics",
year = "1994",
volume = "24",
number = "4",
pages = "656--667",
month = "April",
copyholder = "faria - tese",
keywords = "adaptive probability of crossover, adaptive
probability of mutation, genetic algorithms",
abstract = "In this paper we describe an efficient approach
for multimodal function optimization using
Genetic Algorithms (GAs). We recommended the use
adaptive probabilities of crossover and mutation
to realize the twin goals of maintaining
diversity in the population and sustaining the
convergence capacity of the GA. In the Adaptive
Genetic Algorithm (AGA), the probabilities of
crossover and mutation, pc and pm, are varied
depending on the fitness values of the solutions.
High-fitness solutions are {"}protected{"}, while
solutions with subaverage fitness are totally
disrupted. By using adaptively varying pc and pm,
we also provide a solution to the problem of
deciding the optimal values of pc and pm, i.e.,
pc and pm need not be specified at all. The AGA
is compared with previous approaches for adapting
operator probabilities in genetic algorithms. The
Schema theorem is derived for the AGA, and the
working of the AGA is analyzed. We compare the
performance of the AGA with that of the Standard
GA (SGA) in optmizing several nontrivial
multimodal functions with varying degrees of
complexity. For most functions, the AGA converges
to the global optimum in far fewer generations
than the SGA, and it gets stuck at a local
optimum fewer times. Our experiments demonstrate
that the relative performance of the AGA as
compared to that of the SGA improves as the
epistacity and the multimodal nature of the
objective function increase. We believe that the
AGA is the first step in realizing a class of
self organizing GAs capable of adapting
themselves in locating the global optimum in a
multimodal landscape.",
note = "",
}
@Article{SrinivasPatn:1994:GeAlA,
author = "Srinivas, M. and Patnaik, Lalit M.",
title = "Genetic algorithms: a survey",
journal = "Computer",
year = "1994",
volume = "27",
number = "6",
pages = "17--26",
month = "June",
copyholder = "faria - tese",
keywords = "genetic algorithms, selection, crossover,
mutation.",
abstract = "Genetic algorithms provide an alternative to
traditional optimization techniques by using
directed random searches to locate optimal
solutions in complex landscapes. This traces GA
research.",
note = "",
}
@Article{StricklandDraeMao:1990:EdDeIn,
author = "Strickland, R. N. and Draelos, T. and Mao, Z.",
title = "Edge detection in machine vision using a simple
L1 norm template matching algorithm",
journal = "Pattern Recognition",
year = "1990",
volume = "23",
number = "5",
pages = "411--421",
month = "May",
keywords = "template matching, feature detection, edge
detection, machine vision.",
abstract = "Template matching based on the sum of absolute
errors (the L1 norm) is an effective means of
edge detection in certain controlled imaging
environments where the form of the edges to be
detected is known. The algorithm employs a 1-D
edge profile as the template. Edges are detected
by computing the L1 norm of an error vector
obtained by subtracting an edge template from the
image data. This paper evaluates the performance
of the L1 norm template matching algorithm and
draws comparisons to classical correlation
matching. The L1 norm template matching algorithm
has potential for integrated circuit and printed
circuit board inspection, and other inspection
applications where the lighting and view aspect
can be controlled.",
}
@Article{SullAhuj:1995:InMaSe,
author = "Sull, S. and Ahuja, N.",
title = "Integrated matching and segmentation of multiple
features in two views",
journal = "Computer Vision and Image Understanding",
year = "1995",
volume = "62",
number = "3",
pages = "279--297",
month = "November",
keywords = "matching, segmentation, affine model.",
abstract = "We present an integrated method to match multiple
features including points, regions, and lines in
two perspective images, and simultaneously
segment them such that all features in each
segment have the same 3D motion. The method uses
local affine (first-order) approximation of the
displacement field under the assumption of
locally rigid motion. Each distinct motion is
represented in the image plane by a distinct set
of values for six displacement parameters. To
compute the values of these parameters, the 6D
space is split into two 3D spaces, and each is
exhaustively searched coarse-to-fine. This yields
two results simultaneously, correspondences
between features and segmentation of features
into subsets corresponding to locally rigid
patches of moving objects. Since matching is
based on the 2D approximation of 3D motion,
problems due to motion or object boundaries and
occlusion can be avoided. Large motion is also
handled in a manner unlike the methods based on
flow field. Integrated use of the multiple
features not only gives a larger number of
features (overconstrained system) but also
reduces the number of candidate matches for the
features, thus making matching less ambiguous.
Experimental results are presented for four pairs
of real images.",
}
@Article{SussnerRitt:1997:DeGrMo,
author = "Sussner, P. and Ritter, G. X.",
title = "Decomposition of gray-scale morphological
templates using the rank method",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1997",
volume = "19",
number = "6",
pages = "649--658",
month = "June",
copyholder = "faria - tese",
keywords = "morphology, convolution, structuring element,
morphological template, template decomposition,
template rank.",
abstract = "Convolutions are a fundamental tool in image
processing. Classical examples of two dimensional
linear convolutions include image correlation,
the mean filter, the discrete Fourier transform,
and a multitude of edge mask filters. Nonlinear
convolutions are used in such operations as the
median filter, the medial axis transform, and
erosion and dilation as defined in mathematical
morphology. For large convolution masks or
structuring elements, the computation cost
resulting from implementation can be prohibitive.
However, in many instances, this cost can be
significantly reduced by decomposing the
templates representing the masks or structuring
elements into a sequence of smaller templates. In
addition, such decomposition can often be made
architecture specific and, thus, resulting in
optimal transform performance. In this paper we
provide methods for decomposing morphological
templates which are analogous to decomposition
methods used in the linear domain. Specifically,
we define the notion of the rank of a
morphological template which categorizes
separable morphological templates as templates of
rank one. We establish a necessary and sufficient
condition for the decomposability of rank one
templates into 3x3 templates. We then use the
invariance of the template rank under certain
transformations in order to develop template
decomposition techniques for templates of rank
two.",
note = "",
}
@Article{Svalbe:1991:GeBaSe,
author = "Svalbe, Imants D.",
title = "The geometry of basis sets for morphologic
closing",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1991",
volume = "13",
number = "12",
pages = "1214--1224",
month = "December",
copyholder = "faria - tese",
keywords = "boolean logic, discrete areas and geometry,
filtering, morphology, parallel processing",
abstract = "Maragos has recently provided an elegant
framework for the decomposition of many
morphologic operations into orthogonal components
or basis sets. Using this framework, a method is
described to find the minimal basis set for the
important operation of closing in 2-D. The
closing basis sets are special because their
elements are members of an ordered, global set of
closing shapes or primitives. The selection or
design of appropriate individual or multiple
structuring elements for image filtering can be
better understood, and sometimes implemented more
easily, through consideration of the orthogonal
closing decomposition. Partial closing of images
using ordered fractions of a closing basis set(s)
may give a finer texture or roughness measure
than that obtained from the conventional use of
scaled sets of shapes such as the disc. The
connection between elements of the basis set for
closing and the complete, minimal representation
of arbitrary logic function is analyzed from
geometric viewpoint.",
note = "",
}
@Article{TamburinoZmudRizk:1995:GePaRe,
author = "Tamburino, Louis A. and Zmuda, Michael A. and
Rizki, Mateen M.",
title = "Generating pattern recognition systems using
evolutionary learning",
journal = "IEEE Expert: Intelligent Systems and Their
Applications",
year = "1995",
volume = "10",
number = "4",
pages = "63--68",
month = "August",
copyholder = "faria - tese",
keywords = "pattern recognition, evolutionary learning,
mathematical morphology, morphological
representation, morphological pattern recognition
system",
abstract = "The E-Morph learning algorithm combines a number
of learning algorithms-genetic, evolutionary
programming,clustering-into a hybrid learning
system for solving multiclass pattern-recognition
problems. Our work also shows that a randomly
generated pool of primitive detectors, rather
than manually coded features, can be enhanced and
assembled into effective solution sets. The
design of automatic pattern recognition programs
by humans is a difficult problem requiring
deduction, intuition, and experience. This is
particularly true for the development of
recognition systems based on mathematical
morphology. (See the accompanying box on the next
page for an explanation of morphological
representation.) This article discusses the
techniques we have investigated for using
evolutionary learning to generate morphological
pattern recognition systems. Automating this
learning process requires certain intellectual
information to initialize it. This information
falls naturally into three basic elements: a
suitable problem representation a search
strategy, and performance measures A
representation includes the basic functions,
operators, and data structures that effectively
characterize the solution space or possible
range of attainable solutions. Search strategies
define the rules or techniques for manipulating
the representation and navigating the search
space. The search strategy discussed here is
based on evolutionary learning. The primary
performance measure is generally defined in
terms of the final solution-recognition accuracy.
As the complexity of problems increases,
additional performance measures may be needed to
guide the learning through the intermediate
phases of system design and to confront credit
assignment problems.",
note = "",
}
@Article{TonJain:1989:ReLaIm,
author = "Ton, J. and Jain, A. K.",
title = "Registering Landsat images by point matching",
journal = "IEEE Transactions on Geoscience and Remote
Sensing",
year = "1989",
volume = "27",
number = "5",
pages = "642--651",
month = "September",
keywords = "image registration, matching.",
abstract = "Image registration of Landsat Thematic Mapper
(TM) scenes with translational and rotational
differences is studied. We concentrate on two
major steps of image registration: control-point
selection and control-point matching. In
control-point selection, we first define the
properties that a good control point should
satisfy, then suggest several pontential
control-point candidates and discuss methods for
extracting them from the input image. In
control-point matching, we improve a relaxation
algorithm proposed in the literature by reducing
its time complexity from O(n**4) to O(n**3),
where n is the number of control points. The
matching algorithm also uses a two-way matching
concept which utilizes the inherent symmetry
property of the point-matching problem. The
robustness of the proposed algorithm was
demosntrated through simulation experiments by
evaluating a matching index. Experimental results
on Landsat images show that the proposed method
produces results comparable to those obtained by
an experienced photointerpreter.",
}
@Article{Torlegard:1992:RePr,
author = "Torlegard, K.",
title = "Sensors for photogrammetric mapping: review and
prospects",
journal = "ISPRS Journal of Photogrammetry and Remote
Sensing",
year = "1992",
number = "47",
pages = "241--262",
month = "June",
keywords = "photogrammetric mapping, softcopy photogrammetric
workstations.",
abstract = "The development of sensors systems for
acquisition of imagery for photogrammetric
mapping is reviewed. Aerial cameras with film
will continue to be the main source of primary
data. Forward motion and angular motion
compensation cameras will give images with a
resolution of up to 100 lp/mm. Digitization of
such photos for analysis in digital
photogrammetric workstations requires scanners
with a very small pixel size so as to make use of
the inherent information density. Photography and
electro-optical sensors from space provide images
suitable for topographic mapping at medium and
small scales. Systems are reviewed and compared.
Imaging radar systems are likely to be tested for
topographic applications, although they are
primarily designed for other purposes.
Photographic and electro-optical cameras for
close-range photogrammetry and machine vision are
presented and discussed. The impact of digital
imagery and softcopy photogrammetric workstations
is discussed.",
}
@InProceedings{TothSche:1992:OnMaIm,
author = "Toth, C. K. and Schenk, T.",
title = "On matching image patches under various
geometrical constraints",
booktitle = "International Archives of Photogrammetry and
Remote Sensing, v.29-B3 - 17th Congress -
Commission III",
year = "1992",
editor = "Photogrammetry, International Society of and
(ISPRS), Remote Sensing",
pages = "400--403",
organization = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
publisher = "International Society of Photogrammetry and
Remote Sensing (ISPRS)",
address = "Washington D. C., USA",
keywords = "matching, conjugate points, geometric
constraints.",
abstract = "Image matching plays an important role in digital
photogrammetry. Finding conjugate points occurs
in different photogrammetric tasks. Image
matching is usually performed in two steps:
determining approximattions and computing precise
conjugate locations. In this paper we are
concerned with the second aspect, that is, the
image patches are already close to their final
position. An image patch analyzer determines
which matching primitives should be used first.
Based on the results other primitives can be
activated. The process terminates if a predefined
level of confidence is reached or if no further
improvements are to be expected. The matching
process can be geometrically constrained, for
example, along vertical lines, epipolar lines or
by fixing one image patch in its location.",
}
@InProceedings{TozziTomm:1991:FoCaVi,
author = "Tozzi, Clesio L. and Tommaselli, Antonio Maria
G.",
title = "Fotogrametria, cartografia e vis\~{a}o
computacional",
booktitle = "XV Congresso Brasileiro de Cartografia",
year = "1991",
pages = "",
organization = "Sociedade Brasileira de Cartografia",
publisher = "Sociedade Brasileira de Cartografia",
keywords = "photogrammetry, cartography,computer vision.",
abstract = "Photogrammetry and cartography have been
influenced heavily by computer evolution, and are
connected to new research areas which grew up in
the last years, such as computer vision, machine
vision and robotic vision. The backgrounds of
people involved with computer vision and
photogrammetry are different; nonetheless, there
are many common problems. It is feasible to apply
some techniques developed in computer vision to
cartography. The aim of this paper is to
introduce some areas where computer vision and
photogrammetry efforts can cooperate.",
}
@Article{VanderbrugRose:1977:TwTeMa,
author = "Vanderbrug, G. J. and Rosenfeld, A.",
title = "Two-stage template matching",
journal = "IEEE Transactions on Computers",
year = "1977",
volume = "26",
number = "4",
pages = "384--393",
month = "April",
keywords = "computational cost, pattern recognition, picture
processing, subtemplate, template matching.",
abstract = "The computational cost of template matching can
be reduced by using only a subtemplate, and
applying the rest of the template only when the
subtemplate's degree of match exceeds a
threshold. A probabilistic analysis of this
approach is given, with emphasis on the choice of
subtemplate size to minimize the expected
computational cost.",
}
@Article{VenturaRampSche:1990:ImReBy,
author = "Ventura, A. D. and Rampini, A. and Schettini,
R.",
title = "Image registration by recognition of
corresponding structures",
journal = "IEEE Transactions on Geoscience and Remote
Sensing",
year = "1990",
volume = "28",
number = "3",
pages = "305--314",
month = "May",
keywords = "image registration, similarity assessment,
satellite images, cartography.",
abstract = "A method for automatic image registration which
is characterized by its insensitivity to scaling,
rotation, and intensity changes is described. The
method is based on similarity assessment of the
structures in the images, and on a check of their
spatial arrangement. Pairs os structures that
correspond to each other provide sets of control
points to geometric mapping functions. This paper
presents an application of the method to
remote-sensing image alignment with a reference
map.",
}
@Book{Vogt:1989:AuGeMo,
author = "Vogt, Robert Carl",
editor = "",
title = "Automatic generation of morphological set
recognition algorithms",
publisher = "Springer-Verlag",
year = "1989",
volume = "",
series = "",
address = "New York",
edition = "",
copyholder = "faria - tese",
keywords = "image processing, digital techniques",
abstract = "",
targetfile = "target.html",
}
@Article{WangRons:1996:BoGrMo,
author = "Wang, Demin and Ronsin, Joseph",
title = "Bounded gray-level morphology and its
applications to image representation",
journal = "IEEE Transactions on Image Processing",
year = "1996",
volume = "5",
number = "6",
pages = "1067--1073",
month = "June",
copyholder = "faria - tese",
keywords = "decomposition, gra-level morphology",
abstract = "Morphological skeletonization and decomposition
are two well-known schemes for binary image
representation, but they are not compact for
gray-level images. In this correspondence,
bounded gray-level morphology is used to improve
their performances for gray-level image
representation. Experimental results show that
bounded gray-level morphology efficiently reduces
the number of skeleton points and the entropy of
morphological decomposition.",
note = "",
}
@Article{WatsonVaugPowe:1992:ClUsWa,
author = "Watson, A. I. and Vaughan, R. A. and Powell, M.",
title = "Classification using the watershed method",
journal = "International Journal of Remote Sensing",
year = "1992",
volume = "13",
number = "10",
pages = "1881--1890",
month = "",
keywords = "classification, mathematical morphology,
watershed.",
abstract = "Several methods of producing a thematic map,
suitable for forestry inventories, are evaluated
as to their relative accuracy and efficiency of
production. It is argued that all
probability-based methods are founded on
assumptions that are always false, and therefore
necessarily lead to higher error rates. An
alternative non-probabilistic method, the
watershed, is put forward as better solution to
the classification problem. In order to fully
establish the superiority of th watershed method,
a complex mountainous area was deliberately
chosen to provide difficult and testing
conditions. It is demonstrated that the watershed
is far superior to the traditional
probability-based methods, both in respect of the
efficiency with which a thematic map can be
produced, and its accuracy of classification.
With the same data, the accuracy of
classification were: hybrid method - 77 per cent;
supervised maximum likelihood method - 82 per
cent; watershed method - 96 per cent.",
}
@Article{WilsonHanc:1997:StMaBy,
author = "Wilson, R. C. and Hancock, E. R.",
title = "Structural matching by discrete relaxation",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1997",
volume = "19",
number = "6",
pages = "634--648",
month = "June",
keywords = "structural graph matching, discrete ralaxation,
energy minimization, bayesian, graph edit,
clutter, map estimation, sar images, infrared
images.",
abstract = "This paper describes a Bayesian framework for
performing relational graph matching by discrete
relaxation. Our basic aim is to draw on this
framework to provide a comparative evaluation of
a number of contrasting approaches to relational
matching. Broadly speaking there are two main
aspects to this study. Firstly we focus on the
issue of how relational inexactness may be
quantified. We illustrate that several popular
relational distance measures can be recovered as
specific limiting cases of the Bayesian
consistency measure. The second aspect of our
comparasion concerns the way in which structural
inexactness is controlled. We investigate three
different realizations of the matching process
which draw on contrasting control models. The
main conclusion of our study is that the active
process of graph-editing outperforms the
alternatives in terms of its ability of
effectively control a large population of
contaminating clutter.",
}
@Article{WuMura:1997:ImMaUs,
author = "Wu, X. and Murai, S.",
title = "Image matching using a three line scanner",
journal = "ISPRS Journal of Photogrammetry and Remote
Sensing",
year = "1997",
volume = "52",
number = "1",
pages = "20--32",
month = "February",
keywords = "image matching, linear ccd camera, relaxation,
area-correlation.",
abstract = "Recently, there is considerable interest in
automated extraction of 3-D information through
image matching. This paper presents an image
matching system using Three Line Scanner (TLS)
images. The disparity constraint of the TLS
images has been investigated and exploited to
refine the initial disparity estimation, which is
produced by a relaxation matching. The
effectiveness of our method with TLS is
demonstrated by comparing our results with those
of matching only two line scanner images. It is
shown that more accurate and reliable results are
achieved with TLS.",
}
@Article{YangSoh:1997:StOpBy,
author = "Yang, Jiaping and Soh, Chee Kiong",
title = "Structural optimization by genetic algorithms
with tournament selection",
journal = "Journal of Computing in Civil Engineering",
year = "1997",
volume = "11",
number = "3",
pages = "195--200",
month = "July",
copyholder = "faria - tese",
keywords = "genetic algorithms, tournament selection,
structural optimization",
abstract = "A new approach to optimization design concerning
the configurations of structures using genetic
algorithm (GA) with a tournament select strategy
has been proposed. The tournament selection
strategy is used as a replacement for the
commonly used fitness-proportional selection
strategy to drive the GA so as to improve the
fitness of each succeeding generation more
efficiently. Numerical results for three examples
reveal that a significant reduction of
computation cost has been achieved in the newly
proposed GA with tournament selection, as
compared to the widely used GA with
fitness-proportional selection and other hybrid
GA approaches. Also, it has verified that the
tournament selection performs well over the
fitness-proportional selection and other hybrid
techniques in enhancing GA search efficiency.",
note = "",
}
@Article{-YenLiaoLeeRand:1998:HyApMo,
author = "Yen, John and Liao, James C. and Lee, Bogju and
Randolph, David",
title = "A hybrid approach to modeling metabolic systems
using a genetic algorithm and simplex method",
journal = "IEEE Transactions on Systems, Man and
Cybernetics - Part B: Cybernetics",
year = "1998",
volume = "28",
number = "2",
pages = "173--191",
month = "April",
copyholder = "faria - tese",
keywords = "optimization, search",
abstract = "One of the main obstacles in applying genetic
algorithms (GA's) to complex problems has been
the high computational cost due to their slow
convergence rate, We encountered such a
difficulty in our attempt to use the classical GA
for estimating parameters of a metabolic model,
To alleviate this difficulty, we developed a
hybrid approach that combines a GA with a
stochastic variant of the simplex method in
function optimization, Our motivation for
developing the stochastic simplex method is to
introduce a cost-effective exploration component
into the conventional simplex method. In an
attempt to make effective use of the simplex
operation in a hybrid GA framework, we used an
elite-based hybrid architecture that applies one
simplex step to a top portion of the ranked
population, We compared our approach with five
alternative optimization techniques including a
simplex-GA hybrid independently developed by
Renders-Bersini (R-B) and adaptive simulated
annealing (ASA), Our empirical evaluations showed
that our hybrid approach for the metabolic
modeling problem outperformed all other
techniques in terms of accuracy and convergence
rate, We used two additional function
optimization problems to compare our approach
with the five alternative methods, For a sin
function maximization problem, our hybrid
approach yields the fastest convergence rate
without sacrificing the accuracy of the solution
found. For De Jong's F5 function minimization
problem, our hybrid approach is the second best
(next to ASA), Overall, these tests showed that
our hybrid approach is an effective and robust
optimization technique. We further conducted an
empirical study to identify major factors that
affect the performance of the hybrid approach,
The study indicated that 1) our elite-based
hybrid GA architecture contributes significantly
to the performance improvement and 2) the
probabilistic simplex is more cost-effective for
our hybrid architecture than is the conventional
simplex, By analyzing the performance of the
hybrid approach for the metabolic modeling
problem, we hypothesized that the hybrid approach
is particularly suitable for solving complex
optimization problems the variables of which vary
widely in their sensitivity to the objective
function.",
note = "",
}
@Article{YodaYamaYama:1999:AuAcHi,
author = "Yoda, Ikushi and Yamamoto, Kazuhiko and Yamada,
Hiromitsu",
title = "Automatic acquisition of hierarchical
mathematical morphology procedures by genetic
algorithms",
journal = "Image and Vision Computing",
year = "1999",
volume = "17",
number = "10",
pages = "749--760",
month = "August",
copyholder = "faria - tese",
keywords = "image processing sequence, learning, mathematical
morphology, genetic algorithms",
abstract = "This paper presents a method to obtain an image
processing procedure by showing an original image
and a goal image. There has been previous work
concerning automatic acquisition of image
processing procedures by combining subroutine
packages. In our approach, we do not use any
image processing subroutine packages, but use
only hierarchical mathematical morphology
procedures, i.e. erosion and dilation operators.
We use genetic algorithms to search procedures,
i.e. erosion and dilation operators. Utilizing a
parallel searching function of genetic algorithms
and introducing a concept of era, we construct
hierarchical procedures of mathematical
morphology.",
note = "",
}
@Article{YooFonHuaCoyAda:1999:FaAlDe,
author = "Yoo, Jisang and Fong, Kelvin L. and Huang, Jr-Jen
and Coyle, Edward J. and Adams, Geroge B.",
title = "A fast algorithm for designing stack filters",
journal = "IEEE Transactions on Image Processing",
year = "1999",
volume = "8",
number = "8",
pages = "1014--1028",
month = "August",
copyholder = "faria - tese",
keywords = "enhancement, estimation, median filters,
non-linear filters, stack filters",
abstract = "Stack filters are a class of nonlinear filters
with excellent properties for signal restoration.
Unfortunately, present algorithms for designing
stack filters can only be used for small window
sizes because of either their computational
overhead or their serial nature. This paper
presents a new adaptive algorithm for determining
a stack filter that minimizes the mean absolute
error criterion. The new algorithm retains the
iterative nature of many current adaptive stack
filtering algorithms, but significantly reduces
the number of iterations required to converge to
an optimal filter. This algorithm is faster than
all currently available stack filter design
algorithms, is simple to implement, and is shown
in this paper to always converge to an optimal
stack filter. Extensive comparisons between this
new algorithm and all existing algorithms are
provided. The comparisons are based both on the
performance of the resulting filters and upon the
time and space complexity of the algorithms, They
demonstrate that the new algorithm has three
advantages: it is faster than all other available
algorithms; it can be used on standard
workstations (SPARC 5 with 48MB) to design
filters with windows containing 20 or more
points; and, its highly parallel structure allows
very fast implementations on parallel machines.
This new algorithm allows cascades of stack
filters to be designed; stack filters with
windows containing 72 points have been designed
in a matter of minutes under this new approach.",
note = "",
}
@Article{ZhangChen:1996:ImMoOp,
author = "Zhang, Shuqun and Chen, Caisheng",
title = "Image morphological operations and edge detection
using optical programmable logic neural
networks",
journal = "Optics Communications",
year = "1996",
volume = "132",
number = "3--4",
pages = "353--362",
month = "December",
copyholder = "faria - tese",
keywords = "morphological tranformations, edge detection,
optical neural networks, symbolic substitution,
array logic",
abstract = "Based on the concept of 2-D programmable logic
neural networks, an optical programmable image
processor for neighborhood operations is
proposed. The spatial polarization encoding and
space-variant techniques are used in the design
of an optical system which can perform
multiple-instruction multiple-data processing.
The system is cellular logic image processor with
nine local neighbor inputs and three outputs. In
particular, the applications of the optical
scheme in binary image morphological operations
and edge detection are described in detail.
Simulation results are also presented.",
note = "",
}
@Article{ZhangKim:2000:CoSeMe,
author = "Zhang, Byoung-Tak and Kim, Jung-Jib",
title = "Comparison of selection methods for evolutionary
optimization",
journal = "Evolutionary Optimization: An International
Journal on the Internet",
year = "2000",
volume = "2",
number = "1",
pages = "55--70",
month = "",
copyholder = "faria - tese",
keywords = "evolutionary optimization, machine layout design,
selection methods, selection differential,
response to selection, heritability.",
abstract = "Selection is essential component of evolutionary
algorithms, playing an important role especially
in solving hard optimization problems. Most
previous studies on selection have focused on
more or less ideal properties based on asymptotic
analysis. In this paper, we address the selection
problem from a more practical point of view by
considering solution quality achievable within
acceptable time. The repertoire of methods we
compare includes proportional selection, ranking
selection, linear ranking, tournament, Genitor
selection, simulated annealing, and
hill-climbing. All these methods use genetic
operators in one form or another to create new
search points. Experiments are performed in the
context of the machine layout design problem.
This problem is a real industrial application
having both continuous and discrete optimization
characteristics. The experimental results for
solving two-row machine layout problems of size
ranging from 10 to 50 show strong evidence that
ranking and tournament selection are, in general,
more effective in both solution quality and
convergence time than proportional selection and
other methods. We provide a theoretical
explanation of the experimental results using a
predictive model of evolutionary optimization
based on selection differential and response to
selection.",
note = "site de onde foi copiado este artigo
site da revista - data de
acesso: 26/03/2003",
}
@Article{ZhengChel:1993:CoViAp,
author = "Zheng, Qinfen and Chellappa, Rama",
title = "A computational vision approach to image
registration",
journal = "IEEE Transactions on Image Processing",
year = "1993",
volume = "2",
number = "3",
pages = "311--326",
month = "July",
keywords = "computational vision approach, image
registration, gabor wavelet model, hierarchical
feature matching.",
abstract = "A computational vision approach is presented for
estimation of 2-D translation, rotation, and
scale from two partially overlapping images. The
approach results in a fast method that produces
good results even when large rotation and
translation have occurred between the two frames
and the images are devoid of significant
features. An illuminant direction estimation
method is first used to obtain an initial
estimate of camera rotation. A small number of
feature points are then located based on a Gabor
wavelet model for detecting local curvature
discontinuities. An initial estimate of scale and
translation is obtained by pairwise matching of
the feature points detected from both frames.
Finally, hierarchical feature matching is
performed to obtain an accurate estimate of
translation, rotation and scale. A method for
error analysis on matching results is also
presented. Experiments with synthetic and real
images show that this algorithm yields accurate
results when the scale of the images differs by
up to 10%, the overlap between the two frames is
as small as 23%, and the camera rotation between
the two frames is significant. Experimental
results on several Mojave desert images acquired
from balloon are presented. Applications of the
method to texture and stereo image registration,
and satellite image mosaicking are presented.",
}
@Article{Zhuang:1994:DeMoSt,
author = "Zhuang, Xinhua",
title = "Decomposition of morphological structuring
elements",
journal = "Journal of Mathematical Imaging and Vision,",
year = "1994",
volume = "4",
number = "1",
pages = "5--18",
month = "January",
copyholder = "faria - tese",
keywords = "structuring element, closed-form decomposition,
recursive decomposition",
abstract = "Mathematical morphology has become an important
tool for machine vision since the influential
work by Serra (1982). It is a branch of image
analysis based on set-theoretic descriptions of
images and their transformations. As is well
known, the chain rule for basic morphological
operations, i.e., dilation and erosion, lends
itself well to pipelining. Specialized pipeline
architecture hardware built in the past decade is
capable of efficiently performing morphological
operations. The nature of specialized hardware
depends on the strategy for morphologically
decomposing a structuring element. The two-pixel
decomposition technique and the cellular
decomposition technique are the two main
techniques for morphological structuring-element
decomposition. The former was used by the image
flow computer and the latter by the cytocomputer.
This paper represents a continuation of the work
reported by Zhuang and Haralick (1986). We first
give the optimal two-pixel decomposition for the
binary structuring element and subsequently
attempt to solve the
grayscale-structuring-element two-pixel
decomposition problem. To our knowledge, no
efficient algorithm for this problem has been
found to date. The difficulty can be overcome by
using an adequate representation for the
grayscale structuring element. Representing a
grayscale image as a specific 3D set, i.e., an
umbra (Sternberg, 1986), makes it easier to shift
all basic morphological theorems from the binary
domain to the grayscale domain; however, a direct
umbra representation is not appropriate for the
grayscale-structuring-element decomposition. In
this paper a morphologically realizable
representation and a two-pixel decomposition for
the grayscale structuring element are presented;
moreover, the recursive algorithms, which are
pipelineable for efficiently performing grayscale
morphological operations, are developed on the
basis of the proposed representation and
decomposition. This research will certainly be
beneficial to real-time image analysis in terms
of computer architecture and software
development.",
note = "",
}
@Article{-ZhuangHara:1986:MoStEl,
author = "Zhuang, Xinhua and Haralick, Robert M.",
title = "Morphological structuring element decomposition",
journal = "Computer Vision, Graphics and Image Processing",
year = "1986",
volume = "35",
number = "3",
pages = "370--382",
month = "September",
copyholder = "faria - tese",
keywords = "mathematical morphology, structuring element
decompition",
abstract = "To efficiently perform morphological operations
with specialized pipeline hardware which is not
able to utilize all the points in the domain of
structuring element in one pepeline stage
requires the capability of decomposing the
structuring element into a morphological dilation
of smaller structuring elements each of which is
utilized in a successive stage of the pipeline.
In this paper, we give the theory and algorithm
for such optimal structuring element
decompition.",
note = "",
}
@Article{ZmudaTamb:1996:EfAlSo,
author = "Zmuda, Michael A. and Tamburino, Louis A.",
title = "Efficient algorithms for the soft morphlogical
operators",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1996",
volume = "18",
number = "11",
pages = "1142--1147",
month = "November",
note = "",
keywords = "mathematical morphology, soft morphology, image
processing algorithms, efficient algorithms",
abstract = "This correspondence presents two soft
morphological algorithms that process multiple
images simultaneously. The first algorithm
performs best when the structuring elements
contain less than 19 points; whereas, the second
algorithm should be used for larger structuring
elements. Theoretical and experimental analyses
show these algorithms are faster than the
conventional algorithm.",
note = "",
}
@Article{-ZmudaTambRizk:1996:AnEvLe,
author = "Zmuda, Michael A. and Tamburino, Louis A. and
Rizki, Mateen M.",
title = "An evolutionary learning system for synthesizing
complex morphological filters",
journal = "IEEE Transactions on Systems, Man and Cybernetics -
Part B: Cybernetics",
year = "1996",
volume = "26",
number = "4",
pages = "645--653",
month = "August",
copyholder = "faria - tese",
keywords = "evolutionary learning system, morphological
filters, morphological programs, mathematical
morphology, stochastic selection",
abstract = "This paper describe a system based on
evolutionary learning, called MORPH, that
semi-automates the generation of morphological
programs. MORPH maintains a population of
morphological programs that is continually
enhanced. The first phase of each learning cycle
synthesizes morphological sequences that extract
novel features which increase the population's
diversity. The second phase combines these newly
formed operator sequences into larger programs
that are better than the individual programs. A
stochastic selection process eliminates the poor
performers, while the survivors serve as the
basis of another learning cycle. Experimental
results are presented for binary and grayscale
target recognition problems.",
note = "",
}
@InProceedings{,
author = "Brigger, P. and Kunt, M.",
title = "Morphological contour coding using structuring
functions optimized by genetic algorithms",
booktitle = "",
year = "1995",
editor = "",
pages = "534--537",
organization = "",
publisher = "",
address = "",
keywords = "mathematical morphology, genetic algorithms,
feature extraction, image coding, image
representation, morphological contour coding,
structuring functions, genetic algorithms, shape
representation, image analysis, feature
extraction, morphological skeleton, geometrical
shape description, maximal inscribed structuring
elements, automatic optimization, progressive
contour transmission",
abstract = "Shape representation is an important image
analysis task which can be used for contour
coding and feature extraction. The morphological
skeleton is a geometrical shape description by
means of maximal inscribed structuring elements.
The form of the structuring element is usually
chosen a priori, and we show how genetic
algorithms can be used for an automatic
optimization of an arbitrary shaped structuring
element. It permits improved progressive contour
transmission and the extraction of shape features.",
entrytype = "Article",
copyholder = "faria - tese",
note = "",
}
@InProceedings{,
author = "Gillies, Andrew M.",
title = "Automatic generation of morphological template
features",
booktitle = "Image Algebra and Morphological
Image Processing, v. 1350 - Proceedings",
year = "1990",
editor = "Gader, Paul D.",
pages = "252--261",
organization = "SPIE - The International Society for Optical
Engineering",
publisher = "SPIE - The International Society for Optical
Engineering",
address = "Bellingham",
keywords = "character recognition, image processing,
morphlogical template feature, automatic
generation, OCR",
abstract = "This paper presents a method for generating
morphological template features for use in a
word verification system. Word verification is a
process of matching an image of a word against a list of candidate strings.
The verification process assigns a confidence value to each
string. The rank of the correct string is one measure of success. A character by character rank
may also be obtained. The paper describes experiments using 20 samples in each of 57
character classes to automatically develop 60 template features for the word verification
process. The generation process is guided by a measure of orthogonality between the features.
Two slightly different versions of the orthogonality measure are compared. The resulting
features are then trained on roughly 67,000 character samples to form the feature/character
statistics. Results of the word verification process using the automatically generated features
are compared with earlier results using a set of manually generated features. The principal result
is that automatically generated template features perform better than the manually generated
features.",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Guerrero, Jos\'{e} Antonio S\'{a}nchez and
Su\'{a}rez, Lizet Li\~{n}ero and Gudwin, Ricardo
Ribeiro",
title = "An\'{a}lise da import\^{a}ncia de par\^{a}metros
em um algoritmo gen\'{e}tico por meio de sua
aplica\c{c}\~{a}o no aprendizado de uma rede
neural",
booktitle = "Congresso Nacional da Sociedade Brasileira de
Computa\c{c}\~{a}o, v. 4 - 19. Congresso",
year = "1999",
editor = "",
pages = "423-435",
organization = "Sociedade Brasileira de Computa\c{c}\~{a}o",
publisher = "EntreLugar",
address = "Rio de Janiro",
keywords = "",
abstract = "Este trabalho visa investigar a sensibilidade e importa\^{a}ncia
dos diversos par\^{a}metros utilizados em um algoritmo genético, utilizando
como plataforma de teste sua aplica\c{c}\~{a}o ao aprendizado de uma rede
neural. Utiliza-se para tanto uma representa\c{c}\~{a}o modificada do
algoritmo gen\'{e}tico que \'{e} mais rica em graus de liberdade, de modo
a aumentar o escopo de possibilidades para a sintonia do GA. Diversas
combina\c{c}\~{o}es poss\'{i}veis entre estes par\^{a}metros s\~{a}o
testadas e por fim os resultados s\~{a}o comparados ao algoritmo
{"}\emph{Back-Propagation{"} tradicional, para verifica\c{c}\~{a}o de sua efic\'{a}cia.",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Lacerda, E. G. M. and Carvalho, A. C. P. L. F",
title = "Introdu\c{c}\~{a}o aos algoritmos gen\'{e}ticos",
booktitle = "Anais",
year = "1999",
volume = "2",
pages = "51--126",
editor = "Sociedade Brasileira de Computa\c{c}\~{a}o",
organization = "Congresso Nacional da Sociedade Brasileira de
Computa\c{c}\~{a}o, 19., Rio de Janeiro, Julho 1999.",
publisher = "EntreLugar",
address = "Rio de Janeiro",
keywords = "",
abstract = "Este material apresenta os principais conceitos
de Algoritmos Gen\'{e}ticos e sua
aplica\c{c}\~{a}o" para a solu\c{c}\~{a}o de
problemas te\'{o}ricos e pr\'{a}ticos. Algoritmos
Gen\'{e}ticos consituem uma t\'{e}cnica de busca
e otimiza\c{c}\~{a}o global baseada nos
princ\'{i}pios de evol\c{c}\~{a}o natural e
gen\'{e}tica.",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Sousa, Robson Pequeno de and Carvalho, Jo{\~a}o
M. de and Assis, Franciso M. de Assis and Pessoa,
L{\'u}cio Fl\'{a}vio Cavalcanti",
title = "Designing translation invariant operations via
neural network training",
booktitle = "Proceedings",
year = "2000",
volume = "1",
pages = "908--911",
conferencelocation = "Vancouver",
month = "Sep. 10--13 2000",
sponsor = "IEEE Signal Processing Society",
publisher = "IEEE Computer Society",
address = "Los Alamitos, CA",
note = "",
keywords = "image reconstruction, mathematical morphology,
modular morphological neural network, numerical
methods, mathematical operators, genetic algorithms,
backpropagation",
abstract = "The main objective of this work is to develop an
analytical method for designing translation
invariant operators via neural network training.
A new neural network architecture, called Modular
Morphological Neural Network (MMNN), is defined
using a fundamental result of minimal
representations for translation invariant set
mappings via Mathematical Morphology, proposed by
Banon and Barrera (1991). The MMNN general
architecture is capable of learning both binary
and gray-scale translation invariant operators.
For its training, ideas of the Back-Propagation
(BP) algorithm and the methodology proposed by
Pessoa and Maragos (1997) for overcoming the
problem of non-differentiability of rank
functions are used. An alternative MMNN training
method via Genetic Algorithms (GA) is also
developed, and a comparative analysis of BP vs.
GA training in problems of image restoration and
pattern recognition is provided. The MMNN
structure can be viewed as a special case of the
Morphological/Rank/Linear Neural Network
(MRL-NN),linebreak proposed by Pessoa and
Maragos (1997), but with specific architecture
and training rules. The effectiveness of the
proposed BP and GA training algorithms for MMNNs
is encouraging, offering alternative design tools
for the important class of translation invariant
operators.",
conferencename = "International Conference on Image Processing (ICIP 2000)",
copyholder = "faria - tese",
}
@TechReport{,
author = "Banon, Gerald J. F.",
title = "Characterization of translation-invariant
elementary morphological operators between
gray-level images",
institution = "Instituto Nacional de Pesquisas Espaciais -
INPE",
year = "1995",
type = "research report",
number = "INPE-5616-RPQ/671",
address = "CP 515, 12201--970 S\~ao Jos\'e dos Campos, SP,
Brazil",
month = "November",
note = "A 12 page abstract has appeared in the SPIE's
vol. 2568; this work has been supported by
ProTeM-CC/CNPq through the AnIMoMat project,
contract 680067/94--9, and by CNPq under contract
300966/90--3.",
keywords = "mathematical morphology, dilation, erosion,
anti-dilation, anti-erosion, translation
invariance, window operator, neural network,
hiejmans' operator, flat operator,
characterization, image processing, measure.",
abstract = "The four classes of Mathematical Morphology
elementary operators: dilations, erosions,
anti-dilations and anti-erosions have proved to
be of fundamental importance to the
decomposition/representation of any mapping
between complete lattices. In this paper, we are
concerned with the characterization of
translation invariant window elementary operators
(with window W) that transform a gray-level image
with finite range K1 into a gray-level image with
possibly different finite range K2. Three types
of characterization are presented. In the first
characterization, called {"}characterization by
confrontation{"} each elementary operator depends
on a family of mappings from W to K1, called
structuring element. In the second
characterization, called {"}characterization by
selection{"} each elementary operator depends on
a family of mappings from W to K2, called impulse
response. Finally, in the third characterization,
called {"}characterization by decomposition{"}
each elementary operator depends on a family of
mappings from K1 to K2, called Elementary Look Up
Tables.",
copyholder = "faria - tese",
}
@PhDThesis{,
author = "Oliveira, Jo{\~a}o Ricardo de Freitas",
title = "O uso de algoritmos gen\'eticos na
decomposi\c{c}\~ao morfol\'ogica de operadores
invariantes em transla\c{c}\~ao aplicados a
imagens digitais",
school = "Instituto Nacional de Pesquisas Espaciais -
INPE",
year = "1998",
number = "INPE-7513-TDI/726",
address = "Av. dos Astronautas, 1758 - Jd da Granja CEP
12227.010 - S\~ao Jos\'e dos Campos - SP -
Brasil",
note = "This work has been supported by ProTeM-CC/CNPq
through the AnIMoMat project, contract
680067/94--9.",
keywords = "digital image processing, mathematical
morphology, operator decomposition, genetic
algorithm",
abstract = "This work uses a genetic algorithm for the
morphological decomposition of translation
invariant operators on digital images. This
decomposition has the form of a union (resp.
intersection) of sup-generating (resp.
inf-generating) operators. These operators are
built from the four morphological elementary
operators which, in turn, are defined by
structuring elements. The harder task in using
this formulation is to find the structuring
elements that ultimately implement the desired
decomposition. For this purpose, a genetic
algorithm is used to find a sub-optimal solution
in a huge solution space. Several computational
tests are done and the results are good enough to
justify further research in this direction.",
copyholder = "faria - tese",
}
@PhDThesis{,
author = "Sousa, R. P.",
title = "Projetos de operadores invariantes a
transla\c{c}\~ao via treinamento de redes
neurais",
school = "Universidade Federal da Para\'{\i}ba",
year = "2000",
address = "Campina Grande, Para\'{\i}ba",
note = "",
keywords = "digital image processing, mathematical
morphology, operator decomposition, genetic
algorithm, neural network",
abstract = "The main objective of this thesis is to develop an
analytic method for designing translation-invariant
operators via neural network training. A new neural
network architecture, called Modular Morphological
Neural Network (MMNN), is defined using a
fundamental result of minimal representations for
translation-invariant set mappings via Mathematical
Morphology, proposed by Banon and Barrera (1991).
The MMNN general architecture is capable of
learning both binary and gray-scale
translation-invariant operators. For its training,
ideas of the Back-Propagation (BP) algorithm and
the methodology proposed by Pessoa and Maragos
(1997) for overcoming the problem of
non-differentiability of rank functions are used.
Also is developped an alternative MMNN training
method via Genetic Algorithm (GA), and provide a
comparative analysis of BP vs GA training in
problems of image restoration and pattern
recognition. The MMNN structure can be viewed as
a special case of the Morphological/Rank/Linear
Neural Network (MRL-NN) proposed by Pessoa and
Maragos (1997), but with specific architecture and
training rules. The effectiveness of the proposed
BP and GA training algorithms for MMNNs is
encouraging, offering alternative design tools
for the important class of translation-invariant
operators.",
copyholder = "faria - tese",
}
@MastersThesis{,
author = "Tomita, Nina Sumiko",
title = "Programa\c{c}\~ao autom\'atica de m\'aquinas
morfol\'ogicas bin\'arias baseada em
aprendizado PAC",
school = "Departamento de Ci\^encia da Computa\c{c}\~ao,
Instituto de Matem\'atica e Estat\'{\i}stica,
Universidade de São Paulo",
year = "1996",
address = "S\~ao Paulo, SP",
month = "Fevereiro",
note = "This work has been supported by ProTeM-CC/CNPq
throught the AnIMoMat project, contract
680067/94--9.",
keywords = "morphological machine, PAC learning",
abstract = "The theory of Mathematical Morphology (MM),
restricted to the domain of Boolean complete
lattice of subsets, can be used to model mappings
between binary images. The operators of MM can be
viewed as expressions of a formal language,
denominated Morphological Language, whose
vocabulary is composed by the elementary operators
(erosion and dilation), and by the set operations
(intersection, union and complementation). These
expressions, when implemented on special machines,
called Morphological Machines, define programs that
can be used to solve Image Analysis problems.
However, the design of these programs is not an
elementary yask in most cases. This thesis presents
a methodology for automatic programming of binary
morphological machines based on PAC learning
processes. The learning processes are those in
which a system {"}learns{"} an unknown concept
from examples. In our context, the concepts are
the morphological operators and the examples are
pairs of input-output images representing a
desired transformation. A computational system
based on the proposed methodology has been
implemented and used to learn operators in order
to solve several kinds of real image analysis
problems. This thesis also presents some original
contributions sucha as: yje insertion of automatic
programming of morphological machines in the
context of machine learning and the introduction of
a new learning algorithm which can be also used
to minimize Boolean functions.",
copyholder = "faria - tese",
}
@PhDThesis{,
author = "Hirata, Nina Sumiko Tomita",
title = "Projeto autom\'atico de operadores: explorando
conhecimentos a priori",
school = "Departamento de Ci\^encia da Computa\c{c}\~ao,
Instituto de Matem\'atica e Estat\'{\i}stica,
Universidade de São Paulo",
year = "2000",
address = "S\~ao Paulo, SP",
month = "Outubro",
keywords = "automatic design, PAC learning, learning of
Boolean functions, mathematical morphology, image
analysis, stack filter",
abstract = "Mathematical morphology is being widely used in
image processing and analysis. Designing
morphological operators is usually done by
heuristic methods. However, due to the inherent
difficulty of such procedures, automatic design
techniques are of increasing interest. In recent
years, several approaches for the automatic
design of morphological operators have been
proposed. Some of them are based on learning from
training examples (sampled from observed-ideal
pairs of images representing the desired image
processing mapping). Starting from a technique
based on PAC (Probably Approximately Correct)
learning model, we investigate some limitations
of those approaches. From this investigation, we
study the design of sW-operators emphasizing
questions related with precision of operators
designed from a limited number of training
examples. The results of this study, presented in
this work, are techniques which exploit knowledge
(about the image processing problem being solved)
in order to design more accurate operators and
efficient algorithms for implementing them.
Solutions for some real image processing problems
are given to illustrate the application of the
proposed techniques.",
committee = "Barrera, Junior and Stern, Julio M. and Banon,
Gerald Jean Francis and Costa, Luciano da
Fontoura and Costa, Max Henrique Machado",
copyholder = "faria - tese",
}
@PhDThesis{,
author = "Hashimoto, Ronaldo Fumio",
title = "Mudan\c{c}a de estrutura de
representa\c{c}\~ao de operadores em morfologia
matem\'atica",
school = "Departamento de Ci\^encia da Computa\c{c}\~ao,
Instituto de Matem\'atica e Estat\'{\i}stica,
Universidade de São Paulo",
year = "2000",
address = "S\~ao Paulo, SP",
month = "Julho",
keywords = "w-operadores, sup-decomposi\c{c}\~ao, base,
adi\c{c}\~ao de minkowski,
decomposi\c{c}\~ao.",
abstract = "The main aim of Computer Vision problems is the
extraction of information from digital images. A
powerful technique to solve these problems is
Mathematical Morphology. A central paradigm in
Mathematical Morphology is the decomposition of
operators between Complete Lattices by a set of
elementary operators of Mathematical Morphology.
This paradigm can be formalized by the use of a
formal language, called the Morphological
Language. An implementation of the Morphological
Language is called Morphological Machine and a
program for a Morphological Machine is just an
implementation of an operator for this machine.
Therefore, solving a problem of Computer Vision
by Mathematical Morphology can be understood as
finding a phrase of the Morphological Language
(or equivalently, a program for a Morphological
Machine) that can extract the desired
information. A phrase of the Morphological
Language can have infinite synonymous phrases (of
the Morphological Language), that is, different
phrases can express the same operator. A key
theorem in Mathematical Morphology is the
following: any operator between Complete Lattices
can be decomposed by a set of elementary
operators of Mathematical Morphology. This
theorem was proved by showing two canonical
structures called sup-decomposition and
inf-decomposition. These canonical structures are
strongly parallel. In this work, we formalize and
present results for the following problem: given
an operator between Complete Lattices that solves
a problem of Computer Vision, from its
sup-decompositon (or inf-decompositon), find a
synonymous phrase of the Morphological Language
that has a minimal number of elementary
operators. This problem is extremely complex and
we study it by using Combinatorial Optimation
techniques (for example, branch and bound method
and greedy strategy). Since the sup-decomposition
and inf-decomposition of an operator have
parallel structures and sequential
representations are usually more efficient for
computation in conventional sequential machines,
we present techniques for transforming the
canonical decompositions into purely sequential
decompositions.",
copyholder = "faria - tese",
}
@Book{,
author = "Matheron, Georges",
editor = "",
title = "Random sets and integral geometry",
publisher = "John Wiley & Sons",
year = "1975",
volume = "",
series = "",
address = "New York",
edition = "",
month = "",
note = "",
keywords = "",
abstract = "",
targetfile = "target.html",
copyholder = "faria - tese",
}
@Article{-,
author = "Jiang, Tianzi and Yang, Faguo",
title = "An evolutionary tabu search for cell image segmentation",
journal = "IEEE Transactions on Systems, Man and Cybernetics - Part B:
Cybernetics",
year = "2002",
volume = "32",
number = "5",
pages = "675--678",
month = "October",
note = "",
keywords = "cell image segmentation, evolutionary tabu search (ETS),
genetic algorithms (GAs), tabu search (TS)",
abstract = "Many engineering problems can be formulated as an optimization problem. It has
become more and more important to develop an efficient global optimization technique for
solving these problems. In this correspondence, we propose an evolutionary tabu search
(ETS) for cell image segmentation. The advantages of genetic algorithms (GAs) and TS
algorithms are incorporated into the proposed method. More precisely, we incorporate {"}the
survival of the fittest{"} from evolutionary algorithms into TS. The method has been applied to
the segmentation of several kinds of cell images. The experimental results show that the new
algorithm is a practical and effective one for global optimization; it can yield good,
near-optimal solutions and has better convergence and robustness than other global
optimization approaches.",
targetfile = "target.html",
copyholder = "faria - tese",
}
@Article{,
author = "Rizki, Mateen M. and Zmuda, Michael A. and Tamburino, Louis A.",
title = "Evolving pattern recognition systems",
journal = "IEEE Transactions on Evolutionary Computation",
year = "2002",
volume = "6",
number = "6",
pages = "594--609",
month = "December",
note = "",
keywords = "classification, evolutionary computation, feature extraction,
feature selection, high-range resolution (HRR) analysis,
hybrid evolutionary algorithm, mathematical morphology,
pattern recognition",
abstract = "A hybrid evolutionary learning algorithm is presented that synthesizes a complete
multiclass pattern recognition system. The approach uses a multifaceted representation that
evolves layers of processing to perform feature extraction from raw input data, select
cooperative sets of feature detectors, and assemble a linear classifier that uses the detectors'
responses to label targets. The hybrid algorithm, Hybrid Evolutionary Learning for Pattern
Recognition (HELPR) blends elements of evolutionary programming, genetic programming,
and genetic algorithms to perform a search for an effective set of feature detectors.
Individual detectors are represented as expressions composed of morphological and
arithmetic operations. Starting with a few small random expressions, HELPR expands the
number and complexity of the features to produce a recognition system that achieves high
accuracy. Results are presented that demonstrate the performance of HELPR-generated
recognition systems applied to the task of classification of high-range resolution radar
signals.",
targetfile = "target.html",
copyholder = "faria - tese",
}
@Article{,
author = "Soille, Pierre and Pesaresi, Martino",
title = "Advances in mathematical morphology applied to geoscience and remote sensing",
journal = "IEEE Transactions on Geoscience and Remote Sensing",
year = "2002",
volume = "40",
number = "9",
pages = "2042--2055",
month = "September",
note = "",
keywords = "digital elevation models, directional segmentation, filtering, image analysis, leveling,
mathematical morphology, orientation field, rank, self-duality, simplification,
skeletonization",
abstract = "By concentrating on the analysis of the spatial relationships between groups of pixels,
mathematical morphology provides us with an image processing strategy complementary to
those based on the analysis of the spectral signature of single pixels. A wide variety of
morphological transformations are available for extracting structural information in
spatial data. Accordingly, a stream of successful applications in geoscience and remote
sensing have been reported since the mid-1980s as highlighted in a brief survey. However,
recent advances in the theory of mathematical morphology still remain largely unexplored.
We show in this paper that they can enhance methodologies for the processing and analysis
of earth observation data for tasks as diverse as filtering, simplification, directional
segmentation and crest line extraction. We also address important issues overlooked in the
past and concerning the applicability of a given morphological filter to earth observation
data. In particular, we point out that self-dual or even self-complementary filters are
required in many applications to produce results independent of the local contrast of the
searched image structures.",
targetfile = "target.html",
copyholder = "faria - tese",
}
@Article{,
author = "Jiang, Tianzi",
title = "A tabu search approach to optimal structuring element
extraction for MST-based shapes description",
journal = "International Journal of Computer Mathematics",
year = "1999",
volume = "71",
number = "4",
pages = "437--445",
month = "",
note = "",
keywords = "shape description, mathematical morphology, shape mathing,
optimal structure element, tabu search, model-based vision",
abstract = "In this paper, we propose a novel method for extracting optimal structure element for
MST-based shape description. Specifically, we use tabu search to solve optimal structure
element extraction problem for MST-based shape description. In the best of our knowledge,
there is very little work on how to explore tabu search in computer vision. Our tabu search
(TS) has a number of advantages: (1) TS avoids entrapment in local minima and continues
the search to give a near-optimal final solution; (2) TS is very general and conceptually
much simpler than either SA or GA; (3) TS is very easy to implement and the entire
procedure occupies only a few lines of code; (4) TS is a flexible framework of a variety of
strategies originating from artificial intelligence and is therefore open to further
improvement.",
targetfile = "target.html",
copyholder = "faria - tese",
}
@Article{,
author = "Poli, Ricardo and Cagnoni, Stefano and Valli, Guido",
title = "Genetic design of optimum linear and nonlinear QRS detectors",
journal = "IEEE Transactions on Biomedical Engineering",
year = "1995",
volume = "42",
number = "11",
pages = "1137--1141",
month = "November",
note = "",
keywords = "genetic design, optimum linear detector, optimum nonlinear
detector",
abstract = "This paper describes an approach to the design of optimum QRS detectors. We report on
detectors including a linear or nonlinear polynomial filter, which enhances and rectifies the
QRS complex, and a simple, adaptive maxima detector. The parameters of the filter and the
detector, and the samples to be processed are selected by a genetic algorithm which minimizes
the detection errors made on a set of reference ECG signals. Three different architectures and
the experimental results achieved on the MIT-BIH Arrhythmia Database are described.",
targetfile = "target.html",
copyholder = "faria - tese",
}
@Article{,
author = "Shih, Frank Yeong-Chyang and Mitchell, Owen Robert",
title = "Threshold decomposition of gray-scale morphology into
binary morphology",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
year = "1989",
volume = "11",
number = "1",
pages = "31--42",
month = "January",
note = "",
keywords = "architecture, gray-scale morphology, image processing, morphology,
stacking property, threshold decomposition",
abstract = "Mathematical morphology operations are becoming increasingly
important in industrial vision applications for object recognition
and defect inspection. Binary morphological operations of dilation
and erosion have been successfully extended to gray-scale image
processing. But gray-scale morphological operations are difficult
to implement in real time. Recently, a superposition property called
threshold decomposition and
another property called stacking were introduced and shown to apply successfully
to gray-scale morphological operations. This property allows gray-scale signals
to be decomposed into multiple binary signals. The signals are processed in
parallel, and the results are combined to produce the desired gray-scale result.
The authors present the threshold decomposition architecture and the stacking
property that allows the implementation of this architecture. Gray-scale
operations are decomposed into binary operations with the same dimensionality as
the original operations. This decomposition allows gray-scale morphological
operations to be implemented using only logic gates in VLSI architectures that
can significantly improve speed as well as give theoretical insight into the
operations.",
targetfile = "target.html",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Vizilter, Yury V.",
title = "Design of morphological operators based on selective morphology",
booktitle = "Image Processing: Algotithms and Systems, v. 4667 - Proceedings",
year = "2002",
editor = "Dougherty, Edward R. and Astola, Jaakko T. and Egiazarian, Karen O.",
pages = "215--226",
organization = "SPIE - The International Society for Optical
Engineering",
publisher = "SPIE - The International Society for Optical
Engineering",
sponsor = "IS and T;SPIE - The International Society for Optical
Engineering",
address = "Bellingham, Washington",
keywords = "mathematical morphology, Hough transform",
abstract = "The most famous morphological filters are the morphological opening and closing,
produced by superposition of morphological dilation and erosion implemented as Minkovsky
addition and subtraction with structuring elements. And in practice the modern image
processing uses no other morphological filters. However, it is possible to design some other
and different morphological filters satisfying the Serra's definition of morphological filter and
having some useful and meaningful properties. In the previous work the new {"}selective
morphology{"} (SM) was proposed based on {"}monotonization{"} technique. SM allows designing
special morphological operators different from operators of classic MM Serra. This paper
describes the further results of this approach: It is proved, that the classic and selective
morphological filters are corresponding bottom and top bounds for any other morphological
filters of some kind. The required and enough conditions are determined those guarantee
operators designed by {"}monotonization{"} scheme to be morphological filters in Serra's sense.
The new constructive scheme is proposed that makes it possible to design a wide range of
alternative morphological filters between classic and selective morphological operators.
Some examples of morphological filters design based on selective morphology are given. In
particular, the morphological filter based on Hough Transform is described.",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Walter, Thomas and Klein, Jean Claude",
title = "Segmentation of color fundus images of the human retina: detection
of the optic disc and the vascular tree using morphological
techniques",
booktitle = "Proceedings",
year = "2001",
editor = "",
pages = "",
organization = "Second International Symposium on Medical Data Analysis (ISMDA)",
publisher = "",
sponsor = "",
address = "Madrid",
keywords = "mathematical morphology, segmentation, detection of optic disc,
detection of vascular tree",
abstract = "",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@Article{,
author = "Walter, Thomas and Klein, Jean Claude and Massin, Pascale and
Erginay, Ali",
title = "A contribution of image processing to the diagnosis of diabetic
retinopathy - detection of exudas in color fundus images of the
human retina",
journal = "IEEE Transactions on Medical Imaging",
year = "2002",
volume = "21",
number = "10",
pages = "1236--1243",
month = "October",
note = "",
keywords = "diabetic retinopathy, exudates, image processing, mathematical
morphology, optic disc, papilla",
abstract = "",
targetfile = "target.html",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Walter, Thomas and Klein, Jean Claude and Massin, Pascale and
Zana, Fr\'{e}d\'{e}ric",
title = "Automatic segmentation and registration of retinal fluorescein
angiographies: application to diabetic retinopathy",
booktitle = "Proceedings",
year = "2000",
editor = "",
pages = "",
organization = "First International Workshop on Computer Assited Fundus Image
Analysis (CAFIA)",
publisher = "",
sponsor = "",
address = "Copenhagen",
keywords = "mathematical morphology, diabetic retinopathy, segmentation",
abstract = "",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Walter, Thomas and Klein, Jean Claude",
title = "Automatic detection of microaneurysms in color fundus images
of the human retina by means of the bounding box closing",
booktitle = "Proceedings",
year = "2002",
editor = "",
pages = "",
organization = "Third International Symposium on Medical Data Analysis (ISMDA)",
publisher = "",
sponsor = "",
address = "Rome",
keywords = "mathematical morphology, microaneurysms",
abstract = "",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Bounsaythip, Catherine and Alander, Jarmo",
title = "Genetic algorithms in image processing - a review",
booktitle = "Proceedings",
year = "1997",
editor = "",
pages = "173--192",
organization = "Third Nordic Workshop on Genetic and their Applications",
publisher = "",
address = "Finland",
keywords = "genetic algorithms, animation, classification, feature extraction,
filtering 2D, image analysis, image processing, image segmentation,
pattern, recogntion",
abstract = "",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@Article{,
author = "Beasley, David and Bull, David R. and Martin, Ralph R.",
title = "An overview of genetic algorithms: part 1, fundamentals",
journal = "University Computing",
year = "1993",
volume = "15",
number = "2",
pages = "58--69",
month = "",
note = "",
keywords = "",
abstract = "",
targetfile = "target.html",
copyholder = "faria - tese",
}
@Article{,
author = "Beasley, David and Bull, David R. and Martin, Ralph R.",
title = "An overview of genetic algorithms: part 2, research topics",
journal = "University Computing",
year = "1993",
volume = "15",
number = "4",
pages = "170--181",
month = "",
note = "",
keywords = "",
abstract = "",
targetfile = "target.html",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Loce, Robert P. and Dougherty, Edward R.",
title = "Using structuring element libraries to design suboptimal
morphological filters",
booktitle = "Image Algebra and Morphological
Image Processing, v. 1568 - Proceedings",
year = "1991",
editor = "Gader, Paul D. and Dougherty, Edward R.",
pages = "233--246",
organization = "SPIE - The International Society for Optical
Engineering",
publisher = "SPIE - The International Society for Optical
Engineering",
sponsor = "SPIE - The International Society for Optical
Engineering",
address = "Bellingham",
keywords = "mathematical morphology, structuring element libraries,
morphological filters",
abstract = "",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Kraft, P. and Marshall, Stephen and Harvey, Neal R.",
title = "Parallel genetic algorithms for optimizing morphological filters",
booktitle = "Proceedings of Fifth International Conference on Image Processing
and Its Applications",
year = "1995",
editor = "",
pages = "762--766",
organization = "",
publisher = "IEE, England",
sponsor = "IEE, British Computer Society, British Machine Vision Society,
International Association of Pattern Recogntion, IEEE",
address = "Edinburg",
keywords = "",
abstract = "",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Harvey, Neal R. and Marshall, Stephen",
title = "The design of different classes of morphological filter using
genetic algorithms",
booktitle = "Proceedings of Fifth International Conference on Image Processing
and its Applications",
year = "1995",
editor = "",
pages = "227-231",
organization = "",
publisher = "IEE, England",
sponsor = "IEE, British Computer Society, British Machine Vision Society,
International Association of Pattern Recogntion, IEEE",
address = "Edinburg",
keywords = "",
abstract = "",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@InProceedings{,
author = "Harvey, Neal R. and Marshall, Stephen",
title = "Using genetic algorithms in the design of morphological filters",
booktitle = "Proceedings of IEE Eletronics Division Colloquium on Genetic
Algorithms in Image Processing and Vision",
year = "1994",
editor = "",
pages = "6/1--6/5",
organization = "",
publisher = "IEE, England",
sponsor = "IEE",
address = "London",
keywords = "",
abstract = "",
entrytype = "Article",
note = "",
copyholder = "faria - tese",
}
@InCollection{,
author = "Meyer, Fernand",
title = "The levelings",
booktitle = "Mathematical Morphology and its Applications to
Image and Signal Processing",
publisher = "Kluwer Academic",
year = "1998",
editor = "Heijmans, Henk J. A. M. and Roerdink, Jos B. T. M.",
chapter = "",
pages = "191--198",
address = "Dordrecht",
month = "",
note = "",
keywords = "",
abstract = "",
}
@Article{AnguloFlan:2003:AuDeWo,
author = "Angulo, Jes{\'u}s and Flandrin, Georges",
title = "Automated detection of working area of peripheral blood smears
using mathematical morphology",
journal = "Analytical Cellular Pathology",
year = "2003",
volume = "25",
number = "1",
pages = "37--49",
keywords = "automation, quality control, telepathology, image processing,
mathematical morphology, erythrocytes, blood smear, blood
spreading",
abstract = "The paper presents a technique to automatically detect the working
area of peripheral blood smears stained with May-Gr{\"u}nwuald
Giemsa. The optimal area is defined as the well spread part of the
smear. This zone starts when the erythrocytes stop overlapping (on
the body film side) and finishes when the erythrocytes start
losing their clear central zone (on the feather edge side). The
approach yields a quick detection of this area in images scanned
under low magnifying power (immersion objective 225 or 216). The
algorithm consists of two stages. First, an image analysis
procedure using mathematical morphology is applied for extracting
the erythrocytes, the centers of erythrocytes and the erythrocytes
with center. Second, the number of connected components from the
three kinds of particles is counted and the coefficient of
spreading and the coefficient of overlapping are calculated. The
data from fourteen smears illustrate how the technique is used and
its performance.",
copyholder = "faria-tese",
language = "English",
urlaccessdate = "05 jan. 2013"
}
@Article{AnguloNguMasDrüSer:2003:MoQuAo,
author = "Angulo, Jes{\'u}s and Nguyen-Khoa, Thao and Massy, Ziad A. and
Dr{\"u}eke, Tilman and Serra, Jean",
title = "Morphological quantification of aortic calcification from low
magnification images",
journal = "Image Analysis and Stereology",
year = "2003",
volume = "22",
number = "2",
pages = "81--89",
month = "June",
keywords = "aortic calcification, automation in bioimaging, low magnification
histology, mathematical morphology, nephrology, quantitative image
analysis",
abstract = "Atherosclerotic and medial vascular calcifications are frequent in
chronic renal failure patiens and predict their increased
cardiovascular mortality. Experimental models for mice have been
recently developed in order to study these disorders. The aim of
this paper is to present the morphological image processing
algorithms developed for the semi-automated measurement of
calcification from sections of aorta stained using von Kossa's
silver nitrate procedure and acquired at low magnification power
(x2.5) on colour images. The approach is separated into two
sequential phases. First, the segmentation is aimed to extract the
calcification structures and on the other hand to demarcate the
region of the atherosclerotic lesion within the tissue. The
segmentation yields the image data which is the input to the
second phase, the quantification. Calcified structures are
measured inside and outside the lesion using a granulometric curve
which allows the calculation of statistical parameters of size.
The same operator computes the shape of the lesion. The relative
proportion of the area of calcification is also calculated
respectively for the atherosclerotic lesion area and the area
outside such lesions. In conclusion, the here developed method
allows quantification of vascular calcified deposits in mouse
aorta. This method will be useful for the quantitative assessment
of pathological vascular changes in animals and
man.",
copyholder = "faria-tese",
language = "English",
urlaccessdate = "05 jan. 2013"
}
@Article{AnguloSerr:2003:AuAnDN,
author = "Angulo, Jes{\'u}s and Serra, Jean",
title = "Automatic analysis of DNA microarray images using mathematical
morphology",
journal = "Bioinformatics",
year = "2003",
volume = "19",
number = "5",
pages = "553--562",
month = "March",
abstract = "DNA microarrays are an experimental technology which consists in
arrays of thousands of discrete DNA sequences that are printed on
glass microscope slides. Image analysis is an important aspect of
microarray experiments. The aim of this step is to reduce an image
of spots into a table with a measure of the intensity for each
spot. Efficient, accurate and automatic analysis of DNA spot
images is essential in order to use this technology in laboratory
routines. We present an automatic non-supervised set of algorithms
for a fast and accurate spot data extraction from DNA microarrays
using morphological operators which are robust to both intensity
variation and artefacts. The approach can be summarised as
follows. Initially, a gridding algorithm yields the automatic
segmentation of the microarray image into spot quadrants which are
later individually analysed. Then the analysis of the spot
quadrant images is achieved in five steps. First, a
pre-quantification, the spot size distribution law is calculated.
Second, the background noise extraction is performed using a
morphological filtering by area. Third, an orthogonal grid
provides the first approach to the spot locus. Fourth, the spot
segmentation or spot boundaries definition is carried out using
the watershed transformation. And fifth, the outline of detected
spots allows the signal quantification or spot intensities
extraction; in this respect, a noise model has been investigated.
The performance of the algorithm has been compared with two
packages: ScanAlyze and Genepix, showing its robustness and
precision.",
copyholder = "faria-tese",
urlaccessdate = "05 jan. 2013"
}
@TechReport{BlickleThie:1995:CoSeSc,
author = "Blickle, Tobias and Thiele, Lothar",
title = "A comparison of selection schemes used in genetic
algorithms",
institution = "Swiss Federal Institute of Technology",
year = "1995",
number = "11",
address = "Zurich",
copyholder = "faria - tese",
language = "English",
pages = "67",
urlaccessdate = "05 jan. 2013"
}
@Article{GasteratosAndrTsal:1997:ExVeLa,
author = "Gasteratos, Antonios and Andreadis, Ioannis and Tsalides,
Philipos",
title = "Extension and very large scale integration implementation of the
majority-gate algorithm for gray-scale morphological
operations",
journal = "Optical Engineering",
year = "1997",
volume = "36",
number = "3",
pages = "857--861",
month = "March",
keywords = "image processing, mathematical morphology, majority gate,
ASICs",
abstract = "This paper presents the design and VLSI implementation of a new
ASIC that performs in real time the morphological operations of
dilation and erosion. The ASIC's architecture is based on the
extension of the majority-gate algorithm for morphological
operations. The ASIC was implemented using DLM, 0.7 micrometres,
CMOS, N-well process, and it occupies a silicon area of 14.78 mm2.
Its maximum speed of operation is 92.5 MHz. Targeted applications
include machine vision, where the need for short processing times
is crucial.",
language = "English",
urlaccessdate = "05 jan. 2013"
}
@Article{Jiang:2001:EvTaSe,
author = "Jiang, Tianzi",
title = "An evolutionary tabu search approach to optimal structuring
element extraction for MST-based shapes
description",
journal = "International Journal of Computer
Mathematics",
year = "2001",
volume = "76",
pages = "307--315",
keywords = "shape description, mathematical morphology, shape matching,
optimal structure element, simulated annealing algorithm, genetic
algorithm, tabu search, model-based vision",
abstract = "Optimal structure element extraction is a key step in the
application of mathematical mosphology to various image processing
tasks and shape description problem in computer vision. In this
paper, we propose a novel optimization technique called
evolutionary tabu search (ETS) to solve optimal structure element
extraction problem for MST-based shape description. Specifically,
we incorporates",
copyholder = "faria - tese",
language = "English",
urlaccessdate = "05 jan. 2013"
}
@Article{JiangEvan:2001:ImReCo,
author = "Jiang, Tianzi and Evans, D. J.",
title = "Image restoration by combining local genetic algorithm with
adaptive pre-conditioning",
journal = "International Journal of Computer
Mathematics",
year = "2001",
volume = "76",
pages = "279--295",
keywords = "imagem restoration, adpative pre-conditioning genetic algorithm,
Wiener filter, median filter",
abstract = "Image restoration is an essential preprocessing step for many
image analysis applications. For this issue, the most common
problem is that some interesting structures in the image will be
removed from the concerned image during noise supression. Such
interesting structures in an image often correspond to the
descontinuities in the image. In this paper, we propose a novel
efficient method for image restoration. The central idea in this
method is to combine the hybrid genetic algorithm with adaptive
pre-conditioning. The remarkable advantage of our approach over
the existing works in this field is that restoring corrupted
images and preserving the shape transitions in the restored
results have ochestrated very well. Experiments illustrate that
our method is much more effective and powerful in the noise
reduction than the Wiener and median filtering techniques, two
typical and widely used techniques.",
language = "English",
urlaccessdate = "05 jan. 2013"
}
@TechReport{SmithGoldEari:1994a:ClImSi,
author = "Smith, Robert E. and Goldberg, David E. and Earickson, Jeff
A.",
title = "SGA-C: C-language implementation of a simple genetic
algorithm",
institution = "The Clearinghouse for Genetic Algorithms, The University of
Alabama",
year = "1994a",
type = "Report",
number = "TCGA Report no 91002",
address = "Tuscaloosa",
copyholder = "faria-tese",
pages = "6",
url = "ftp://ftp-illigal.ge.uiuc.edu/pub/src/simpleGA/C/",
urlaccessdate = "05 jan. 2013"
}