getpatch
import time
import os
import math
import sys
import os,os.path,shutil
import numpy as np
import cv2 img_in_path = 'F:/project/Breast/InBreast/INBreast/removeother/'
# img_in_path = 'F:/project/Breast/InBreast/INBreast/imgtest/'
outpathimgyes = 'F:/project/Breast/InBreast/INBreast/outimgpatch/calcification/'
outpathimgno = 'F:/project/Breast/InBreast/INBreast/outimgpatch/no/'
txtPath = 'F:/project/Breast/InBreast/INBreast/AllTXTall/'
# txtPath = 'F:/project/Breast/InBreast/INBreast/ALLtest/'
outpathtxt = 'F:/project/Breast/InBreast/INBreast/outtxtpatch/'
txtType = 'txt'
txtLists = os.listdir(txtPath) #列出文件夹下所有的目录与文件 # Read all points into a list(before 21:30,715) for filename in txtLists:
pp = 0
ppp = 0
with open(txtPath + filename, 'r') as file:
print(filename)
lines = file.readlines()
dataset = [[] for i in range(len(lines))]
for i in range(len(dataset)):
dataset[i][:] = (item for item in lines[i].strip().split(',')) # 逐行读取数据
#print("dateset:", dataset)
# print(type(dataset[0][0]))
# print(dataset.__sizeof__())
u = np.array(dataset)
list = np.zeros((u.shape[0], 2))
for i in range(u.shape[0]):
# print(u[i,0][0])
findNumber = u[i,0].find(" ")
# print(findNumber)
list[i,0] = round(float(u[i, 0][0:findNumber]))
list[i,1] = round(float(u[i, 0][findNumber+1:])) # Read the same name image(before 21:30,715)
img = img_in_path + filename[:-4] + '.png' # out_path
img = cv2.imread(img)
black = np.zeros((img.shape[0], img.shape[1]))
for i in range(img.shape[0]):
for j in range(img.shape[1]):
if img[i,j][0] == 0 and img[i,j][1] == 0 and img[i,j][2] == 0:
black[i][j] = 1
print(img.shape[0],img.shape[1])
# Cutting distance has been determined, Handling cutting details(before 22.30, 715)
row = img.shape[0]/56;
col = img.shape[1]/56;
print(row,col) # 待考虑问题:黑色像素
for i in range(int(row-1)):
# print(i)
for j in range(int(col-1)):
tt = 0
pb = np.sum(black[i * 56:i * 56 + 112,j * 56:j * 56 + 112]) / 12544
# print("top_left:", i*56, j*56)
# print("bottom_right:",i*56+112,j*56+112)
for k in range(u.shape[0]):
if j*56<list[k,0]<j*56+112 and i*56<list[k,1]<i*56+112:
tt = tt + 1
patch_label = np.zeros((tt, 4))
tt1 = 0
for k in range(u.shape[0]):
if j*56<list[k,0]<j*56+112 and i*56<list[k,1]<i*56+112:
patch_label[tt1,0] = list[k,0] - j*56
patch_label[tt1,1] = list[k,1] - i*56
patch_label[tt1,2] = list[k,0]
patch_label[tt1,3] = list[k,1]
tt1 = tt1 + 1
if tt>0 and pb == 0:
patch = img[i * 56:i * 56 + 112,j * 56:j * 56 + 112]
pp = pp + 1
# print(patch.shape)
outputimg = outpathimgyes + '/' + filename[:-4] + '/' + filename[:-4] + '_'+ str(pp) + '.png'
cv2.imwrite(outputimg, patch)
outputtxt1 = outpathtxt + '/' + filename[:-4] + '/' + filename[:-4] + '_' + str(pp) + '.txt'
np.savetxt(outputtxt1, patch_label, fmt='%f')
if tt==0 and pb == 0:
patch = img[i * 56:i * 56 + 112,j * 56:j * 56 + 112]
ppp = ppp + 1
# print(patch.shape)
outputimg1 = outpathimgno + '/' + filename[:-4] + '/' + filename[:-4] + '_' + str(ppp) + '.png'
cv2.imwrite(outputimg1, patch) print(img.shape[0], img.shape[1])
print(pp,ppp) for i in range(int(row-1)):
tt = 0
pb = np.sum(black[i * 56:i * 56 + 112, img.shape[1] - 113:img.shape[1]-1]) / 12544
# print("top_right:",i*56,img.shape[1]-1)
# print("bottom_left:", i * 56+112, img.shape[1] - 113)
for k in range(u.shape[0]):
if img.shape[1] - 113 < list[k, 0] < img.shape[1]-1 and i * 56 < list[k, 1] < i * 56 + 112:
tt = tt + 1
patch_label = np.zeros((tt, 4))
tt1 = 0
# print(tt)
for k in range(u.shape[0]):
if img.shape[1] - 113 < list[k, 0] < img.shape[1]-1 and i * 56 < list[k, 1] < i * 56 + 112:
patch_label[tt1, 0] = list[k, 0] - j * 56
patch_label[tt1, 1] = list[k, 1] - i * 56
patch_label[tt1, 2] = list[k, 0]
patch_label[tt1, 3] = list[k, 1]
tt1 = tt1 + 1
if tt > 0 and pb == 0.1:
patch = img[i * 56:i * 56 + 112, img.shape[1] - 113:img.shape[1]-1]
pp = pp + 1
# print(patch.shape)
outputimg = outpathimgyes + '/' + filename[:-4] + '/' + filename[:-4] + '_' + str(pp) + '.png'
cv2.imwrite(outputimg, patch)
outputtxt1 = outpathtxt + '/' + filename[:-4] + '/' + filename[:-4] + '_' + str(pp) + '.txt'
np.savetxt(outputtxt1, patch_label, fmt='%f')
if tt == 0 and pb == 0:
patch = img[i * 56:i * 56 + 112, img.shape[1] - 113:img.shape[1]-1]
ppp = ppp + 1
# print(patch.shape)
outputimg1 = outpathimgno + '/' + filename[:-4] + '/' + filename[:-4] + '_' + str(ppp) + '.png'
cv2.imwrite(outputimg1, patch)
print(img.shape[0], img.shape[1])
#
#
#
for j in range(int(col-1)):
# print("bottom_left:", img.shape[0]-1, j*56)
# print("top_right:", img.shape[0] - 113, j * 56+112, )
tt = 0
pb = np.sum(black[img.shape[0]-113:img.shape[0] - 1, j * 56:j * 56+112]) / 12544
# print("top_right:",i*56,img.shape[1]-1)
# print("bottom_left:", i * 56+112, img.shape[1] - 113)
for k in range(u.shape[0]):
if j * 56 < list[k, 0] < j * 56+112 and img.shape[0]-113 < list[k, 1] < img.shape[0]-1:
tt = tt + 1
patch_label = np.zeros((tt, 4))
tt1 = 0
# print(tt)
for k in range(u.shape[0]):
if j * 56 < list[k, 0] < j * 56+112 and img.shape[0]-113 < list[k, 1] < img.shape[0]-1:
patch_label[tt1, 0] = list[k, 0] - j * 56
patch_label[tt1, 1] = list[k, 1] - i * 56
patch_label[tt1, 2] = list[k, 0]
patch_label[tt1, 3] = list[k, 1]
tt1 = tt1 + 1
if tt > 0 and pb == 0:
patch = img[img.shape[0]-113:img.shape[0] - 1, j * 56:j * 56+112]
pp = pp + 1
# print(patch.shape)
outputimg = outpathimgyes + '/' + filename[:-4] + '/' + filename[:-4] + '_' + str(pp) + '.png'
cv2.imwrite(outputimg, patch)
outputtxt1 = outpathtxt + '/' + filename[:-4] + '/' + filename[:-4] + '_' + str(pp) + '.txt'
np.savetxt(outputtxt1, patch_label, fmt='%f')
if tt == 0 and pb == 0:
patch = img[img.shape[0]-113:img.shape[0] - 1, j * 56:j * 56+112]
ppp = ppp + 1
# print(patch.shape)
outputimg1 = outpathimgno + '/' + filename[:-4] + '/' + filename[:-4] + '_' + str(ppp) + '.png'
cv2.imwrite(outputimg1, patch)
# print(img.shape[0], img.shape[1]) # A = np.array([[1, 2], [3, 4], [5, 6]])
# print(np.sum(A))
print(pp)
getpatch的更多相关文章
- Android系统Recovery工作原理之使用update.zip升级过程分析(一)
通过分析update.zip包在具体Android系统升级的过程,来理解Android系统中Recovery模式服务的工作原理.我们先从update.zip包的制作开始,然后是Android系统的启动 ...
- Amazon API Gateway Importer整合过程小结
(1)需要将swagger json转换成amazon api gateway 所需要的格式(根据Method Request中 Request PathsURL Query String Param ...
- 深入了解Libgdx中间Skin分类
文不是直接翻译.. . 本文在Libgdx的官方wiki的基础上,加上一些自己的理解.所以,难免会一些甚至是非常多的理解非常片面的东西.写的不好,还请见谅.... 事实上 事实上.在LibGDX的官方 ...
- recovery 差分升级包制作超时
我们在对android系统升级的时候,可以减少升级包的大小,只升级差异部分,也就是差分包升级,相关的描述可以参考:http://blog.csdn.net/csdn66_2016/article/de ...
- recovery 差分升级包制作超时【转】
本文转载自:https://blog.csdn.net/csdn66_2016/article/details/73800349 我们在对android系统升级的时候,可以减少升级包的大小,只升级差异 ...
- centos 6.4安装杀毒软件clamAV 0.98[转]
原文出处: http://dnuser.blog.51cto.com/4863891/1303829 1.查看系统版本 [root@local]# lsb_release -a LSB Versi ...
- Android系统Recovery工作原理之使用update.zip升级过程分析(一)---update.zip包的制作【转】
本文转载自:http://blog.csdn.net/mu0206mu/article/details/7399822 这篇及以后的篇幅将通过分析update.zip包在具体Android系统升级的过 ...
随机推荐
- git集成idea
1.Git Gui的使用 2.Ssh key 介绍及使用 3.Idea配置使用并使用git Git Gui的使用 Ssh key 介绍及使用 Ssh key介绍 我理解的就是每台电脑上会产生出一个ss ...
- 06. Go 语言结构体
Go语言结构体(struct) Go 语言通过用自定义的方式形成新的类型,结构体是类型中带有成员的复合类型.Go 语言使用结构体和结构体成员来描述真实世界的实体和实体对应的各种属性. Go 语言中的类 ...
- 剑指Offer-35.两个链表的第一个公共结点(C++/Java)
题目: 输入两个链表,找出它们的第一个公共结点. 分析: 先统计两个链表的长度,计算他们的差值,然后将两个链表对齐,再去寻找公共节点即可. 程序: C++ class Solution { publi ...
- Win32 程序开发:创建一个应用程序窗口
一.创建一个应用程序窗口 代码如下: // 头文件 #include <windows.h> // 全局变量 WCHAR g_lpszClassName[] = L"CLASSN ...
- 使用configparser模块进行封装,构造配置文件处理器
from configparser import ConfigParser class HandleConfig: ''' 定义一个配置文件处理类 ''' def __init__(self, fil ...
- ubuntu通过代理设置update源
ubuntu更换国内源 备份/etc/apt/sources.list文件 cp /etc/apt/sources.list /etc/apt/sourses.list.backup #163源deb ...
- Java设计模式:Simple Factory(简单工厂)模式
概念定义 简单工厂(Simple Factory)模式,又称静态工厂方法(Static Factory Method)模式,即定义一个工厂类,根据传入的不同参数创建不同的产品实例,这些实例对象具有共同 ...
- 图解servlet
You can see the following illustration to better understand the lifecycle of the Servlet. When the r ...
- LOAD_DLL_DEBUG_EVENT 时读取 DllName
这句话是说 lpImageName 和 hFile 存在关联(associated),不是一定指向! 继续读后面那句,“这个数字可能为NULL,或者包含着被调试进程空间中的一个字符串地址.这个地址,相 ...
- 安装keepalived OpenSSL is not properly installed on your system. !!!
错误信息: configure: error: !!! OpenSSL is not properly installed on your system. !!! !!! Can not includ ...