← Back
Editing: _morphology.cpython-311.pyc
� d�c�U � �F � d dl Z d dlZd dlZddlmZ ddlmZ ddlmZ g d�Zd� Zd$d�Z d � Z d � Z d%d �Z d%d �Z d&d�Z d&d�Z d'd�Z d(d�Zd)d�Z d*d�Z d*d�Z d*d�Z d*d�Z d*d�Z d*d�Z d*d�Z d*d �Z d+d �Z d,d!�Z d-d"�Z d#� Z dS ).� N� )� _ni_support)� _nd_image)�_filters)�iterate_structure�generate_binary_structure�binary_erosion�binary_dilation�binary_opening�binary_closing�binary_hit_or_miss�binary_propagation�binary_fill_holes� grey_erosion� grey_dilation� grey_opening� grey_closing�morphological_gradient�morphological_laplace� white_tophat� black_tophat�distance_transform_bf�distance_transform_cdt�distance_transform_edtc � � t j | � � } t d� t | j |� � D � � � � }t | | � � S )Nc �$ � g | ] \ }}||d z z ��S �� � )�.0�ss�oos �;/usr/lib/python3/dist-packages/scipy/ndimage/_morphology.py� <listcomp>z#_center_is_true.<locals>.<listcomp>2 s0 � � :� :� :�6�2�r�"�r�Q�w�,� :� :� :� )�numpy�array�tuple�zip�shape�bool)� structure�origin�coors r# �_center_is_truer/ 0 s^ � �� �I�&�&�I� � :� :�S�� �17�.9� .9� :� :� :� ;� ;�D� � �$�� � � r% c � � ���� t j � � � � �dk r� � � � S �dz ��fd�� j D � � }�� fd�t t |� � � � D � � �t �� fd�t t |� � � � D � � � � }t j |t � � }� dk ||< t |� ��� � }|�|S t j |� j � � }�fd �|D � � }||fS ) a� Iterate a structure by dilating it with itself. Parameters ---------- structure : array_like Structuring element (an array of bools, for example), to be dilated with itself. iterations : int number of dilations performed on the structure with itself origin : optional If origin is None, only the iterated structure is returned. If not, a tuple of the iterated structure and the modified origin is returned. Returns ------- iterate_structure : ndarray of bools A new structuring element obtained by dilating `structure` (`iterations` - 1) times with itself. See also -------- generate_binary_structure Examples -------- >>> from scipy import ndimage >>> struct = ndimage.generate_binary_structure(2, 1) >>> struct.astype(int) array([[0, 1, 0], [1, 1, 1], [0, 1, 0]]) >>> ndimage.iterate_structure(struct, 2).astype(int) array([[0, 0, 1, 0, 0], [0, 1, 1, 1, 0], [1, 1, 1, 1, 1], [0, 1, 1, 1, 0], [0, 0, 1, 0, 0]]) >>> ndimage.iterate_structure(struct, 3).astype(int) array([[0, 0, 0, 1, 0, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 1, 1, 1, 1, 1, 0], [1, 1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 0, 1, 0, 0, 0]]) r r c �& �� g | ] }|�|d z z z ��S )r r )r �ii�nis �r# r$ z%iterate_structure.<locals>.<listcomp>m s& �� � :� :� :�B�R�"��Q��-� � :� :� :r% c �6 �� g | ]}��j | d z z ��S r )r* )r r2 r3 r, s ��r# r$ z%iterate_structure.<locals>.<listcomp>n s* �� � G� G� G�r�2�� ��$��)� *� G� G� Gr% c 3 �n �K � | ]/}t �| �| �j | z d � � V � �0d S �N)�slicer* )r r2 �posr, s ��r# � <genexpr>z$iterate_structure.<locals>.<genexpr>o sW �� � � � -� -�� �c�"�g�s�2�w�� ��)<� <�d�C�C� -� -� -� -� -� -r% r )� iterationsNc � �� g | ]}�|z ��S r r )r �or: s �r# r$ z%iterate_structure.<locals>.<listcomp>x s �� �1�1�1�Q�*�q�.�1�1�1r% ) r& �asarray�copyr* �range�lenr( �zerosr+ r r �_normalize_sequence�ndim)r, r: r- r* �slc�outr3 r8 s `` @@r# r r 7 s: ����� �d � �i�(�(�I��A�~�~��~�~� � � � �a� �B� :� :� :� :�)�/� :� :� :�E� G� G� G� G� G�U�3�u�:�:�5F�5F� G� G� G�C� � -� -� -� -� -� ��E� � �+�+�-� -� -� -� -�C� �+�e�T� "� "�C��A�~�C��H� �#�y�R� 8� 8� 8�C� �~�� � �0��� �H�H��1�1�1�1�&�1�1�1���F�{�r% c � � |dk rd}| dk rt j dt �� � S t j t j dg| z � � dz � � }t j � |d� � }||k S )a� Generate a binary structure for binary morphological operations. Parameters ---------- rank : int Number of dimensions of the array to which the structuring element will be applied, as returned by `np.ndim`. connectivity : int `connectivity` determines which elements of the output array belong to the structure, i.e., are considered as neighbors of the central element. Elements up to a squared distance of `connectivity` from the center are considered neighbors. `connectivity` may range from 1 (no diagonal elements are neighbors) to `rank` (all elements are neighbors). Returns ------- output : ndarray of bools Structuring element which may be used for binary morphological operations, with `rank` dimensions and all dimensions equal to 3. See also -------- iterate_structure, binary_dilation, binary_erosion Notes ----- `generate_binary_structure` can only create structuring elements with dimensions equal to 3, i.e., minimal dimensions. For larger structuring elements, that are useful e.g., for eroding large objects, one may either use `iterate_structure`, or create directly custom arrays with numpy functions such as `numpy.ones`. Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> struct = ndimage.generate_binary_structure(2, 1) >>> struct array([[False, True, False], [ True, True, True], [False, True, False]], dtype=bool) >>> a = np.zeros((5,5)) >>> a[2, 2] = 1 >>> a array([[ 0., 0., 0., 0., 0.], [ 0., 0., 0., 0., 0.], [ 0., 0., 1., 0., 0.], [ 0., 0., 0., 0., 0.], [ 0., 0., 0., 0., 0.]]) >>> b = ndimage.binary_dilation(a, structure=struct).astype(a.dtype) >>> b array([[ 0., 0., 0., 0., 0.], [ 0., 0., 1., 0., 0.], [ 0., 1., 1., 1., 0.], [ 0., 0., 1., 0., 0.], [ 0., 0., 0., 0., 0.]]) >>> ndimage.binary_dilation(b, structure=struct).astype(a.dtype) array([[ 0., 0., 1., 0., 0.], [ 0., 1., 1., 1., 0.], [ 1., 1., 1., 1., 1.], [ 0., 1., 1., 1., 0.], [ 0., 0., 1., 0., 0.]]) >>> struct = ndimage.generate_binary_structure(2, 2) >>> struct array([[ True, True, True], [ True, True, True], [ True, True, True]], dtype=bool) >>> struct = ndimage.generate_binary_structure(3, 1) >>> struct # no diagonal elements array([[[False, False, False], [False, True, False], [False, False, False]], [[False, True, False], [ True, True, True], [False, True, False]], [[False, False, False], [False, True, False], [False, False, False]]], dtype=bool) r T��dtype� r )r& r' r+ �fabs�indices�add�reduce)�rank� connectivity�outputs r# r r | sy � �f �a���� � �a�x�x��{�4�t�,�,�,�,� �Z�� �q�c�D�j�1�1�A�5� 6� 6�F� �Y� � �f�a� (� (�F� �\� !�!r% c �b � t j |� � }n"# t $ r} t d� � | �d } ~ ww xY wt j | � � } t j | � � rt d� � �|�t | j d� � }nt j |t �� � }|j | j k rt d� � �|j j s|� � � }t j |j d�� � dk rt d� � �|�3t j |� � }|j | j k rt d � � �t j || j � � }t# ||� � } t% |t j � � r$t j |� � rt d � � �nt }t j || � � }t j | |� � } | r |} t j |j | � � }|dk r t/ j | ||||||| d� � �n�| r�|s�t/ j | ||||||| d� � \ } }|t3 t5 d d d � � g|j z � � }t7 t9 |� � � � D ].}|| ||< |j | dz s||xx dz cc< �/|� t j |t j �� � }|j j s|� � � }t/ j ||||dz |||� � n�t j | t �� � }|}|dk r |dz s||}}t/ j | ||||||| d� � } d}||k s|dk r5| r3||}}t/ j |||||||| d� � } |dz }||k �+|dk r| �3| r|| d < | }|S ) Nz)iterations parameter should be an integerzComplex type not supportedr rG z1structure and input must have same dimensionalityr ��axiszstructure must not be emptyz$mask and input must have equal sizesz!Complex output type not supported���.) �operator�index� TypeErrorr& r= � iscomplexobjr rC r+ � RuntimeError�flags� contiguousr> �prodr* r rB r/ � isinstance�ndarray� _get_output�may_share_memoryrH r r r( r7 r? r@ �int8�binary_erosion2� empty_like)�inputr, r: �maskrP � border_valuer- �invert� brute_force�e�cit� temp_needed�temp�changed�coordinate_listr2 �tmp_in�tmp_outs r# �_binary_erosionrq � s= � �L� �^�J�/�/� � �� � L� L� L��C�D�D�!�K�����L���� �M�%� � �E� ��%� � � 6��4�5�5�5���-�e�j�!�<�<� � ��M�)�4�8�8�8� ��~���#�#��N�O�O�O� �?� %� %� �N�N�$�$� � �z�)�/��*�*�*�Q�.�.��8�9�9�9� ���}�T�"�"�� �:��� $� $� � E�F�F� F� � ,�V�U�Z� @� @�F� �)�V� ,� ,�C��&�%�-�(�(� � � �f� %� %� A�� ?�@�@� @� A� �� � $�V�U� 3� 3�F��(���7�7�K�� >��� �(�� �u�=�=���Q���� �� �4��!-�v�v�s�A� G� G� G� G� � �[� �#,�#;� �9�d�F� �&�&�#�q�$2� $2� �� � �e�U�4��r�%:�%:�$;�$-�N�%3� 4� 4� 5� ���F� � �$�$� � �B� ��*��F�2�J� �?�2�&��*� ��r� � � �a�� � � �� � ��=��U�Z�8�8�8�D���)� )�!���(�(�I��!�&�)�T�:��>�"(�&�/� C� C� C� C� �!�%�t�4�4�4���� ��?�?�:��>�?� %�v�G�F��*� �9�d�G� �&�&�#�q�2� 2�� ���:�o�o�*�q�.�.�W�.� %�v�G�F� �.�� �4�� �f�f�c�1�6� 6�G� �!�G�B� �:�o�o�*�q�.�.�W�.� � ���S� ��� �Ms � � 6�1�6Fc �0 � t | ||||||d|� � S )a� Multidimensional binary erosion with a given structuring element. Binary erosion is a mathematical morphology operation used for image processing. Parameters ---------- input : array_like Binary image to be eroded. Non-zero (True) elements form the subset to be eroded. structure : array_like, optional Structuring element used for the erosion. Non-zero elements are considered True. If no structuring element is provided, an element is generated with a square connectivity equal to one. iterations : int, optional The erosion is repeated `iterations` times (one, by default). If iterations is less than 1, the erosion is repeated until the result does not change anymore. mask : array_like, optional If a mask is given, only those elements with a True value at the corresponding mask element are modified at each iteration. output : ndarray, optional Array of the same shape as input, into which the output is placed. By default, a new array is created. border_value : int (cast to 0 or 1), optional Value at the border in the output array. origin : int or tuple of ints, optional Placement of the filter, by default 0. brute_force : boolean, optional Memory condition: if False, only the pixels whose value was changed in the last iteration are tracked as candidates to be updated (eroded) in the current iteration; if True all pixels are considered as candidates for erosion, regardless of what happened in the previous iteration. False by default. Returns ------- binary_erosion : ndarray of bools Erosion of the input by the structuring element. See also -------- grey_erosion, binary_dilation, binary_closing, binary_opening, generate_binary_structure Notes ----- Erosion [1]_ is a mathematical morphology operation [2]_ that uses a structuring element for shrinking the shapes in an image. The binary erosion of an image by a structuring element is the locus of the points where a superimposition of the structuring element centered on the point is entirely contained in the set of non-zero elements of the image. References ---------- .. [1] https://en.wikipedia.org/wiki/Erosion_%28morphology%29 .. [2] https://en.wikipedia.org/wiki/Mathematical_morphology Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.zeros((7,7), dtype=int) >>> a[1:6, 2:5] = 1 >>> a array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> ndimage.binary_erosion(a).astype(a.dtype) array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> #Erosion removes objects smaller than the structure >>> ndimage.binary_erosion(a, structure=np.ones((5,5))).astype(a.dtype) array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) r )rq )rd r, r: re rP rf r- rh s r# r r % s- � �| �5�)�Z��!�<���K� I� I� Ir% c �� � t j | � � } |�t | j d� � }t j || j � � }t j |� � }|t t ddd� � g|j z � � }t t |� � � � D ].}|| ||< |j | dz s||xx dz cc< �/t | ||||||d|� � S )a� Multidimensional binary dilation with the given structuring element. Parameters ---------- input : array_like Binary array_like to be dilated. Non-zero (True) elements form the subset to be dilated. structure : array_like, optional Structuring element used for the dilation. Non-zero elements are considered True. If no structuring element is provided an element is generated with a square connectivity equal to one. iterations : int, optional The dilation is repeated `iterations` times (one, by default). If iterations is less than 1, the dilation is repeated until the result does not change anymore. Only an integer of iterations is accepted. mask : array_like, optional If a mask is given, only those elements with a True value at the corresponding mask element are modified at each iteration. output : ndarray, optional Array of the same shape as input, into which the output is placed. By default, a new array is created. border_value : int (cast to 0 or 1), optional Value at the border in the output array. origin : int or tuple of ints, optional Placement of the filter, by default 0. brute_force : boolean, optional Memory condition: if False, only the pixels whose value was changed in the last iteration are tracked as candidates to be updated (dilated) in the current iteration; if True all pixels are considered as candidates for dilation, regardless of what happened in the previous iteration. False by default. Returns ------- binary_dilation : ndarray of bools Dilation of the input by the structuring element. See also -------- grey_dilation, binary_erosion, binary_closing, binary_opening, generate_binary_structure Notes ----- Dilation [1]_ is a mathematical morphology operation [2]_ that uses a structuring element for expanding the shapes in an image. The binary dilation of an image by a structuring element is the locus of the points covered by the structuring element, when its center lies within the non-zero points of the image. References ---------- .. [1] https://en.wikipedia.org/wiki/Dilation_%28morphology%29 .. [2] https://en.wikipedia.org/wiki/Mathematical_morphology Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.zeros((5, 5)) >>> a[2, 2] = 1 >>> a array([[ 0., 0., 0., 0., 0.], [ 0., 0., 0., 0., 0.], [ 0., 0., 1., 0., 0.], [ 0., 0., 0., 0., 0.], [ 0., 0., 0., 0., 0.]]) >>> ndimage.binary_dilation(a) array([[False, False, False, False, False], [False, False, True, False, False], [False, True, True, True, False], [False, False, True, False, False], [False, False, False, False, False]], dtype=bool) >>> ndimage.binary_dilation(a).astype(a.dtype) array([[ 0., 0., 0., 0., 0.], [ 0., 0., 1., 0., 0.], [ 0., 1., 1., 1., 0.], [ 0., 0., 1., 0., 0.], [ 0., 0., 0., 0., 0.]]) >>> # 3x3 structuring element with connectivity 1, used by default >>> struct1 = ndimage.generate_binary_structure(2, 1) >>> struct1 array([[False, True, False], [ True, True, True], [False, True, False]], dtype=bool) >>> # 3x3 structuring element with connectivity 2 >>> struct2 = ndimage.generate_binary_structure(2, 2) >>> struct2 array([[ True, True, True], [ True, True, True], [ True, True, True]], dtype=bool) >>> ndimage.binary_dilation(a, structure=struct1).astype(a.dtype) array([[ 0., 0., 0., 0., 0.], [ 0., 0., 1., 0., 0.], [ 0., 1., 1., 1., 0.], [ 0., 0., 1., 0., 0.], [ 0., 0., 0., 0., 0.]]) >>> ndimage.binary_dilation(a, structure=struct2).astype(a.dtype) array([[ 0., 0., 0., 0., 0.], [ 0., 1., 1., 1., 0.], [ 0., 1., 1., 1., 0.], [ 0., 1., 1., 1., 0.], [ 0., 0., 0., 0., 0.]]) >>> ndimage.binary_dilation(a, structure=struct1,\ ... iterations=2).astype(a.dtype) array([[ 0., 0., 1., 0., 0.], [ 0., 1., 1., 1., 0.], [ 1., 1., 1., 1., 1.], [ 0., 1., 1., 1., 0.], [ 0., 0., 1., 0., 0.]]) Nr rT ) r& r= r rC r rB r( r7 r? r@ r* rq ) rd r, r: re rP rf r- rh r2 s r# r r � s� � �j �M�%� � �E���-�e�j�!�<�<� � � ,�V�U�Z� @� @�F�� �i�(�(�I��%��t�T�2�!6�!6� 7� )��!/� 0� 0� 1�I��C��K�K� � � � �� �R�j�[��r� ���r�"�Q�&� � �2�J�J�J�!�O�J�J�J�� �5�)�Z��!�<���K� I� I� Ir% c � � t j | � � } |�| j }t |d� � }t | |||d|||� � } t | |||||||� � S )a� Multidimensional binary opening with the given structuring element. The *opening* of an input image by a structuring element is the *dilation* of the *erosion* of the image by the structuring element. Parameters ---------- input : array_like Binary array_like to be opened. Non-zero (True) elements form the subset to be opened. structure : array_like, optional Structuring element used for the opening. Non-zero elements are considered True. If no structuring element is provided an element is generated with a square connectivity equal to one (i.e., only nearest neighbors are connected to the center, diagonally-connected elements are not considered neighbors). iterations : int, optional The erosion step of the opening, then the dilation step are each repeated `iterations` times (one, by default). If `iterations` is less than 1, each operation is repeated until the result does not change anymore. Only an integer of iterations is accepted. output : ndarray, optional Array of the same shape as input, into which the output is placed. By default, a new array is created. origin : int or tuple of ints, optional Placement of the filter, by default 0. mask : array_like, optional If a mask is given, only those elements with a True value at the corresponding mask element are modified at each iteration. .. versionadded:: 1.1.0 border_value : int (cast to 0 or 1), optional Value at the border in the output array. .. versionadded:: 1.1.0 brute_force : boolean, optional Memory condition: if False, only the pixels whose value was changed in the last iteration are tracked as candidates to be updated in the current iteration; if true all pixels are considered as candidates for update, regardless of what happened in the previous iteration. False by default. .. versionadded:: 1.1.0 Returns ------- binary_opening : ndarray of bools Opening of the input by the structuring element. See also -------- grey_opening, binary_closing, binary_erosion, binary_dilation, generate_binary_structure Notes ----- *Opening* [1]_ is a mathematical morphology operation [2]_ that consists in the succession of an erosion and a dilation of the input with the same structuring element. Opening, therefore, removes objects smaller than the structuring element. Together with *closing* (`binary_closing`), opening can be used for noise removal. References ---------- .. [1] https://en.wikipedia.org/wiki/Opening_%28morphology%29 .. [2] https://en.wikipedia.org/wiki/Mathematical_morphology Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.zeros((5,5), dtype=int) >>> a[1:4, 1:4] = 1; a[4, 4] = 1 >>> a array([[0, 0, 0, 0, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 0, 0, 0, 1]]) >>> # Opening removes small objects >>> ndimage.binary_opening(a, structure=np.ones((3,3))).astype(int) array([[0, 0, 0, 0, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 0, 0, 0, 0]]) >>> # Opening can also smooth corners >>> ndimage.binary_opening(a).astype(int) array([[0, 0, 0, 0, 0], [0, 0, 1, 0, 0], [0, 1, 1, 1, 0], [0, 0, 1, 0, 0], [0, 0, 0, 0, 0]]) >>> # Opening is the dilation of the erosion of the input >>> ndimage.binary_erosion(a).astype(int) array([[0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 1, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]]) >>> ndimage.binary_dilation(ndimage.binary_erosion(a)).astype(int) array([[0, 0, 0, 0, 0], [0, 0, 1, 0, 0], [0, 1, 1, 1, 0], [0, 0, 1, 0, 0], [0, 0, 0, 0, 0]]) Nr )r& r= rC r r r � rd r, r: rP r- re rf rh rN �tmps r# r r ss � �b �M�%� � �E����z��-�d�A�6�6� � �� �:�t�T�%�v�{� <� <�C� �3� �:�t�V�'��� >� >� >r% c � � t j | � � } |�| j }t |d� � }t | |||d|||� � } t | |||||||� � S )a� Multidimensional binary closing with the given structuring element. The *closing* of an input image by a structuring element is the *erosion* of the *dilation* of the image by the structuring element. Parameters ---------- input : array_like Binary array_like to be closed. Non-zero (True) elements form the subset to be closed. structure : array_like, optional Structuring element used for the closing. Non-zero elements are considered True. If no structuring element is provided an element is generated with a square connectivity equal to one (i.e., only nearest neighbors are connected to the center, diagonally-connected elements are not considered neighbors). iterations : int, optional The dilation step of the closing, then the erosion step are each repeated `iterations` times (one, by default). If iterations is less than 1, each operations is repeated until the result does not change anymore. Only an integer of iterations is accepted. output : ndarray, optional Array of the same shape as input, into which the output is placed. By default, a new array is created. origin : int or tuple of ints, optional Placement of the filter, by default 0. mask : array_like, optional If a mask is given, only those elements with a True value at the corresponding mask element are modified at each iteration. .. versionadded:: 1.1.0 border_value : int (cast to 0 or 1), optional Value at the border in the output array. .. versionadded:: 1.1.0 brute_force : boolean, optional Memory condition: if False, only the pixels whose value was changed in the last iteration are tracked as candidates to be updated in the current iteration; if true al pixels are considered as candidates for update, regardless of what happened in the previous iteration. False by default. .. versionadded:: 1.1.0 Returns ------- binary_closing : ndarray of bools Closing of the input by the structuring element. See also -------- grey_closing, binary_opening, binary_dilation, binary_erosion, generate_binary_structure Notes ----- *Closing* [1]_ is a mathematical morphology operation [2]_ that consists in the succession of a dilation and an erosion of the input with the same structuring element. Closing therefore fills holes smaller than the structuring element. Together with *opening* (`binary_opening`), closing can be used for noise removal. References ---------- .. [1] https://en.wikipedia.org/wiki/Closing_%28morphology%29 .. [2] https://en.wikipedia.org/wiki/Mathematical_morphology Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.zeros((5,5), dtype=int) >>> a[1:-1, 1:-1] = 1; a[2,2] = 0 >>> a array([[0, 0, 0, 0, 0], [0, 1, 1, 1, 0], [0, 1, 0, 1, 0], [0, 1, 1, 1, 0], [0, 0, 0, 0, 0]]) >>> # Closing removes small holes >>> ndimage.binary_closing(a).astype(int) array([[0, 0, 0, 0, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 0, 0, 0, 0]]) >>> # Closing is the erosion of the dilation of the input >>> ndimage.binary_dilation(a).astype(int) array([[0, 1, 1, 1, 0], [1, 1, 1, 1, 1], [1, 1, 1, 1, 1], [1, 1, 1, 1, 1], [0, 1, 1, 1, 0]]) >>> ndimage.binary_erosion(ndimage.binary_dilation(a)).astype(int) array([[0, 0, 0, 0, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 0, 0, 0, 0]]) >>> a = np.zeros((7,7), dtype=int) >>> a[1:6, 2:5] = 1; a[1:3,3] = 0 >>> a array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 0, 1, 0, 0], [0, 0, 1, 0, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> # In addition to removing holes, closing can also >>> # coarsen boundaries with fine hollows. >>> ndimage.binary_closing(a).astype(int) array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 0, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> ndimage.binary_closing(a, structure=np.ones((2,2))).astype(int) array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) Nr )r& r= rC r r r ru s r# r r � ss � �P �M�%� � �E����z��-�d�A�6�6� � �%��J��d�&�� � =� =�C� �#�y�*�d�F�&�� � =� =� =r% c �8 � t j | � � } |�t | j d� � }|�t j |� � }t j || j � � }|�|}nt j || j � � }t | |dddd|dd� � }t |t j � � }t | |dd|d|dd� � }|r-t j ||� � t j |||� � dS t j ||� � t j ||� � S )a� Multidimensional binary hit-or-miss transform. The hit-or-miss transform finds the locations of a given pattern inside the input image. Parameters ---------- input : array_like (cast to booleans) Binary image where a pattern is to be detected. structure1 : array_like (cast to booleans), optional Part of the structuring element to be fitted to the foreground (non-zero elements) of `input`. If no value is provided, a structure of square connectivity 1 is chosen. structure2 : array_like (cast to booleans), optional Second part of the structuring element that has to miss completely the foreground. If no value is provided, the complementary of `structure1` is taken. output : ndarray, optional Array of the same shape as input, into which the output is placed. By default, a new array is created. origin1 : int or tuple of ints, optional Placement of the first part of the structuring element `structure1`, by default 0 for a centered structure. origin2 : int or tuple of ints, optional Placement of the second part of the structuring element `structure2`, by default 0 for a centered structure. If a value is provided for `origin1` and not for `origin2`, then `origin2` is set to `origin1`. Returns ------- binary_hit_or_miss : ndarray Hit-or-miss transform of `input` with the given structuring element (`structure1`, `structure2`). See also -------- binary_erosion References ---------- .. [1] https://en.wikipedia.org/wiki/Hit-or-miss_transform Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.zeros((7,7), dtype=int) >>> a[1, 1] = 1; a[2:4, 2:4] = 1; a[4:6, 4:6] = 1 >>> a array([[0, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 1, 0, 0, 0], [0, 0, 1, 1, 0, 0, 0], [0, 0, 0, 0, 1, 1, 0], [0, 0, 0, 0, 1, 1, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> structure1 = np.array([[1, 0, 0], [0, 1, 1], [0, 1, 1]]) >>> structure1 array([[1, 0, 0], [0, 1, 1], [0, 1, 1]]) >>> # Find the matches of structure1 in the array a >>> ndimage.binary_hit_or_miss(a, structure1=structure1).astype(int) array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> # Change the origin of the filter >>> # origin1=1 is equivalent to origin1=(1,1) here >>> ndimage.binary_hit_or_miss(a, structure1=structure1,\ ... origin1=1).astype(int) array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1, 0], [0, 0, 0, 0, 0, 0, 0]]) Nr r F) r& r= r rC � logical_notr rB rq r] r^ � logical_and) rd � structure1� structure2rP �origin1�origin2�tmp1�inplace�results r# r r s& � �l �M�%� � �E���.�u�z�1�=�=� ����&�z�2�2� ��-�g�u�z�B�B�G������ �1�'�5�:�F�F�� �5�*�a��t�Q�� �e� %� %�D���� �/�/�G� �U�J��4��� $�a��0� 0�F�� /� ��&�&�)�)�)� ��$���/�/�/�/�/� ��&�&�)�)�)�� ��v�.�.�.r% c �, � t | |d||||� � S )a� Multidimensional binary propagation with the given structuring element. Parameters ---------- input : array_like Binary image to be propagated inside `mask`. structure : array_like, optional Structuring element used in the successive dilations. The output may depend on the structuring element, especially if `mask` has several connex components. If no structuring element is provided, an element is generated with a squared connectivity equal to one. mask : array_like, optional Binary mask defining the region into which `input` is allowed to propagate. output : ndarray, optional Array of the same shape as input, into which the output is placed. By default, a new array is created. border_value : int (cast to 0 or 1), optional Value at the border in the output array. origin : int or tuple of ints, optional Placement of the filter, by default 0. Returns ------- binary_propagation : ndarray Binary propagation of `input` inside `mask`. Notes ----- This function is functionally equivalent to calling binary_dilation with the number of iterations less than one: iterative dilation until the result does not change anymore. The succession of an erosion and propagation inside the original image can be used instead of an *opening* for deleting small objects while keeping the contours of larger objects untouched. References ---------- .. [1] http://cmm.ensmp.fr/~serra/cours/pdf/en/ch6en.pdf, slide 15. .. [2] I.T. Young, J.J. Gerbrands, and L.J. van Vliet, "Fundamentals of image processing", 1998 ftp://qiftp.tudelft.nl/DIPimage/docs/FIP2.3.pdf Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> input = np.zeros((8, 8), dtype=int) >>> input[2, 2] = 1 >>> mask = np.zeros((8, 8), dtype=int) >>> mask[1:4, 1:4] = mask[4, 4] = mask[6:8, 6:8] = 1 >>> input array([[0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0]]) >>> mask array([[0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 1, 1, 0, 0, 0, 0], [0, 1, 1, 1, 0, 0, 0, 0], [0, 1, 1, 1, 0, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1]]) >>> ndimage.binary_propagation(input, mask=mask).astype(int) array([[0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 1, 1, 0, 0, 0, 0], [0, 1, 1, 1, 0, 0, 0, 0], [0, 1, 1, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0]]) >>> ndimage.binary_propagation(input, mask=mask,\ ... structure=np.ones((3,3))).astype(int) array([[0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 1, 1, 0, 0, 0, 0], [0, 1, 1, 1, 0, 0, 0, 0], [0, 1, 1, 1, 0, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0]]) >>> # Comparison between opening and erosion+propagation >>> a = np.zeros((6,6), dtype=int) >>> a[2:5, 2:5] = 1; a[0, 0] = 1; a[5, 5] = 1 >>> a array([[1, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 1, 1, 1, 0], [0, 0, 1, 1, 1, 0], [0, 0, 1, 1, 1, 0], [0, 0, 0, 0, 0, 1]]) >>> ndimage.binary_opening(a).astype(int) array([[0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0], [0, 0, 1, 1, 1, 0], [0, 0, 0, 1, 0, 0], [0, 0, 0, 0, 0, 0]]) >>> b = ndimage.binary_erosion(a) >>> b.astype(int) array([[0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0]]) >>> ndimage.binary_propagation(b, mask=a).astype(int) array([[0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 1, 1, 1, 0], [0, 0, 1, 1, 1, 0], [0, 0, 1, 1, 1, 0], [0, 0, 0, 0, 0, 0]]) rT )r )rd r, re rP rf r- s r# r r � s& � �@ �5�)�R��v�'�� 1� 1� 1r% c �P � t j | � � }t j |j t � � }t |t j � � }|r,t ||d||d|� � t j ||� � dS t ||d|dd|� � }t j ||� � |S )aq Fill the holes in binary objects. Parameters ---------- input : array_like N-D binary array with holes to be filled structure : array_like, optional Structuring element used in the computation; large-size elements make computations faster but may miss holes separated from the background by thin regions. The default element (with a square connectivity equal to one) yields the intuitive result where all holes in the input have been filled. output : ndarray, optional Array of the same shape as input, into which the output is placed. By default, a new array is created. origin : int, tuple of ints, optional Position of the structuring element. Returns ------- out : ndarray Transformation of the initial image `input` where holes have been filled. See also -------- binary_dilation, binary_propagation, label Notes ----- The algorithm used in this function consists in invading the complementary of the shapes in `input` from the outer boundary of the image, using binary dilations. Holes are not connected to the boundary and are therefore not invaded. The result is the complementary subset of the invaded region. References ---------- .. [1] https://en.wikipedia.org/wiki/Mathematical_morphology Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.zeros((5, 5), dtype=int) >>> a[1:4, 1:4] = 1 >>> a[2,2] = 0 >>> a array([[0, 0, 0, 0, 0], [0, 1, 1, 1, 0], [0, 1, 0, 1, 0], [0, 1, 1, 1, 0], [0, 0, 0, 0, 0]]) >>> ndimage.binary_fill_holes(a).astype(int) array([[0, 0, 0, 0, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 0, 0, 0, 0]]) >>> # Too big structuring element >>> ndimage.binary_fill_holes(a, structure=np.ones((5,5))).astype(int) array([[0, 0, 0, 0, 0], [0, 1, 1, 1, 0], [0, 1, 0, 1, 0], [0, 1, 1, 1, 0], [0, 0, 0, 0, 0]]) rT r N)r& ry rA r* r+ r] r^ r )rd r, rP r- re rv r� s r# r r s� � �P � �U� #� #�D� �+�d�j�$� '� '�C���� �/�/�G�� ���Y��D�&�!�V�D�D�D� ��&�&�)�)�)�)�)� ��i��T�4��!'�)� )�� ��&�&�)�)�)�� r% �reflect� c �d � |�|�|�t d� � �t j | |||||||d� � S )a� Calculate a greyscale erosion, using either a structuring element, or a footprint corresponding to a flat structuring element. Grayscale erosion is a mathematical morphology operation. For the simple case of a full and flat structuring element, it can be viewed as a minimum filter over a sliding window. Parameters ---------- input : array_like Array over which the grayscale erosion is to be computed. size : tuple of ints Shape of a flat and full structuring element used for the grayscale erosion. Optional if `footprint` or `structure` is provided. footprint : array of ints, optional Positions of non-infinite elements of a flat structuring element used for the grayscale erosion. Non-zero values give the set of neighbors of the center over which the minimum is chosen. structure : array of ints, optional Structuring element used for the grayscale erosion. `structure` may be a non-flat structuring element. output : array, optional An array used for storing the output of the erosion may be provided. mode : {'reflect','constant','nearest','mirror', 'wrap'}, optional The `mode` parameter determines how the array borders are handled, where `cval` is the value when mode is equal to 'constant'. Default is 'reflect' cval : scalar, optional Value to fill past edges of input if `mode` is 'constant'. Default is 0.0. origin : scalar, optional The `origin` parameter controls the placement of the filter. Default 0 Returns ------- output : ndarray Grayscale erosion of `input`. See also -------- binary_erosion, grey_dilation, grey_opening, grey_closing generate_binary_structure, minimum_filter Notes ----- The grayscale erosion of an image input by a structuring element s defined over a domain E is given by: (input+s)(x) = min {input(y) - s(x-y), for y in E} In particular, for structuring elements defined as s(y) = 0 for y in E, the grayscale erosion computes the minimum of the input image inside a sliding window defined by E. Grayscale erosion [1]_ is a *mathematical morphology* operation [2]_. References ---------- .. [1] https://en.wikipedia.org/wiki/Erosion_%28morphology%29 .. [2] https://en.wikipedia.org/wiki/Mathematical_morphology Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.zeros((7,7), dtype=int) >>> a[1:6, 1:6] = 3 >>> a[4,4] = 2; a[2,3] = 1 >>> a array([[0, 0, 0, 0, 0, 0, 0], [0, 3, 3, 3, 3, 3, 0], [0, 3, 3, 1, 3, 3, 0], [0, 3, 3, 3, 3, 3, 0], [0, 3, 3, 3, 2, 3, 0], [0, 3, 3, 3, 3, 3, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> ndimage.grey_erosion(a, size=(3,3)) array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 3, 2, 2, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> footprint = ndimage.generate_binary_structure(2, 1) >>> footprint array([[False, True, False], [ True, True, True], [False, True, False]], dtype=bool) >>> # Diagonally-connected elements are not considered neighbors >>> ndimage.grey_erosion(a, size=(3,3), footprint=footprint) array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 3, 1, 2, 0, 0], [0, 0, 3, 2, 2, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) N�/size, footprint, or structure must be specifiedr )� ValueErrorr �_min_or_max_filter)rd �size� footprintr, rP �mode�cvalr- s r# r r b sN � �P �|� �)�i�.?��J�K�K�K� � &�u�d�I�y�'-�t�T�6�1� F� F� Fr% c �� � |�|�|�t d� � �|�At j |� � }|t t ddd� � g|j z � � }|�At j |� � }|t t ddd� � g|j z � � }t j | � � } t j || j � � }t t |� � � � D ]b}|| ||< |�|j | } n/|�|j | } n t j |� � r|} n|| } | dz s||xx dz cc< �ct j | |||||||d� � S )a� Calculate a greyscale dilation, using either a structuring element, or a footprint corresponding to a flat structuring element. Grayscale dilation is a mathematical morphology operation. For the simple case of a full and flat structuring element, it can be viewed as a maximum filter over a sliding window. Parameters ---------- input : array_like Array over which the grayscale dilation is to be computed. size : tuple of ints Shape of a flat and full structuring element used for the grayscale dilation. Optional if `footprint` or `structure` is provided. footprint : array of ints, optional Positions of non-infinite elements of a flat structuring element used for the grayscale dilation. Non-zero values give the set of neighbors of the center over which the maximum is chosen. structure : array of ints, optional Structuring element used for the grayscale dilation. `structure` may be a non-flat structuring element. output : array, optional An array used for storing the output of the dilation may be provided. mode : {'reflect','constant','nearest','mirror', 'wrap'}, optional The `mode` parameter determines how the array borders are handled, where `cval` is the value when mode is equal to 'constant'. Default is 'reflect' cval : scalar, optional Value to fill past edges of input if `mode` is 'constant'. Default is 0.0. origin : scalar, optional The `origin` parameter controls the placement of the filter. Default 0 Returns ------- grey_dilation : ndarray Grayscale dilation of `input`. See also -------- binary_dilation, grey_erosion, grey_closing, grey_opening generate_binary_structure, maximum_filter Notes ----- The grayscale dilation of an image input by a structuring element s defined over a domain E is given by: (input+s)(x) = max {input(y) + s(x-y), for y in E} In particular, for structuring elements defined as s(y) = 0 for y in E, the grayscale dilation computes the maximum of the input image inside a sliding window defined by E. Grayscale dilation [1]_ is a *mathematical morphology* operation [2]_. References ---------- .. [1] https://en.wikipedia.org/wiki/Dilation_%28morphology%29 .. [2] https://en.wikipedia.org/wiki/Mathematical_morphology Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.zeros((7,7), dtype=int) >>> a[2:5, 2:5] = 1 >>> a[4,4] = 2; a[2,3] = 3 >>> a array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 3, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 2, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> ndimage.grey_dilation(a, size=(3,3)) array([[0, 0, 0, 0, 0, 0, 0], [0, 1, 3, 3, 3, 1, 0], [0, 1, 3, 3, 3, 1, 0], [0, 1, 3, 3, 3, 2, 0], [0, 1, 1, 2, 2, 2, 0], [0, 1, 1, 2, 2, 2, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> ndimage.grey_dilation(a, footprint=np.ones((3,3))) array([[0, 0, 0, 0, 0, 0, 0], [0, 1, 3, 3, 3, 1, 0], [0, 1, 3, 3, 3, 1, 0], [0, 1, 3, 3, 3, 2, 0], [0, 1, 1, 2, 2, 2, 0], [0, 1, 1, 2, 2, 2, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> s = ndimage.generate_binary_structure(2,1) >>> s array([[False, True, False], [ True, True, True], [False, True, False]], dtype=bool) >>> ndimage.grey_dilation(a, footprint=s) array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 3, 1, 0, 0], [0, 1, 3, 3, 3, 1, 0], [0, 1, 1, 3, 2, 1, 0], [0, 1, 1, 2, 2, 2, 0], [0, 0, 1, 1, 2, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> ndimage.grey_dilation(a, size=(3,3), structure=np.ones((3,3))) array([[1, 1, 1, 1, 1, 1, 1], [1, 2, 4, 4, 4, 2, 1], [1, 2, 4, 4, 4, 2, 1], [1, 2, 4, 4, 4, 3, 1], [1, 2, 2, 3, 3, 3, 1], [1, 2, 2, 3, 3, 3, 1], [1, 1, 1, 1, 1, 1, 1]]) Nr� rT r r )r� r& r= r( r7 rC r rB r? r@ r* �isscalarr r� ) rd r� r� r, rP r� r� r- r2 �szs r# r r � s� � �n �|� �)�i�.?��J�K�K�K�� ��M�)�,�,� � �e�U�4��r�%:�%:�$;�$-�N�%3� 4� 4� 5� �� ��M�)�,�,� � �e�U�4��r�%:�%:�$;�$-�N�%3� 4� 4� 5� � �M�%� � �E� � ,�V�U�Z� @� @�F��C��K�K� � � � �� �R�j�[��r� � � �� ��$�B�B� � "�� ��$�B�B� �^�D� !� !� ��B�B��b��B��A�v� � �2�J�J�J�!�O�J�J�J�� � &�u�d�I�y�'-�t�T�6�1� F� F� Fr% c � � |� |� t j dt d�� � t | |||d|||� � }t ||||||||� � S )a Multidimensional grayscale opening. A grayscale opening consists in the succession of a grayscale erosion, and a grayscale dilation. Parameters ---------- input : array_like Array over which the grayscale opening is to be computed. size : tuple of ints Shape of a flat and full structuring element used for the grayscale opening. Optional if `footprint` or `structure` is provided. footprint : array of ints, optional Positions of non-infinite elements of a flat structuring element used for the grayscale opening. structure : array of ints, optional Structuring element used for the grayscale opening. `structure` may be a non-flat structuring element. output : array, optional An array used for storing the output of the opening may be provided. mode : {'reflect', 'constant', 'nearest', 'mirror', 'wrap'}, optional The `mode` parameter determines how the array borders are handled, where `cval` is the value when mode is equal to 'constant'. Default is 'reflect' cval : scalar, optional Value to fill past edges of input if `mode` is 'constant'. Default is 0.0. origin : scalar, optional The `origin` parameter controls the placement of the filter. Default 0 Returns ------- grey_opening : ndarray Result of the grayscale opening of `input` with `structure`. See also -------- binary_opening, grey_dilation, grey_erosion, grey_closing generate_binary_structure Notes ----- The action of a grayscale opening with a flat structuring element amounts to smoothen high local maxima, whereas binary opening erases small objects. References ---------- .. [1] https://en.wikipedia.org/wiki/Mathematical_morphology Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.arange(36).reshape((6,6)) >>> a[3, 3] = 50 >>> a array([[ 0, 1, 2, 3, 4, 5], [ 6, 7, 8, 9, 10, 11], [12, 13, 14, 15, 16, 17], [18, 19, 20, 50, 22, 23], [24, 25, 26, 27, 28, 29], [30, 31, 32, 33, 34, 35]]) >>> ndimage.grey_opening(a, size=(3,3)) array([[ 0, 1, 2, 3, 4, 4], [ 6, 7, 8, 9, 10, 10], [12, 13, 14, 15, 16, 16], [18, 19, 20, 22, 22, 22], [24, 25, 26, 27, 28, 28], [24, 25, 26, 27, 28, 28]]) >>> # Note that the local maximum a[3,3] has disappeared N�&ignoring size because footprint is setr �� stacklevel)�warnings�warn� UserWarningr r � rd r� r� r, rP r� r� r- rv s r# r r f sl � �X ��y� 4�� �>� �XY�Z�Z�Z�Z� �u�d�I�y�$���V� %� %�C� ��d�I�y�&�$� �v� '� '� 'r% c � � |� |� t j dt d�� � t | |||d|||� � }t ||||||||� � S )a Multidimensional grayscale closing. A grayscale closing consists in the succession of a grayscale dilation, and a grayscale erosion. Parameters ---------- input : array_like Array over which the grayscale closing is to be computed. size : tuple of ints Shape of a flat and full structuring element used for the grayscale closing. Optional if `footprint` or `structure` is provided. footprint : array of ints, optional Positions of non-infinite elements of a flat structuring element used for the grayscale closing. structure : array of ints, optional Structuring element used for the grayscale closing. `structure` may be a non-flat structuring element. output : array, optional An array used for storing the output of the closing may be provided. mode : {'reflect', 'constant', 'nearest', 'mirror', 'wrap'}, optional The `mode` parameter determines how the array borders are handled, where `cval` is the value when mode is equal to 'constant'. Default is 'reflect' cval : scalar, optional Value to fill past edges of input if `mode` is 'constant'. Default is 0.0. origin : scalar, optional The `origin` parameter controls the placement of the filter. Default 0 Returns ------- grey_closing : ndarray Result of the grayscale closing of `input` with `structure`. See also -------- binary_closing, grey_dilation, grey_erosion, grey_opening, generate_binary_structure Notes ----- The action of a grayscale closing with a flat structuring element amounts to smoothen deep local minima, whereas binary closing fills small holes. References ---------- .. [1] https://en.wikipedia.org/wiki/Mathematical_morphology Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.arange(36).reshape((6,6)) >>> a[3,3] = 0 >>> a array([[ 0, 1, 2, 3, 4, 5], [ 6, 7, 8, 9, 10, 11], [12, 13, 14, 15, 16, 17], [18, 19, 20, 0, 22, 23], [24, 25, 26, 27, 28, 29], [30, 31, 32, 33, 34, 35]]) >>> ndimage.grey_closing(a, size=(3,3)) array([[ 7, 7, 8, 9, 10, 11], [ 7, 7, 8, 9, 10, 11], [13, 13, 14, 15, 16, 17], [19, 19, 20, 20, 22, 23], [25, 25, 26, 27, 28, 29], [31, 31, 32, 33, 34, 35]]) >>> # Note that the local minimum a[3,3] has disappeared Nr� r r� )r� r� r� r r r� s r# r r � sl � �X ��y� 4�� �>� �XY�Z�Z�Z�Z� ��t�Y� �4�� �f� &� &�C� ��T�9�i��� �f� &� &� &r% c �� � t | |||d|||� � }t |t j � � r,t | |||||||� � t j |||� � S |t | |||d|||� � z S )a8 Multidimensional morphological gradient. The morphological gradient is calculated as the difference between a dilation and an erosion of the input with a given structuring element. Parameters ---------- input : array_like Array over which to compute the morphlogical gradient. size : tuple of ints Shape of a flat and full structuring element used for the mathematical morphology operations. Optional if `footprint` or `structure` is provided. A larger `size` yields a more blurred gradient. footprint : array of ints, optional Positions of non-infinite elements of a flat structuring element used for the morphology operations. Larger footprints give a more blurred morphological gradient. structure : array of ints, optional Structuring element used for the morphology operations. `structure` may be a non-flat structuring element. output : array, optional An array used for storing the output of the morphological gradient may be provided. mode : {'reflect', 'constant', 'nearest', 'mirror', 'wrap'}, optional The `mode` parameter determines how the array borders are handled, where `cval` is the value when mode is equal to 'constant'. Default is 'reflect' cval : scalar, optional Value to fill past edges of input if `mode` is 'constant'. Default is 0.0. origin : scalar, optional The `origin` parameter controls the placement of the filter. Default 0 Returns ------- morphological_gradient : ndarray Morphological gradient of `input`. See also -------- grey_dilation, grey_erosion, gaussian_gradient_magnitude Notes ----- For a flat structuring element, the morphological gradient computed at a given point corresponds to the maximal difference between elements of the input among the elements covered by the structuring element centered on the point. References ---------- .. [1] https://en.wikipedia.org/wiki/Mathematical_morphology Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.zeros((7,7), dtype=int) >>> a[2:5, 2:5] = 1 >>> ndimage.morphological_gradient(a, size=(3,3)) array([[0, 0, 0, 0, 0, 0, 0], [0, 1, 1, 1, 1, 1, 0], [0, 1, 1, 1, 1, 1, 0], [0, 1, 1, 0, 1, 1, 0], [0, 1, 1, 1, 1, 1, 0], [0, 1, 1, 1, 1, 1, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> # The morphological gradient is computed as the difference >>> # between a dilation and an erosion >>> ndimage.grey_dilation(a, size=(3,3)) -\ ... ndimage.grey_erosion(a, size=(3,3)) array([[0, 0, 0, 0, 0, 0, 0], [0, 1, 1, 1, 1, 1, 0], [0, 1, 1, 1, 1, 1, 0], [0, 1, 1, 0, 1, 1, 0], [0, 1, 1, 1, 1, 1, 0], [0, 1, 1, 1, 1, 1, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> a = np.zeros((7,7), dtype=int) >>> a[2:5, 2:5] = 1 >>> a[4,4] = 2; a[2,3] = 3 >>> a array([[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 3, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 2, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0]]) >>> ndimage.morphological_gradient(a, size=(3,3)) array([[0, 0, 0, 0, 0, 0, 0], [0, 1, 3, 3, 3, 1, 0], [0, 1, 3, 3, 3, 1, 0], [0, 1, 3, 2, 3, 2, 0], [0, 1, 1, 2, 2, 2, 0], [0, 1, 1, 2, 2, 2, 0], [0, 0, 0, 0, 0, 0, 0]]) N)r r] r& r^ r �subtractr� s r# r r s� � �N ��t�Y� �4�� �f� &� &�C��&�%�-�(�(� >��U�D�)�Y����6� #� #� #��~�c�6�6�2�2�2��l�5�$� �9�#'��t�V�=� =� =� >r% c �� � t | |||d|||� � }t |t j � � rXt | |||||||� � t j |||� � t j || |� � t j || |� � S t | |||d|||� � } t j || | � � t j | | | � � t j | | | � � | S )a� Multidimensional morphological laplace. Parameters ---------- input : array_like Input. size : int or sequence of ints, optional See `structure`. footprint : bool or ndarray, optional See `structure`. structure : structure, optional Either `size`, `footprint`, or the `structure` must be provided. output : ndarray, optional An output array can optionally be provided. mode : {'reflect','constant','nearest','mirror', 'wrap'}, optional The mode parameter determines how the array borders are handled. For 'constant' mode, values beyond borders are set to be `cval`. Default is 'reflect'. cval : scalar, optional Value to fill past edges of input if mode is 'constant'. Default is 0.0 origin : origin, optional The origin parameter controls the placement of the filter. Returns ------- morphological_laplace : ndarray Output N)r r] r& r^ r rL r� ) rd r� r� r, rP r� r� r- r �tmp2s r# r r � s� � �D ���i��D�$� �v� '� '�D��&�%�-�(�(� ��U�D�)�Y����6� #� #� #� � �$���'�'�'� ��v�u�f�-�-�-��~�f�e�V�4�4�4��E�4��I�t�T� �&�*� *�� � �$��d�#�#�#� ��t�U�D�)�)�)� ��t�U�D�)�)�)�� r% c �X � |� |� t j dt d�� � t | |||d|||� � }t ||||||||� � }|�|}| j t j k r-|j t j k rt j | ||�� � nt j | ||�� � |S )a� Multidimensional white tophat filter. Parameters ---------- input : array_like Input. size : tuple of ints Shape of a flat and full structuring element used for the filter. Optional if `footprint` or `structure` is provided. footprint : array of ints, optional Positions of elements of a flat structuring element used for the white tophat filter. structure : array of ints, optional Structuring element used for the filter. `structure` may be a non-flat structuring element. output : array, optional An array used for storing the output of the filter may be provided. mode : {'reflect', 'constant', 'nearest', 'mirror', 'wrap'}, optional The `mode` parameter determines how the array borders are handled, where `cval` is the value when mode is equal to 'constant'. Default is 'reflect' cval : scalar, optional Value to fill past edges of input if `mode` is 'constant'. Default is 0.0. origin : scalar, optional The `origin` parameter controls the placement of the filter. Default is 0. Returns ------- output : ndarray Result of the filter of `input` with `structure`. Examples -------- Subtract gray background from a bright peak. >>> from scipy.ndimage import generate_binary_structure, white_tophat >>> import numpy as np >>> square = generate_binary_structure(rank=2, connectivity=3) >>> bright_on_gray = np.array([[2, 3, 3, 3, 2], ... [3, 4, 5, 4, 3], ... [3, 5, 9, 5, 3], ... [3, 4, 5, 4, 3], ... [2, 3, 3, 3, 2]]) >>> white_tophat(input=bright_on_gray, structure=square) array([[0, 0, 0, 0, 0], [0, 0, 1, 0, 0], [0, 1, 5, 1, 0], [0, 0, 1, 0, 0], [0, 0, 0, 0, 0]]) See also -------- black_tophat Nr� r r� �rE ) r� r� r� r r rH r& �bool_� bitwise_xorr� r� s r# r r � s� � �x ��y� 4�� �>� �XY�Z�Z�Z�Z� �u�d�I�y�$���V� %� %�C� ��T�9�i��� �f� &� &�C� �{��� �{�e�k�!�!�c�i�5�;�&>�&>� ��%��#�.�.�.�.�.� ��u�c�s�+�+�+�+� �Jr% c �X � |� |� t j dt d�� � t | |||d|||� � }t ||||||||� � }|�|}| j t j k r-|j t j k rt j || |�� � nt j || |�� � |S )a Multidimensional black tophat filter. Parameters ---------- input : array_like Input. size : tuple of ints, optional Shape of a flat and full structuring element used for the filter. Optional if `footprint` or `structure` is provided. footprint : array of ints, optional Positions of non-infinite elements of a flat structuring element used for the black tophat filter. structure : array of ints, optional Structuring element used for the filter. `structure` may be a non-flat structuring element. output : array, optional An array used for storing the output of the filter may be provided. mode : {'reflect', 'constant', 'nearest', 'mirror', 'wrap'}, optional The `mode` parameter determines how the array borders are handled, where `cval` is the value when mode is equal to 'constant'. Default is 'reflect' cval : scalar, optional Value to fill past edges of input if `mode` is 'constant'. Default is 0.0. origin : scalar, optional The `origin` parameter controls the placement of the filter. Default 0 Returns ------- black_tophat : ndarray Result of the filter of `input` with `structure`. Examples -------- Change dark peak to bright peak and subtract background. >>> from scipy.ndimage import generate_binary_structure, black_tophat >>> import numpy as np >>> square = generate_binary_structure(rank=2, connectivity=3) >>> dark_on_gray = np.array([[7, 6, 6, 6, 7], ... [6, 5, 4, 5, 6], ... [6, 4, 0, 4, 6], ... [6, 5, 4, 5, 6], ... [7, 6, 6, 6, 7]]) >>> black_tophat(input=dark_on_gray, structure=square) array([[0, 0, 0, 0, 0], [0, 0, 1, 0, 0], [0, 1, 5, 1, 0], [0, 0, 1, 0, 0], [0, 0, 0, 0, 0]]) See also -------- white_tophat, grey_opening, grey_closing Nr� r r� r� ) r� r� r� r r rH r& r� r� r� r� s r# r r � s� � �z ��y� 4�� �>� �XY�Z�Z�Z�Z� ��t�Y� �4�� �f� &� &�C� �s�D�)�Y����V� %� %�C� �{��� �{�e�k�!�!�c�i�5�;�&>�&>� ��#�u�#�.�.�.�.�.� ��s�E�s�+�+�+�+� �Jr% � euclideanTc �� � t |t j � � }t |t j � � }t ||||� � t j | � � dk } t | j | j � � } t | | � � } t j | | � � } | � t j � � | � t j � � z } |� � � }|dk rd}n |dv rd}n|dk rd}nt d� � �|�Zt j || j � � }t j |t j � � � }|j j s|� � � }|r&t j | j t j � � � } nd } |r�|�R|dk r&t j | j t j � � � } n�t j | j t j � � � } n}|j | j k rt d � � �|dk r*|j j t j k rt d � � �n)|j j t j k rt d � � �|} nd } t3 j | ||| | � � |r�t |t j � � rT|j j t j k rt d� � �|j | j f| j z k rt d� � �|} n%t j | j t j � � � } t j | � � } t; | j d � � D ]7}t j | |df � � | }| j |_ || |df< �8| } g }|r|s|� | � � |r|s|� | � � t? |� � dk rtA |� � S t? |� � dk r|d S d S )a� Distance transform function by a brute force algorithm. This function calculates the distance transform of the `input`, by replacing each foreground (non-zero) element, with its shortest distance to the background (any zero-valued element). In addition to the distance transform, the feature transform can be calculated. In this case the index of the closest background element to each foreground element is returned in a separate array. Parameters ---------- input : array_like Input metric : {'euclidean', 'taxicab', 'chessboard'}, optional 'cityblock' and 'manhattan' are also valid, and map to 'taxicab'. The default is 'euclidean'. sampling : float, or sequence of float, optional This parameter is only used when `metric` is 'euclidean'. Spacing of elements along each dimension. If a sequence, must be of length equal to the input rank; if a single number, this is used for all axes. If not specified, a grid spacing of unity is implied. return_distances : bool, optional Whether to calculate the distance transform. Default is True. return_indices : bool, optional Whether to calculate the feature transform. Default is False. distances : ndarray, optional An output array to store the calculated distance transform, instead of returning it. `return_distances` must be True. It must be the same shape as `input`, and of type float64 if `metric` is 'euclidean', uint32 otherwise. indices : int32 ndarray, optional An output array to store the calculated feature transform, instead of returning it. `return_indicies` must be True. Its shape must be `(input.ndim,) + input.shape`. Returns ------- distances : ndarray, optional The calculated distance transform. Returned only when `return_distances` is True and `distances` is not supplied. It will have the same shape as the input array. indices : int32 ndarray, optional The calculated feature transform. It has an input-shaped array for each dimension of the input. See distance_transform_edt documentation for an example. Returned only when `return_indices` is True and `indices` is not supplied. Notes ----- This function employs a slow brute force algorithm, see also the function distance_transform_cdt for more efficient taxicab and chessboard algorithms. r r� r ��taxicab� cityblock� manhattanr � chessboardrI z distance metric not supportedNrG � distances array has wrong shape� distances array must be float64z distances array must be uint32�indices array must be int32� indices array has wrong shape.)!r] r& r^ � _distance_tranform_arg_checkr= r rC r � logical_xor�astypera �lowerrY r rB �float64rZ r[ r> rA r* �int32�uint32rH �typer r rK �ravelr? �appendr@ r( )rd �metric�sampling�return_distances�return_indices� distancesrK � ft_inplace� dt_inplacer �structr� �ft�dtr2 �rtmpr� s r# r r L s� � �@ �G�U�]�3�3�J��I�u�}�5�5�J� ��J� 0�.�� � � �=�� � �1� $�D� &�t�y�$�)� <� <�F� �4�� (� (�D� � �T�4� (� (�D� �;�;�u�z� "� "�T�[�[���%<�%<� <�D� �\�\�^�^�F� �� � ���� �8� 8� 8���� �<� � �����:�;�;�;��� �2�8�T�Y�G�G���=��� �?�?�?���~�(� '� �}�}���H�� � �[���5�;� 7� 7� 7��� ��� � � ���{�{��[���5�=�A�A�A����[���5�<�@�@�@�����$�*�,�,�"�#D�E�E�E���{�{� �?�'�5�=�8�8�&�'H�I�I�I� 9� �?�'�5�<�7�7�&�'G�H�H�H��B�B� �� �#�D�&�(�B��C�C�C�� � �g�u�}� -� -� @��}�!�U�[�0�0�"�#@�A�A�A��}��� �t�z� 9�9�9�"�#B�C�C�C��D�D��=���5�;�?�?�?�D� �[��_�_���� �1� �&�&� !� !�B��;�t�B��G�}�-�-�b�1�D� ��D�J� �D��S��M�M� �� �F�� � � �� � �b����� �j� �� � �b���� �6�{�{�a����V�}�}� � �V���� � ��a�y���tr% r� c �x � t |t j � � }t |t j � � }t ||||� � t j | � � } |dv r| j }t |d� � }nu|dk r| j }t ||� � }nW t j |� � }n"# t $ r} t d� � | �d} ~ ww xY w|j D ]} | dk rt d� � ��|j j s|� � � }|r�|j j t j k rt d� � �|j | j k rt d � � �|} t j | d d � � � t j � � | d < n3t j | d d � � � t j � � } | j }|rHt j | j d � � � } t j | t j �� � } | j | _ nd} t) j || | � � | t- t/ ddd � � g|z � � } |r(| t- t/ ddd � � g|z � � } t) j || | � � | t- t/ ddd � � g|z � � } |�r | t- t/ ddd � � g|z � � } t j | � � } |rT|j j t j k rt d� � �|j | j f| j z k rt d� � �|}n%t j | j t j �� � }t5 |j d � � D ]7}t j ||d f � � | }| j |_ |||d f< �8|} g }|r|s|� | � � |r|s|� | � � t9 |� � dk rt- |� � S t9 |� � dk r|d S dS )a Distance transform for chamfer type of transforms. In addition to the distance transform, the feature transform can be calculated. In this case the index of the closest background element to each foreground element is returned in a separate array. Parameters ---------- input : array_like Input metric : {'chessboard', 'taxicab'} or array_like, optional The `metric` determines the type of chamfering that is done. If the `metric` is equal to 'taxicab' a structure is generated using generate_binary_structure with a squared distance equal to 1. If the `metric` is equal to 'chessboard', a `metric` is generated using generate_binary_structure with a squared distance equal to the dimensionality of the array. These choices correspond to the common interpretations of the 'taxicab' and the 'chessboard' distance metrics in two dimensions. A custom metric may be provided, in the form of a matrix where each dimension has a length of three. 'cityblock' and 'manhattan' are also valid, and map to 'taxicab'. The default is 'chessboard'. return_distances : bool, optional Whether to calculate the distance transform. Default is True. return_indices : bool, optional Whether to calculate the feature transform. Default is False. distances : int32 ndarray, optional An output array to store the calculated distance transform, instead of returning it. `return_distances` must be True. It must be the same shape as `input`. indices : int32 ndarray, optional An output array to store the calculated feature transform, instead of returning it. `return_indicies` must be True. Its shape must be `(input.ndim,) + input.shape`. Returns ------- distances : int32 ndarray, optional The calculated distance transform. Returned only when `return_distances` is True, and `distances` is not supplied. It will have the same shape as the input array. indices : int32 ndarray, optional The calculated feature transform. It has an input-shaped array for each dimension of the input. See distance_transform_edt documentation for an example. Returned only when `return_indices` is True, and `indices` is not supplied. r� r r� zinvalid metric providedNrI z metric sizes must be equal to 3z distances must be of int32 typezdistances has wrong shaperT r .rR rG r� r� r ) r] r& r^ r� r= rC r � ExceptionrY r* rZ r[ r> rH r� r� �wherer� r\ �aranger �distance_transform_opr( r7 r� rK r? r� r@ )rd r� r� r� r� rK r� r� rN ri �sr� r� r� rv r2 r� r� s r# r r � s? � �r �G�U�]�3�3�J��I�u�}�5�5�J� ��J� 0�.�� � � �M�%� � �E� �6�6�6��z��*�4��3�3��� �<� � ��z��*�4��6�6��� A��]�6�*�*�F�F��� A� A� A� � 8�9�9�q� @����� A����� � F� F�A��A�v�v�"�#D�E�E�E� � �<� "� ���� � ��� ;� �?� �5�;� .� .� � @�A�A� A� �?�e�k� )� )� � :�;�;� ;� ���+�e�R��+�+�2�2�5�;�?�?��3��� �[���A� &� &� -� -�e�k� :� :�� �7�D�� � �Z���q� )� )� )�� �\�"�E�K� 0� 0� 0���8���� �� �#�F�B��3�3�3� �E�5��t�R�(�(�)�D�0� 1� 1� 2�B�� 7� ��u�T�4��,�,�-��4�5�5� 6�� �#�F�B��3�3�3� �E�5��t�R�(�(�)�D�0� 1� 1� 2�B�� � ��u�T�4��,�,�-��4�5�5� 6�� �[��_�_�� � =��}�!�U�[�0�0�"�#@�A�A�A��}��� �R�X� 5�5�5�"�#B�C�C�C��C�C��-���� �<�<�<�C��� �!� �%�%� � �B��;�s�2�s�7�|�,�,�R�0�D���D�J� �C��C��L�L� �� �F�� � � �� � �b����� �j� �� � �b���� �6�{�{�a����V�}�}� � �V���� � ��a�y���ts �B+ �+ C �5C�C c �~ � t |t j � � }t |t j � � }t ||||� � t j t j | dd� � � t j � � � � } |�Zt j || j � � }t j |t j �� � }|j j s|� � � }|rT|}|j | j f| j z k rt# d� � �|j j t j k rt# d� � �n.t j | j f| j z t j �� � }t- j | ||� � |�rG|t j | j |j �� � z } | � t j � � } |�7t3 t5 |� � � � D ]} | | dfxx || z cc< �t j | | | � � |rt j � | d�� � } |j | j k rt# d � � �|j j t j k rt# d � � �t j | |� � n5t j � | d�� � } t j | � � } g } |r|s| � | � � |r|s| � |� � t5 | � � d k rtA | � � S t5 | � � dk r| d S dS ) a� Exact Euclidean distance transform. In addition to the distance transform, the feature transform can be calculated. In this case the index of the closest background element to each foreground element is returned in a separate array. Parameters ---------- input : array_like Input data to transform. Can be any type but will be converted into binary: 1 wherever input equates to True, 0 elsewhere. sampling : float, or sequence of float, optional Spacing of elements along each dimension. If a sequence, must be of length equal to the input rank; if a single number, this is used for all axes. If not specified, a grid spacing of unity is implied. return_distances : bool, optional Whether to calculate the distance transform. Default is True. return_indices : bool, optional Whether to calculate the feature transform. Default is False. distances : float64 ndarray, optional An output array to store the calculated distance transform, instead of returning it. `return_distances` must be True. It must be the same shape as `input`. indices : int32 ndarray, optional An output array to store the calculated feature transform, instead of returning it. `return_indicies` must be True. Its shape must be `(input.ndim,) + input.shape`. Returns ------- distances : float64 ndarray, optional The calculated distance transform. Returned only when `return_distances` is True and `distances` is not supplied. It will have the same shape as the input array. indices : int32 ndarray, optional The calculated feature transform. It has an input-shaped array for each dimension of the input. See example below. Returned only when `return_indices` is True and `indices` is not supplied. Notes ----- The Euclidean distance transform gives values of the Euclidean distance:: n y_i = sqrt(sum (x[i]-b[i])**2) i where b[i] is the background point (value 0) with the smallest Euclidean distance to input points x[i], and n is the number of dimensions. Examples -------- >>> from scipy import ndimage >>> import numpy as np >>> a = np.array(([0,1,1,1,1], ... [0,0,1,1,1], ... [0,1,1,1,1], ... [0,1,1,1,0], ... [0,1,1,0,0])) >>> ndimage.distance_transform_edt(a) array([[ 0. , 1. , 1.4142, 2.2361, 3. ], [ 0. , 0. , 1. , 2. , 2. ], [ 0. , 1. , 1.4142, 1.4142, 1. ], [ 0. , 1. , 1.4142, 1. , 0. ], [ 0. , 1. , 1. , 0. , 0. ]]) With a sampling of 2 units along x, 1 along y: >>> ndimage.distance_transform_edt(a, sampling=[2,1]) array([[ 0. , 1. , 2. , 2.8284, 3.6056], [ 0. , 0. , 1. , 2. , 3. ], [ 0. , 1. , 2. , 2.2361, 2. ], [ 0. , 1. , 2. , 1. , 0. ], [ 0. , 1. , 1. , 0. , 0. ]]) Asking for indices as well: >>> edt, inds = ndimage.distance_transform_edt(a, return_indices=True) >>> inds array([[[0, 0, 1, 1, 3], [1, 1, 1, 1, 3], [2, 2, 1, 3, 3], [3, 3, 4, 4, 3], [4, 4, 4, 4, 4]], [[0, 0, 1, 1, 4], [0, 1, 1, 1, 4], [0, 0, 1, 4, 4], [0, 0, 3, 3, 4], [0, 0, 3, 3, 4]]]) With arrays provided for inplace outputs: >>> indices = np.zeros(((np.ndim(a),) + a.shape), dtype=np.int32) >>> ndimage.distance_transform_edt(a, return_indices=True, indices=indices) array([[ 0. , 1. , 1.4142, 2.2361, 3. ], [ 0. , 0. , 1. , 2. , 2. ], [ 0. , 1. , 1.4142, 1.4142, 1. ], [ 0. , 1. , 1.4142, 1. , 0. ], [ 0. , 1. , 1. , 0. , 0. ]]) >>> indices array([[[0, 0, 1, 1, 3], [1, 1, 1, 1, 3], [2, 2, 1, 3, 3], [3, 3, 4, 4, 3], [4, 4, 4, 4, 4]], [[0, 0, 1, 1, 4], [0, 1, 1, 1, 4], [0, 0, 1, 4, 4], [0, 0, 3, 3, 4], [0, 0, 3, 3, 4]]]) r r NrG r� r� .rR r� r� r )!r] r& r^ r� � atleast_1dr� r� ra r rB rC r= r� rZ r[ r> r* rY rH r� r� rA r �euclidean_feature_transformrK r? r@ �multiplyrL rM �sqrtr� r( ) rd r� r� r� r� rK r� r� r� r� r2 r� s r# r r d s � �t �G�U�]�3�3�J��I�u�}�5�5�J� ��J� 0�.�� � � � �U�[���1� 5� 5� <� <�U�Z� H� H� I� I�E��� �2�8�U�Z�H�H���=��� �?�?�?���~�(� '� �}�}���H�� I� �� �8�� �}�u�{�2� 2� 2� � >�?�?� ?� �8�=�E�K� '� '� � <�=�=� =� (� �[�%�*� ���4�E�K� H� H� H�� �)�%��2�>�>�>�� � �%�-�� �2�8�<�<�<� <�� �Y�Y�u�}� %� %�� � ��C��M�M�*�*� ,� ,���2�s�7� � � �x��|�+� � � � � ��r�2�r�"�"�"� � ���!�!�"�1�!�-�-�B���"�(�*�*�"�#D�E�E�E���#�u�}�4�4�"�#D�E�E�E� �J�r�9� %� %� %� %���!�!�"�1�!�-�-�B���B� � �B� �F�� � � �� � �b����� �j� �� � �b���� �6�{�{�a����V�}�}� � �V���� � ��a�y���tr% c �� � g }|s|s|� d� � | r|s|� d� � |r|s|� d� � |r"t d� |� � � � �dS )z1Raise a RuntimeError if the arguments are invalidz<at least one of return_distances/return_indices must be Truez6return_distances must be True if distances is suppliedz2return_indices must be True if indices is suppliedz, N)r� rY �join)� distances_out� indices_outr� r� � error_msgss r# r� r� s� � � �J� � L�~� L���� J� L� L� L�� � -� ���� D� � � � � P�>� P����N�O�O�O�� 2��4�9�9�Z�0�0�1�1�1�2� 2r% r6 )Nr NNr r F)Nr Nr Nr F)NNNr N)NNNr r )NNr )NNNNr� r� r )r� NTFNN)r� TFNN)NTFNN) r� rU r& � r r r �__all__r/ r r rq r r r r r r r r r r r r r r r r r r r� r r% r# �<module>r� sE ��> ���� ���� � � � � � � � � � � � � � � � � � � � � � � %� %� %��!� !� !�B� B� B� B�JY"� Y"� Y"�xJ� J� J�Z KO�9>�_I� _I� _I� _I�D ?C�89� %�BI� BI� BI� BI�J @D�DI�y>� y>� y>� y>�x @D�DI�P=� P=� P=� P=�f ;?�7;�k/� k/� k/� k/�\ 48�;<�A1� A1� A1� A1�HR� R� R� R�j >B�?@�lF� lF� lF� lF�^ ?C�@A�RF� RF� RF� RF�j >B�?@�Q'� Q'� Q'� Q'�h >B�?@�Q&� Q&� Q&� Q&�h HL�IJ�o>� o>� o>� o>�d 7;�15�;<�0� 0� 0� 0�f >B�?@�I� I� I� I�X .2�3<�"#�J� J� J� J�Z ?C�@E�26�M� M� M� M�` IM�IM�E� E� E� E�P CG�IM�q� q� q� q�h2� 2� 2� 2� 2r%
Save File
Cancel