SeekingForJoy
/
ComDesignProject
forked from wffjwbbf/ComDesignProject
0
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Update cmc_reid_detector.py

This commit is contained in:
wffjwbbf 2022-11-28 08:24:45 +08:00
parent f249669814
commit 20e0b047ec
1 changed files with 5 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
cmc_reid_detector.py
View File

@ -34,6 +34,8 @@ if __name__ == '__main__':
for path in query_list:
distance_dict = {}
parsed_query_id = path.split("_")[1]
parsed_query_id = parsed_query_id.split(".")[0]
parsed_query_id= int(parsed_query_id)
print(parsed_query_id)
id_feature = extractidfeature(query_path+path, extractor)
query_feature_list.append(id_feature)
@ -47,10 +49,11 @@ if __name__ == '__main__':
counter += 1
matched = sorted(distance_dict.items(), key=lambda x : x[1]) # 按特征距离排序
# 储存k从前1到前10名的是否（存在命中的ID）
temp_acck = [matched[0][0].split("_")[2]==parsed_query_id] # ID相同为True，否则False
temp_acck = [matched[0][0].split("_")[2].split(".")[0]==parsed_query_id] # ID相同为True，否则False
# 获取前k个acck情况
for i in range(1,11):
parsed_detector_id = matched[i][0].split("_")[2]
parsed_detector_id = matched[i][0].split("_")[2].split(".")[0]
parsed_detector_id=int(parsed_detector_id)
print(parsed_detector_id)# 解析出gallary的ID
temp_acck.append(parsed_detector_id==parsed_query_id or temp_acck[i-1]) # or用意是表明如果Acc(k-1)已经为True，那么Acck必然为True（递推）
print(temp_acck)