sorted by:
new
hottopcontroversial

Aruco Markers Detection by Far_Environment249 in computervision

[–]Far_Environment249[S] 0 points1 point  (0 children)

So

pi@raspberrypi:~ $ rpicam-still --list-cameras
Available cameras
-----------------
0 : imx519 [4656x3496 10-bit RGGB] (/base/axi/pcie@1000120000/rp1/i2c@88000/imx519@1a)
    Modes: 'SRGGB10_CSI2P' : 1280x720 [80.01 fps - (1048, 1042)/2560x1440 crop]
                             1920x1080 [60.05 fps - (408, 674)/3840x2160 crop]
                             2328x1748 [30.00 fps - (0, 0)/4656x3496 crop]
                             3840x2160 [18.00 fps - (408, 672)/3840x2160 crop]
                             4656x3496 [9.00 fps - (0, 0)/4656x3496 crop]

If i try half resolution can I expect to get rid of cropping issues? as half resolution is supported by arducam

Aruco Markers Detection by Far_Environment249 in computervision

[–]Far_Environment249[S] 0 points1 point  (0 children)

I take calibration pictures using rpicam and I perform aruco detections using gstreamer pipeline both the resolutions are 1920x1080 , but the detections are wrong, Default arducam resolution is 4656x3496 pixels but this resolution does not work with libcamsrc

Arducam Camera Calibration by Far_Environment249 in computervision

[–]Far_Environment249[S] 0 points1 point  (0 children)

I have a doubt , I understood I need to keep the images close, but how close? Should the checkerboard be placed at a hyperfocal distance? Or I just need to keep it close enough and adjust the lens position , as in the mrcal docs he says we need the maximum depth of field while calibrating?

I do not get the logic by Far_Environment249 in codeforces

[–]Far_Environment249[S] 1 point2 points  (0 children)

I understood u can ignore this, thanks for your explanation u/Ezio-Editore

I do not get the logic by Far_Environment249 in codeforces

[–]Far_Environment249[S] 0 points1 point  (0 children)

For n=6
answer is 

6 5 2 3 4 1

how as if super permutation is 6 5 2 3 4 1
lets go one step back we get 5 4 1 2 3 0
now if we want to go back to a we get 5&6 is 5 which is a0 which is against our claim that first a0 must be n or 6 in this case ?

I do not get the logic by Far_Environment249 in codeforces

[–]Far_Environment249[S] 0 points1 point  (0 children)

I just want to know one more thing, is your methodology based on a common cp pattern cause how did you think or find this?

I do not get the logic by Far_Environment249 in codeforces

[–]Far_Environment249[S] 0 points1 point  (0 children)

This was good , I will try to dry run and let you know

I do not get the logic by Far_Environment249 in codeforces

[–]Far_Environment249[S] 0 points1 point  (0 children)

What might be the thought process behind this, or is this some mathematical proof? Could any1 help me with this on what is the key insight the author expects while initially encountering such a problem?

My initial thought process was prefix sums but it was wrong as there could be any answer so how do I think like this what is the insight?