TY - JOUR
T1 - Threshold Decomposition of Gray-Scale Morphology into Binary Morphology
AU - Shih, Frank Yeong Chyang
AU - Mitchell, Owen Robert
N1 - Funding Information:
Manuscript received August 8, 1986; revised February 8, 1988. This work was supported by the National Science Foundation through the Engineering Research Center for Intelligent Manufacturing Systems, Purdue University.
PY - 1989/1
Y1 - 1989/1
N2 - 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 have been found to apply successfully to gray-scale morphological operations. This property allows gray-scale signals to be decomposed into multiple binary signals. These signals are processed in parallel, and the results are combined to produce the desired gray-scale result. In this paper, we present the threshold decomposition architecture and the stacking property which 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 new VLSI architectures, which may significantly improve speed as well as give new theoretical insight into the operations.
AB - 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 have been found to apply successfully to gray-scale morphological operations. This property allows gray-scale signals to be decomposed into multiple binary signals. These signals are processed in parallel, and the results are combined to produce the desired gray-scale result. In this paper, we present the threshold decomposition architecture and the stacking property which 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 new VLSI architectures, which may significantly improve speed as well as give new theoretical insight into the operations.
UR - http://www.scopus.com/inward/record.url?scp=0024479011&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0024479011&partnerID=8YFLogxK
U2 - 10.1109/34.23111
DO - 10.1109/34.23111
M3 - Article
AN - SCOPUS:0024479011
SN - 0162-8828
VL - 11
SP - 31
EP - 42
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
JF - IEEE Transactions on Pattern Analysis and Machine Intelligence
IS - 1
ER -