The Experts below are selected from a list of 16212 Experts worldwide ranked by ideXlab platform
Its'hak Dinstein - One of the best experts on this subject based on the ideXlab platform.
-
GREC - Compound Regulated Morphological Operations and Their Application to the Analysis of Line-Drawings
Graphics Recognition Recent Advances, 2000Co-Authors: Gady Agam, Its'hak DinsteinAbstract:Regulated Morphological Operations, which are defined by extending the fitting interpretation of the ordinary Morphological Operations, have been shown to be less sensitive to noise and small intrusions or protrusions on the boundary of shapes. The compound regulated Morphological Operations, as defined in this paper, extend the fitting interpretation of the ordinary compound Morphological Operations. Consequently, these regulated Morphological Operations enhance the ability of the ordinary Morphological Operations to quantify geometrical structure in signals in a way that agrees with human perception. The properties of the compound regulated Morphological Operations are described, and they are shown to be idempotent, thus manifesting their ability to filter basic characteristics of the input signal. The paper concludes with some examples of applications of compound regulated Morphological Operations for the analysis of line-drawings.
-
Regulated Morphological Operations
Pattern Recognition, 1999Co-Authors: Gady Agam, Its'hak DinsteinAbstract:In this paper regulated Morphological Operations are defined by extending the fitting interpretation of the ordinary Morphological Operations. The defined Operations have a controllable strictness, and so they are less sensitive to noise and small intrusions or protrusions on the boundaries of shapes. The properties of the defined Operations are described, and the relations between them and some other non-linear Operations are discussed. Given an existing Morphological algorithm, it is possible to try and improve the results obtained by it by using the regulated Operations instead of the ordinary Operations with strictness that may be optimized according to some optimization criteria. Several examples of the proposed approach are presented.
-
SSPR/SPR - Efficient Implementation of Regulated Morphological Operations Based on Directional Interval Coding
Advances in Pattern Recognition, 1998Co-Authors: Gady Agam, Its'hak DinsteinAbstract:The problem of efficient implementation of regulated Morphological Operations on a serial computer is discussed, where it is assumed that arbitrary kernels may be used. The proposed approach is based on a compact representation of the image which is obtained by using directional interval coding, where the direction of the intervals is selected based on the image contents. This representation is particularly suitable for the processing of directional edge planes. By using stacked intervals, it is described how to obtain the result of a convolution which is based on interval coding, and thereby how to obtain an efficient implementation of regulated Morphological Operations.
Gady Agam - One of the best experts on this subject based on the ideXlab platform.
-
GREC - Compound Regulated Morphological Operations and Their Application to the Analysis of Line-Drawings
Graphics Recognition Recent Advances, 2000Co-Authors: Gady Agam, Its'hak DinsteinAbstract:Regulated Morphological Operations, which are defined by extending the fitting interpretation of the ordinary Morphological Operations, have been shown to be less sensitive to noise and small intrusions or protrusions on the boundary of shapes. The compound regulated Morphological Operations, as defined in this paper, extend the fitting interpretation of the ordinary compound Morphological Operations. Consequently, these regulated Morphological Operations enhance the ability of the ordinary Morphological Operations to quantify geometrical structure in signals in a way that agrees with human perception. The properties of the compound regulated Morphological Operations are described, and they are shown to be idempotent, thus manifesting their ability to filter basic characteristics of the input signal. The paper concludes with some examples of applications of compound regulated Morphological Operations for the analysis of line-drawings.
-
Regulated Morphological Operations
Pattern Recognition, 1999Co-Authors: Gady Agam, Its'hak DinsteinAbstract:In this paper regulated Morphological Operations are defined by extending the fitting interpretation of the ordinary Morphological Operations. The defined Operations have a controllable strictness, and so they are less sensitive to noise and small intrusions or protrusions on the boundaries of shapes. The properties of the defined Operations are described, and the relations between them and some other non-linear Operations are discussed. Given an existing Morphological algorithm, it is possible to try and improve the results obtained by it by using the regulated Operations instead of the ordinary Operations with strictness that may be optimized according to some optimization criteria. Several examples of the proposed approach are presented.
-
SSPR/SPR - Efficient Implementation of Regulated Morphological Operations Based on Directional Interval Coding
Advances in Pattern Recognition, 1998Co-Authors: Gady Agam, Its'hak DinsteinAbstract:The problem of efficient implementation of regulated Morphological Operations on a serial computer is discussed, where it is assumed that arbitrary kernels may be used. The proposed approach is based on a compact representation of the image which is obtained by using directional interval coding, where the direction of the intervals is selected based on the image contents. This representation is particularly suitable for the processing of directional edge planes. By using stacked intervals, it is described how to obtain the result of a convolution which is based on interval coding, and thereby how to obtain an efficient implementation of regulated Morphological Operations.
Kenneth G Ricks - One of the best experts on this subject based on the ideXlab platform.
-
scalable giga pixels s binary image Morphological Operations
International Symposium on Circuits and Systems, 2003Co-Authors: S Ongwattanakul, P Chewputtanagul, David Jeff Jackson, Kenneth G RicksAbstract:Binary Morphological Operations are a building block in many computer vision applications. Several iterative Morphological Operations are commonly performed for image analysis resulting in a significant computational load on the processing unit, especially in a real-time computer vision system. Custom designed hardware can exploit the parallelism exhibited in binary image Morphological Operations. In this paper, we describe a scalable parallel Binary Morphological Unit (spBMU) which can produce 2/spl times/8-pixel (2 rows /spl times/ 8 columns) outputs from one of fifteen primitive Morphological Operations based on a 30 mask. Multiple spBMU can be linked to achieve higher parallel performance. Operations include Sobel edge detection, dilation, erosion, Laplacian, and edge thinning. Implementation on an Altera CPLD has shown a sustained performance up to 720 million output pixels per second per chip at 45 MHz. Eight spBMUs, yielding 5.76 Giga-pixels/s, can be implemented with relatively small modification to the memory structure. The spBMU architecture and details of implementation are presented.
-
Computers and Their Applications - A Programmable Logic-Based Implementation of Ultra-Fast Parallel Binary Image Morphological Operations.
2003Co-Authors: S Ongwattanakul, P Chewputtanagul, David Jeff Jackson, Kenneth G RicksAbstract:Binary Morphological Operations are a building block in many computer vision applications. Several iterative Morphological Operations are commonly performed for image analysis resulting in a significant computational load on the processing unit, especially in a real-time computer vision system. Custom designed hardware can exploit the natural parallelism exhibited in binary image Morphological Operations. In this paper we describe a parallel Binary Morphological Unit (pBMU) which can produce two 8-pixel outputs from one of fifteen Morphological Operations based on a 3x3 mask. Operations include Sobel edge detection, dilation, erosion, Laplacian, and edge thinning. Implementation on an Altera EPM7256SRC208-7 has shown a sustained performance of 1.066 billion output pixels per second at 66.67 MHz. Thus the pBMU can process 1,356 frame-Operations on 1024x768 binary images every second. The pBMU architecture and details of implementation are presented.
-
ISCAS (2) - Scalable giga-pixels/s binary image Morphological Operations
Proceedings of the 2003 International Symposium on Circuits and Systems 2003. ISCAS '03., 1Co-Authors: S Ongwattanakul, P Chewputtanagul, David Jeff Jackson, Kenneth G RicksAbstract:Binary Morphological Operations are a building block in many computer vision applications. Several iterative Morphological Operations are commonly performed for image analysis resulting in a significant computational load on the processing unit, especially in a real-time computer vision system. Custom designed hardware can exploit the parallelism exhibited in binary image Morphological Operations. In this paper, we describe a scalable parallel Binary Morphological Unit (spBMU) which can produce 2/spl times/8-pixel (2 rows /spl times/ 8 columns) outputs from one of fifteen primitive Morphological Operations based on a 30 mask. Multiple spBMU can be linked to achieve higher parallel performance. Operations include Sobel edge detection, dilation, erosion, Laplacian, and edge thinning. Implementation on an Altera CPLD has shown a sustained performance up to 720 million output pixels per second per chip at 45 MHz. Eight spBMUs, yielding 5.76 Giga-pixels/s, can be implemented with relatively small modification to the memory structure. The spBMU architecture and details of implementation are presented.
Frank Y. Shih - One of the best experts on this subject based on the ideXlab platform.
-
Wavelet coefficients clustering using Morphological Operations and pruned quadtrees
Pattern Recognition, 2000Co-Authors: Eduardo Morales, Frank Y. ShihAbstract:Abstract Transform coding has been extensively applied in image compression. The wavelet transform possesses the characteristic of providing spatial and frequency domain information. This characteristic plays an important role in image compression so that identification and selection of the significant coefficients in the wavelet transform become easier. The result has the advantages of better compression ratio and better image quality. The paper presents a new approach to create an efficient clustering of the significant coefficients in the wavelet transform based on Morphological Operations and pruned quadtrees. In this way, only the significant coefficients and their map will be encoded and transmitted. The decoder process will use the map to place the significant coefficients in the correct locations and then apply the inverse wavelet transform to reconstruct the original image. Experimental results show that the combination of Morphological Operations and pruned quadtrees outperforms the conventional quadtrees by a compression ratio of 2 to 1 with the similar image quality.
-
Design of one-pass training algorithms for variant Morphological Operations
Information Sciences, 1996Co-Authors: Jenlong Moh, Frank Y. ShihAbstract:In this paper, the design of one-pass training algorithms for variant Morphological Operations is presented. The algorithms intend to achieve a fast-learning goal in which the Morphological neurons can learn a training pattern and memorize it in exactly one training iteration. Furthermore, only simple computations are used to allow easy implementation in hardware. The proofs of the training algorithms and the program-simulated experimental results are provided.
-
Pipeline architectures for recursive Morphological Operations
IEEE transactions on image processing : a publication of the IEEE Signal Processing Society, 1995Co-Authors: Frank Y. Shih, Chung-ta KingAbstract:Introduces efficient pipeline architectures for the recursive Morphological Operations. The standard Morphological operation is applied directly on the original input image and produces an output image. The order of image scanning in which the operator is applied to the input pixels is irrelevant. However, the intent of the recursive Morphological Operations is to feed back the output at the current scanning pixel to overwrite its corresponding input pixel to be considered into computation at the following scanning pixels. The resultant output image by recursive morphology inherently depends on the image scanning sequence. Two pipelined implementations of the recursive Morphological Operations are presented. The design of an application-specific systolic array is first introduced. The systolic array uses 3 n cells to process an n/spl times/n image in 6 n-2 cycles. The cell utilization rate is 100%. Second, a parallel program implementing the recursive Morphological Operations and running on distributed-memory multicomputers is described. Performance of the program can be finely tuned by choosing appropriate partition parameters. >
-
Image Morphological Operations by neural circuits
IEEE International Symposium on Circuits and Systems, 1Co-Authors: Frank Y. Shih, J. MohAbstract:An approach to implementing neural computing with Boolean programmable logic is presented. A technique for the implementation of image Morphological Operations using a neural architecture is developed. Image Morphological Operations, by their very nature, involve repeated computations over large data structures. Parallelism appears to be a necessary attribute of a hardware system which can efficiently perform such image analysis tasks. >
Paul J. Scott - One of the best experts on this subject based on the ideXlab platform.
-
A theoretical insight into Morphological Operations in surface measurement by introducing the slope transform
Journal of Zhejiang University-SCIENCE A, 2015Co-Authors: Shan Lou, Wenhan Zeng, Xiangqian Jiang, Paul J. ScottAbstract:As one of the tools for surface analysis, Morphological Operations, although not as popular as linear convolution Operations (e.g., the Gaussian filter), are really useful in mechanical surface reconstruction, surface filtration, functional simulation, etc. By introducing the slope transform originally developed for signal processing into the field of surface metrology, an analytic capability is gained for Morphological Operations, paralleling that of the Fourier transform in the context of linear convolution. Using the slope transform, the tangential dilation is converted into the addition in the slope domain, just as by the Fourier transform, the convolution switches into the multiplication in the frequency domain. Under the theory of the slope transform, the slope and curvature changes of the structuring element to the operated surface can be obtained, offering a deeper understanding of Morphological Operations in surface measurement. The analytical solutions to the tangential dilation of a sine wave and a disk by a disk are derived respectively. An example of the discretized tangential dilation of a sine wave by the disks with two different radii is illustrated to show the consistency and distinction between the tangential dilation and the classical dilation.
-
Slope transform: a theoretical insight into Morphological Operations in surface measurement
2014Co-Authors: Shan Lou, Xiang Jiang, Wenhan Zeng, Paul J. ScottAbstract:Linear convolution and Morphological (nonlinear) Operations are two kinds of Operations that have wide applications in the field of surface measurement. Well-established computational and analytical methods are available for linear convolution, such as the Fourier Transform. A counterpart transform, called the slope transform, which resembles the Fourier transform in many aspects, can provide the analytical ability for Morphological Operations. The tangential dilation is the extension of the classical dilation, providing the basis for the slope transform. The slope transform sets out to decompose the input function into the eigenfunctions (planar functions), each of which is a point in the slope domain representing the slope and intercept of the tangent line of the input function. Under the slope transform, the tangential dilation becomes the addition, just as by the Fourier transform, the convolution becomes the multiplication. By investigating the slope and curvature change, the slope transform can offer a deeper understanding of Morphological Operations in surface measurement.
-
Applications of Morphological Operations in Surface Metrology and Dimensional Metrology
Journal of Physics: Conference Series, 2014Co-Authors: Shan Lou, Xiangqian Jiang, Paul J. ScottAbstract:In contrast to the widely used mean-line based evaluation techniques, the capabilities of Morphological methods are not fully recognized in practice. Morphological Operations, e.g. dilation, erosion, closing and opening, are useful tools in surface metrology and dimensional metrology. This paper presents a variety of novel applications of Morphological Operations in association with several of existing critical cases to demonstrate their usability and capability. These applications include scanning process analysis, real mechanical surface reconstruction, freeform surface deviation evaluation, open surface and roundness filtration, form approximation, contact phenomenon simulation, establishment of uncertainty zone for continuous surface reconstruction and stratified functional surface evaluation.
