feat: hand-find js

hand-find.js

@@ -0,0 +1,238 @@
+function handDataPreprocessing(inputHandData) {
+  let inputX = [];
+  let inputY = [];
+
+  let minX = 1.0;
+  let minY = 1.0;
+  let maxX = 0.0;
+  let maxY = 0.0;
+
+  for (let idx = 0; idx < inputHandData.length; idx++) {
+    let x = inputHandData[idx].x;
+    let y = inputHandData[idx].y;
+
+    if (minX > x) {
+      minX = x;
+    }
+
+    if (minY > y) {
+      minY = y;
+    }
+
+    if (maxX < x) {
+      maxX = x;
+    }
+
+    if (maxY < y) {
+      maxY = y;
+    }
+
+    inputX[idx] = x;
+    inputY[idx] = y;
+  }
+
+  let numX = 1.0 / (maxX - minX);
+  let numY = 1.0 / (maxY - minY);
+
+  for (let idx = 0; idx < inputHandData.length; idx++) {
+    inputX[idx] = (inputX[idx] - minX) * numX;
+    inputY[idx] = (inputY[idx] - minY) * numY;
+  }
+
+  return [...inputX, ...inputY];
+}
+
+function checkCosSimilarity(inputHandData, savedHandData, isExisted, similarity) {
+  if (isExisted) {
+    if (savedHandData == null) {
+      return false;
+    }
+  } else {
+    //둘다 없는 경우
+    if (savedHandData == null) {
+      return true;
+    } else {
+      return false;
+    }
+  }
+
+  let inputHand = handDataPreprocessing(inputHandData);
+  let savedHand = handDataPreprocessing(savedHandData);
+
+  let cosSimilarity = similarity(inputHand, savedHand);
+
+  if (cosSimilarity > 0.98) {
+    return true;
+  }
+
+  return false;
+}
+
+module.exports = function (RED) {
+  function HandFindNode(config) {
+    RED.nodes.createNode(this, config);
+
+    var node = this;
+
+    //data.right, data.left
+    node.on("input", function (msg) {
+      const similarity = require("compute-cosine-similarity");
+
+      /*--------------- input 체크 -------------------------*/
+      for (let idx = 1; idx < msg.inputLeftHands; idx++) {
+        let isLeftInputExisted = true;
+
+        if (msg.inputLeftHands[idx] == null) {
+          isLeftInputExisted = false;
+        }
+
+        let isRightInputExisted = true;
+
+        if (msg.inputRightHands[idx] == null) {
+          isRightInputExisted = false;
+        }
+
+        let isSameLeftInput = checkCosSimilarity(
+          msg.inputLeftHands[0],
+          msg.inputLeftHands[idx],
+          isLeftInputExisted,
+          similarity
+        );
+
+        let isSameRightInput = checkCosSimilarity(
+          msg.inputRightHands[0],
+          msg.inputRightHands[idx],
+          isRightInputExisted,
+          similarity
+        );
+
+        //둘 모두 true인 경우 -> 이미 존재하는 경우
+        if (!isSameLeftInput || !isSameRightInput) {
+          msg.status = false;
+          node.send(msg);
+
+          return;
+        }
+      }
+
+      /*--------------- DB 데이터 처리 -------------------------*/
+      const handDataCount = msg.savedLeftHand.length;
+      let savedLeftHand = msg.savedLeftHand;
+      let savedRightHand = msg.savedRightHand;
+      let savedNameList = msg.savedNameList;
+      /*--------------- 유사도 체크 시작 -------------------------*/
+      let inputLeftHand = null;
+      let inputRightHand = null;
+
+      //손의 모든 포인트가 나온지 여부
+      let isCorrect = true;
+      let isLeftExisted = false;
+      let isRightExisted = false;
+
+      //왼손, 오른손 찾아 저장
+      msg.multiHandedness.forEach((el, index) => {
+        if (el.label === "Right") {
+          if (msg.multiHandLandmarks[index].length != 21) {
+            isCorrect = false;
+          } else {
+            isRightExisted = true;
+            inputRightHand = msg.multiHandLandmarks[index];
+          }
+        } else if (el.label === "Left") {
+          if (msg.multiHandLandmarks[index].length != 21) {
+            isCorrect = false;
+          } else {
+            isLeftExisted = true;
+            inputLeftHand = msg.multiHandLandmarks[index];
+          }
+        }
+      });
+
+      //손이 제대로 나오지 않은 경우
+      if (!isCorrect) {
+        msg.status = false;
+        node.send(msg);
+
+        return;
+      }
+
+      //범위 밖의 좌표가 있는 경우
+      let isIn = true;
+
+      for (let idx = 0; idx < 21; idx++) {
+        if (
+          isLeftExisted &&
+          (inputLeftHand[idx].x < 0 ||
+            inputLeftHand[idx].y < 0 ||
+            inputLeftHand[idx].x > 1 ||
+            inputLeftHand[idx].y > 1)
+        ) {
+          isIn = false;
+          break;
+        }
+
+        if (
+          isRightExisted &&
+          (inputRightHand[idx].x < 0 ||
+            inputRightHand[idx].y < 0 ||
+            inputRightHand[idx].x > 1 ||
+            inputRightHand[idx].y > 1)
+        ) {
+          isIn = false;
+          break;
+        }
+      }
+
+      if (!isIn) {
+        msg.status = false;
+        node.send(msg);
+
+        return;
+      }
+
+      //db에서 가져온 데이터랑 비교
+      let isExistedFromOrigin = false;
+      let findHandName = "";
+
+      for (let idx = 0; idx < handDataCount; idx++) {
+        let isLeftSameFromOrigin = checkCosSimilarity(
+          inputLeftHand,
+          savedLeftHand[idx],
+          isLeftExisted,
+          similarity
+        );
+
+        let isRightSameFromOrigin = checkCosSimilarity(
+          inputRightHand,
+          savedRightHand[idx],
+          isRightExisted,
+          similarity
+        );
+
+        //둘 모두 true인 경우 -> 이미 존재하는 경우
+        if (isLeftSameFromOrigin && isRightSameFromOrigin) {
+          isExistedFromOrigin = true;
+        } else {
+          isExistedFromOrigin = false;
+        }
+
+        if (isExistedFromOrigin) {
+          findHandName = savedNameList[idx];
+          break;
+        }
+      }
+
+      //이미 있는 핸드인 경우
+      if (isExistedFromOrigin) {
+        msg.status = true;
+        msg.handName = findHandName;
+      } else {
+        msg.status = false;
+      }
+
+      node.send(msg);
+    });
+  }
+
+  RED.nodes.registerType("hand-find", HandFindNode);
+};