Timeline for Minimum number of patches needed to find color correction matrix (CCM)
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 30 at 5:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 2 at 5:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 4 at 3:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 5, 2023 at 23:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 7, 2023 at 22:08 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 8, 2023 at 19:41 | answer | added | Royi | timeline score: 0 | |
| Oct 13, 2022 at 19:13 | comment | added | Peter K.♦ | Welcome to SE.SP! Is it as simple as needing at least as many independent measurements as you have things you want to estimate? If you have only four measurements (color patches), but need to find nine entries for the $3 \times 3$ color correction matrix, that seems like an underdetermined system (in linear algebra terms). | |
| S Oct 13, 2022 at 16:25 | history | edited | lennon310 | CC BY-SA 4.0 |
grammar corrections, formatting
|
| S Oct 13, 2022 at 16:25 | history | suggested | Glorfindel | CC BY-SA 4.0 |
grammar corrections, formatting
|
| Oct 13, 2022 at 8:08 | review | Suggested edits | |||
| S Oct 13, 2022 at 16:25 | |||||
| S Oct 12, 2022 at 5:59 | review | First questions | |||
| Oct 12, 2022 at 12:35 | |||||
| S Oct 12, 2022 at 5:59 | history | asked | user64826 | CC BY-SA 4.0 |